Pages that link to "Item:Q2291732"

The following pages link to Stochastic subgradient method converges on tame functions (Q2291732):

Displaying 41 items.

• Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces (Q2028468) (← links)
• Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning (Q2039229) (← links)
• Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
• Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks (Q2058689) (← links)
• A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs (Q2063194) (← links)
• Perturbed iterate SGD for Lipschitz continuous loss functions (Q2093279) (← links)
• Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
• Convergence of constant step stochastic gradient descent for non-smooth non-convex functions (Q2158840) (← links)
• A framework for differential calculus on persistence barcodes (Q2162119) (← links)
• Generalized gradients in dynamic optimization, optimal control, and machine learning problems (Q2215292) (← links)
• Discussion of: ``Nonparametric regression using deep neural networks with ReLU activation function'' (Q2215716) (← links)
• Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization (Q2228354) (← links)
• Determination of convex functions via subgradients of minimal norm (Q2235158) (← links)
• A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function (Q2662659) (← links)
• Conservative and semismooth derivatives are equivalent for semialgebraic maps (Q2670975) (← links)
• Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set (Q2679007) (← links)
• Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization (Q2679567) (← links)
• A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization (Q4995000) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• The Structure of Conservative Gradient Fields (Q5010051) (← links)
• Graphical Convergence of Subgradients in Nonconvex Optimization and Learning (Q5076697) (← links)
• Pathological Subgradient Dynamics (Q5110559) (← links)
• MultiComposite Nonconvex Optimization for Training Deep Neural Networks (Q5114402) (← links)
• Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization (Q5147028) (← links)
• Stochastic Approximation for Optimization in Shape Spaces (Q5147032) (← links)
• (Q5149225) (← links)
• An Inertial Newton Algorithm for Deep Learning (Q5159400) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning (Q5214402) (← links)
• Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization (Q5868947) (← links)
• Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions (Q5870372) (← links)
• A gradient sampling algorithm for stratified maps with applications to topological data analysis (Q6052059) (← links)
• Global convergence of the gradient method for functions definable in o-minimal structures (Q6052062) (← links)
• Lyapunov stability of the subgradient method with constant step size (Q6052064) (← links)
• Subgradient Sampling for Nonsmooth Nonconvex Minimization (Q6076858) (← links)
• An Improved Unconstrained Approach for Bilevel Optimization (Q6076870) (← links)
• Stochastic approximation with discontinuous dynamics, differential inclusions, and applications (Q6103982) (← links)
• Certifying the Absence of Spurious Local Minima at Infinity (Q6116236) (← links)
• Conservative parametric optimality and the ridge method for tame min-max problems (Q6163857) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions (Q6188504) (← links)