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

4489133177 · Jun 202019922001200920172026
48 results for α-maxmin utility

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.

Copula models have become popular in different applications, including modeling shocks, in view of their ability to describe better the dependence concepts in stochastic systems. The class of maxmin copulas was recently introduced by Omladič and Ružić. It extends the well known classes of Marshall-Olkin and Marshall co…

2018-08-23abs ↗pdf ↗

In this paper we introduce some new copulas emerging from shock models. It was shown earlier that reflected maxmin copulas (RMM for short) are not just some specific singular copulas; they contain many important absolutely continuous copulas including the negative quadrant dependent part of the Eyraud-Farlie-Gumbel-Mor…

2018-08-23abs ↗pdf ↗

SharedRep-RLHF learns shared traits for diverse groups, improving fairness and performance.

problem Uniform-reward RLHF fails to capture diverse preferences, leading to unfairness.
method SharedRep-RLHF learns shared traits among various groups, improving fairness and performance.
result SharedRep-RLHF outperforms MaxMin-RLHF by up to 20% in win rate.

A new landmark sampling method improves TDA performance on biomedical data.

problem Improving landmark samplers for pseudometric spaces with varying density and multiplicities.
method Proposes 'lastfirst' procedure based on ranked distances, proving landmarks have desired properties.
result lastfirst outperforms maxmin on homology detection tasks and comparable on prediction tasks.

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.

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.

We introduce a representation theory for risk operations on locally compact groups in a partition of unity on a topological manifold for Markowitz-Tversky-Kahneman (MTK) reference points. We identify (1) risk torsion induced by the flip rate for risk averse and risk seeking behaviour, and (2) a structure constant or co…

2012-06-12abs ↗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.

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 solve S-shaped utility portfolio selection with SD constraints using algorithms and neural networks.

problem Optimizing portfolios with S-shaped utility functions under SD constraints.
method First-order SD constraint solution, numerical algorithm for SSD, neural network approach.
result Effective numerical and neural network solutions for SSD constrained problems.

Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters…

2018-08-01abs ↗pdf ↗

When choosing the right copula for our data a key point is to distinguish the family that describes it at the best. In this respect, a better choice of the copulas could be obtained through the information about the (non)symmetry of the data. Exchangeability as a probability concept (first next to independence) has bee…

2018-08-29abs ↗pdf ↗

EMIX minimizes surprise in multi-agent reinforcement learning.

problem Surprise and approximation bias in multi-agent reinforcement learning.
method Energy-based MIXer (EMIX) for minimizing surprise across multiple agents.
result EMIX demonstrates consistent stable performance in challenging StarCraft II scenarios.

Efficient local Lipschitz bounds improve neural network robustness.

problem Certifying robustness of neural networks is challenging and often leads to over-regularization.
method Proposes an efficient trainable local Lipschitz upper bound by considering activation functions and weight matrices.
result Consistently outperforms state-of-the-art methods in clean and certified accuracy on various datasets.

A novel Q-learning variant reduces underestimation bias in deep actor-critic methods for reinforcement learning.

problem Underestimation bias in deep actor-critic methods for reinforcement learning.
method Introduces a parameter-free Q-learning variant that combines maximum and minimum operators to bound value estimates.
result Improves state-of-the-art performance on OpenAI Gym tasks.

FraPPE efficiently identifies Pareto optimal arms in multi-objective bandits.

problem Efficiently identifying Pareto optimal arms in multi-objective bandits with confidence.
method Deriving structural properties and using Frank-Wolfe optimisation to solve the maxmin optimisation problem.
result FraPPE achieves optimal sample complexity and identifies the exact Pareto set.

New method for fair resource allocation in AI-aware networks with unknown utility functions.

problem Fair resource allocation in AI-aware communication networks with unknown utility functions.
method Distributed, data-driven bilevel optimization approach to learn surrogate utility functions.
result The proposed algorithm learns from data to autotune surrogate utility functions for unknown utility functions.

