Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

Robust Optimization

Robust counterparts, uncertainty sets, adaptive policies, and distributionally robust optimization.

72 missions

Missions

51–72 of 72
Open0Completed72All72
🏆Completed
Convex OptimizationLinear algebraNumerical Analysis+2·Captain: mikedeng1

Robust Solutions to Least-Squares Problems with Uncertain Data I: The Worst-Case Residual and Its Unique MinimizerResearch Paper

The least-squares (LS) problem min⁡x∥Ax−b∥\min_x \|Ax - b\|minx​∥Ax−b∥ assumes that the data A∈Rn×mA \in \mathbb{R}^{n\times m}A∈Rn×m, b∈Rnb \in \mathbb{R}^nb∈Rn are exact. In applications they rarely are: they come from measurements, from linearizations, or from models with neglected dynamics. A classical response is sensitivity analysis or regularization (Tikhonov), where a weight trades the size…

7 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems 5: For Hypercube Uncertainty, Even in the Constraints, the Robust and Adaptive Optima CoincideResearch Paper

In two-stage optimization under uncertainty, a first-stage decision xxx is taken before the data are known, and a second-stage decision yyy is taken after a scenario ω\omegaω is revealed. The fully adaptive formulation lets yyy depend on ω\omegaω and minimizes the worst-case cost. It is the natural model of recourse, but it optimizes over policies, one decision per…

11 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems 4: For Symmetric Cost and Right-Hand-Side Uncertainty, the Adaptability Gap Is at Most FourResearch Paper

Two-stage optimization separates a decision made before uncertainty is observed from one made after a scenario is known. A fully adaptive policy can choose a different second-stage decision in each scenario, while a static robust solution commits to a single second-stage decision that works in every scenario. Static solutions can be simpler to implement,…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems 2: On the Non-Symmetric Uniform Simplex, the Robust Optimum Is at Least n + 1 Times the Stochastic OneResearch Paper

Many operations problems are decided in two stages: a first-stage decision is fixed before an uncertain quantity is revealed, and a second-stage (recourse) decision is chosen afterwards. Two classical ways to optimize such a problem differ in how they treat the uncertainty. Two-stage stochastic optimization minimizes the expected cost under a probability…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems 2: Worst-Case Distribution with Largest Covariance for Piecewise-Linear PortfoliosResearch Paper

