mlsanityData to 7 Oct 2026

Batch Stationary Distribution Estimation

arXiv 2003.00722 ↗First posted 2 Mar 2020cs.LG cs.AI stat.MLcited by 19

Not on the map. Why?

Abstract (arXiv)

We consider the problem of approximating the stationary distribution of an ergodic Markov chain given a set of sampled transitions. Classical simulation-based approaches assume access to the underlying process so that trajectories of sufficient length can be gathered to approximate stationary sampling. Instead, we consider an alternative setting where a fixed set of transitions has been collected beforehand, by a separate, possibly unknown procedure. The goal is still to estimate properties of the stationary distribution, but without additional access to the underlying system. We propose a consistent estimator that is based on recovering a correction ratio function over the given data. In particular, we develop a variational power method (VPM) that provides provably consistent estimates under general conditions. In addition to unifying a number of existing approaches from different subfields, we also find that VPM yields significantly better estimates across a range of problems, including queueing, stochastic differential equations, post-processing MCMC, and off-policy evaluation.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Mar 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2020: 2; 2021: 6; 2022: 2; 2023: 5; 2024: 1; 2025: 2; 2026: 1.

19 papers.

Sort:

By area:

  1. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  2. 2021GFlowNet Foundationscited by 286
  3. 2021Benchmarks for Deep Off-Policy Evaluationcited by 89
  4. 2020Provably Good Batch Reinforcement Learning Without Great Explorationcited by 77
  5. 2021Autoregressive Dynamics Models for Offline Policy Evaluation and Optimizationcited by 32
  6. 2023A Comprehensive Survey on Rare Event Predictioncited by 18
  7. 2025One-Step Flow Policy Mirror Descentcited by 18
  8. 2022A Unified Framework for Alternating Offline Model Training and Policy Learningcited by 14
  9. 2021Continual Learning In Environments With Polynomial Mixing Timescited by 13
  10. 2021Non-asymptotic Confidence Intervals of Off-policy Evaluation: Primal and Dual Boundscited by 11
  11. 2023Inexact iterative numerical linear algebra for neural network-based spectral estimation and rare-event predictioncited by 9
  12. 2022Scaling Marginalized Importance Sampling to High-Dimensional State-Spaces via State Abstractioncited by 7
7 more
  1. 2023Variational Latent Branching Model for Off-Policy Evaluationcited by 6
  2. 2023Nonparametric Density Estimation under Distribution Driftcited by 5
  3. 2025Trajectory World Models for Heterogeneous Environmentscited by 4
  4. 2023Model-based Offline Policy Optimization with Adversarial Networkcited by 3
  5. 2024Scalable Offline Reinforcement Learning for Mean Field Gamescited by 1
  6. 2021Cautious Policy Programming: Exploiting KL Regularization in Monotonic Policy Improvement for Reinforcement Learningcited by 0
  7. 2026Forward-Free Diffusion Language Models with BPTT-Free Looped Refinementcited by 0