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.

169,181 papers · 148 categories

Trend · papers per month

3907801,1701,560 · Jun 202019922001200920182026
48 results for random utility models

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.

The paper shows how utility indifference prices approach superreplication prices in uncertain markets.

problem Modeling investor preferences under non-dominated uncertainty.
method Formulates and proves convergence of utility indifference prices to superreplication prices.
result Utility indifference prices converge to superreplication prices under certain conditions.

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 ↗

A new method for estimating random utility models using rank-breaking and composite marginal likelihood.

problem Estimating random utility models efficiently and accurately.
method Rank-breaking-then-composite-marginal-likelihood (RBCML) framework.
result RBCML achieves better statistical efficiency and computational efficiency than existing methods.

RUMBoost combines RUMs and deep learning for better choice modelling.

problem Creating interpretable and robust discrete choice models.
method Gradient Boosted Regression Trees for utility functions, with constraints for interpretability and monotonicity.
result RUMBoost outperforms ML and RUM benchmarks in predictive performance and interpretability.

The paper confirms a conjecture about optimal expected utility in discrete-time markets approaching a continuous-time model.

problem Analyzing the convergence of optimal expected utility in discrete-time markets to a continuous-time model.
method Examined a sequence of discrete-time economies generated by scaled random walks, and compared their optimal expected utilities to the continuous-time Black-Scholes-Merton model.
result The conjecture holds for utility functions with asymptotic elasticity strictly less than one, but fails for elasticity equal to one.

Introduces RPU to explain randomization preference in dynamic settings.

problem Explains preference for randomization in dynamic investment problems.
method Introduces recursive perturbed utility (RPU) to incorporate randomization preference.
result Proves RPU-optimal portfolio policy is Gaussian and can be expressed in closed form.

A new model uses neural networks for consistent discrete choice analysis.

problem Difficulties in specifying utility functions in RUM models.
method Alternative-Specific and Shared weights Neural Network (ASS-NN) model.
result ASS-NN provides consistent outcomes without specifying utility form.

Algorithm identifies best item from subsets with random utility model feedback.

problem PAC learning the best item from subsets with random utility model feedback.
method Pairwise relative counts and hierarchical elimination for learning algorithm.
result Near-optimal PAC sample complexity guarantee for identifying ε-optimal item.

Modeling driver trajectories using inverse reinforcement learning and random utility.

problem Modeling rational driver behavior in road networks from sparse sensor data.
method Apply random utility theory to model unknown reward function, introduce extended state, and use Markov decision process.
result Maximum entropy inverse reinforcement learning is a special case of the proposed approach.

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.

We study arbitrage opportunities, market viability and utility maximization in market models with an insider. Assuming that an economic agent possesses from the beginning an additional information in the form of a random variable G, which only becomes known to the ordinary agents at date T, we give criteria for the No …

2016-08-06abs ↗pdf ↗

Proposes FairRR to improve fairness in machine learning models through randomized response.

problem Achieving group fairness in machine learning models.
method Formulates group fairness as optimizing a design matrix in Randomized Response, proposing FairRR.
result Demonstrates FairRR yields excellent model utility and fairness.

A novel framework combines deep metric learning and conditional random field for hyperspectral image classification.

problem Improving classification performance in hyperspectral image processing with limited labeled data.
method Combines spectrum-based deep metric learning and conditional random field. Uses center loss for spectrum-based features and Gaussian edge potentials for pixel-wise classification.
result Demonstrates advantages in classification accuracy and computation cost compared to classical methods.

Machine learning models predict depression risk based on various factors.

problem Identifying individuals at greatest risk for depression.
method Random Effects/Expectation Maximization (RE-EM) trees and Mixed Effects Random Forest (MERF) algorithms.
result Machine learning models accurately predict depression severity and identify key predictors.

This work analyzes privacy-utility trade-offs in linear regression with noise and projections.

problem Balancing privacy and utility in machine learning models trained on private data.
method Analyzes two schemes: additive noise and random projections, using differential privacy based on conditional mutual information.
result Projecting data to a lower-dimensional subspace before adding noise yields a better privacy-utility trade-off.

The paper analyzes log-optimal and numéraire portfolios in market models stopped at random times.

problem Analyzing portfolios in market models stopped at random times.
method Progressive enlargement of flow of information with the random stopping time, studying log-optimal and numéraire portfolios.
result Computations of log-optimal and numéraire portfolios described in terms of observable parameters.

Study optimal healthcare spending under Epstein-Zin preferences for longevity.

problem Optimizing healthcare spending to extend longevity under Epstein-Zin preferences.
method Formulated Epstein-Zin utilities over a controllable random horizon using backward stochastic differential equations and HJB equations.
result Calibrated model accurately reflects actual mortality data and compares healthcare efficacy between countries.

We review the utility-based valuation method for pricing derivative securities in incomplete markets. In particular, we review the practical approach to the utility-based pricing by the means of computing the first order expansion of marginal utility-based prices with respect to a small number of random endowments.

2010-03-30abs ↗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.

Paper extends RUMs with features to handle incomplete preferences and proves identifiability.

problem Learning preferences from incomplete and possibly noisy data.
method Generalized Mixture of Random Utility Models with features, proving identifiability and consistency of MLE.
result Proves consistency of Maximum Likelihood Estimation (MLE) for PL with features under certain conditions.

DiPriMe forests use private medians to create balanced tree splits for privacy-protected data.

problem Privacy concerns in training random forests due to multiple data queries.
method Proposes DiPriMe forests, which use a private median to generate balanced splits, ensuring differential privacy.
result DiPriMe forests achieve high utility while maintaining differential privacy, as shown both theoretically and empirically.

Study utility maximization with costs under uncertain models.

problem Maximizing utility in a market with transaction costs and model uncertainty.
method Transformed semi-static utility maximization problem on an enlarged space using randomization techniques and dynamic programming.
result Existence of optimal strategy and convex duality theorem proved.

Tutorials on preference learning with Gaussian Processes.

problem Understanding individual preferences and choices for efficient and personalized applications.
method Presentation of a comprehensive framework for preference learning with Gaussian Processes, incorporating rationality principles.
result Construction of preference learning models that encompass various utility models and scenarios.

This memoir presents a systematic study of the utility maximization problem of an investor in a constrained and unbounded financial market. Building upon the work of Hu et al. (2005) [Ann. Appl. Probab., 15, 1691--1712] in a bounded framework, we extend our analysis to the more challenging unbounded case. Our methodolo…

2017-07-01abs ↗pdf ↗

Algorithm samples fair rankings to ensure individual fairness while maintaining group fairness.

problem Fair ranking tasks with group fairness constraints and uncertainty in item utilities.
method Efficient algorithm that samples rankings from an individually-fair distribution ensuring group fairness.
result Expected utility of output ranking is at least α times optimal fair solution, where α depends on utilities and constraints.

The paper confirms a conjecture about optimal expected utility in markets with insider information.

problem Optimal expected utility in markets with insider information.
method An extension of the Black-Scholes-Merton model with a sequence of discrete-time economies.
result Optimal expected utility converges to the classic model when conditions are met.

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 ↗

The paper optimizes portfolios in a market with hidden drift and random expert opinions.

problem Optimizing portfolios in a market with hidden Gaussian drift and random expert signals.
method Modeling the hidden drift using Kalman filters and solving the utility maximization problem with dynamic programming.
result Derivation of optimal portfolio weights and utility maximization under the given market conditions.