{"total":24,"rows":[{"id":"2202.04428","title":"Adapting to Mixing Time in Stochastic Optimization with Markovian Data","created":"2022-02-09","cited_by_count":36,"area":null},{"id":"2205.05800","title":"Stochastic first-order methods for average-reward Markov decision processes","created":"2022-05-11","cited_by_count":32,"area":null},{"id":"2208.11639","title":"Oracle-free Reinforcement Learning in Mean-Field Games along a Single Sample Path","created":"2022-08-24","cited_by_count":20,"area":null},{"id":"2112.13109","title":"Accelerated and instance-optimal policy evaluation with linear function approximation","created":"2021-12-24","cited_by_count":18,"area":null},{"id":"2403.02476","title":"A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation","created":"2024-03-04","cited_by_count":16,"area":null},{"id":"2207.06364","title":"BR-SNIS: Bias Reduced Self-Normalized Importance Sampling","created":"2022-07-13","cited_by_count":12,"area":null},{"id":"2203.12497","title":"Quantum-enhanced Markov chain Monte Carlo","created":"2022-03-23","cited_by_count":6,"area":null},{"id":"2302.06757","title":"Kernelized Diffusion maps","created":"2023-02-13","cited_by_count":5,"area":null},{"id":"2404.05819","title":"Just Wing It: Near-Optimal Estimation of Missing Mass in a Markovian Sequence","created":"2024-04-08","cited_by_count":5,"area":null},{"id":"2408.05686","title":"The Bandit Whisperer: Communication Learning for Restless Bandits","created":"2024-08-11","cited_by_count":5,"area":null},{"id":"2102.01938","title":"How good is Good-Turing for Markov samples?","created":"2021-02-03","cited_by_count":4,"area":null},{"id":"2207.12217","title":"Finite-Time Analysis of Asynchronous Q-learning under Diminishing Step-Size from Control-Theoretic View","created":"2022-07-25","cited_by_count":4,"area":null},{"id":"2407.15277","title":"Conformal Predictions under Markovian Data","created":"2024-07-21","cited_by_count":4,"area":null},{"id":"2410.21702","title":"Minimax optimality of deep neural networks on dependent data via PAC-Bayes bounds","created":"2024-10-29","cited_by_count":4,"area":null},{"id":"2504.12175","title":"Approximation Bounds for Transformer Networks with Application to Regression","created":"2025-04-16","cited_by_count":4,"area":null},{"id":"2111.07372","title":"Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time Bounds","created":"2021-11-14","cited_by_count":3,"area":null},{"id":"2402.07296","title":"Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes","created":"2024-02-11","cited_by_count":3,"area":null},{"id":"2509.20985","title":"Empirical PAC-Bayes Bounds for Markov Chains","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2305.00977","title":"Generalization for slowly mixing processes","created":"2023-04-28","cited_by_count":1,"area":null},{"id":"2402.18651","title":"Quantifying Human Priors over Social and Navigation Networks","created":"2024-02-28","cited_by_count":1,"area":null},{"id":"2506.01324","title":"Near-Optimal Clustering in Mixture of Markov Chains","created":"2025-06-02","cited_by_count":1,"area":null},{"id":"2306.06192","title":"Confidence-Controlled Exploration: Efficient Sparse-Reward Policy Learning for Robot Navigation","created":"2023-06-09","cited_by_count":0,"area":null},{"id":"2505.20017","title":"Linear Bandits with Non-i.i.d. Noise","created":"2025-05-26","cited_by_count":0,"area":null},{"id":"2610.20007","title":"Minimax estimation of the pseudo-spectral gap of continuous Markov chains, with applications to empirical concentration bounds","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}