PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

A function fitting method

Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
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.
Wydawca
Rocznik
Strony
59--65
Opis fizyczny
Bibliogr. 13 poz.
Twórcy
  • Independent Researcher, F-306 BRC Shivahills, Puppalaguda Main Road, Hyderabad-500089, India
Bibliografia
  • [1] G. Cybenko, Approximation by superpositions of a sigmoidal function, Math. Control Signals Systems 2 (1989), no. 4, 303-314.
  • [2] J. Duchon, Splines minimizing rotation-invariant semi-norms in Sobolev spaces, in: Constructive Theory of Functions of Several Variables (Oberwolfach 1976), Lecture Notes in Math. 571, Springer, VBerlin (1977), 85-100.
  • [3] C. Fefferman, Fitting a Cm-smooth function to data. III, Ann. of Math. (2) 170 (2009), no. 1, 427-441.
  • [4] C. Fefferman, A. Israel and G. Luli, Fitting a Sobolev function to data, preprint (2014), https://arxiv.org/abs/1411.1786.
  • [5] C. Fefferman, A. Israel and G. Luli, Fitting a Sobolev function to data I, Rev. Mat. Iberoam. 32 (2016), no. 1, 275-376.
  • [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.
  • [7] C. Fefferman and B. Klartag, Fitting a Cm-smooth function to data. I, Ann. of Math. (2) 169 (2009), no. 1, 315-346.
  • [8] C. Fefferman and B. Klartag, Fitting a Cm-smooth function to data. II, Rev. Mat. Iberoam. 25 (2009), no. 1, 49-273.
  • [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] K. Hornik, Approximation capabilities of multilayer feedforward networks, Neural Netw. 4 (1991), no. 2, 251-257.
  • [11] R.-D. Reiss, Sharp rates of convergence of minimum penalized distance estimators, Sankhya Ser. A 48 (1986), no. 1, 59-68.
  • [12] J. Shawe-Taylor and N. Cristianini, Kernel Methods for Pattern Analysis, Cambridge University, New York, 2004.
  • [13] V. Vapnik, Estimation of Dependences Based on Empirical Data, Springer Ser. Statist., Springer, New York, 1982.
Uwagi
Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-2695af37-d212-49f1-8399-a569354f2fef
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.