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,695 papers · 148 categories

Trend · papers per month

137275412549 · Jun 202019922001200920172026
48 results for Distributional ambiguity

Improves DRO with Bayesian Ambiguity Sets for model misspecification.

problem Overly conservative decisions due to misspecified models in DRO.
method Introduces DRO-RoBAS with robust posterior predictive distribution.
result Outperforms other Bayesian and empirical DRO approaches in out-of-sample performance.

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under 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.

DRO optimizes decisions under uncertain distributions, considering worst-case scenarios.

problem Optimizing decisions when the distribution of uncertainties is itself uncertain.
method Defines ambiguity sets and seeks decisions optimal under the worst-case distribution.
result DRO models can be connected to regularization techniques and machine learning.

Investment strategy in uncertain markets improved by learning and risk-ambiguity preferences.

problem Investment in financial markets with unknown drift coefficients.
method Optimization under KMM approach, considering risk and ambiguity preferences.
result Optimal investment strategy can be adjusted based on prior drift distribution.

We introduce a measure to quantify ambiguity in deep learning models, improving their reliability.

problem Deep learning models make mistakes on seemingly trivial cases and fail in recognizing what they don't know.
method We define ambiguity based on decision boundaries and convex hulls in feature space, developing a theoretical framework to identify unknowns.
result A single ambiguity measure can detect a significant portion of model mistakes, including adversarial and out-of-distribution inputs.

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.

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 ↗

Study extreme-case Value-at-Risk under IFR distributions, providing guidance for risk management.

problem Understanding extreme-case risk measures under distributional ambiguity and increasing failure rate.
method Characterized extreme-case range Value-at-Risk under mean and variance constraints with increasing failure rate.
result Characterized specific characteristics of extreme-case distributions under IFR constraints.

Study finds cheapest possible payoff under ambiguity, linking to maxmin expected utility.

problem Finding cost-efficient payoffs in uncertain market conditions.
method Developed a new concept of robust cost-efficient payoff and linked it to maxmin expected utility.
result Solutions to maxmin robust expected utility are robust cost-efficient.

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.

Paper proposes online optimization for uncertain systems using machine learning and DRO.

problem Optimization of uncertain dynamical systems with distributional uncertainty.
method Combines machine learning with Distributional Robust Optimization (DRO) to handle uncertainty.
result Online solutions with probabilistic regret bounds for uncertain systems.

Contrastive learning recovers latent distributions for ambiguous inputs, including aleatoric uncertainty.

problem Real-world observations often have inherent ambiguities, making the true posterior probabilistic with heteroscedastic uncertainty.
method Extended InfoNCE objective and encoders to predict latent distributions, proving they recover the correct posteriors, including aleatoric uncertainty.
result Contrastive learning encoders can recover the correct posteriors of data-generating processes, including aleatoric uncertainty, up to a rotation of the latent space.

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.

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.

CADRO optimizes DRO by reducing conservatism through cost-aware ambiguity sets.

problem Optimizing solutions under uncertainty with reduced conservatism.
method CADRO uses a cost-aware ambiguity set to reduce DRO's conservatism.
result CADRO provides high-confidence upper bounds and consistent estimators of out-of-sample expected cost.

This paper provides a non-robust interpretation of the distributionally robust optimization (DRO) problem by relating the distributional uncertainties to the chance probabilities. Our analysis allows a decision-maker to interpret the size of the ambiguity set, which is often lack of business meaning, through the chance…

2019-06-03abs ↗pdf ↗

ST-MAML tackles task ambiguity in meta-learning by encoding tasks with stochastic representations.

problem Handling tasks from multiple distributions is challenging for meta-learning due to task ambiguity.
method ST-MAML uses a stochastic neural network module to encode tasks and propagate task representations to revise input variable encoding.
result ST-MAML matches or outperforms state-of-the-art methods on various tasks.

A firm with heterogeneous shareholders optimizes dividends under ambiguity aggregation.

problem Optimizing dividends for a firm with heterogeneous shareholders under ambiguity aggregation.
method Characterizing equilibrium dividends using a partition of the state space.
result Time-homogeneous equilibrium dividend law characterized by a partition of the state space.

