Robust statistical learning with Lipschitz and convex loss functions
From MaRDI portal
Publication:2174664
Recommendations
Cites work
- A new method for estimation and model selection: \(\rho\)-estimation
- A new perspective on robust \(M\)-estimation: finite sample theory and applications to dependence-adjusted multiple testing
- Bounding the smallest singular value of a random matrix without concentration
- Challenging the empirical mean and empirical variance: a deviation study
- Concentration inequalities. A nonasymptotic theory of independence
- Convergence rates of least squares regression estimators with heavy-tailed errors
- Convex optimization: algorithms and complexity
- Empirical minimization
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Learning from MOM's principles: Le Cam's approach
- Learning without concentration
- Local Rademacher complexities
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- On multiplier processes under weak moment assumptions
- On optimality of empirical risk minimization in linear aggregation
- Optimal aggregation of classifiers in statistical learning.
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Performance of empirical risk minimization in linear aggregation
- Random generation of combinatorial structures from a uniform distribution
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Regularization, sparse recovery, and median-of-means tournaments
- Risk minimization by median-of-means tournaments
- Robust classification via MOM minimization
- Robust linear least squares regression
- Robust low-rank matrix estimation
- Robust machine learning by median-of-means: theory and practice
- Scikit-learn: machine learning in Python
- Smooth discrimination analysis
- Stabilité et instabilité du risque minimax pour des variables indépendantes équidistribuées
- Sub-Gaussian estimators of the mean of a random vector
- Sub-Gaussian mean estimators
- The concentration of measure phenomenon
- The space complexity of approximating the frequency moments
- Theory of Classification: a Survey of Some Recent Advances
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
Cited in
(28)- Learning without concentration for general loss functions
- Learning from MOM's principles: Le Cam's approach
- Iteratively reweighted _1-penalized robust regression
- A statistical learning assessment of Huber regression
- Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
- Total variation regularized Fréchet regression for metric-space valued data
- Suboptimality of constrained least squares and improvements via non-linear predictors
- Distribution-free robust linear regression
- Aggregated hold out for sparse linear regression with a robust loss function
- Concentration study of M-estimators using the influence function
- Robust machine learning by median-of-means: theory and practice
- Robust classification via MOM minimization
- ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels
- High-dimensional robust regression with \(L_q\)-loss functions
- Excess risk bounds in robust empirical risk minimization
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Robust high dimensional learning for Lipschitz and convex losses
- On the Loss Robustness of Least-Square Estimators
- Statistical performance of quantile tensor regression with convex regularization
- Robust subgaussian estimation with VC-dimension
- Least squares regression under weak moment conditions
- Optimal convex M-estimation via score matching
- Covariance estimation: optimal dimension-free guarantees for adversarial corruption and heavy tails
- Statistical guarantees for distribution estimation of contaminated data via DNN-based MoM-GANs
- Kernel-based regularized learning with random projections: beyond least squares
- Computationally efficient and statistically optimal robust high-dimensional linear regression
- Learning under \((1 + \epsilon)\)-moment conditions
- Empirical risk minimization for heavy-tailed losses
This page was built for publication: Robust statistical learning with Lipschitz and convex loss functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174664)
