Searcharxiv⌕ Search

arXiv subjects

Pascal Van Hentenryck

Publications and source records attributed to Pascal Van Hentenryck.

At least 19 recordsLinked to original sources

CoCoNet: Convex Conformal Network for Multi-Dimensional Uncertainty Regions

Conformal prediction (CP) provides distribution-free coverage guarantees under exchangeability, but the efficiency of its prediction regions depends critically on the choice of the conformity score. This is particularly important in multivariate regression, where dependencies across output dimensions induce complex joint uncertainty structures. This paper introduces CoCoNet (Convex Conformal Network) for learning convex conformity scores that induce flexible, data-adaptive prediction regions. CoCoNet learns the score from held-out data by optimizing prediction-region efficiency while enforcing convexity with respect to the residual. CoCoNet then applies split-conformal calibration to retain finite-sample coverage guarantees. The paper presents two variants of the method: CoCoNet$_{\mathrm{Spline}}$, based on piecewise-linear scores, and CoCoNet$_{\mathrm{ICNN}}$, based on Input Convex Neural Networks. Experiments compare CoCoNet with other CP baselines over synthetic and real-world datasets with output dimensions ranging from 2 to 16. The results demonstrate the flexibility of CoCoNet in learning different response types. Across 8 models and 30 multi-dimensional regression tasks, CoCoNet$_\text{ICNN}$ and CoCoNet$_{\mathrm{Spline}\text{-}\ell_1}$ achieve the best efficiencies with average ranks of 1.45 and 2.75, respectively. In particular, CoCoNet$_\text{ICNN}$ ranks first on 22 tasks out of 30 in terms of efficiency.

stat.ML↗

Conformal Predictive Distributions for Contextual Order Fulfillment Optimization

Ship-to-home fulfillment requires a retailer to select a fulfillment location and carrier before the delivery time is known. These decisions often rely on static transit-time estimates, which cannot represent how delivery-time uncertainty varies across orders and fulfillment options. This paper constructs conformal predictive distributions (CPDs) using Conformal Predictive Systems (CPS) for regression and the cross Venn-Abers predictor (CVAP) for multiclass classification, and uses them in a contextual optimization model for fulfillment decisions. The model is solved by contextual sample-average approximation (C-SAA). The regret of each fulfillment decision, its expected cost above that of the best decision, is bounded by forecast error, scenario-evaluation error, and the candidate-generation gap. The forecast term depends on how well calibration residuals or class probabilities represent the current order. On more than five million proprietary order records, CVAP raises exact-day accuracy from 49.5% for the rule-based estimate to 64.1%. Paired with a decision rule that selects a quantile weighting late errors more heavily, the split CPS (SCPS) gives a point estimate that raises late-delivery detection from 3.8% to 79.4%. Residual-based CPS distributions also meet or slightly exceed nominal interval-coverage targets. In decision experiments with a JD.com simulator over six test dates, C-SAA with CVAP lowers mean total cost by 7.1% and C-SAA with the Mondrian CPS (MCPS) lowers it by 6.7%, relative to C-SAA with the original nonconformal forecast. Both cut the late-delivery rate from 5.7% to below 4.0%.

math.OC↗

Trust-Region Benders for Scalable Multiperiod Expansion Planning for Transmission and Storage

Transmission expansion planning (TEP) seeks to identify cost-effective investment strategies that enable power systems to reliably meet future demand, while accounting for the location, timing, and operational impacts of infrastructure upgrades. As demand grows and renewable penetration increases, there is growing interest in jointly modeling energy storage investments to enhance operational flexibility. This work presents a multiperiod formulation that co-optimizes transmission reconductoring and energy storage installation across multiple planning periods. To solve the resulting large-scale problem efficiently, a Benders decomposition with per-period trust-region stabilization and a relaxation-based warm-start procedure is proposed. The approach is demonstrated on a 2,000-bus Texas system, producing an investment plan spanning 2030-2045 with optimality gap below 1.0%, and is compared against a rolling-horizon approach to highlight the benefits of multiperiod coordination.

