Jan. 25, 2022, 2:43 p.m. | /u/SQL_beginner

Machine Learning www.reddit.com

https://en.m.wikipedia.org/wiki/Universal_approximation_theorem

For this theorem to work, i.e. for the function fϵfϵ to approximate the function ff at some arbitrary level of precision - this theorem seems to specifically require that the function σσ to not be a polynomial.

In a certain sense, it seems like being polynomial here has a negative connotation, in the sense that it might prevent the results of this theorem from being true.

Regarding this, I had the following questions:

Could this theorem have been written …

machinelearning networks neural networks relationship theorem

Data Scientist (m/f/x/d)

@ Symanto Research GmbH & Co. KG | Spain, Germany

Research Analyst

@ Cypris | Los Angeles, California, United States

Data Manager H/F

@ ASSYSTEM | Courbevoie, France

Software Engineer III - Java Scala BigData AWS

@ JPMorgan Chase & Co. | Bengaluru, Karnataka, India

Reference Data Specialist

@ JPMorgan Chase & Co. | Bengaluru, Karnataka, India

Data Visualization Manager

@ PatientPoint | Cincinnati, Ohio, United States