ISSN:
0885-6125
Keywords:
nonparametric regression
;
VC dimension
;
convex optimization
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This approach is based on the minimization of the sum of empirical squared errors, subject to the constraints implied by Lipschitz continuity. The resulting optimization problem has a convex objective function and linear constraints, and as a result, is efficiently solvable. The estimated function computed by this technique, is proven to convergeto the underlying regression function uniformly and almost surely, when the sample size grows to infinity, thus providing a very strong form of consistency. Wealso propose a convex optimization approach to the maximum likelihood estimation of unknown parameters in statistical models, where the parameters depend continuously on some observable input variables. For a number of classical distributional forms, the objective function in the underlying optimization problem is convex and the constraints are linear. These problems are, therefore, also efficiently solvable.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1007586831473
Permalink
