Pith. sign in

REVIEW 3 cited by

Robust Optimization using Machine Learning for Uncertainty Sets

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 1407.1097 v1 pith:UIZB6SAG submitted 2014-07-04 math.OC cs.LGstat.ML

classification math.OCcs.LGstat.ML
keywords uncertaintyrobustdataoptimizationpastpolicygoallearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possible situation that could arise, out of an uncertainty set of possible situations. Classically, the uncertainty set is simply chosen by the user, or it might be estimated in overly simplistic ways with strong assumptions; whereas in this work, we learn the uncertainty set from data collected in the past. The past data are drawn randomly from an (unknown) possibly complicated high-dimensional distribution. We propose a new uncertainty set design and show how tools from statistical learning theory can be employed to provide probabilistic guarantees on the robustness of the policy.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. A Consistency-Robustness Framework for Robust Optimization: Integrating Predictions into Robust Scheduling

    cs.DS 2026-08 accept novelty 8.0 of 10

    A consistency-robustness framework for robust scheduling with predictions yields constant tradeoffs for interval, budgeted and arbitrary uncertainty on the more structured machines, and provable impossibilities elsewhere.

  2. Conformal Risk-Averse Decision Making with Action Conditional Guarantee

    stat.ML 2026-06 unverdicted novelty 7.0 of 10

    Action-conditional conformal prediction sets provide per-action safety guarantees for risk-averse policies that optimize conditional value-at-risk through pinball-loss minimization.

  3. Everywhere Learning: Artificial Intelligence with Pointwise Constraints

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Everywhere learning trains AI to meet pointwise loss constraints almost surely, backed by approximate duality theory for generalization and L1 regularization on relaxations.

Pith tools