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

Trend · papers per month

10203040 · Jun 202019922001200920172026
48 results for ambiguity-averse preferences

Characterizes preferences for decision-making under uncertainty using a leader-follower game model.

problem Decision-making under uncertainty and ambiguity aversion.
method Characterizes niveloidal preferences through a leader-follower game model, satisfying specific axioms.
result The leader's strategy space can serve as an ambiguity aversion index.

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.

The paper analyzes investment and consumption strategies under uncertain market conditions.

problem Investment and consumption under drift and volatility uncertainties.
method Randomization approach to construct robust preferences and strategies.
result Developed optimal and robust investment and consumption strategies remain valid in the physical market.

Paper shows equivalence between two dividend preference models.

problem Understanding investor and firm preferences for dividends.
method Formulated Epstein-Zin preference, proved equivalence with Maenhout's model.
result Robust dividend policy is equivalent to a threshold strategy based on surplus process.

Proposes a bond portfolio solution for managing interest rate risk.

problem Managing long-term assets and liabilities under interest rate risk.
method Proposes a bond portfolio solution based on ambiguity-averse preferences, accommodating various constraints and interest rate perturbations.
result Optimal portfolio can be computed as a simple generalized least squares problem, enhancing out-of-sample performance.

Study optimizes insurance and investment strategies for risk-averse insurers under ambiguity.

problem Optimizing insurance and investment strategies for risk-averse insurers under ambiguity.
method Solves a coupled FBSDE to derive optimal strategies and value function.
result Optimal consumption, investment, and reinsurance strategies influenced by risk aversion and EIS.

Bayesian nonparametrics improves data-driven risk optimization under distributional uncertainty.

problem Improving out-of-sample performance in machine learning models due to distributional uncertainty.
method Combining Bayesian nonparametric theory and decision-theoretic preferences to propose a robust optimization criterion.
result The proposed robust optimization procedure provides favorable statistical guarantees and tractable approximations.

Unified framework for DRO and DTA using Bayesian nonparametrics.

problem Combining DRO and DTA under ambiguity.
method Unified framework using DP and HDPs, with outlier robustness.
result Favorable performance in prediction accuracy and stability.

Investor optimizes investment and consumption under uncertain market conditions with constraints.

problem Investor optimizes investment and consumption in a stochastic environment with model uncertainty and constraints.
method Robust control problem solved using stochastic Hamilton-Jacobi-Bellman-Isaacs equations, backward stochastic differential equations, and bounded mean oscillation martingale theory.
result Investor incurs utility loss when ignoring model uncertainty, and constraints impact optimal strategy and value function.

We propose to interpret distribution model risk as sensitivity of expected loss to changes in the risk factor distribution, and to measure the distribution model risk of a portfolio by the maximum expected loss over a set of plausible distributions defined in terms of some divergence from an estimated distribution. The…

2013-01-21abs ↗pdf ↗

We consider the problem of optimal risk sharing in a pool of cooperative agents. We analyze the asymptotic behavior of the certainty equivalents and risk premia associated with the Pareto optimal risk sharing contract as the pool expands. We first study this problem under expected utility preferences with an objectivel…

2016-01-26abs ↗pdf ↗

New theory extends rank-dependent utility for risk and ambiguity.

problem Modeling decision-making under risk and ambiguity.
method Axiomatizes a new preference relation with ambiguity index, probability weighting, and utility function.
result Extends rank-dependent utility to risk and ambiguity, reducing to existing models under specific conditions.

The paper solves TIC LQ control problems using stochastic differential games.

problem Time-inconsistent linear-quadratic stochastic control problems.
method Stochastic differential games, spike variation approach.
result Achieves Nash equilibrium for TIC problems, demonstrating impact of ambiguity aversion.

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.

Study optimal timing to divest from assets with uncertain future scenarios.

problem Optimal timing to divest from assets with uncertain future scenarios.
method Smooth model of decision making under ambiguity aversion, optimal stopping problem with learning.
result Proves a minimax result reducing the problem to standard optimal stopping problems with learning.

We study an optimal liquidation problem under the ambiguity with respect to price impact parameters. Our main results show that the value function and the optimal trading strategy can be characterized by the solution to a semi-linear PDE with superlinear gradient, monotone generator and singular terminal value. We also…

2019-09-02abs ↗pdf ↗

