arXiv:2609. 11073v1 Announce Type: cross Abstract: Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error.
arXiv:2608.29789v1 Announce Type: cross Abstract: Uncertainty quantification from finite data is central to machine learning, optimization, and automation systems, where decisions must remain reliabl...
arXiv:2510. 07750v3 Announce Type: replace-cross Abstract: Robust optimization safeguards decisions against uncertainty by optimizing against worst-case scenarios, yet their effectiveness hinges on a prespecified robustness level that is often chosen ad hoc, leading to either insufficient protection or overly conservative and costly solutions.
arXiv:2402. 07407v3 Announce Type: replace-cross Abstract: We propose conformal predictive programming (CPP), a framework to solve chance constrained optimization problems, i.
arXiv:2511.15146v2 Announce Type: replace Abstract: Conformal prediction (CP) constructs uncertainty sets for model outputs with finite-sample coverage guarantees. Yet ranking scores is straightforwa...
arXiv:2605.08506v3 Announce Type: replace Abstract: Robust optimization (RO) provides a principled framework for decision-making under uncertainty, but its performance critically depends on the choic...
arXiv:2504. 10796v4 Announce Type: replace-cross Abstract: Distributionally robust optimization (DRO) is widely used for decision-making under uncertainty, but its adversarial focus on worst-case loss can lead to overly conservative policies.
arXiv:2605. 07565v2 Announce Type: replace-cross Abstract: We study Bayesian Optimisation (BO) in settings where the objective function is influenced by uncontrollable environmental contexts governed by an unknown probability distribution.
arXiv:2607. 24983v1 Announce Type: cross Abstract: Generative models are increasingly adopted in distributionally robust optimization (DRO), but existing approaches trade off model compatibility and adversarial structure: methods that accept arbitrary samplers do not restrict worst-case laws to a generator family, while generator-parameterized adversaries rely on model-specific access such as likelihoods, scores, or training data.
arXiv:2601. 02998v2 Announce Type: replace Abstract: In many fairness and distribution robustness problems, one has access to labeled data from multiple source distributions yet the test data may come from an arbitrary member or a mixture of them.
arXiv:2606. 00320v1 Announce Type: new Abstract: We present an online, distribution-free framework for controlling the Conditional Value-at-Risk (CVaR), extending conformal tail risk control to non-stationary and adversarial environments.
arXiv:2507. 20975v5 Announce Type: replace-cross Abstract: Operator models are regression algorithms between Banach spaces of functions.
arXiv:2606. 31915v1 Announce Type: cross Abstract: While conformal prediction provides a general framework for uncertainty quantification in predictive inference, its application is often limited by computational cost.