2018arXiv (Cornell University)Open access

Interplay of minimax estimation and minimax support recovery under\n sparsity

Mohamed Ndaoud

Open full text 6 citations

Abstract

In this paper, we study a new notion of scaled minimaxity for sparse\nestimation in high-dimensional linear regression model. We present more\noptimistic lower bounds than the one given by the classical minimax theory and\nhence improve on existing results. We recover sharp results for the global\nminimaxity as a consequence of our study. Fixing the scale of the\nsignal-to-noise ratio, we prove that the estimation error can be much smaller\nthan the global minimax error. We construct a new optimal estimator for the\nscaled minimax sparse estimation. An optimal adaptive procedure is also\ndescribed.\n

Open-access reader

About this research paper

What this paper is about

In this paper, we study a new notion of scaled minimaxity for sparse\nestimation in high-dimensional linear regression model. We present more\noptimistic lower bounds than the one given by the classical minimax theory and\nhence improve on existing results. We recover sharp results for the global\nminimaxity as a consequence of our study. Fixing the scale of the\nsignal-to-noise ratio, we prove that the estimation error can be much smaller\nthan the global minimax error. We construct a new optimal estimator for the\nscaled minimax sparse estimation. An optimal adaptive procedure is also\ndescribed.\n

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we study a new notion of scaled minimaxity for sparse\nestimation in high-dimensional linear regression model. We present more\noptimistic lower bounds than the one given by the classical minimax theory and\nhence improve on existing results. We recover sharp results for the global\nminimaxity as a consequence of our study. Fixing the scale of the\nsignal-to-noise ratio, we prove that the estimation error can be much smaller\nthan the global minimax error. We construct a new optimal estimator for the\nscaled minimax sparse estimation. An optimal adaptive procedure is also\ndescribed.\n

Key concepts: Minimax, Minimax estimator, Estimator, Mathematical optimization, Estimation, Minimax approximation algorithm, Mathematics, Scale (ratio)

Related papers

Back to paper searchBrowse research topicsOriginal source
Interplay of minimax estimation and minimax support recovery under\n sparsity — Research Paper | ScholarLens