Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm

From MaRDI portal
Revision as of 01:30, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5962728

DOI10.1007/s10107-015-0864-7zbMath1333.65070arXiv1310.5715OpenAlexW2162287622WikidataQ29027877 ScholiaQ29027877MaRDI QIDQ5962728

Deanna Needell, Nathan Srebro, Rachel Ward

Publication date: 23 February 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5715




Related Items (74)

Stochastic Gradients for Large-Scale Tensor DecompositionAn Optimal Scheduled Learning Rate for a Randomized Kaczmarz AlgorithmAn attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problemsAccelerating mini-batch SARAH by step size rulesRandomized numerical linear algebra: Foundations and algorithmsFit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationOn data preconditioning for regularized loss minimizationStochastic accelerated alternating direction method of multipliers with importance samplingConvergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz MethodsOn the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\)Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and accelerationQuantile-Based Iterative Methods for Corrupted Systems of Linear EquationsRandomized Kaczmarz with averagingA new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrievalBlock Kaczmarz method with inequalitiesA semi-randomized Kaczmarz method with simple random sampling for large-scale linear systemsFractional-based stochastic gradient algorithms for time-delayed ARX modelsApproximate Solutions of Linear Systems at a Universal RateRandomized Kaczmarz method with adaptive stepsizes for inconsistent linear systemsUnified analysis of stochastic gradient methods for composite convex and smooth optimizationA block-randomized stochastic method with importance sampling for CP tensor decompositionAn accelerated variance reducing stochastic method with Douglas-Rachford splittingBridging the gap between constant step size stochastic gradient descent and Markov chainsImportance sampling in signal processing applicationsImproving sampling accuracy of stochastic gradient MCMC methods via non-uniform subsampling of gradientsRandomized Kaczmarz algorithm with averaging and block projectionEnhancement of the Kaczmarz algorithm with projection adjustmentOn fast greedy block Kaczmarz methods for solving large consistent linear systemsBatched Stochastic Gradient Descent with Weighted SamplingA Sampling Kaczmarz--Motzkin Algorithm for Linear FeasibilityRows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge RegressionTwo stochastic optimization algorithms for convex optimization with fixed point constraintsLinear convergence of the randomized sparse Kaczmarz methodOn block Gaussian sketching for the Kaczmarz methodMultilevel Stochastic Gradient Methods for Nested Composition OptimizationAccelerating the distributed Kaczmarz algorithm by strong over-relaxationRandomized Extended Average Block Kaczmarz for Solving Least SquaresOn variance reduction for stochastic smooth convex optimization with multiplicative noiseOn the regularizing property of stochastic gradient descentWorst-case recovery guarantees for least squares approximation using random samplesMinimizing finite sums with the stochastic average gradientStability of the Kaczmarz reconstruction for stationary sequencesAnalysis of biased stochastic gradient descent using sequential semidefinite programsUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemMomentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methodsThe Kaczmarz algorithm, row action methods, and statistical learning algorithmsA weighted randomized Kaczmarz method for solving linear systemsData-driven algorithm selection and tuning in optimization and signal processingImproved asynchronous parallel optimization analysis for stochastic incremental methodsNonlinear Kaczmarz algorithms and their convergenceThe dual Kaczmarz algorithmOn the linear convergence of the stochastic gradient method with constant step-sizeRandomized Kaczmarz Converges Along Small Singular VectorsAdaptive Sampling for Incremental Optimization Using Stochastic Gradient DescentStochastic Markov gradient descent and training low-bit neural networksStochastic Primal-Dual Coordinate Method for Regularized Empirical Risk MinimizationSurrounding the solution of a linear system of equations from all sidesOn Adaptive Sketch-and-Project for Solving Linear SystemsA Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spacesGreed Works: An Improved Analysis of Sampling Kaczmarz--MotzkinUnnamed ItemSampled limited memory methods for massive linear inverse problemsUnnamed ItemIterative Methods for Solving Factorized Linear SystemsRegularized Kaczmarz Algorithms for Tensor RecoveryOn stochastic Kaczmarz type methods for solving large scale systems of ill-posed equationsA Kaczmarz Algorithm for Solving Tree Based Distributed Systems of EquationsReconstructing the Thermal Phonon Transmission Coefficient at Solid Interfaces in the Phonon Transport EquationA Randomized Algorithm for Multivariate Function ApproximationRandomized Kaczmarz for tensor linear systemsRestricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization



Cites Work




This page was built for publication: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm