Abstract
We study the computational aspects of the task of multivariate convex regression in dimension d ≥ 5. We present the first computationally efficient minimax optimal (up to logarithmic factors) estimators for the tasks of L-Lipschitz and Γ-bounded convex regression under polytopal support. This work is the first to show the existence of efficient minimax optimal estimators for non-Donsker classes whose corresponding Least Squares Estimators are provably minimax suboptimal. The proof of the correctness of these estimators uses a variety of tools from different disciplines, among them empirical process theory, stochastic geometry, and potential theory.
Original language | English |
---|---|
Pages (from-to) | 1510-1546 |
Number of pages | 37 |
Journal | Proceedings of Machine Learning Research |
Volume | 178 |
State | Published - 2022 |
Event | 35th Conference on Learning Theory, COLT 2022 - London, United Kingdom Duration: 2 Jul 2022 → 5 Jul 2022 |
Keywords
- Minimax Optimality
- Multivariate Convex Regression
- Non-Donsker Regime