Stochastic backward Euler: an implicit gradient descent algorithm for \(k\)-means clustering

DOI10.1007/s10915-018-0744-4OpenAlexW2964000654MaRDI QIDQ1632217

Y. Aharonov

Publication date: 13 December 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

fixed-point iteration\(k\)-meansbackward Eulerimplicit gradient descentmini-batch gradient

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items (4)

A regularization interpretation of the proximal point method for weakly convex functions ⋮ Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers ⋮ Clustering multivariate count data via Dirichlet-multinomial network fusion ⋮ Selection dynamics for deep neural networks

Uses Software

• kmcudaR
• Entropy-SGD

Cites Work

• Unnamed Item
• Proximal point methods and nonconvex optimization
• Linearly Constrained Nonsmooth and Nonconvex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Least squares quantization in PCM
• Proximité et dualité dans un espace hilbertien

This page was built for publication: Stochastic backward Euler: an implicit gradient descent algorithm for \(k\)-means clustering