arXiv Statistics ML By Boyang Shen, Junyi Liu

Learning-Based Surrogate Method for Stochastic Optimization under Decision-Dependent Uncertainty with Adaptive Random Designs

Read the original on arXiv Statistics ML →

The paper introduces a learning-based surrogate approach for stochastic optimization problems where uncertainty depends on the decision, modeled via a nonparametric regression. It constructs a surrogate that embeds iteratively updated Jacobian estimates, using an adaptive random design that focuses sampling near the current iterate to achieve dimension‑independent convergence of the Jacobian estimates. The resulting learning‑based stochastic prox‑linear (L‑SPL) algorithm demonstrates nonasymptotic convergence rates and outperforms existing methods in sample efficiency and objective value in numerical experiments.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Oct 5

Learn Feasibility Once, Optimize All Objectives: Derivative-Free Diffusion Models for Chance-Constrained Programming

The paper introduces D$^3$Opt, a derivative‑free diffusion‑based framework that separates constraint modeling from objective optimization in chance‑constrained programs. It learns a risk‑conditioned diffusion model once on constraint‑filtered decisions, then uses an annealed, particle‑based Feynman–Kac correction to optimize any post‑specified objective without retraining. The method is proven to preserve feasibility and provides an error bound, and experiments show effective optimization across smooth, non‑smooth, and non‑convex objectives, including objective transfer tasks.

By Ziwen Liu, Yan Liu, Congying Han, Tiande Guo, Yao Yan, Weichen Zhao