Fetching the paper…
Reading the bibliography…
State aggregation is a popular model reduction method rooted in optimal control.
The rotation of eigenvectors by a perturbation. III
Chandler Davis and William Morton Kahan · 1970
Earlier work this paper cites.
Nonnegative matrices
Henryk Minc · 1988
Earlier work this paper cites.
Aggregation and disaggregation techniques and methodology in optimization
David F Rogers, Robert D Plante, Richard T Wong, and James R Evans · 1991
Earlier work this paper cites.
Mapping target signatures via partial unmixing of aviris data
Joseph W Boardman, Fred A Kruse, and Robert O Green · 1995
Earlier work this paper cites.
Reinforcement learning with soft state aggregation
Satinder P Singh, Tommi Jaakkola, and Michael I Jordan · 1995
Earlier work this paper cites.
Neuro-dynamic programming
Dimitri P Bertsekas and John N Tsitsiklis · 1996
Earlier work this paper cites.
Feature-based methods for large scale dynamic programming
John N Tsitsiklis and Benjamin Van Roy · 1996
Earlier work this paper cites.
Learning the parts of objects by non-negative matrix factorization
Daniel Lee and Sebastian Seung · 1999
Earlier work this paper cites.
The successive projections algorithm for variable selection in spectroscopic multicomponent analysis
Mário César Ugulino Araújo, Teresa Cristina Bezerra Saldanha, Roberto Kawakami Harrop Galvao, Takashi Yoneyama, Henrique Caldas Chame, and Valeria Visani · 2001
Earlier work this paper cites.
Latent dirichlet allocation
David M Blei, Andrew Y Ng, and Michael I Jordan · 2003
Earlier work this paper cites.
When does non-negative matrix factorization give a correct decomposition into parts?
David Donoho and Victoria Stodden · 2004
Earlier work this paper cites.
Vertex component analysis: A fast algorithm to unmix hyperspectral data
José MP Nascimento and José MB Dias · 2005
Earlier work this paper cites.
Robust Perron cluster analysis for various applications in computational life science
Marcus Weber and Susanna Kube · 2005
Earlier work this paper cites.
A new growing method for simplex-based endmember extraction algorithm
C-I Chang, C-C Wu, Weimin Liu, and Y-C Ouyang · 2006
Earlier work this paper cites.
Dynamic programming and optimal control
Dimitri P Bertsekas · 2007
Cited alongside, same era.
Freedman’s inequality for matrix martingales
Joel Tropp et al · 2011
Cited alongside, same era.
Learning topic models–going beyond SVD
Sanjeev Arora, Rong Ge, and Ankur Moitra · 2012
Cited alongside, same era.
On learning parametric-output hmms
Aryeh Kontorovich, Boaz Nadler, and Roi Weiss · 2013
Cited alongside, same era.
The why and how of nonnegative matrix factorization
Nicolas Gillis · 2014
Cited alongside, same era.
Learning mixtures of arbitrary distributions over large discrete domains
Yuval Rabani, Leonard J Schulman, and Chaitanya Swamy · 2014
Cited alongside, same era.
Unperturbed: spectral analysis beyond Davis-Kahan
Justin Eldridge, Mikhail Belkin, and Yusu Wang · 2017
Later among the works it cites.
Estimating network memberships by simplex vertex hunting
Jiashun Jin, Zheng Tracy Ke, and Shengming Luo · 2017
Later among the works it cites.
A new SVD approach to optimal topic estimation
Zheng Tracy Ke and Minzhe Wang · 2017
Later among the works it cites.
http://www.nyc.gov/html/tlc/html/about/trip_record_data.shtml
NYC Taxi and Limousine Commission (TLC) trip record data · 2018
Closest in time.
Scalable bilinear π \pi learning using state and action features
Yichen Chen, Lihong Li, and Mengdi Wang · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yanjun Han, Jiantao Jiao, and Tsachy Weissman · 2015
Cited alongside, same era.
Fast community detection by SCORE
Jiashun Jin · 2015
Cited alongside, same era.
Learning arbitrary statistical mixtures of discrete distributions
Jian Li, Yuval Rabani, Leonard J Schulman, and Chaitanya Swamy · 2015
Cited alongside, same era.
Learning Markov distributions: Does estimation trump compression?
Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, and Ananda Theertha Suresh · 2016
Cited alongside, same era.
Asymptotics and concentration bounds for bilinear forms of spectral projectors of sample covariance
Vladimir Koltchinskii and Karim Lounici · 2016
Cited alongside, same era.
Perturbation of linear forms of singular vectors under Gaussian noise
Vladimir Koltchinskii and Dong Xia · 2016
Cited alongside, same era.
On learning markov chains
Yi HAO, Alon Orlitsky, and Venkatadheeraj Pichapati · 2018
Closest in time.
Estimation of Markov chain via rank-constrained likelihood
Xudong Li, Mengdi Wang, and Anru Zhang · 2018
Closest in time.
Spectral state compression of Markov processes
Anru Zhang and Mengdi Wang · 2018
Closest in time.
Near-optimal bounds for phase synchronization
Yiqiao Zhong and Nicolas Boumal · 2018
Closest in time.
Spectral method and regularized MLE are both optimal for top- K {K} ranking
Yuxin Chen, Jianqing Fan, Cong Ma, Kaizheng Wang, et al · 2019
Closest in time.
Non-negative matrix factorization via archetypal analysis
Hamid Javadi and Andrea Montanari · 2019
Closest in time.
Minimax learning of ergodic markov chains
Geoffrey Wolfer and Aryeh Kontorovich · 2019
Closest in time.
Sample-optimal parametric Q-learning with linear transition models
Lin F Yang and Mengdi Wang · 2019
Closest in time.