Chance-Constrained Optimization

Overview

Chance-constrained optimization studies how to make good decisions when uncertain outcomes must meet explicit probability-of-failure limits. Methods include deterministic reformulations for Gaussian or moment-based models, scenario sampling, conformal calibration, and distributionally robust optimization over ambiguity sets. These approaches support applications such as trajectory planning, stochastic control, resource allocation, and safe learning, where they are evaluated for solution quality, constraint satisfaction, and computational cost. A central tension is that stronger reliability guarantees can make optimization more conservative or harder to solve, especially with non-Gaussian uncertainty, distribution shift, or many coupled constraints.

Latest papers

33 papers2 papers in the last four weeks, down 75% on the four weeks before. 0.0% of all new papers.

Jan 26, 2026

Convex Chance-Constrained Stochastic Control under Uncertain Specifications with Application to Learning-Based Hybrid Powertrain Control

This paper proposes a strictly convex chance-constrained stochastic control framework that accounts for uncertainty in control specifications such as reference trajectories and operational constraints. Control inputs and risk allocation are jointly optimized under general, possibly non-Gaussian, uncertainties through sufficient deterministic conditions for probabilistic constraint satisfaction. A decreasing risk regularizer ensures existence and full use of the allowable risk. Under the stated regularity assumptions, the joint solution is unique and locally Lipschitz-continuous, supporting stable numerical optimization. The formulation is extended to learning-based exactly linearizable (EL) models through monotone state and input transformations. A hybrid powertrain example compares deterministic control, equal risk allocation, and optimized risk allocation with and without regularization in terms of charge sustaining, constraint violations, closed-loop cost, and solver time.
Sep 29, 2025

Chance-constrained Flow Matching for High-Fidelity Constraint-aware Generation

Generative models excel at synthesizing high-fidelity samples from complex data distributions, but they often violate hard constraints arising from physical laws or task specifications. A common remedy is to project intermediate samples onto the feasible set at each sampling step. However, repeated projection can disrupt the learned sampling dynamics because this feasible set is defined for clean samples rather than noisy intermediate states. Thus, recent studies first estimate clean samples and then project them to the feasible set, but this increases algorithmic complexity and accumulates errors across steps. To address these issues, this paper proposes Chance-constrained Flow Matching (CCFM), a training-free method that formulates constraint enforcement during sampling as stochastic optimization while retaining the hard-constraint feasibility guarantee of projection-based methods. By avoiding direct projection of noisy intermediate states onto the clean-sample feasible set, CCFM mitigates the distributional distortion. Unlike approaches that first estimate and project clean samples, CCFM avoids complex multi-stage procedures. Experiments show that CCFM outperforms current state-of-the-art constrained generative models in modeling complex physical systems governed by partial differential equations, molecular docking problems, and physics-informed motion generation, delivering superior feasibility and fidelity.
Feb 12, 2024

Conformal Predictive Programming for Chance Constrained Optimization

We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.e., optimization problems with constraints that are functions of random variables. CPP utilizes samples from these random variables along with the quantile lemma - central to conformal prediction - to transform the chance constrained optimization problem into a deterministic problem with a quantile reformulation. CPP's main strength is an independent calibration step that provides a posteriori guarantees for the solution of this problem that are of conditional and marginal nature otherwise. These guarantees even apply in settings when assumptions required for obtaining standard a priori guarantees (e.g., in scenario optimization or sample average approximation) are unavailable, difficult to compute, or conservative. Another strength of CPP is that it can easily support different variants of conformal prediction which have been (or will be) proposed within the conformal prediction community. To illustrate this, we present robust CPP to deal with distribution shifts in the random variables and Mondrian CPP to deal with class conditional chance constraints. In a series of case studies, we show the validity of the aforementioned approaches, and illustrate the advantage of CPP as compared to scenario approach.