eess.SY↗

MARTA Reach: Toward an On-Demand Multimodal Transit System in Atlanta

On-Demand Multimodal Transit Systems (ODMTS) adopt a transit-centric model, integrating fixed-route public transit with on-demand shuttles to provide integrated, door-to-door multimodal service. Although simulation studies have demonstrated the theoretical potential of ODMTS, the system has not yet been tested in practice at scale. In collaboration with the transit agency of the Atlanta metropolitan region (MARTA), the authors organized MARTA Reach, a six-month on-demand mobility pilot to explore the practical viability of ODMTS. Reach offered on-demand services across four different zones, connecting each zone to the existing transit network and offering an integrated flat fare. This allowed for testing key system components in real-world conditions. Ridership steadily increased throughout the pilot, suggesting potential for growth if a full ODMTS were implemented. Reach offered a highly valued service with 94% satisfaction rate, and 12.24% of survey respondents indicated they would have driven, ridden with someone, or taken a taxi or ride-hailing service otherwise. The vast majority of Reach trips were multimodal, especially in West Atlanta, where over 70% of morning riders connected to rail. The paper presents a potential path to economic viability and discusses practical challenges encountered during the pilot, along with strategies for future deployments. Following the pilot, MARTA officially adopted MARTA Reach as a long-term component of its transportation services in March 2026. The system-wide on-demand transit service currently serves 12 zones with the integrated flat fare and the organizational structure advocated in the pilot. The adoption decision demonstrates that the insights, system components, and operational lessons documented in this paper translated directly into a larger real-world deployment, providing an opportunity to evaluate ODMTS performance at scale.

cs.CY↗

CoCopula: Conformal Calibration and Copula Aggregation for Reliable Renewable Energy Forecasting

The rapid growth of renewable energy penetration has intensified the need for reliable probabilistic forecasts to support grid operations at aggregated (fleet or system) levels. In practice, however, system operators often lack access to fleet-level probabilistic models and instead rely on site-level forecasts produced by heterogeneous third-party providers. Constructing coherent and calibrated fleet-level probabilistic forecasts from such inputs remains challenging due to complex cross-site dependencies and aggregation-induced miscalibration. Motivated by a real-world operational challenge identified through collaboration with an industry partner, this paper presents a probabilistic aggregation and calibration framework that directly converts site-level probabilistic forecasts into reliable fleet-level forecasts. The paper introduces \method~ (\textbf{Co}nformal Calibration and \textbf{Copula} Aggregation), which integrates Copula-based dependence modeling to capture cross-site correlations followed by Context-Aware Conformal Prediction (CACP) to mitigate miscalibration at the aggregated level. This combination enables dependence-aware aggregation while improving empirical coverage and maintaining sharp prediction intervals. Experiments on large-scale solar generation datasets from three system operators in the United States including MISO, ERCOT, and SPP demonstrate that the proposed \method{} approach achieves near-nominal empirical coverage and consistently lower Winkler scores than competing aggregation-based baselines across different target coverage levels. Importantly, \method{} achieves performance comparable to directly calibrated system-level forecasts, demonstrating its practical value when dedicated fleet-level forecasting models are unavailable.

cs.LG↗

Match the Canvas, Not Just the Answer: Predictability-Aware SFT for Diffusion Language Models

Diffusion language models (DLMs) enable flexible parallel generation by resolving tokens according to the model's evolving predictability rather than a fixed left-to-right order. This flexibility, however, introduces training choices absent from standard autoregressive teacher forcing: which reference tokens are visible when a target is supervised and how much generation space is allocated. Standard supervised fine-tuning (SFT) typically makes these choices through random masking, independently of inference. Our analysis shows how this training-inference mismatch can misdirect supervision. Random masking can conceal prediction errors or penalize uncertainty that decoding would otherwise resolve, while the attention-visible input length can change which response formulations the model favors, even when the underlying solution is unchanged. Motivated by these findings, we propose Predictability-Aware Canvas Selection and Supervision (PACS), an SFT method. PACS uses the model's own predictability to select each example's attention-visible input length and supervises reference tokens immediately before their confidence-guided revelation. Across reasoning and code-generation benchmarks, PACS consistently achieves the highest mean accuracy among the compared SFT methods, with gains of up to 12.84 percentage points over vanilla SFT on individual benchmarks. Code will be released upon publication.

