Minimax learning of ergodic Markov chains
From MaRDI portal
Cites work
- _p testing and learning of discrete distributions
- Combinatorial methods in density estimation
- Concentration inequalities for Markov chains by Marton couplings and spectral methods
- Freedman's inequality for matrix martingales
- scientific article; zbMATH DE number 3907540 (Why is no real title available?)
- scientific article; zbMATH DE number 3514781 (Why is no real title available?)
- scientific article; zbMATH DE number 1064667 (Why is no real title available?)
- Introduction to nonparametric estimation
- Markov Chains
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Matrix Analysis
- Minimax Estimation of Discrete Distributions Under <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula> Loss
- Neural Network Learning
- On tail probabilities for martingales
- On the learnability of discrete distributions
- Statistical Methods in Markov Chains
Cited in
(4)- Structured matrix learning under arbitrary entrywise dependence and estimation of Markov transition kernel
- Learning and testing irreducible Markov chains via the k-cover time
- Bayesian nonparametric inference for ``species-sampling problems
- Robust estimation of a Markov chain transition matrix from multiple sample paths
This page was built for publication: Minimax learning of ergodic Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034366)
