AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction

Jake Roth, Ying Cui

JMLR 2025 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use ALM instead of Gurobi at high risk aversion (k=1%m) with the largest msuperquantile-constrained problems · Synthetic, m up to 2^20solve time: at least 20x and up to 70xImproved
use ALM instead of Gurobi at lower risk aversion (larger k)superquantile-constrained problems · Synthetic, large-m instancessolve time: at least 5x and up to 30xImproved
use ALM instead of Gurobi dual simplex for small m and large n with linear objectivesuperquantile-constrained problems · Synthetic, small-m large-n, linear objectivesolve time: GRB beats ALM by up to 4xHurt
use ALM instead of outer approximation (G-OA) in high risk-aversion instancessuperquantile-constrained problems · Synthetic, large-m, k=1%msolve time: about 5-10xImproved
use ALM (eps=1e-3) instead of OSQP (eps=1e-3)superquantile-constrained problems · Synthetic, large-m instancessolve time: at least 50x, sometimes more than 750xImproved
increase scenario count m or number of constraints L (ablation)ALM relative to Gurobi · Synthetic, k=1%mrelative solve time: ALM never slower than GRB; 20x to 70x at largest mImproved
use larger k (lower risk aversion) in ALM (ablation)ALM · Synthetic, large-m instancesrelative performance versus Gurobi: advantage drops from 20-70x to 5-30xHurt
use second-order (Jacobian) information versus first-order in ALM when m much larger than n and k much smaller than m (ablation)ALM subproblem · Synthetic ten largest-m instancesincremental cost: 3-7x cheaperImproved
use PSG instead of ALMPSG HELI solver · Synthetic, large-m instancesprimal feasibilityHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy