The following pages link to Learning without concentration (Q2796408):
Displaying 19 items.
- (Q4969103) (← links)
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization (Q5006447) (← links)
- Fast Convex Pruning of Deep Neural Networks (Q5027023) (← links)
- (Q5053171) (← links)
- (Q5054630) (← links)
- On the geometry of polytopes generated by heavy-tailed random vectors (Q5066318) (← links)
- On the Geometry of Random Polytopes (Q5115967) (← links)
- Approximating the covariance ellipsoid (Q5120344) (← links)
- Extending the scope of the small-ball method (Q5139054) (← links)
- Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces (Q5230191) (← links)
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
- Variance-based regularization with convex objectives (Q5381122) (← 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)
- Orthogonal statistical learning (Q6136574) (← links)
- Mean estimation in high dimension (Q6200221) (← links)
- The geometric median and applications to robust mean estimation (Q6583521) (← links)
- Stable recovery and the coordinate small-ball behaviour of random vectors (Q6608548) (← links)
- Empirical risk minimization for time series: nonparametric performance bounds for prediction (Q6664628) (← links)