cs.LG↗

Decision-Focused On-Policy Learning for Contextual Linear Optimization with Partial Feedback

Decision-focused learning (DFL) trains predictive models by optimizing downstream decision quality rather than standalone prediction accuracy. For contextual linear optimization, most existing DFL methods assume offline data and full observations of the objective cost vector. We develop an on-policy learning method for sequential contextual linear optimization under partial feedback, generalizing the standard bandit feedback setting. Our method learns a stochastic predict-then-optimize policy that samples a cost-vector prediction from a conditional distribution and solves the resulting downstream linear optimization problem. To update this distributional model, we introduce a two-component hybrid gradient estimator. The first component is a score function estimator, which provides an unbiased but potentially high-variance policy gradient estimate. The second is a decision-focused plug-in component that uses an auxiliary nuisance estimate of the latent cost vector to exploit the downstream optimization structure, becoming more informative as the estimate improves. We prove an O(T^-1/2) bound on the average squared policy-gradient norm, matching the standard non-convex SGD rate. Experiments on top-k selection, shortest path, combinatorial pricing, and a real-data energy-scheduling benchmark show that, under bandit feedback, the hybrid gradient approach achieves lower mean cumulative regret than the contextual-bandit baselines on all four benchmarks and than linear Thompson sampling on three, and that it also works with richer conditional generative cost models. Code is available at https://github.com/Joeyetinghan/on-policy-bandit-dfl.

cs.LG↗

Sequence Variables: A Constraint Programming Computational Domain for Routing and Sequencing

Constraint Programming (CP) offers an intuitive, declarative framework for modeling Vehicle Routing Problems (VRP). While classical successor-based CP models can be adapted to handle optional visits or insertion-based heuristics, sequence variables provide a significantly more natural and elegant formulation for these requirements. Building upon our prior work that introduced the initial concept, the main contribution of this article is the complete semantic and operational formalization of sequence variables as a computational domain. Specifically, we formally define the sequence domain and its update operations, and detail the implementation and data structures required to integrate sequence variables into trail-based CP solvers. Furthermore, we introduce consistency levels for associated constraints on this domain alongside specialized global constraints tailored for routing problems. Finally, we demonstrate that sequence variables simplify problem modeling while achieving competitive computational performance on Pickup and Delivery Problems with and without Time Windows, the Dial-a-Ride Problem, and a Prize-Collecting Scheduling Problem.

cs.AI↗

Distributed Linear Programming on GPU Clusters at Extreme Scale

Large linear programs can exceed the memory of a single compute node. Although first-order methods replace sparse factorizations with GPU-suited matrix-vector products, other solver phases can reintroduce a single-node memory limit. We present SHARDLP, a distributed GPU LP solver that keeps the matrix and primal-dual state partitioned from sharded input through solution output. On the Google PDLP benchmark, SHARDLP reaches the published criterion on nine of eleven instances, compared with eight in the published CPU PDLP study. On the largest benchmark, eight H200 GPUs solve a 1.185-billion-variable, 6.338-billion-nonzero LP in 9.9 minutes; the published CPU experiment reports 21.06 hours on different hardware. Beyond this benchmark, separately checked multi-node solves reach up to 13.604 billion variables and 40.807 billion nonzeros, while validated executions span up to 76 GPUs across 29 compute nodes. For column-partitioned solves, support-aware communication skips GPUs that store no coefficients for a row; on an LP with 2.76 billion nonzeros, it cuts modelled communication by 92.97% and improves solver time by 1.27x-1.52x

