Home A function fitting method
Article
Licensed
Unlicensed Requires Authentication

A function fitting method

  • Rajesh Dachiraju ORCID logo EMAIL logo
Published/Copyright: May 8, 2020

Abstract

In this article, we describe a function fitting method that has potential applications in machine learning and also prove relevant theorems. The described function fitting method is a convex minimization problem which can be solved using a gradient descent algorithm. We also provide qualitative analysis on fitness to data of this function fitting method. The function fitting problem is also shown to be a solution of a linear, weak partial differential equation (PDE). We describe a simple numerical solution using a gradient descent algorithm that converges uniformly to the actual solution. As the functional of the minimization problem is a quadratic form, there also exists a numerical method using linear algebra.

MSC 2010: 68T01; 35J99

Dedicated to the memory of my father D. Narasimharaju (1951–2010), a mathematics teacher who inspired me


Acknowledgements

The author is thankful to the math-stackexchange and mathoverflow communities.

References

[1] G. Cybenko, Approximation by superpositions of a sigmoidal function, Math. Control Signals Systems 2 (1989), no. 4, 303–314. 10.1007/BF02551274Search in Google Scholar

[2] J. Duchon, Splines minimizing rotation-invariant semi-norms in Sobolev spaces, Constructive Theory of Functions of Several Variables (Oberwolfach 1976), Lecture Notes in Math. 571, Springer, VBerlin (1977), 85–100. 10.1007/BFb0086566Search in Google Scholar

[3] C. Fefferman, Fitting a Cm-smooth function to data. III, Ann. of Math. (2) 170 (2009), no. 1, 427–441. 10.4007/annals.2009.170.427Search in Google Scholar

[4] C. Fefferman, A. Israel and G. Luli, Fitting a Sobolev function to data, preprint (2014), https://arxiv.org/abs/1411.1786. 10.4171/RMI/887Search in Google Scholar

[5] C. Fefferman, A. Israel and G. Luli, Fitting a Sobolev function to data I, Rev. Mat. Iberoam. 32 (2016), no. 1, 275–376. 10.4171/RMI/887Search in Google Scholar

[6] C. Fefferman, A. Israel and G. K. Luli, Fitting a Sobolev function to data III, Rev. Mat. Iberoam. 32 (2016), no. 3, 1039–1126. 10.4171/RMI/908Search in Google Scholar

[7] C. Fefferman and B. Klartag, Fitting a Cm-smooth function to data. I, Ann. of Math. (2) 169 (2009), no. 1, 315–346. 10.4007/annals.2009.169.315Search in Google Scholar

[8] C. Fefferman and B. Klartag, Fitting a Cm-smooth function to data. II, Rev. Mat. Iberoam. 25 (2009), no. 1, 49–273. 10.4171/RMI/569Search in Google Scholar

[9] L. A. Gajek, Estimating a density and its derivatives via the minimum distance method, Probab. Theory Related Fields 80 (1989), no. 4, 601–617. 10.1007/BF00318908Search in Google Scholar

[10] K. Hornik, Approximation capabilities of multilayer feedforward networks, Neural Netw. 4 (1991), no. 2, 251–257. 10.1016/0893-6080(91)90009-TSearch in Google Scholar

[11] R.-D. Reiss, Sharp rates of convergence of minimum penalized distance estimators, Sankhya Ser. A 48 (1986), no. 1, 59–68. Search in Google Scholar

[12] J. Shawe-Taylor and N. Cristianini, Kernel Methods for Pattern Analysis, Cambridge University, New York, 2004. 10.1017/CBO9780511809682Search in Google Scholar

[13] V. Vapnik, Estimation of Dependences Based on Empirical Data, Springer Ser. Statist., Springer, New York, 1982. Search in Google Scholar

Received: 2019-01-31
Accepted: 2019-10-22
Published Online: 2020-05-08
Published in Print: 2020-06-01

© 2020 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 21.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jaa-2020-2004/html?lang=en
Scroll to top button