Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions (Q2313281): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 23:42, 28 July 2024

scientific article

Language	Label	Description	Also known as
English	Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions	scientific article

Statements

scholarly article

0 references

Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions (English)

0 references

0 references

0 references

Guillaume Lecué

0 references

The Annals of Statistics

0 references

publication date

18 July 2019

0 references

full work available at URL

https://arxiv.org/abs/1702.01402

0 references

https://projecteuclid.org/euclid.aos/1558425641

0 references

zbMATH Keywords

empirical processes

0 references

high-dimensional statistics

0 references

MaRDI profile type

MaRDI publication profile

0 references

Bayesian Methods for Low-Rank Matrix Estimation: Short Survey and Theoretical Study

0 references

On the properties of variational approximations of Gibbs posteriors

0 references

Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions

0 references

Fast learning rates for plug-in classifiers

0 references

A probabilistic approach to the geometry of the \(\ell^n_p\)-ball

0 references

Local Rademacher complexities

0 references

Empirical minimization

0 references

Slope meets Lasso: improved oracle bounds and optimality

0 references

\(\ell_1\)-penalized quantile regression in high-dimensional sparse models

0 references

SLOPE-adaptive variable selection via convex optimization

0 references

A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

0 references

Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.

0 references

0 references

0 references

The convex geometry of linear inverse problems

0 references

1-bit matrix completion: PAC-Bayesian analysis of a variational approximation

0 references

Real Analysis and Probability

0 references

Lasso logistic regression, GSoft and the cyclic coordinate descent algorithm: application to gene expression data

0 references

Gaussian averages of interpolated bodies and applications to approximate reconstruction

0 references

Noisy low-rank matrix completion with general sampling distribution

0 references

Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)

0 references

Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.

0 references

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

0 references

Empirical margin distributions and bounding the generalization error of combined classifiers

0 references

General nonexact oracle inequalities for classes with a subexponential envelope

0 references

Regularization and the small-ball method II: complexity dependent error rates

0 references

Regularization and the small-ball method. I: Sparse recovery

0 references

A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution

0 references

Smooth discrimination analysis

0 references

The Group Lasso for Logistic Regression

0 references

10.1162/1532443041424337

0 references

Estimation of high-dimensional low-rank matrices

0 references

SLOPE is adaptive to unknown sparsity and asymptotically minimax

0 references

Efficient methods for estimating constrained parameters with applications to regularized (Lasso) logistic regression

0 references

Optimal aggregation of classifiers in statistical learning.

0 references

Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015

0 references

High-dimensional generalized linear models and the lasso

0 references

Statistical behavior and consistency of classification methods based on convex risk minimization.

0 references

Identifiers

zbMATH Open document ID

0 references

10.1214/18-AOS1742

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2313281

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2313281&oldid=36803262"