Optimizes portfolios with utility theory, diversification, and leverage.

problem Finding optimal portfolio allocation strategies.
method Utility theory, exponential and logarithmic utilities, compound probability distributions, maximum expected utility, generalized mean-variance.
result Enhanced portfolio allocation strategies with natural explanations.

New algorithm tackles unknown utility network resource allocation.

problem Maximizing network utility with unknown agent utilities.
method Modeling as a bandit problem, proposing algorithms for resource allocation.
result Proposed algorithms are optimal when all agents have the same utility.

The maximum entropy principle can be used to assign utility values when only partial information is available about the decision maker's preferences. In order to obtain such utility values it is necessary to establish an analogy between probability and utility through the notion of a utility density function. According…

2007-09-05abs ↗pdf ↗

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.

Novel framework for portfolio selection considering utility and risk.

problem Maximizing utility subject to risk constraints with various utility and risk functionals.
method General framework accommodating non-concave utilities and non-convex risk measures. Characterization of well-posedness using a simple either-or criterion.
result Minimal condition for well-posedness: either utility or risk must be sensitive to large losses.

Closed-form optimal portfolios for exponential utility in small/large markets.

problem Optimal portfolios maximizing exponential utility in small/large financial markets.
method Closed-form expressions for optimal portfolios in small markets, convergence to large market optimal utility, numerical procedure for general utility functions.
result Optimal utility in large markets converges to optimal utility in small markets, requiring infinite diversification.

The purpose of this paper relies on the study of long term yield curves modeling. Inspired by the economic litterature, it provides a financial interpretation of the Ramsey rule that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adju…

2014-04-07abs ↗pdf ↗

The paper examines utility maximization in markets with hidden Gaussian drift, finding restrictions on model parameters.

problem Utility maximization problems in markets with hidden Gaussian drift mean-reverting processes.
method Derives sufficient conditions for bounded maximum expected utility of terminal wealth for models with full and partial information.
result Restrictions on model parameters for bounded maximum expected utility.

We consider market players with tail-risk-seeking behaviour as exemplified by the S-shaped utility introduced by Kahneman and Tversky. We argue that risk measures such as value at risk (VaR) and expected shortfall (ES) are ineffective in constraining such players. We show that, in many standard market models, product d…

2017-11-01abs ↗pdf ↗

Study on robust utility maximization with nonconcave utility functions under projective determinacy.

problem Investor's optimal investment strategy under model ambiguity and nonconcave utility.
method Projective functions of the path and sets of priors, upper-semicontinuous utility.
result Existence of optimal investment strategy under PD.

Investigates conditions for risk or utility functionals to be sensitive to large losses.

problem Conditions for risk or utility functionals to be sensitive to large losses.
method Analyzes sensitivity to large losses for various risk and utility functionals.
result Value at Risk and Expected Shortfall generally fail to be sensitive to large losses, but expected utility functionals and certain adjusted versions are sensitive.

The study bounds the utility of empirically optimal portfolios using stock return data.

problem Maximizing expected ratio of portfolio utility to best asset utility.
method High probability utility bounds derived from Lipschitz or Hölder continuous utility functions.
result Utility bounds depend on utility function, number of assets, and observations.

The paper solves a utility-based hedging problem with quadratic costs.

problem Optimal trading strategy for hedging European contingent claims with quadratic transaction costs.
method Duality theory applied to exponential utility maximization problem.
result Explicit computation of optimal trading strategy for quadratic payoffs.

This paper considers exponential utility indifference pricing for a multidimensional non-traded assets model, and provides two linear approximations for the utility indifference price. The key tool is a probabilistic representation for the utility indifference price by the solution of a functional differential equation…

2014-03-30abs ↗pdf ↗

Introduces new performance measures using scaled utility functions.

problem Performance measurement in financial contexts.
method Certainty equivalents defined via scaled utility functions, well-posed portfolio optimization problem under generic conditions.
result Link between portfolio dynamics, benchmark process, and utility function choice in the long-run setting.