New method calibrates ambiguity sets for robust decision-making under contamination.

problem Minimizing worst-case expected loss over distributional shifts in out-of-sample environments.
method Bulk-calibrated credal ambiguity sets that learn a high-mass bulk set from data and bound tail contributions.
result Closed-form, finite robust objective and tractable optimization for various losses and geometries.

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.

Paper proposes a method to solve log-optimal portfolios under ambiguous return distributions.

problem Maximizing wealth growth with unknown return distributions.
method Supporting hyperplane approximation to reformulate the problem into a linear program.
result The problem can be solved efficiently, even with transaction costs and diversification.

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 ↗

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.

Paper develops online learning-based risk-averse MPC for uncertain systems.

problem Designing robust MPC for systems with unknown but inferable stochastic disturbances.
method Proposes a novel online learning framework using CVaR constraints and Dirichlet process mixture models.
result Demonstrates improved robustness and adaptability of MPC in handling time-varying disturbance distributions.

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.

Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.

problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.

Meta-learning for few-shot learning entails acquiring a prior over previous tasks and experiences, such that new tasks be learned from small amounts of data. However, a critical challenge in few-shot learning is task ambiguity: even when a powerful prior can be meta-learned from a large number of prior tasks, a small d…

2018-06-07abs ↗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 ↗

In most classification tasks there are observations that are ambiguous and therefore difficult to correctly label. Set-valued classifiers output sets of plausible labels rather than a single label, thereby giving a more appropriate and informative treatment to the labeling of ambiguous instances. We introduce a framewo…

2016-09-02abs ↗pdf ↗

The paper proposes a new method to measure risk with fine-grained tail sensitivity.

problem Risk measures that do not account for tail sensitivity are insufficient for machine learning systems.
method The approach involves specifying a reference distribution with desired tail behavior and constructing risk measures compatible with this upper probability.
result Risk measures with fine-grained tail sensitivity can replace the expectation operator in machine learning systems.

This paper solves a financial portfolio selection problem in incomplete markets.

problem Portfolio selection in incomplete financial markets with ambiguity.
method Constructing an efficient frontier, simplifying the problem, introducing a new distorted Legendre transformation, and proving the bipolar relation and distorted duality theorem.
result The existence and uniqueness of optimal strategies are shown for different utility functions under specific conditions.

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.

New method improves robustness of Bayesian experimental design.

problem Bayesian experimental design's sensitivity to prior distribution changes.
method Introduces robust expected information gain (REIG) and uses KL-divergence ambiguity sets.
result REIG stabilizes sampling-based EIG estimation and compensates for prior variability.

We consider settings in which the distribution of a multivariate random variable is partly ambiguous. We assume the ambiguity lies on the level of the dependence structure, and that the marginal distributions are known. Furthermore, a current best guess for the distribution, called reference measure, is available. We w…

2018-11-01abs ↗pdf ↗

In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …

2016-08-22abs ↗pdf ↗

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.

Study insurance pricing under correlation ambiguity without increasing prices or reducing utility.

problem Understanding the dependence structure between insurance and financial risks.
method Dynamic equilibrium analysis of insurance pricing with worst-case beliefs.
result Correlation ambiguity does not necessarily increase insurance prices or reduce insurers' utility.

New formulations capture aversion to ambiguity about volatility.

problem Capturing aversion to ambiguity about unknown and time-varying volatility.
method Introduces novel preference formulations and compares them with existing models.
result Illustrates the impact of ambiguity aversion in static and dynamic models.

Study inert and ambiguous classes in modular group using combinatorial methods.

problem Counting inert and ambiguous conjugacy classes in modular group.
method Purely combinatorial approach using word length in free product representation.
result Exact counting formulas and asymptotic growth rates for inert and ambiguous classes.

We study the dynamic indifference pricing with ambiguity preferences. For this, we introduce the dynamic expected utility with ambiguity via the nonlinear expectation--G-expectation, introduced by Peng (2007). We also study the risk aversion and certainty equivalent for the agents with ambiguity. We obtain the dynamic …

2015-03-30abs ↗pdf ↗