Fetching the paper…
Reading the bibliography…
Riemannian optimization has drawn a lot of attention due to its wide applications in practice.
Loading and correlations in the interpretation of principal compenents
Jorge Cadima and Ian T Jolliffe · 1995
Earlier work this paper cites.
Columbia object image library (coil-20)
Sameer A Nene, Shree K Nayar, Hiroshi Murase, et al · 1996
Earlier work this paper cites.
The mnist database of handwritten digits
Yann LeCun · 1998
Earlier work this paper cites.
The geometry of algorithms with orthogonality constraints
A. Edelman, T. A. Arias, and S. T. Smith · 1999
Earlier work this paper cites.
A modified principal component technique based on the lasso
I. Jolliffe, N.Trendafilov, and M. Uddin · 2003
Earlier work this paper cites.
Statistical modeling of complex backgrounds for foreground object detection
Liyuan Li, Weimin Huang, Irene Yu-Hua Gu, and Qi Tian · 2004
Earlier work this paper cites.
Shixiang Chen, Zengde Deng, Shiqian Ma, and Anthony Man-Cho So · 2005
Earlier work this paper cites.
Sparse principal component analysis
H. Zou, T. Hastie, and R. Tibshirani · 2006
Earlier work this paper cites.
Sparse decomposition and modeling of anatomical shape variation
Karl Sjostrand, Egill Rostrup, Charlotte Ryberg, Rasmus Larsen, Colin Studholme, Hansjoerg Baezner, Jose Ferro, Franz Fazekas, Leonardo Pantoni, Domenico Inzitari, et al · 2007
Earlier work this paper cites.
Strong human association with plant invasion success for trifolium introductions to new zealand
Kelly Gravuer, Jon J Sullivan, Peter A Williams, and Richard P Duncan · 2008
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P-A Absil, Robert Mahony, and Rodolphe Sepulchre · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
Online learning for matrix factorization and sparse coding
Julien Mairal, Francis Bach, Jean Ponce, and Guillermo Sapiro · 2010
Earlier work this paper cites.
RTRMC: A Riemannian trust-region method for low-rank matrix completion
Nicolas Boumal and Pierre-Antoine Absil · 2011
Earlier work this paper cites.
Sparse canonical correlation analysis
David R Hardoon and John Shawe-Taylor · 2011
Earlier work this paper cites.
Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds
S Hosseini and MR Pouryayevali · 2011
Earlier work this paper cites.
ℓ 2 , 1 \ell_{2,1} -norm regularized discriminative feature selection for unsupervised learning
Y. Yang, H. Shen, Z. Ma, Z. Huang, and X. Zhou · 2011
Cited alongside, same era.
Unsupervised feature selection for linked social media data
Jiliang Tang and Huan Liu · 2012
Cited alongside, same era.
Stochastic gradient descent on Riemannian manifolds
Silvere Bonnabel · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Compressed modes for variational problems in mathematics and physics
V. OzoliņVs, R. Lai, R. Caflisch, and S. Osher · 2013
Cited alongside, same era.
A feasible method for optimization with orthogonality constraints
Z. Wen and W. Yin · 2013
Cited alongside, same era.
SARAH: A novel method for machine learning problems using stochastic recursive gradient
Lam M Nguyen, Jie Liu, Katya Scheinberg, and Martin Takac · 2017
Later among the works it cites.
On the global geometry of sphere-constrained sparse blind deconvolution
Y. Zhang, Y. Lau, H.-W. Kuo, S. Cheung, A. Pasupathy, and J. Wright · 2017
Later among the works it cites.
SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Later among the works it cites.
Riemannian stochastic recursive gradient algorithm with retraction and vector transport and its convergence analysis
Hiroyuki Kasai, Hiroyuki Sato, and Bamdev Mishra · 2018
Later among the works it cites.
Efficient optimization algorithms for robust principal component analysis and its variants
S. Ma and N. S. Aybat · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Manopt, a Matlab toolbox for optimization on manifolds
N. Boumal, B. Mishra, P.-A. Absil, and R. Sepulchre · 2014
Cited alongside, same era.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Cited alongside, same era.
Convergence of stochastic proximal gradient algorithm
Lorenzo Rosasco, Silvia Villa, and Bang Công Vũ · 2014
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Cited alongside, same era.
Optimality conditions for the nonlinear programming problems on Riemannian manifolds
Wei Hong Yang, Lei-Hong Zhang, and Ruyi Song · 2014
Cited alongside, same era.
Streaming sparse principal component analysis
Wenzhuo Yang and Huan Xu · 2015
Cited alongside, same era.
A regularized semi-smooth Newton method with projection steps for composite convex programs
Xiantao Xiao, Yongfeng Li, Zaiwen Wen, and Liwei Zhang · 2018
Later among the works it cites.
R-SPIDER: A fast Riemannian stochastic optimization algorithm with curvature independent rate
Jingzhao Zhang, Hongyi Zhang, and Suvrit Sra · 2018
Later among the works it cites.
Global rates of convergence for nonconvex optimization on manifolds
Nicolas Boumal, Pierre-Antoine Absil, and Coralia Cartis · 2019
Later among the works it cites.
On the ineffectiveness of variance reduced optimization for deep learning
Aaron Defazio and Léon Bottou · 2019
Later among the works it cites.
Riemannian proximal gradient methods
Wen Huang and Ke Wei · 2019
Later among the works it cites.
Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
Xiao Li, Shixiang Chen, Zengde Deng, Qing Qu, Zhihui Zhu, and Anthony Man Cho So · 2019
Later among the works it cites.
ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization
Nhan H Pham, Lam M Nguyen, Dzung T Phan, and Quoc Tran-Dinh · 2019
Later among the works it cites.
SpiderBoost and momentum: Faster stochastic variance reduction algorithms
Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, and Vahid Tarokh · 2019
Later among the works it cites.
Faster first-order methods for stochastic non-convex optimization on Riemannian manifolds
Pan Zhou, Xiao-Tong Yuan, and Jiashi Feng · 2019
Later among the works it cites.
Robust low-rank matrix completion via an alternating manifold proximal gradient continuation method
M. Huang, S. Ma, and L. Lai · 2020
Closest in time.
A manifold proximal linear method for sparse spectral clustering with application to single-cell rna sequencing data analysis
Z. Wang, B. Liu, S. Chen, S. Ma, L. Xue, and H. Zhao · 2021
Closest in time.