math.OC↗

A Hybrid Decomposition Approach for Stochastic Unit Commitment with Combined-Cycle Generators

The U.S. power grid is undergoing a paradigm shift as energy demand grows in scale and volatility. In response to this growing need, the U.S. has increased adoption of combined-cycle generators (CCs). CCs are fast-ramping generators that utilize variable configurations of combustion turbines (CTs) and steam turbines (STs) to achieve higher efficiency than traditional CTs. For schedule optimization, modeling these CCs requires the addition of a large number of binary constraints and variables to Unit Commitment (UC) problem formulations. This paper presents a novel hybrid Benders' (BD) and Dantzig-Wolfe (DW) decomposition algorithm, called CRG, for stochastic UC problems with CCs. CRG exploits the separability of the linear constraints in UC through BD and the integer CC constraints through DW. A novel set of valid inequalities are proposed for significantly tightening the lower bound produced by CRG. CRG is tested on the 935-generator FERC test data set, modified to include CC mode data. Results demonstrate better primal solutions than BD on cases with at least 20 load scenarios. CRG scales computationally better than Gurobi's branch-and-bound solver, which exceeds 64GB RAM allocations at 45 scenarios. Results show that the proposed algorithm is a scalable approach for solving large-scale stochastic UC with CCs.

math.OC↗

Improving Stability and Economic Operation in Transmission Systems through Volt/VAR Optimization

Transmission system operators often reconcile market-cleared DC dispatches with AC physics through power-flow solves (ACPF), yet the resulting setpoints can still violate voltage (Volt) and reactive-power (VAR) limits. Maintaining secure voltage profiles and adequate VAR support therefore requires fast corrective decisions that are implementable in operation. This paper presents a novel homotopy-based continuation method for discrete-control Volt/VAR Optimization (VVO) that coordinates switchable devices, such as on-load tap-changing transformers (OLTCs) and capacitor banks (CBs). Experiments on IEEE, PEGASE, and RTE systems show that the proposed VVO produces AC-feasible setpoints within practical runtime, while reducing voltage deviation, VAR dispatch, and generation cost. VVO also achieves comparable performance using ACPF-adjusted DC dispatches as inputs relative to AC-feasible dispatches, indicating that it can be integrated naturally into existing transmission dispatch practices to strengthen grid operation.

math.OC↗

The Impact of Shared Autonomous Vehicles in Microtransit Systems: A Case Study in Atlanta

Microtransit systems represent an enhancement to solve the first- and last-mile problem, integrating traditional rail and bus networks with on-demand shuttles into a flexible, integrated system. This type of demand responsive transport provides greater accessibility and higher quality levels of service compared to conventional fixed-route transit services. Advances in technology offer further opportunities to enhance microtransit performance. In particular, shared autonomous vehicles (SAVs) have the potential to transform the mobility landscape by enabling more sustainable operations, enhanced user convenience, and greater system reliability. This paper investigates the integration of SAVs in microtransit systems, advancing the technological capabilities of on-demand shuttles. A shuttle dispatching optimization model is enhanced to accommodate for driver behavior and SAV functionalities. A model predictive control approach is proposed that dynamically rebalances on-demand shuttles towards areas of higher demand without relying on vast historical data. Scenario-driven experiments are conducted using data from the MARTA Reach microtransit pilot. The results demonstrate that SAVs can elevate both service quality and user experience compared to traditional on-demand shuttles in microtransit systems.

eess.SY↗

End-to-End Supply Chain Planning in the Paper Industry Via Column Generation and Benders Decomposition