A portfolio manager who maximizes expected utility needs the distribution of asset returns, but in practice only estimates of its first two moments are available, and these estimates are themselves noisy. Distributionally robust optimization handles this by optimizing against the worst distribution in a set of plausible ones. Delage and Ye (Operations…

9 thms2 active usersReviewed
🏆Completed
Machine LearningOptimal TransportProbability+1·Captain: mikedeng1

Robust Wasserstein Profile Inference and Applications to Machine Learning 3: The Scaled Robust Wasserstein Profile n^(ρ/2)·R_n(θ*) Is Asymptotically Stochastically Bounded by R̄(ρ)Research Paper

Many statistical parameters are defined implicitly, as the root θ∗\theta_*θ∗​ of an estimating equation E[h(W,θ∗)]=0\mathbb E[h(W, \theta_*)] = \mathbf 0E[h(W,θ∗​)]=0: a mean, a quantile, a regression coefficient, the minimizer of an expected loss. Owen's empirical likelihood builds confidence regions for such parameters by asking how far the empirical distribution of the data must be…

13 thms2 active usersReviewed
🏆Completed
Machine LearningOptimal TransportOptimization+1·Captain: mikedeng1

Robust Wasserstein Profile Inference and Applications to Machine Learning 2: ℓp-Regularized Logistic Regression and the Hinge-Loss SVM Are Wasserstein DRO under a Label-Preserving Transport CostResearch Paper

Regularized logistic regression and the support vector machine (SVM) are two of the most widely used linear classifiers. Both are usually introduced as empirical risk minimization plus a norm penalty ∥β∥p\|\beta\|_p∥β∥p​ whose size is tuned by cross-validation, with the penalty justified heuristically as a guard against overfitting. Distributionally robust…

13 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems 1: For Symmetric Right-Hand-Side Uncertainty, the Robust Optimum Is at Most Twice the Stochastic OptimumResearch Paper

Many planning problems are made in two stages: a first decision xxx (capacity, inventory, a network design) is fixed before an uncertain demand is revealed, and a second decision yyy (recourse, routing, overtime) is taken afterwards. Two-stage stochastic optimization models the demand as random and minimizes expected cost; its second stage is a whole policy …

10 thms2 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOperations Research+1·Captain: mikedeng1

Optimality of Affine Policies in Multistage Robust Optimization: In One-Dimensional Constrained Min-Max Control, Disturbance-Affine Policies with Affine Stage Costs Attain the Optimal ValueResearch Paper

Multistage robust optimization chooses decisions over time while an adversary picks the uncertain data from a known set; every later decision may react to what has been observed. The exact problem is a nested min-max over functions of the past, and is intractable in general. The standard workaround, proposed by Ben-Tal, Goryashko, Guslitzer and Nemirovski (M…

11 thms2 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Oracle-Based Robust Optimization via Online Learning 2: Follow the Perturbed Leader with an ε-Approximate Linear Oracle Has Expected Regret at Most 2√(DRAT) + 2εTResearch Paper

Many decision problems are solved repeatedly against data that arrive over time: routing traffic, allocating budgets, choosing portfolios or combinatorial structures. Online linear optimization models this. At each round t=1,…,Tt = 1, \ldots, Tt=1,…,T a learner picks a decision xtx_txt​ from a fixed domain K⊆Rn\mathcal K\subseteq\mathbb R^nK⊆Rn, then a reward vector ftf_tft​ is revealed…

7 thms2 active usersReviewed
🏆Completed
OptimizationProbabilityStatistics·Captain: mikedeng1

Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems 1: Finite-Sample Confidence Region for the Mean and CovarianceResearch Paper

An optimization model often needs a probability distribution for an uncertain cost or demand, while a practitioner has only a finite sample from that distribution. Replacing the distribution by the empirical one can hide uncertainty in its estimated mean and covariance. Delage and Ye use a finite-sample confidence region for these two moments to justify a…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOperations Research·Captain: mikedeng1

Robust Solutions of Uncertain Linear Programs I: Under Constraint-wise Uncertainty and the Boundedness Assumption the Robust Counterpart Is No Worse Than the Worst InstanceResearch Paper

A linear program is solved with data that, in practice, is rarely known exactly: coefficients come from measurements, estimates or forecasts. Robust optimization asks for a solution that remains feasible for every realization of the data in a prescribed uncertainty set, and among those the one with the best guaranteed objective value. Ben-Tal and Nemirovski…

9 thms2 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability+1·Captain: mikedeng1

Variance-based Regularization with Convex Objectives I: The χ²-Robust Risk Equals Empirical Risk plus a Standard-Deviation PenaltyResearch Paper

Many statistical procedures minimize an average observed loss. This treats two candidates with the same average as equally attractive even when one has much more variable losses across the sample. Adding a multiple of the empirical standard deviation can distinguish them, but the resulting objective need not be convex even when each individual loss is…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

A Distributional Interpretation of Robust Optimization III: Uncertainty Set Shrinkage Approximates a Two-Scenario Distributionally Robust ProblemResearch Paper

Robust optimization (RO) protects a decision against every parameter value in an uncertainty set. For a decision vvv and a parameter x∈Rmx \in \mathbb{R}^mx∈Rm with objective f(v,x)f(v, x)f(v,x) to be maximized, the robust problem around a nominal parameter x0x_0x0​ with a deviation set Δ\DeltaΔ is

7 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

A Distributional Interpretation of Robust Optimization I: Robust Optimization over Overlapping Uncertainty Sets Equals a Distributionally Robust Stochastic ProgramResearch Paper

Robust optimization (RO) protects a decision against every realisation of an uncertain parameter in a prescribed uncertainty set; distributionally robust stochastic programming (DRSP) protects it against every probability distribution in a prescribed distribution set. The two paradigms are usually treated separately. When the n uncertain parameters live in…

5 thms2 active usersReviewed
🏆Completed
Linear OptimizationMachine LearningOperations Research+3·Captain: mikedeng1

Distributionally Robust Logistic Regression II: Worst- and Best-Case Misclassification Risks over a Wasserstein Ball Are Linear ProgramsResearch Paper

A logistic regression model is fitted on finitely many samples, and the quantity a practitioner cares about is the misclassification risk of the fitted classifier on new data. Its empirical counterpart, the training error, is biased downwards, and classical generalization bounds give it an additive margin that depends on a complexity measure of the model…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research+2·Captain: mikedeng1

Distributionally Robust Logistic Regression I: The Worst-Case Expected Logloss over a Wasserstein Ball Is a Tractable Convex ProgramResearch Paper

Logistic regression is among the most widely used classification methods in statistics and machine learning. Its maximum-likelihood estimator minimizes the average logloss on the training data and is known to overfit when data are scarce; practitioners respond with ad hoc regularization, typically a norm penalty on the weight vector. Shafieezadeh-Abadeh,…

9 thms2 active usersReviewed
🏆Completed
Control TheoryConvex OptimizationOperations Research+1·Captain: mikedeng1

Robust Solutions to Uncertain Semidefinite Programs II: An SDP Inner Approximation of the Robust Feasible Set under Structured PerturbationsResearch Paper

A semidefinite program (SDP) minimizes a linear objective cTxc^TxcTx subject to a linear matrix inequality F(x)=F0+∑i=1mxiFi⪰0F(x) = F_0 + \sum_{i=1}^m x_i F_i \succeq 0F(x)=F0​+∑i=1m​xi​Fi​⪰0. In engineering applications the coefficient matrices are rarely known exactly: they come from measurements, from a model of a physical plant, or from a finite-precision implementation. El Ghaoui, Oustry and Lebret…

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraNumerical Analysis+2·Captain: mikedeng1

Robust Solutions to Least-Squares Problems with Uncertain Data II: Robust Least Squares as Tikhonov RegularizationResearch Paper

Least squares fits a linear model Ax≃bAx \simeq bAx≃b by minimizing ∥Ax−b∥\|Ax - b\|∥Ax−b∥, and its solution can be extremely sensitive to errors in the data (A,b)(A, b)(A,b) when AAA is ill-conditioned. The standard remedy is Tikhonov regularization (ridge regression): minimize ∥Ax−b∥2+μ∥x∥2\|Ax - b\|^2 + \mu\|x\|^2∥Ax−b∥2+μ∥x∥2, whose solution x=(A⊤A+μI)−1A⊤bx = (A^\top A + \mu I)^{-1}A^\top bx=(A⊤A+μI)−1A⊤b is stable but depends on a…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Robust Mean-Covariance Solutions for Stochastic Optimization I: The General Projection Property of Mean-Covariance Distribution ClassesResearch Paper

In robust stochastic optimization a decision maker chooses a decision xxx whose outcome depends on a random vector R\mathbf RR, but knows only the first two moments of R\mathbf RR: its mean vector μ\muμ and its covariance matrix Σ\SigmaΣ. The decision is evaluated by its worst-case expected utility over every distribution consistent with those moments. This model is…

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Robust Solutions of Optimization Problems Affected by Uncertain Probabilities II: A Self-Concordant Barrier for the Perspective ConstraintResearch Paper

Robust optimization protects a decision against every scenario in an uncertainty set. When the uncertain data are probabilities, a natural uncertainty set is a ball around a nominal distribution measured by a φ-divergence (Kullback–Leibler, Burg entropy, χ², Hellinger and others). Ben-Tal, den Hertog, De Waegenaere, Melenberg and Rennen (Management Science…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Robust Solutions of Optimization Problems Affected by Uncertain Probabilities I: The Robust Counterpart of a Linear Constraint under φ-Divergence UncertaintyResearch Paper

Many decision problems contain a constraint whose coefficients are an expectation under a probability vector that is not known exactly: an expected cost under uncertain scenario probabilities, an expected payoff of an asset under an estimated distribution, the expected demand in a newsvendor model. The probabilities are usually estimated from data, and a…

12 thms2 active usersReviewed
PreviousPage 3 of 3Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1NINickrobbins951280
2MRmrfancypants1110
3MOmoona3k500
4RYryanshin390
5SCShuze Chen2213
6KMkmehltretter82181
7VEvebis160
8ARarexychen110
8TItianyipeng112
10FIfizzyinc380

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me