Pith. sign in

REVIEW 2 cited by

Lightning Does Not Strike Twice: Robust MDPs with Coupled Uncertainty

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1206.4643 v1 pith:DZXHGHEL submitted 2012-06-18 cs.LG cs.GTcs.SYeess.SY

classification cs.LGcs.GTcs.SYeess.SY
keywords conceptcoupledlightningmodelparametersstriketwiceuncertainty
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider Markov decision processes under parameter uncertainty. Previous studies all restrict to the case that uncertainties among different states are uncoupled, which leads to conservative solutions. In contrast, we introduce an intuitive concept, termed "Lightning Does not Strike Twice," to model coupled uncertain parameters. Specifically, we require that the system can deviate from its nominal parameters only a bounded number of times. We give probabilistic guarantees indicating that this model represents real life situations and devise tractable algorithms for computing optimal control policies using this concept.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Dual Formulation for Non-Rectangular Lp Robust Markov Decision Processes

    cs.AI 2025-02 conditional novelty 7.0 of 10

    For non-rectangular Lp transition uncertainty, the worst-case return equals the nominal return minus a penalty that can be found by binary search on a fixed-point equation.

  2. Robust General Utility for Reinforcement Learning

    cs.LG 2026-08 conditional novelty 6.0 of 10

    The paper introduces robust general-utility RL, a minimax formulation over utility uncertainty sets, and proves convergence rates for projected gradient descent-ascent and prox-extragradient algorithms.

Pith tools