Problem definition: The paper studies an integrated end-to-end planning problem in large-scale paper manufacturing, where production scheduling, trimming decisions, vehicle loading, and multi-period fulfillment of make-to-order and make-to-stock demand must be coordinated over time. In practice, these decisions are often optimized sequentially, leading to material waste, inefficient transportation, and degraded service levels. Solving the fully integrated problem at industrial scale remains computationally challenging due to its combinatorial structure. Methodology/results: A key structural feature of the problem is that downstream fulfillment decisions depend on upstream production and logistics choices only through aggregate supply availability over time. By exploiting this structure, the paper develops an exact mathematical formulation and proposes a two-phase hybrid framework (BDCG-DP) that integrates column generation (CG) using exact dynamic-programming (DP) for supply-side decisions with Benders decomposition (BD) for downstream fulfillment. Computational experiments on proprietary instances from a major North American paper manufacturer show that BDCG-DP lowers total costs by 24.4% compared to a traditional CG-DP on challenging eight-week planning problems. Median runtime for four-week planning problems decreases from over five hours using CG-DP to under one hour using BDCG-DP. Managerial implications: This paper provides the first exact model that integrates production, trimming, load planning, and multi-period fulfillment at an industrial scale. The proposed approach returns integer-feasible plans within 2.3 to 6 hours for the most complex planning problems, enabling planners to access high-quality implementable schedules within hours, a capability that was previously unavailable in practice.

math.OC↗

Towards AC Feasibility of DCOPF Dispatch

DC Optimal Power Flow (DCOPF) is widely utilized in power system operations due to its simplicity and computational efficiency. However, its lossless, reactive power-agnostic model often yields dispatches that are infeasible under practical operating scenarios such as the nonlinear AC power flow (ACPF) equations. While theoretical analysis demonstrates that DCOPF solutions are inherently AC-infeasible, their widespread industry adoption suggests substantial practical utility. This paper develops a unified DCOPF-ACPF pipeline to recover AC feasible solutions from DCOPF-based dispatches. The pipeline uses four DCOPF variants and applies AC feasibility recovery using both distributed slack allocation and PV/PQ switching. The main objective is to identify the most effective pipeline for restoring AC feasibility. Evaluation across over 10,000 dispatch scenarios on various test cases demonstrates that the structured ACPF model yields solutions that satisfy both the ACPF equations, and all engineering inequality constraints. In a 13,659 bus case, the mean absolute error and cost differences between DCOPF and ACOPF are reduced by 75% and 93%, respectively, compared to conventional single slack bus methods. Under extreme loading conditions, the pipeline reduces inequality constraint violations by a factor of 3 to 5.

eess.SY↗

PACR: Parameter-Optimized AC Power Flow Restoration for AC Feasible DCOPF Dispatch

The DC optimal power flow is widely used in power system operations because of its computational efficiency and scalability. However, DC dispatches are not guaranteed to satisfy the nonlinear AC power-flow equations or associated operational limits. This paper develops a parameterized, differentiable AC power-flow restoration method for mapping DC dispatches to AC-consistent operating points. The method incorporates distributed slack for active-power balancing and PV/PQ switching for reactive-power regulation, both implemented using smooth differentiable surrogates with tunable parameters, including slack participation factors, voltage setpoints, and regulation steepness. These parameters are trained offline by differentiating through the AC restoration equations using the implicit function theorem. Once trained, the optimized parameters are fixed and used directly during AC power-flow recovery from DC dispatches. The approach is evaluated on IEEE, ACTIVSg, and PEGASE test systems using setpoints computed by standard DC optimal power flow. Results show that the optimized restoration method improves AC feasibility recovery across various systems relative to conventional single-slack AC power-flow recovery. On the 9,241-bus case, the optimized method improves cost difference by 80% relative to the conventional recovery baseline and improves solving time relative to ACOPF by 75%.

eess.SY↗

Learning Optimization Proxies for Sequential Contextual Stochastic Programs: An Order Fulfillment Application

