The sharp MSE bound for the ℓ1-minimum-norm interpolator under isotropic Gaussian covariates is recovered via the geometry of symmetric Gaussian polytopes, without the convex Gaussian min-max theorem.
Ensemble Methods for Convex Regression with Applications to Geometric Programming Based Circuit Design
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Convex regression is a promising area for bridging statistical estimation and deterministic convex optimization. New piecewise linear convex regression methods are fast and scalable, but can have instability when used to approximate constraints or objective functions for optimization. Ensemble methods, like bagging, smearing and random partitioning, can alleviate this problem and maintain the theoretical properties of the underlying estimator. We empirically examine the performance of ensemble methods for prediction and optimization, and then apply them to device modeling and constraint approximation for geometric programming based circuit design.
fields
math.ST 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Minimum Norm Interpolation via The Local Theory of Banach Spaces: The Role of Gaussianity
The sharp MSE bound for the ℓ1-minimum-norm interpolator under isotropic Gaussian covariates is recovered via the geometry of symmetric Gaussian polytopes, without the convex Gaussian min-max theorem.