Skip to Main content Skip to Navigation

Linear programming problems for $L_1$ optimal frontier estimation

Abstract : We propose new optimal estimators for the Lipschitz frontier of a set of points. They are defined as kernel estimators being sufficiently regular, covering all the points and whose associated support is of smallest surface. The estimators are written as linear combinations of kernel functions applied to the points of the sample. The coefficients of the linear combination are then computed by solving related linear programming problem. The $L_1$ error between the estimated and the true frontier function with a known Lipschitz constant is shown to be almost surely converging to zero, and the rate of convergence is proved to be optimal.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:48:51 PM
Last modification on : Monday, July 20, 2020 - 9:19:00 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:26:16 PM


  • HAL Id : inria-00070541, version 1



Stéphane Girard, Anatoli Iouditski, Alexander Nazin. Linear programming problems for $L_1$ optimal frontier estimation. RR-5466, INRIA. 2005, pp.34. ⟨inria-00070541⟩



Record views


Files downloads