Fetching the paper…
Reading the bibliography…
Model reduction of Markov processes is a basic problem in modeling state-transition systems.
H. Weyl, “Das asymptotische verteilungsgesetz der eigenwerte linearer partieller differentialgleichungen (mit einer anwendung auf die theorie der hohlraumstrahlung),” Mathematische Annalen
1912
Earlier work this paper cites.
H. Steinhaus, “The problem of estimation,” The Annals of Mathematical Statistics
1957
Earlier work this paper cites.
T. W. Anderson and L. A. Goodman, “Statistical inference about markov chains,” The Annals of Mathematical Statistics
1957
Earlier work this paper cites.
van Nostrand Princeton, NJ, 1960
J. G. Kemeny, J. L. Snell, et al · 1960
Earlier work this paper cites.
PhD thesis, Thesis, Poortpers, Amsterdam, 1966
J. T. Runnenburg, Markov processes in waiting-time and renewal theory · 1966
Earlier work this paper cites.
P.-A. Wedin, “Perturbation bounds in connection with singular value decomposition,” BIT Numerical Mathematics
1972
Earlier work this paper cites.
D. A. Freedman, “On tail probabilities for martingales,” the Annals of Probability
1975
Earlier work this paper cites.
PhD thesis, CMathematical Centre, Amsterdam, 1983
A. Hoekstra, Markov Chains of Finite Rank · 1983
Earlier work this paper cites.
A. Hoekstra and F. Steutel, “Limit theorems for markov chains of finite rank,” Linear algebra and its applications
1984
Earlier work this paper cites.
M. Wilczyński, “Minimax estimation for the multinomial and multivariate hypergeometric distributions,” Sankhyā: The Indian Journal of Statistics, Series A
1985
Earlier work this paper cites.
New York: Springer Verlag, 1986
I. Jolliffe, Principal Component Analysis · 1986
Earlier work this paper cites.
D. F. Rogers, R. D. Plante, R. T. Wong, and J. R. Evans, “Aggregation and disaggregation techniques and methodology in optimization,” Operations Research
1991
Earlier work this paper cites.
A. W. Moore, “Variable resolution dynamic programming: Efficiently learning action maps in multivariate real-valued state-spaces,” in Machine Learning Proceedings 1991
1991
Earlier work this paper cites.
L. Molgedey and H. G. Schuster, “Separation of a mixture of independent signals using time delayed correlations,” Physical review letters
1994
Earlier work this paper cites.
P. Buchholz, “Exact and ordinary lumpability in finite markov chains,” Journal of applied probability
1994
Earlier work this paper cites.
S. P. Singh, T. Jaakkola, and M. I. Jordan, “Reinforcement learning with soft state aggregation,” in Advances in neural information processing systems
1995
Earlier work this paper cites.
Athena Scientific, Belmont, MA, 1996
D. P. Bertsekas and J. N. Tsitsiklis, Neuro-dynamic programming · 1996
Earlier work this paper cites.
J. N. Tsitsiklis and B. Van Roy, “Feature-based methods for large scale dynamic programming,” Machine Learning
1996
Earlier work this paper cites.
B. Yu, “Assouad, fano, and le cam,” in Festschrift for Lucien Le Cam
1997
Earlier work this paper cites.
No. 2, Cambridge university press, 1998
J. R. Norris, Markov chains · 1998
Earlier work this paper cites.
Y. Yang and A. Barron, “Information-theoretic determination of minimax rates of convergence,” Annals of Statistics
1999
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on pattern analysis and machine intelligence
2000
Earlier work this paper cites.
M. Meila and J. Shi, “A random walks view of spectral segmentation,” 2001
2001
Earlier work this paper cites.
Z. Ren and B. H. Krogh, “State aggregation in markov decision processes,” in Decision and Control, 2002, Proceedings of the 41st IEEE Conference on
2002
Earlier work this paper cites.
A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in Advances in neural information processing systems
2002
Earlier work this paper cites.
Springer, New York, 2nd ed. ed., 2002
I. Jolliffe, Principal component analysis · 2002
Cited alongside, same era.
S. Mahadevan, “Proto-value functions: Developmental reinforcement learning,” in Proceedings of the 22nd international conference on Machine learning
2005
Cited alongside, same era.
Springer Science & Business Media, 2006
E. L. Lehmann and G. Casella, Theory of point estimation · 2006
Cited alongside, same era.
J. Johns and S. Mahadevan, “Constructing basis functions from directed graphs for value function approximation,” in Proceedings of the 24th international conference on Machine learning
2007
Cited alongside, same era.
R. Parr, C. Painter-Wakefield, L. Li, and M. Littman, “Analyzing feature generation for value-function approximation,” in Proceedings of the 24th international conference on Machine learning
2007
Cited alongside, same era.
M. E. Newman, “Spectral methods for community detection and graph partitioning,” Physical Review E
2013
Later among the works it cites.
2013
Later among the works it cites.
E. J. Candes, C. A. Sing-Long, and J. D. Trzasko, “Unbiased risk estimates for singular value thresholding and spectral estimators,” IEEE transactions on signal processing
2013
Later among the works it cites.
S. Zeng, R. Huang, Z. Kang, and N. Sang, “Image segmentation using spectral clustering of gaussian mixture models,” Neurocomputing
2014
Later among the works it cites.
D. Donoho, M. Gavish, et al
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Petrik, “An analysis of laplacian methods for value function approximation in mdps.,” in IJCAI
2007
Cited alongside, same era.
Athena scientific Belmont, MA, 2007
D. P. Bertsekas, Dynamic programming and optimal control · 2007
Cited alongside, same era.
W. E, T. Li, and E. Vanden-Eijnden, “Optimal partition and effective dynamics of complex networks,” Proceedings of the National Academy of Sciences
2008
Cited alongside, same era.
A. George, W. B. Powell, and S. R. Kulkarni, “Value function approximation using multiple aggregation for multiattribute resource management,” Journal of Machine Learning Research
2008
Cited alongside, same era.
S. Mahadevan et al
2009
Cited alongside, same era.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational mathematics
2009
Cited alongside, same era.
American Mathematical Soc., 2009
D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times · 2009
Cited alongside, same era.
Y. Han, J. Jiao, and T. Weissman, “Minimax estimation of discrete distributions under ℓ 1 \ell_{1} loss,” IEEE Transactions on Information Theory
2015
Later among the works it cites.
S. Kamath, A. Orlitsky, D. Pichapati, and A. T. Suresh, “On learning distributions from their samples,” in Conference on Learning Theory
2015
Later among the works it cites.
2015
Later among the works it cites.
S. Chatterjee et al
2015
Later among the works it cites.
J. Lei, A. Rinaldo, et al
2015
Later among the works it cites.
D. J. Hsu, A. Kontorovich, and C. Szepesvári, “Mixing time estimation in reversible markov chains from a single sample path,” in Advances in neural information processing systems
2015
Later among the works it cites.
D. Paulin, “Concentration inequalities for markov chains by marton couplings and spectral methods,” Electronic Journal of Probability
2015
Later among the works it cites.
S. Negahban, S. Oh, and D. Shah, “Rank centrality: Ranking from pairwise comparisons,” Operations Research
2016
Later among the works it cites.
2016
Later among the works it cites.
J. Jin and W. Wang, “Influential features pca for high dimensional clustering,” The Annals of Statistics
2016
Later among the works it cites.
A. R. Benson, D. F. Gleich, and L.-H. Lim, “The spacey random walk: A stochastic process for higher-order data,” SIAM Review
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
S. Klus, F. Nüske, P. Koltai, H. Wu, I. Kevrekidis, C. Schütte, and F. Noé, “Data-driven model reduction and transfer operator approximation,” Journal of Nonlinear Science
2018
Closest in time.
X. Li, M. Wang, and A. Zhang, “Estimation of markov chain via rank-constrained likelihood,” International Conference on Machine Learning
2018
Closest in time.
T. T. Cai and A. Zhang, “Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics,” The Annals of Statistics
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.