Sequential contextual stochastic programs model real-time decision systems in which each time epoch commits to an action under uncertainty whose consequences propagate into future decisions. In many practical contexts, these programs require obtaining solutions rapidly as new information becomes available. These problems can be represented through scenario approximations to be solved by off-the-shelf optimization solvers, which achieve high decision quality offline but typically run in seconds to minutes per instance, falling short of the sub-second responses that peak periods of planning require. This paper develops a learning-based optimization proxy: a scenario-embedded neural network trained offline on solver-generated labels, paired online with a decoder that enforces feasibility, replacing the per-epoch solve with a single forward pass. The framework is specialized to omnichannel order fulfillment, where each arriving order requires a sub-second assignment of products to distribution centers and carrier services under stochastic delivery times and future demand. A two-stage contextual stochastic program is introduced to formulate this problem, and its contextual sample average approximation (C-SAA) supplies the offline labels, while a composite training loss combines label imitation, a constraint-violation penalty, and self-supervised cost alignment. In a calibrated simulator built from JD.com transactional records, a detailed computational study is provided. The proxy reduces decision latency by roughly 2800x relative to the online finite-sample C-SAA reference and improves over it by 3.3% in realized fulfillment cost. Relative to established fulfillment policies, the proxy lowers total realized cost by at least 10.7% and roughly halves the late-delivery rate.

math.OC↗

Fusing Backdoors, Machine Learning, and Optimization for Large-Scale Parametric Mixed-Integer Programs

Large-scale optimization problems are often solved repeatedly under similar structural conditions, leading to substantial computational overhead. This occurs in applications such as power systems, transportation, and supply chain networks, where the underlying structure is fixed while parameters frequently vary under perturbations. This paper proposes a Learning to Optimize (LTO) framework that accelerates the solution of large-scale general mixed-integer problems by leveraging the concept of a backdoor, i.e., a subset of variables that drive most of the computational complexity. The proposed BIPC framework consists of three phases. Phase I is an identification procedure that discovers a backdoor for a set of instances in the distribution. Phase II uses supervised learning to develop machine learning models that, given an instance, predict values for bounded-domain backdoor variables and intervals for wide-domain backdoor variables. These predictions define a reduced optimization problem where the predictions constrain the backdoor variables, while the other variables remain free. Phase III optimizes this reduced problem and, if necessary, applies a correction step to restore feasibility or the optimality guarantees. Experiments on real-world, large-scale problems show substantial reductions in solution time with only a limited loss in solution quality. The framework enables organizations to solve large-scale optimization problems efficiently in the presence of frequent perturbations, such as unexpected events, demand fluctuations, or operational changes. Because these changes affect parameters rather than the problem structure, BIPC can quickly provide high-quality, feasible solutions, offering a practical approach to integrating machine learning into existing optimization pipelines.

cs.LG↗

The Proxy Benders Decomposition

Benders decomposition is a fundamental framework for solving large-scale mixed-integer optimization problems with complicating variables that, when fixed, yield significantly easier subproblems. However, classical Benders decomposition repeatedly solves highly similar subproblems and often exhibits zigzagging behavior across iterations, leading to slow convergence in large-scale settings. Motivated by the repetitive structure and parametric nature of Benders subproblems, this paper introduces the proxy Benders decomposition (Proxy-BD), a new decomposition framework in which subproblem optimization is replaced by certified optimization proxies rather than repeated exact solves. The proposed proxy follows a self-supervised predict-project-and-complete mechanism that produces dual-feasible solutions for generating provably valid Benders cuts. The framework preserves the theoretical validity of the decomposition independently of prediction quality through a projection-and-completion certification layer. A formal characterization of proxy-induced cuts is established, and the framework naturally extends to modern decomposition schemes, including branch-and-Benders-cut algorithms. Computational experiments on large-scale facility location and network design problems demonstrate that Proxy-BD substantially reduces the computational effort of subproblems while maintaining near-optimal solution quality. On large-scale uncapacitated facility location instances up to 2000x2000, Proxy-BD achieves median optimality gaps below 0.5%, yields up to 161x median speedups, and reduces the number of generated cuts by more than 240x on the largest instances. The computational gains consistently increase with recourse complexity, indicating that proxy-based inference scales substantially more favorably than repeated exact subproblem optimization in large-scale decomposition settings.

math.OC↗