Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

16324864 · May 202619922001200920172026
48 results for Wasserstein ambiguity

This paper compares different DRO formulations for pension fund management.

problem Navigating uncertainty in asset liability management for pension funds.
method Three DRO formulations: mixture, box, and Wasserstein ambiguity sets.
result Wasserstein and box ambiguity sets outperform traditional approaches in fund performance.

Construction of ambiguity set in robust optimization relies on the choice of divergences between probability distributions. In distribution learning, choosing appropriate probability distributions based on observed data is critical for approximating the true distribution. To improve the performance of machine learning …

2017-05-23abs ↗pdf ↗

As opposed to standard empirical risk minimization (ERM), distributionally robust optimization aims to minimize the worst-case risk over a larger ambiguity set containing the original empirical distribution of the training data. In this work, we describe a minimax framework for statistical learning with ambiguity sets …

2017-05-22abs ↗pdf ↗

Study improves adversarial classification using distributionally robust models.

problem Improving robustness against adversarial attacks in classification models.
method Distributionally robust chance constraints with Wasserstein ambiguity, reformulated as a regularized ramp loss minimization problem.
result Standard descent methods can converge to the global minimizer for the distributionally robust adversarial classification model.

Expands newsvendor model with moment constraints using Wasserstein distance.

problem Optimizing order quantity under distributional ambiguity.
method Formulates infinite dimensional primal problem, derives finite dimensional dual problem using problem of moments duality.
result Distributional ambiguity affects optimal order quantity and profits/costs.

This paper tackles cost-sensitive portfolio optimization under ambiguous return distributions.

problem Tackles cost-sensitive distributionally robust log-optimal portfolio problem with ambiguous return distributions.
method Uses Wasserstein metric for distributional ambiguity, incorporates convex transaction costs, and approximates infinite-dimensional problem with finite convex program.
result Establishes conditions for robustly survivable trades and validates theoretical framework with empirical studies.

We study a distributionally robust mean square error estimation problem over a nonconvex Wasserstein ambiguity set containing only normal distributions. We show that the optimal estimator and the least favorable distribution form a Nash equilibrium. Despite the non-convex nature of the ambiguity set, we prove that the …

2018-09-24abs ↗pdf ↗

The paper uses EVT to improve tail risk measures under ambiguity sets.

problem Misspecification of tail risk measures leads to inflated risk estimates.
method Applies Extreme Value Theory to derive worst-case tail risk under ambiguity sets.
result Proposes a tail-calibrated ambiguity design that preserves nominal tail asymptotic scaling.

Bayesian approach to portfolio selection reduces pessimism in frequent trading.

problem Tackling the challenge of estimating drift in Merton's portfolio selection model.
method Bayesian distributionally robust control with nonlinear Wasserstein projections.
result Reduced pessimism and improved performance in frequent rebalancing compared to existing methods.

Unified framework for DRO using OT with constraints.

problem Handling ambiguity in likelihood ratios and outcomes.
method Unified framework leveraging optimal transport with conditional moment constraints.
result Unified approach enables adversarial perturbation of likelihood ratios and outcomes.

This paper examines how data affects risk measures in uncertain distributions.

problem How does distributional ambiguity affect risk measures?
method Formulated and derived simpler dual problems for infinite and finite dimensional robust moment problems.
result Developed theory and conducted experiments in inventory control and portfolio management.

The paper explores arbitrage in financial markets under uncertainty using Wasserstein distance.

problem Investigating arbitrage in financial markets with distributional uncertainty.
method Using Wasserstein distance, the paper considers weak and strong forms of arbitrage conditions and introduces a relaxation called statistical arbitrage.
result The paper derives dual formulations of robust arbitrage conditions and conducts computational experiments to answer questions about ambiguity and statistical arbitrage.

Proposes a method to learn adaptive ambiguity sets for robust optimization.

problem Misspecification in distributionally robust optimization (DRO).
method Learned predictive ambiguity sets (LPAS) using deep contextual models.
result Significantly improves portfolio optimization performance compared to baselines.

