Iterative regularization in classification via hinge loss diagonal descent
From MaRDI portal
Cites work
- 10.1162/153244302760200704
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Bias of homotopic gradient descent for the hinge loss
- Boosting as a regularized path to a maximum margin classifier
- Boosting with early stopping: convergence and consistency
- Bridging the gap between constant step size stochastic gradient descent and Markov chains
- Convergence of a generalized SMO algorithm for SVM classifier design
- Convergence of diagonally stationary sequences in convex optimization
- Convergence of stochastic proximal gradient algorithm
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization in normed spaces. Theory, methods and examples
- Difference Methods for Differential Inclusions: A Survey
- Early stopping and non-parametric regression: an optimal data-dependent stopping rule
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- First-order methods in optimization
- Foundations of Optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- scientific article; zbMATH DE number 6378119 (Why is no real title available?)
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 3566540 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- scientific article; zbMATH DE number 3189712 (Why is no real title available?)
- Implicit regularization with strongly convex bias: Stability and acceleration
- Interior-Point Methods for Massive Support Vector Machines
- Iterative regularization for learning with convex loss functions
- Iterative regularization via dual diagonal descent
- Lectures on convex optimization
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- On early stopping in gradient descent learning
- On Nesterov acceleration for Landweber iteration of linear ill-posed problems
- On the acceleration of optimal regularization algorithms for linear ill-posed inverse problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Optimal-order convergence of Nesterov acceleration for linear ill-posed problems
- Pegasos: primal estimated sub-gradient solver for SVM
- Penalty-proximal methods in convex programming
- Perturbation des méthodes d'optimisation. Applications
- Preconditioned iterative regularization in Banach spaces
- Proximal Gradient Methods for Machine Learning and Imaging
- Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient
- Regularization methods in Banach spaces.
- Risk bounds for statistical learning
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Signal Recovery by Proximal Forward-Backward Splitting
- Stochastic mirror descent method for linear ill-posed problems in Banach spaces
- Sublinear optimization for machine learning
- Support Vector Machines
- Support-vector networks
- The implicit bias of gradient descent on separable data
- Theory of Classification: a Survey of Some Recent Advances
- Towards a deeper geometric, analytic and algorithmic understanding of margins
- Training a Support Vector Machine in the Primal
- Understanding machine learning. From theory to algorithms
- Viscosity Solutions of Minimization Problems
This page was built for publication: Iterative regularization in classification via hinge loss diagonal descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018630)
