pith. sign in

arxiv: 1705.04630 · v6 · pith:Q65OO7YZnew · submitted 2017-05-12 · 💻 cs.LG

Forecasting using incomplete models

classification 💻 cs.LG
keywords probabilityincompletemeasureforecastingobservationssettingsomebayesian
0
0 comments X
read the original abstract

We consider the task of forecasting an infinite sequence of future observations based on some number of past observations, where the probability measure generating the observations is "suspected" to satisfy one or more of a set of incomplete models, i.e. convex sets in the space of probability measures. This setting is in some sense intermediate between the realizable setting where the probability measure comes from some known set of probability measures (which can be addressed using e.g. Bayesian inference) and the unrealizable setting where the probability measure is completely arbitrary. We demonstrate a method of forecasting which guarantees that, whenever the true probability measure satisfies an incomplete model in a given countable set, the forecast converges to the same incomplete model in the (appropriately normalized) Kantorovich-Rubinstein metric. This is analogous to merging of opinions for Bayesian inference, except that convergence in the Kantorovich-Rubinstein metric is weaker than convergence in total variation.

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 1 Pith paper

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

  1. Infra-Bayesian Reinforcement Learning Agents Outperform Classical RL For Worst-Case Robustness

    cs.LG 2026-05 unverdicted novelty 6.0

    Infra-Bayesian RL agents are shown via implementation to have lower worst-case regret than classical RL under model misspecification and to solve Newcomb's problem optimally.