AI Chat AI Image Generator AI Video Text to Speech

A note on sharp oracle bounds for Slope and Lasso

07/23/2021

∙

by Zhiyong Zhou, et al.

∙

∙

In this paper, we study the sharp oracle bounds for Slope and Lasso and generalize the results in Bellec et al. (2018) to allow the case that the parameter vector is not exactly sparse and obtain the optimal bounds for ℓ_q estimation errors with 1≤ q≤∞ by using some extended Restricted Eigenvalue type conditions.

page 1

page 2

page 3

page 4

research

∙ 10/05/2009

On the conditions used to prove oracle results for the Lasso

Oracle inequalities and variable selection properties for the Lasso in l...

0 Sara A. van de Geer, et al. ∙

research

∙ 08/18/2023

Sharp minimax optimality of LASSO and SLOPE under double sparsity assumption

This paper introduces a rigorous approach to establish the sharp minimax...

0 Zhifan Li, et al. ∙

research

∙ 11/30/2009

Sparse Empirical Bayes Analysis (SEBA)

We consider a joint processing of n independent sparse regression proble...

0 Natalia Bochkina, et al. ∙

research

∙ 09/12/2022

The Sparsity of LASSO-type Minimizers

This note extends an attribute of the LASSO procedure to a whole class o...

0 Simon Foucart, et al. ∙

research

∙ 05/16/2007

Lasso type classifiers with a reject option

We consider the problem of binary classification where one can, for a pa...

0 Marten Wegkamp, et al. ∙

research

∙ 09/21/2012

A Note on the SPICE Method

In this article, we analyze the SPICE method developed in [1], and estab...

0 Cristian R. Rojas, et al. ∙

research

∙ 02/09/2015

High dimensional errors-in-variables models with dependent measurements

Suppose that we observe y ∈R^f and X ∈R^f × m in the following errors-in...

0 Mark Rudelson, et al. ∙