pith. sign in

arxiv: 2405.19466 · v4 · pith:T34GCP5Fnew · submitted 2024-05-29 · 💻 cs.LG · stat.ML

Active Exploration via Autoregressive Generation of Missing Data

classification 💻 cs.LG stat.ML
keywords ratherautoregressiveexplorationgenerationpredictionsequenceuncertaintyexplicit
0
0 comments X
read the original abstract

We pose uncertainty quantification and exploration in online decision-making as a problem of training and generation from an autoregressive sequence model, an area experiencing rapid innovation. Our approach rests on viewing uncertainty as arising from missing future outcomes that could be revealed through action choices, rather than from unobservable latent parameters of the environment. This reformulation aligns naturally with modern machine learning capabilities: we can i) train generative models through next-outcome prediction rather than fit explicit priors, ii) assess uncertainty through autoregressive generation rather than sampling latent parameters from posteriors, and iii) adapt to new information by extending the sequence model's context rather than explicit posterior updating. Our main theoretical result establishes a reduction from online learning to offline next-outcome prediction, showing that Bayesian regret is controlled by the offline sequence prediction loss. Semi-synthetic experiments show our insights bear out in a challenging news recommendation setting, where effective performance requires leveraging article headline text as prior information to focus exploration on resolving remaining uncertainties.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds

    cs.LG 2026-05 unverdicted novelty 8.0

    Joint KL yields horizon-free approximation but an information-theoretic lower bound of order Omega(H) for estimation error in autoregressive learning, with matching computationally efficient upper bounds.

  2. Automatic, Debiased, and Invariant Counterfactual Generation under General Interventions

    stat.ML 2026-06 unverdicted novelty 6.0

    ADIGen generates counterfactuals under general interventions via Riesz regression, causal invariance, and orthogonal learning, with excess-risk bounds featuring product-bias remainder and invariant risk across environments.