Pages that link to "Item:Q2290072"

The following pages link to Non-asymptotic guarantees for sampling by stochastic gradient descent (Q2290072):

Displaying 11 items.

• Asymptotic bias of stochastic gradient search (Q1704136) (← links)
• Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration (Q2057056) (← links)
• Nonasymptotic estimates for stochastic gradient Langevin dynamics under local conditions in nonconvex optimization (Q2682367) (← links)
• On the differentiability check in gradient sampling methods (Q2829571) (← links)
• Sampling Gaussian distributions in Krylov spaces with conjugate gradients (Q2909297) (← links)
• Subgradient and sampling algorithms for \(\ell_1\) regression (Q2921678) (← links)
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3503200) (← links)
• Batched Stochastic Gradient Descent with Weighted Sampling (Q4609808) (← links)
• Auxiliary Gradient-Based Sampling Algorithms (Q4962088) (← links)
• Sampling can be faster than optimization (Q5218499) (← links)
• Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm (Q5962728) (← links)