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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for concave utility functions

The paper analyzes portfolio selection with non-concave utility and transaction costs.

problem Non-concave utility maximization with proportional transaction costs.
method Two-step procedure: asymptotic terminal behavior analysis and discontinuous viscosity solution.
result Optimal portfolio strategies can differ significantly from the frictionless case due to transaction costs.

Optimizes investment under uncertain time horizons with non-concave utility.

problem Optimizing investment decisions with non-concave utility and uncertain time horizons.
method Established necessary and sufficient conditions for optimality, suggested recursive procedure for non-concave utility.
result Optimal investment strategies under uncertain time horizons exhibit multimodal distribution, indicating flexibility in switching between local maximizers.

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 ↗

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.

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.

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.

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.

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.

Optimal portfolios are found for a wide range of utility functions under hyperbolic returns.

problem Portfolio optimization under expected utility criterion for large portfolios.
method Analytical expressions for optimal portfolios under hyperbolic return distributions and various utility functions.
result The two-fund separation holds true for a broad class of utility functions.

We analyze a nonlinear equation proposed by F. Black (1968) for the optimal portfolio function in a log-normal model. We cast it in terms of the risk tolerance function and provide, for general utility functions, existence, uniqueness and regularity results, and we also examine various monotonicity, concavity/convexity…

2017-05-21abs ↗pdf ↗

We propose a novel and flexible rank-breaking-then-composite-marginal-likelihood (RBCML) framework for learning random utility models (RUMs), which include the Plackett-Luce model. We characterize conditions for the objective function of RBCML to be strictly log-concave by proving that strict log-concavity is preserved…

2018-06-04abs ↗pdf ↗

We maximize the expected utility of terminal wealth in an incomplete market where there are cone constraints on the investor's portfolio process and the utility function is not assumed to be strictly concave or differentiable. We establish the existence of the optimal solutions to the primal and dual problems and their…

2010-10-19abs ↗pdf ↗

The paper solves an insurance problem using mean-variance and rank-dependent utility theory.

problem Formulating and solving an insurance problem with rank-dependent utility and mean-variance premium principle.
method Formulated as a non-concave maximization problem, then turned into a concave quantile optimization problem, solved using calculus of variations.
result An optimal insurance contract is derived and numerically computed.

New algorithm for reinforcement learning reduces complexity and guarantees convergence.

problem Reinforcement learning problems with convex occupancy measures.
method MD-CURL, inspired by mirror descent, uses non-standard regularization.
result Achieves convergence guarantees and simple closed-form solution.

Optimal portfolios are formed by combining momentum, size, and volatility characteristics, enhancing utility for all investors.

problem Estimation error in forming optimal portfolios from characteristics.
method Maximizing an in-sample loss function that is more concave than the utility function, linking weights to characteristics.
result Optimal portfolios with significantly higher certainty equivalents than benchmarks for all investors.

Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous wealth. A counterintuitive result is proved : for any continuous, co…

2016-11-28abs ↗pdf ↗

Study optimal control strategy for hedge funds managers with PSAHARA utility family.

problem Optimizing risk and reward in incomplete markets with non-monotone risk aversion and convex compensation.
method Introduced PSAHARA utility family to model non-monotone risk aversion and convex compensation. Proved concavification techniques for non-concave utility functions. Derived explicit optimal control strategy.
result PSAHARA utility induces risk-taking behavior even with convex compensation, leading to high returns and volatility.

We consider the terminal wealth utility maximization problem from the point of view of a portfolio manager who is paid by an incentive scheme, which is given as a convex function gg of the terminal wealth. The manager's own utility function UU is assumed to be smooth and strictly concave, however the resulting utilit…

2011-09-13abs ↗pdf ↗

Study shows equivalence of four risk constraints in non-concave optimization problems.

problem Investigating risk constraints in non-concave optimization for financial companies.
method Analytical solutions for four risk constraints (ES, EDS, VaR, AVaR) under non-concave optimization.
result All four risk constraints lead to the same optimal solution, differing from concave optimization.

Investor optimizes investment strategy under model uncertainty and random utility.

problem Optimizing investment under model ambiguity and random utility.
method Proves existence of optimal strategy using primal methods, with assumptions on market and utility function.
result Existence of optimal investment strategy proven.

Investigates portfolio selection with transaction costs and stochastic volatility, using deep learning for computation.

problem Optimal portfolio selection with transaction costs and stochastic volatility.
method Two-factor stochastic volatility model, option-implied utility function, deep learning policy iteration.
result Deep learning method effectively computes optimal investment decisions under transaction costs and stochastic volatility.

Support selection and eventwise decoupling for simultaneous bets proven.

problem Optimizing expected utility for simultaneous independent events with multiple outcomes.
method Proved a support theorem for a broad class of strictly increasing strictly concave utilities, identifying the exact active support and proving independence from utility function.
result The exact active support is the eventwise union of single-event supports, independent of the utility function.

It was recently proved that embedded solutions of Euclidean hypersurface flows with speeds given by concave (convex), degree one homogeneous functions of the Weingarten map are interior (exterior) non-collapsing. These results were subsequently extended to hypersurface flows in the sphere and hyperbolic space. In the f…

2013-10-02abs ↗pdf ↗

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.

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 ↗

Develops deep learning methods for solving S-shaped utility maximisation problems.

problem Optimizing portfolios with S-shaped utility and random benchmarks.
method Uses deep learning and duality methods to solve the Hamilton-Jacobi-Bellman equation and adjoint equation.
result Demonstrates the accuracy of deep learning methods for non-concave utility maximisation problems.

Random utility theory models an agent's preferences on alternatives by drawing a real-valued score on each alternative (typically independently) from a parameterized distribution, and then ranking the alternatives according to scores. A special case that has received significant attention is the Plackett-Luce model, fo…

2012-11-11abs ↗pdf ↗

Assuming that agents' preferences satisfy first-order stochastic dominance, we show how the Expected Utility paradigm can rationalize all optimal investment choices: the optimal investment strategy in any behavioral law-invariant (state-independent) setting corresponds to the optimum for an expected utility maximizer w…

2013-02-19abs ↗pdf ↗

The choice of admissible trading strategies in mathematical modelling of financial markets is a delicate issue, going back to Harrison and Kreps (1979). In the context of optimal portfolio selection with expected utility preferences this question has been a focus of considerable attention over the last twenty years. We…

2009-10-20abs ↗pdf ↗

We treat utility maximization from terminal wealth for an agent with utility function U:RRU:\mathbb{R}\to\mathbb{R} who dynamically invests in a continuous-time financial market and receives a possibly unbounded random endowment. We prove the existence of an optimal investment without introducing the associated dual prob…

2017-02-03abs ↗pdf ↗

This work overcomes bias in concave multi-objective reinforcement learning.

problem Gradient bias in policy gradient methods for concave scalarized multi-objective reinforcement learning.
method Developed a Natural Policy Gradient (NPG) algorithm with a multi-level Monte Carlo (MLMC) estimator.
result Achieved optimal O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}) sample complexity for computing an εε-optimal policy.