From inexact optimization to learning via gradient concentration
From MaRDI portal
(Redirected from Publication:2111477)
Recommendations
- Deep learning: a statistical viewpoint
- scientific article; zbMATH DE number 1786133
- Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Optimization problems for machine learning: a survey
Cites work
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 7370542 (Why is no real title available?)
- scientific article; zbMATH DE number 7370593 (Why is no real title available?)
- 10.1162/153244302760200704
- 10.1162/153244303321897690
- A Vector-Contraction Inequality for Rademacher Complexities
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Concentration inequalities. A nonasymptotic theory of independence
- Convergence rates of kernel conjugate gradient for random design regression
- Convex optimization: algorithms and complexity
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities
- Early stopping and non-parametric regression: an optimal data-dependent stopping rule
- Early stopping for statistical inverse problems via truncated SVD estimation
- Gradient Convergence in Gradient methods with Errors
- Graph-dependent implicit regularisation for distributed stochastic subgradient descent
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
- High-dimensional probability. An introduction with applications in data science
- High-dimensional statistics. A non-asymptotic viewpoint
- Iterative regularization for learning with convex loss functions
- Nonparametric stochastic approximation with large step-sizes
- On early stopping in gradient descent learning
- On regularization algorithms in learning theory
- Optimal rates for multi-pass stochastic gradient methods
- Optimal rates for regularization of statistical inverse learning problems
- Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
- Parallelizing spectrally regularized kernel algorithms
- Robust Estimation via Robust Gradient Estimation
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- Support Vector Machines
- The implicit bias of gradient descent on separable data
- Understanding machine learning. From theory to algorithms
Cited in
(15)- scientific article; zbMATH DE number 19772 (Why is no real title available?)
- The importance of convexity in learning with squared loss
- Special issue for SIMAI 2020-2021: large-scale optimization and applications
- scientific article; zbMATH DE number 7306907 (Why is no real title available?)
- Optimization in machine learning: a distribution-space approach
- Gradient-Based Discrete-Time Concurrent Learning for Standalone Function Approximation
- Optimal learning
- Multilevel Fine-Tuning: Closing Generalization Gaps in Approximation of Solution Maps under a Limited Budget for Training Data
- Implicit regularization with strongly convex bias: Stability and acceleration
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- The implicit bias of gradient descent on separable data
- Towards an automatic uncertainty compiler
- Approximation and learning of convex superpositions
- A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations
- From inexact optimization to learning via gradient concentration
This page was built for publication: From inexact optimization to learning via gradient concentration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111477)
