On the variance, admissibility, and stability of empirical risk minimization
It is well known that Empirical Risk Minimization (ERM) may attain minimax suboptimal rates
in terms of the mean squared error (Birgé and Massart, 1993). In this paper, we prove that …
in terms of the mean squared error (Birgé and Massart, 1993). In this paper, we prove that …
Convex regression in multidimensions: Suboptimality of least squares estimators
The least squares estimator (LSE) is shown to be suboptimal in squared error loss in the
usual nonparametric regression model with Gaussian errors for $ d\geq 5$ for each of the …
usual nonparametric regression model with Gaussian errors for $ d\geq 5$ for each of the …
Suboptimality of constrained least squares and improvements via non-linear predictors
Suboptimality of constrained least squares and improvements via non-linear predictors Page 1
Bernoulli 29(1), 2023, 473–495 https://doi.org/10.3150/22-BEJ1465 Suboptimality of …
Bernoulli 29(1), 2023, 473–495 https://doi.org/10.3150/22-BEJ1465 Suboptimality of …
On the minimal error of empirical risk minimization
We study the minimal squared error of the Empirical Risk Minimization (ERM) procedure in
the task of regression, both in random and fixed design settings. Our sharp lower bounds …
the task of regression, both in random and fixed design settings. Our sharp lower bounds …
Spectrahedral regression
E O'Reilly, V Chandrasekaran - SIAM Journal on Optimization, 2023 - SIAM
Convex regression is the problem of fitting a convex function to a data set consisting of input-
output pairs. We present a new approach to this problem called spectrahedral regression, in …
output pairs. We present a new approach to this problem called spectrahedral regression, in …
Contextual Offline Demand Learning and Pricing with Separable Models
This paper, inspired by a collaboration with a leading consumer electronics retailer in the
Middle East, explores the challenge of demand learning and pricing using separable …
Middle East, explores the challenge of demand learning and pricing using separable …
The Star Geometry of Critic-Based Regularizer Learning
Variational regularization is a classical technique to solve statistical inference tasks and
inverse problems, with modern data-driven approaches parameterizing regularizers via …
inverse problems, with modern data-driven approaches parameterizing regularizers via …
On The Performance Of The Maximum Likelihood Over Large Models
G Kur - 2023 - dspace.mit.edu
This dissertation investigates non-parametric regression over large function classes,
specifically, non-Donsker classes. We will present the concept of non-Donsker classes and …
specifically, non-Donsker classes. We will present the concept of non-Donsker classes and …
Nonparametric Regression in Dirichlet Spaces: A Random Obstacle Approach
P Talwai, D Simchi-Levi - arxiv preprint arxiv:2412.14357, 2024 - arxiv.org
In this paper, we consider nonparametric estimation over general Dirichlet metric measure
spaces. Unlike the more commonly studied reproducing kernel Hilbert space, whose …
spaces. Unlike the more commonly studied reproducing kernel Hilbert space, whose …
Convex and nonconvex sublinear regression with application to data-driven learning of reach sets
We consider estimating a compact set from finite data by approximating the support function
of that set via sublinear regression. Support functions uniquely characterize a compact set …
of that set via sublinear regression. Support functions uniquely characterize a compact set …