Develops a method to estimate rare-event probabilities under distributional uncertainty.

problem Distributional uncertainty limits the effectiveness of rare-event simulation techniques.
method Wasserstein distributionally robust rare-event simulation (DRIS) framework.
result DRIS achieves vanishing relative error in estimating rare-event probabilities.

We solve robust optimization problems using Wasserstein balls and apply it to mean-CVaR optimization.

problem Distributionally robust optimization with Wasserstein ambiguity sets.
method Transformed robust optimization into non-robust with penalty term, selecting ambiguity set size.
result Impressive results in robust mean-CVaR optimization compared to other strategies.

This paper tackles robust control of noisy systems with uncertain distributions.

problem Optimal control of sampled-data stochastic systems with multiplicative noise and distributional ambiguity.
method Develops a convex relaxation to handle the ``concave-max'' geometry and derives a probabilistic performance guarantee.
result Derives an explicit, non-asymptotic bound on the duality gap and proves robust viability conditions.

Framework for robust control under model uncertainty, improving financial derivatives hedging.

problem Model uncertainty in financial derivatives hedging.
method Dynamic programming principle for solving one-step optimization problems.
result Robust hedging strategy outperforms model-based strategies during adverse scenarios.

ELD compares graphs by their embedded Laplacian eigenvectors, resolving ambiguities.

problem Comparing graphs of different sizes and structures.
method ELD uses symmetrization and perturbation techniques to compare graph embeddings.
result ELD resolves ambiguities in graph comparisons, making it a natural pseudo-metric.

New algorithm solves uncertain Markov decision processes using Wasserstein uncertainty.

problem Solving Markov decision processes with uncertain transition probabilities.
method Distributionally robust QQ-learning algorithm for Wasserstein uncertainty.
result Convergence of the algorithm proved and demonstrated with real data.

DRO-NPE improves neural posterior estimation by reducing overconfidence and overfitting.

problem Overconfident and unreliable posteriors in simulation-based inference with limited simulation budgets.
method Distributionally robust approach using Wasserstein ambiguity set and KL-based metrics.
result Consistently improves coverage and calibration across benchmark tasks.

FDR-SVM improves classification robustness in federated learning with uncertain data.

problem Federated learning with uncertain and private client data.
method Develops FDR-SVM, a robust SVM approach using a mixture of Wasserstein balls ambiguity set.
result Establishes theoretical guarantees and derives algorithms with performance bounds.

Flexible framework integrates machine learning and DRO for uncertain parameter prediction.

problem Limited joint observations of uncertain parameters and covariates.
method Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets.
result Validation of theoretical and practical benefits in limited data scenarios.

Optimal financial strategies minimize risk under uncertain models.

problem Maximizing utility in financial markets with model uncertainty.
method Optimized strategies converge to those with minimal norm as uncertainty increases.
result Optimal strategies with minimal norm emerge as uncertainty grows.

This paper investigates WDRO for nonparametric regression, achieving robustness against distributional uncertainty.

problem Addressing model misspecification in nonparametric regression under distributional uncertainty.
method Wasserstein distributionally robust optimization (WDRO) with structural distinction based on Wasserstein distance order.
result Achieves a convergence rate of n2β/(d+2β)n^{-2β/(d+2β)} up to logarithmic factors, showing minimax optimality.

Proves hardness of semi-discrete optimal transport and proposes regularization methods.

problem Computing Wasserstein distance between discrete and non-discrete probability measures.
method Proves hardness, introduces distributionally robust dual optimal transport, regularizes primal objective, uses stochastic gradient descent.
result Regularization schemes and improved convergence guarantees for semi-discrete optimal transport problems.

New estimator robust to adversarial noise and data heterogeneity.

problem Sensitive to adversarial noise and poor performance with heterogeneous data.
method Distributionally robust estimator minimizing worst-case conditional expected loss over adversarial distributions.
result Efficiently finds non-parametric local estimates via convex optimization.

The paper proves generalization bounds and stopping rules for self-selected data in reciprocal learning.