Pari-mutuel markets are trading platforms through which the common market maker simultaneously clears multiple contingent claims markets. This market has several distinctive properties that began attracting the attention of the financial industry in the 2000s. For example, the platform aggregates liquidity from the ind…

2015-09-23abs ↗pdf ↗

The paper optimizes insurer's decisions on dividends, reinsurance, and capital injection under model uncertainty.

problem Maximizing insurer's expected discounted dividends while managing model uncertainty and risk.
method Modeling reserve levels as diffusion processes, solving for optimal strategies in closed form.
result Optimal strategies include barrier dividend and capital injection policies.

This paper analyzes a game between insurer and reinsurer under ambiguity and risk aversion, optimizing reinsurance and investment strategies.

problem Optimizing reinsurance and investment strategies in a game between insurer and reinsurer under ambiguity and risk aversion.
method Stackelberg game, α\alpha-maxmin mean-variance criterion, Heston's stochastic volatility, Hamilton-Jacobi-Bellman equations, Riccati differential equations.
result Excess-of-loss reinsurance is optimal for the insurer, and the equilibrium strategies are determined by specific equations.

We derive a closed form portfolio optimization rule for an investor who is diffident about mean return and volatility estimates, and has a CRRA utility. The novelty is that confidence is here represented using ellipsoidal uncertainty sets for the drift, given a volatility realization. This specification affords a simpl…

2015-02-10abs ↗pdf ↗

This paper concerns the recursive utility maximization problem. We assume that the coefficients of the wealth equation and the recursive utility are concave. Then some interesting and important cases with nonlinear and nonsmooth coefficients satisfy our assumption. After given an equivalent backward formulation of our …

2016-07-04abs ↗pdf ↗

In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift ambiguity for one-dimensional diffusion processes. Analogously to the case of ordinary o…

2011-10-18abs ↗pdf ↗

New method adapts to user preferences dynamically, improving recommendation models.

problem Current recommendation models lack dynamic adaptation to changing user preferences.
method Preference Discerning with LLM-Enhanced Generative Retrieval
result Mender achieves state-of-the-art performance in adapting to evolving user preferences.

Many real-world engineering problems rely on human preferences to guide their design and optimization. We present PrefOpt, an open source package to simplify sequential optimization tasks that incorporate human preference feedback. Our approach extends an existing latent variable model for binary preferences to allow f…

2018-01-09abs ↗pdf ↗

Bayesian optimization learns DM preferences for multi-outcome experiments.

problem Optimizing expensive experiments with unknown utility functions and multiple outcomes.
method Alternates preference learning and Bayesian optimization, using pairwise comparisons.
result Preference exploration strategies improve Bayesian optimization performance.

New study shows personalized content recommendations can lead to polarization of user preferences.

problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.

Bayesian optimization agent learns user preferences from pairwise comparisons.

problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.

New RLHF framework handles general preference oracles without reward functions.

problem Handling general preference oracles without assuming a reward function.
method Developed a minimax game between two LLMs for RLHF under a general preference oracle, focusing on KL-regularized preference.
result Proposed algorithms for efficient offline and online RLHF learning.

In preference-based reinforcement learning (RL), an agent interacts with the environment while receiving preferences instead of absolute feedback. While there is increasing research activity in preference-based RL, the design of formal frameworks that admit tractable theoretical analysis remains an open challenge. Buil…

2019-08-04abs ↗pdf ↗

Study on identifying most preferred policy in bandits with vector-valued rewards.

problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.

Stable and consistent model alignment for language models without assuming human preference models.

problem Lack of statistical consistency in existing alignment methods.
method Relative density ratio optimization between preferred and mixture of preferred and non-preferred data distributions.
result Our approach achieves statistical consistency and stability, providing tighter convergence guarantees.

Dropping a tiny fraction of preferences can significantly alter the rankings of top LLMs.

problem Robustness of LLM ranking systems to small changes in preference data.
method A computational method based on the Bradley-Terry model to evaluate robustness.
result Top LLM rankings can be highly sensitive to the removal of a small fraction of preferences.

Paper explores limits and possibilities of aligning LLMs with human preferences.

problem Aligning LLMs with diverse human preferences to ensure fairness and informed outcomes.
method Analysis of probabilistic representation of human preferences and preservation of diverse preferences.
result LLMs can't fully align with human preferences using reward-based approaches due to Condorcet cycles, but mixed strategies are statistically possible.