The following pages link to Learning without Concentration (Q2796408):
Displaying 50 items.
- Performance of empirical risk minimization in linear aggregation (Q282546) (← links)
- Upper bounds on product and multiplier empirical processes (Q335637) (← links)
- Low rank matrix recovery from rank one measurements (Q347516) (← links)
- Sparse recovery under weak moment assumptions (Q520739) (← links)
- Low-rank matrix recovery via rank one tight frame measurements (Q666654) (← links)
- Empirical risk minimization for heavy-tailed losses (Q892246) (← links)
- Finite sample behavior of a sieve profile estimator in the single index mode (Q895013) (← links)
- Simpler PAC-Bayesian bounds for hostile data (Q1640576) (← links)
- Learning without concentration for general loss functions (Q1647935) (← links)
- Relative deviation learning bounds and generalization with unbounded loss functions (Q1714946) (← links)
- Optimal rates of statistical seriation (Q1715546) (← links)
- Column normalization of a random measurement matrix (Q1748563) (← links)
- Regularization and the small-ball method. I: Sparse recovery (Q1750281) (← links)
- Slope meets Lasso: improved oracle bounds and optimality (Q1990596) (← links)
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- Learning from MOM's principles: Le Cam's approach (Q2010482) (← links)
- Phase retrieval with PhaseLift algorithm (Q2033498) (← links)
- Approximating \(L_p\) unit balls via random sampling (Q2039571) (← links)
- Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing (Q2039597) (← links)
- A MOM-based ensemble method for robustness, subsampling and hyperparameter tuning (Q2044333) (← links)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- On Monte-Carlo methods in convex stochastic optimization (Q2083277) (← links)
- Exact minimax risk for linear least squares, and the lower tail of sample covariance matrices (Q2091833) (← links)
- AdaBoost and robust one-bit compressed sensing (Q2102435) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Suboptimality of constrained least squares and improvements via non-linear predictors (Q2108490) (← links)
- Distribution-free robust linear regression (Q2113267) (← links)
- On least squares estimation under heteroscedastic and heavy-tailed errors (Q2119229) (← links)
- Aggregated hold out for sparse linear regression with a robust loss function (Q2136632) (← links)
- Robust statistical learning with Lipschitz and convex loss functions (Q2174664) (← links)
- Convergence rates for empirical barycenters in metric spaces: curvature, convexity and extendable geodesics (Q2182123) (← links)
- Robust machine learning by median-of-means: theory and practice (Q2196199) (← links)
- Robust classification via MOM minimization (Q2203337) (← links)
- Complex phase retrieval from subgaussian measurements (Q2226993) (← links)
- Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures (Q2243168) (← links)
- Learning with correntropy-induced losses for regression with mixture of symmetric stable noise (Q2300760) (← links)
- Convergence rates of least squares regression estimators with heavy-tailed errors (Q2313287) (← links)
- Solving equations of random convex functions via anchored regression (Q2317380) (← links)
- Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation (Q2325349) (← links)
- Mean estimation and regression under heavy-tailed distributions: A survey (Q2329044) (← links)
- Generalization bounds for non-stationary mixing processes (Q2360972) (← links)
- On aggregation for heavy-tailed classes (Q2363649) (← links)
- Regularization, sparse recovery, and median-of-means tournaments (Q2419670) (← links)
- Posterior concentration and fast convergence rates for generalized Bayesian learning (Q2666765) (← links)
- Generic error bounds for the generalized Lasso with sub-exponential data (Q2675193) (← links)
- Quantized Compressed Sensing: A Survey (Q3296175) (← links)
- Stable low-rank matrix recovery via null space properties (Q4606522) (← links)
- Extending the scope of the small-ball method (Q5139054) (← links)
- Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints (Q6038637) (← links)
- A unified approach to uniform signal recovery from nonlinear observations (Q6101267) (← links)
