ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1605.08651
  4. Cited By
Slope meets Lasso: improved oracle bounds and optimality

Slope meets Lasso: improved oracle bounds and optimality

27 May 2016
Pierre C. Bellec
Guillaume Lecué
Alexandre B. Tsybakov
ArXivPDFHTML

Papers citing "Slope meets Lasso: improved oracle bounds and optimality"

6 / 6 papers shown
Title
Iterative Algorithm for Discrete Structure Recovery
Iterative Algorithm for Discrete Structure Recovery
Chao Gao
A. Zhang
235
31
0
04 Nov 2019
Estimation bounds and sharp oracle inequalities of regularized
  procedures with Lipschitz loss functions
Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
Pierre Alquier
V. Cottet
Guillaume Lecué
153
59
0
05 Feb 2017
Towards the study of least squares estimators with convex penalty
Towards the study of least squares estimators with convex penalty
Pierre C. Bellec
Guillaume Lecué
Alexandre B. Tsybakov
123
11
0
31 Jan 2017
SLOPE is Adaptive to Unknown Sparsity and Asymptotically Minimax
SLOPE is Adaptive to Unknown Sparsity and Asymptotically Minimax
Weijie Su
Emmanuel Candes
216
145
0
29 Mar 2015
Nuclear norm penalization and optimal rates for noisy low rank matrix
  completion
Nuclear norm penalization and optimal rates for noisy low rank matrix completion
V. Koltchinskii
Alexandre B. Tsybakov
Karim Lounici
154
663
0
29 Nov 2010
Minimax rates of estimation for high-dimensional linear regression over
  $\ell_q$-balls
Minimax rates of estimation for high-dimensional linear regression over ℓq\ell_qℓq​-balls
Garvesh Raskutti
Martin J. Wainwright
Bin Yu
161
575
0
11 Oct 2009
1