English
Related papers

Related papers: Adaptive Estimation of Convex Sets and Convex Poly…

200 papers

Convex risk measures play a foundational role in the area of stochastic optimization. However, in contrast to risk neutral models, their applications are still limited due to the lack of efficient solution methods. In particular, the mean…

Optimization and Control · Mathematics 2024-12-30 Zhichao Jia , Guanghui Lan , Zhe Zhang

We study the problem of estimating low-rank matrices from linear measurements (a.k.a., matrix sensing) through nonconvex optimization. We propose an efficient stochastic variance reduced gradient descent algorithm to solve a nonconvex…

Machine Learning · Statistics 2017-01-17 Xiao Zhang , Lingxiao Wang , Quanquan Gu

We propose a unified framework for estimating low-rank matrices through nonconvex optimization based on gradient descent algorithm. Our framework is quite general and can be applied to both noisy and noiseless observations. In the general…

Machine Learning · Statistics 2016-10-18 Lingxiao Wang , Xiao Zhang , Quanquan Gu

We consider the linear regression model with observation error in the design. In this setting, we allow the number of covariates to be much larger than the sample size. Several new estimation methods have been recently introduced for this…

Statistics Theory · Mathematics 2016-07-05 Alexandre Belloni , Mathieu Rosenbaum , Alexandre Tsybakov

We introduce a convex approach for mixed linear regression over $d$ features. This approach is a second-order cone program, based on L1 minimization, which assigns an estimate regression coefficient in $\mathbb{R}^{d}$ for each data point.…

Optimization and Control · Mathematics 2019-01-09 Paul Hand , Babhru Joshi

We consider two nonparametric procedures for estimating a concave distribution function based on data corrupted with additive noise generated by a bounded decreasing density on $(0,\infty)$. For the maximum likelihood (ML) estimator and…

Statistics Theory · Mathematics 2009-04-02 Geurt Jongbloed , Frank H. van der Meulen

We propose two families of asymptotically local minimax lower bounds on parameter estimation performance. The first family of bounds applies to any convex, symmetric loss function that depends solely on the difference between the estimate…

Statistics Theory · Mathematics 2024-09-20 Neri Merhav

Transfer learning for nonparametric regression is considered. We first study the non-asymptotic minimax risk for this problem and develop a novel estimator called the confidence thresholding estimator, which is shown to achieve the minimax…

Machine Learning · Statistics 2024-01-24 T. Tony Cai , Hongming Pu

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Methodology · Statistics 2016-05-03 Juhee Cho , Donggyu Kim , Karl Rohe

The paper deals with the non-parametric estimation in the regression with the multiplicative noise. Using the local polynomial fitting and the bayesian approach, we construct the minimax on isotropic H\"older class estimator. Next applying…

Statistics Theory · Mathematics 2012-07-24 M. Chichignoud

A scheme for locally adaptive bandwidth selection is proposed which sensitively shrinks the bandwidth of a kernel estimator at lowest density regions such as the support boundary which are unknown to the statistician. In case of a…

Statistics Theory · Mathematics 2016-01-25 Tim Patschkowski , Angelika Rohde

We study the problem of nonparametric estimation under $\bL_p$-loss, $p\in [1,\infty)$, in the framework of the convolution structure density model on $\bR^d$. This observation scheme is a generalization of two classical statistical models,…

Statistics Theory · Mathematics 2017-04-17 Oleg Lepski , Thomas Willer

The estimation of a log-concave density on $\mathbb{R}^d$ represents a central problem in the area of nonparametric inference under shape constraints. In this paper, we study the performance of log-concave density estimators with respect to…

Statistics Theory · Mathematics 2015-09-29 Arlene K. H. Kim , Richard J. Samworth

In this paper, we establish explicit convergence rates for the stochastic smooth approximations of infimal convolutions introduced and developed in \cite{MR4581306,MR4923371}. In particular, we quantify the convergence of the associated…

Optimization and Control · Mathematics 2026-02-23 Diego Morales , Pedro Pérez-Aros , Emilio Vilches

This paper addresses the problem of estimating a convex regression function under both the sup-norm risk and the pointwise risk using B-splines. The presence of the convex constraint complicates various issues in asymptotic analysis,…

Statistics Theory · Mathematics 2012-05-02 Xiao Wang , Jinglai Shen

We study nonasymptotic minimax estimation of the linear functional $L(\theta)=\eta^\top \theta$ for a high-dimensional $s$-sparse mean vector with an arbitrary loading vector $\eta$. For symmetric noise with exponentially decaying tails, we…

Statistics Theory · Mathematics 2026-04-29 Jie Xie , Dongming Huang

We develop polynomial-time algorithms for near-optimal minimax mean estimation under $\ell_2$-squared loss in a Gaussian sequence model under convex constraints. The parameter space is an origin-symmetric, type-2 convex body $K \subset…

Statistics Theory · Mathematics 2026-02-27 Matey Neykov

This work is concerned with the estimation of multidimensional regression and the asymptotic behaviour of the test involved in selecting models. The main problem with such models is that we need to know the covariance matrix of the noise to…

Statistics Theory · Mathematics 2008-02-20 Joseph Rynkiewicz

We quantify the minimax rate for a nonparametric regression model over a star-shaped function class $\mathcal{F}$ with bounded diameter. We obtain a minimax rate of ${\varepsilon^{\ast}}^2\wedge\mathrm{diam}(\mathcal{F})^2$ where…

Statistics Theory · Mathematics 2025-08-20 Akshay Prasadan , Matey Neykov

We study prediction and estimation problems using empirical risk minimization, relative to a general convex loss function. We obtain sharp error rates even when concentration is false or is very restricted, for example, in heavy-tailed…

Machine Learning · Statistics 2014-10-14 Shahar Mendelson