problem Generalization of learning algorithms using self-selected data.
method Proves universal generalization bounds using covering numbers and Wasserstein ambiguity sets.
result Provides stopping rules for reciprocal learning algorithms to ensure out-of-sample performance.

This paper improves conformal prediction for robust interval estimation under distribution shifts.

problem Robustness of conformal prediction under distribution shifts.
method Modeling distribution shifts using Levy-Prokhorov (LP) ambiguity sets, which capture both local and global perturbations.
result Constructs robust conformal prediction intervals that remain valid under distribution shifts.

Expands robust profit opportunities to include distributional uncertainty.

problem Distributional uncertainty in financial markets.
method Formulates infinite dimensional primal problems, simplifies to finite dimensional dual problems using Wasserstein distance.
result Distributional uncertainty can enhance robustness of profit opportunities.

Improved robustness in multivariate regression and classification with DRO under Wasserstein metric.

problem Outliers in covariates and responses.
method Distributionally Robust Optimization (DRO) with Wasserstein metric ambiguity set and regularization.
result Significant improvement in predictive error and robustness.

This paper presents a distributionally robust Q-Learning algorithm (DrQ) which leverages Wasserstein ambiguity sets to provide idealistic probabilistic out-of-sample safety guarantees during online learning. First, we follow past work by separating the constraint functions from the principal objective to create a hiera…

2020-02-07abs ↗pdf ↗

A new portfolio model considers investor aversion to loss and risk.

problem Constructing a robust portfolio under uncertain asset returns and investor aversion.
method Distributional robust optimization (DRP) with a Wasserstein ball centered on empirical distribution, mixed-integer quadratic programming, and hybrid algorithm.
result Empirical testing shows superior performance in asset allocation compared to common strategies.

Enhances survival analysis predictions with a robust learning approach.

problem Improving robustness and accuracy in survival analysis predictions.
method Integrates Distributionally Robust Learning (DRL) into Cox regression using Wasserstein distance-based ambiguity set.
result Demonstrates superior performance in prediction accuracy and robustness compared to traditional methods.

The paper analyzes insurance contracts under distributional uncertainty using Bregman-Wasserstein divergence.

problem Optimal insurance contracts under distributional ambiguity.
method Utilizes Bregman-Wasserstein ball to characterize ambiguity sets, employs robust optimization.
result Derives optimal indemnity functions in closed form and studies their properties.

Paper tackles robust online learning with worst-case distributions.

problem Distributionally robust online learning with worst-case Wasserstein ambiguity sets.
method Formulated as an online saddle-point stochastic game, proposed a general framework converging to robust Nash equilibrium.
result Proposed a tailored algorithm for piecewise concave loss functions, achieving substantial speedups.

DRIVE improves IV estimation by accounting for distributional uncertainties.

problem Challenges in IV estimation due to untestable model assumptions and poor finite sample properties.
method DRIVE is a distributionally robust IV estimation method that minimizes a square root TSLS objective with a Wasserstein ambiguity set.
result DRIVE achieves consistency without requiring regularization parameter to vanish, ensuring robustness to distributional uncertainties.

EDRBO optimizes Bayesian optimization with continuous contexts using ensemble models and robust methods.

problem Bayesian optimization with unknown and continuous contextual distributions leads to suboptimal results.
method EDRBO uses ensemble surrogate models and Wasserstein ball ambiguity sets to handle uncertainty and maintain computational tractability.
result EDRBO achieves sublinear cumulative regret guarantees of order O(γTT)\mathcal{O}(γ_T \sqrt{T}).

New method improves PCA robustness using Wasserstein distances.

problem Uncertainty in probability distribution affects PCA robustness.
method Distributionally robust optimization with Wasserstein distances.
result Explicit reformulation leads to efficient smoothing algorithm.

KG-WDRO optimizes transfer learning with external knowledge.

problem Over-pessimism in WDRO for small target samples.
method KG-WDRO incorporates multiple sources of external knowledge to construct smaller Wasserstein ambiguity sets.
result KG-WDRO improves transfer learning performance and adaptivity.