analiza aiqbench
This paper introduces Adaptive Conditional Residual Sampling (ACRS), a novel optimization framework designed to minimize spectral risk objectives under decision-dependent uncertainty with limited simulation budgets. By constructing deterministic surrogates from standardized residuals and refining them via importance sampling, the method achieves significantly lower regret than standard Bayesian optimization or cross-entropy techniques across various benchmark instances. The work advances the field of robust stochastic optimization by providing a consistent estimator that efficiently handles scenarios where the underlying distribution shifts based on the decision variables.
Adaptive Conditional Residual Sampling for Spectral Risk Optimisation under Decision-Dependent Uncertainty
arXiv:2603.12507v3 Announce Type: replace Abstract: We consider minimising a spectral risk objective, the expected cost plus a weighted conditional value-at-risk, when the distribution of the uncertain parameters depends on the decision and can only be sampled through a stochastic simulator under a fixed budget of draws. We propose adaptive conditional residual sampling (ACRS). It takes one simulator draw at each point of a space-filling design, fits a heteroscedastic regression model of the decision-dependent distribution and reuses the standardised residual vectors as scenarios to construct a deterministic surrogate. ACRS searches this surrogate for several local optima, adds draws around the most promising ones, ranks the candidates on the simulator with common random numbers and finishes with sample-path local refinement using tail importance sampling. We show that the optimality gap of the surrogate minimiser is bounded by the Wasserstein error of the scenario distribution and that the refinement estimator is consistent. In the experiments, all methods share the budget accounting, the design sampler and the local refinement routine, and solutions are scored by normalised regret against reference optima. On 60 random instances of an analytic family with a closed-form objective, ACRS attains a mean regret of 11.8% against 22.3-42.3% for Bayesian optimisation, cross-entropy, kernel-density, stochastic-gradient and refinement-only baselines; its lead is largest at small budgets and, relative to the kernel-density method, tends to grow with the dimension. ACRS also has the lowest mean regret on two six-dimensional benchmarks and three development problems, and performs comparably to pure local refinement on three held-out problems frozen before testing.
Abstract:We consider minimising a spectral risk objective, the expected cost plus a weighted conditional value-at-risk, when the distribution of the uncertain parameters depends on the decision and can only be sampled through a stochastic simulator under a fixed budget of draws. We propose adaptive conditional residual sampling (ACRS). It takes one simulator draw at each point of a space-filling design, fits a heteroscedastic regression model of the decision-dependent distribution and reuses the standardised residual vectors as scenarios to construct a deterministic surrogate. ACRS searches this surrogate for several local optima, adds draws around the most promising ones, ranks the candidates on the simulator with common random numbers and finishes with sample-path local refinement using tail importance sampling. We show that the optimality gap of the surrogate minimiser is bounded by the Wasserstein error of the scenario distribution and that the refinement estimator is consistent. In the experiments, all methods share the budget accounting, the design sampler and the local refinement routine, and solutions are scored by normalised regret against reference optima. On 60 random instances of an analytic family with a closed-form objective, ACRS attains a mean regret of 11.8% against 22.3-42.3% for Bayesian optimisation, cross-entropy, kernel-density, stochastic-gradient and refinement-only baselines; its lead is largest at small budgets and, relative to the kernel-density method, tends to grow with the dimension. ACRS also has the lowest mean regret on two six-dimensional benchmarks and three development problems, and performs comparably to pure local refinement on three held-out problems frozen before testing.
Machine Learning (cs.LG); Optimization and Control (math.OC); Computation (stat.CO); Machine Learning (stat.ML)
arXiv:2603.12507 [cs.LG]
(or arXiv:2603.12507v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2603.12507 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 350 cuvinte
Subiecte conexe
Adaptive Conditional Forest Sampling for Spectral Risk Optimisation under Decision-Dependent Uncertainty
arXiv · 8 iun. 2026
Domain-informed Adaptive Sampling for Generalizable PINNs in Metal Additive Manufacturing via Conditional Flow Matching
arXiv · 8 oct. 2026
Adaptive Finite-Budget Training for CVaR Risk-Aware Q-Learning
arXiv · 6 aug. 2026
Reflections on unlearning and inoculation
LessWrong · 20 sept. 2026