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

Trend · papers per month

106212317423 · Jun 202019922001200920182026
48 results for random utility

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.

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.

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.

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 ↗

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.

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.

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 ↗

New method proves utility maximization without dual problem, simplifying existing results.

problem Maximizing utility from terminal wealth in a continuous-time financial market.
method Utilizes recent Orlicz space theory to prove existence of optimal investment without dual problem.
result Existence of optimal investment strategy for non-smooth utilities and strict concavity.

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.

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.

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.

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.

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.

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 ↗

Study shows inefficiency in economic model leads to higher consumption but lower utility.

problem Effects of information inefficiency on economic activity and consumer welfare.
method Employed two approaches to analyze statistical vs classical economic equilibria.
result Inefficiency increases consumption set but decreases expected utility, contrary to rational consumer behavior.

Optimizes trading in a market with a change point, considering risk and information constraints.

problem Maximizing utility in a financial market with a change point in parameters.
method Solves an optimization problem using martingale representation results for different filtrations.
result Calculates the utility indifference value for a specific utility function and risk measure.

Solves consumption-investment problem with random horizon under Epstein-Zin preferences.

problem Maximizing consumption and investment under random time horizons with Epstein-Zin utility.
method Backward stochastic differential equations with superlinear growth on unbounded random horizons.
result Optimal strategies differ significantly when moving from fixed to random time horizons.

Improved privacy and utility in machine learning with adaptive differential privacy.

problem Enhancing privacy in machine learning models while maintaining utility.
method Adaptive differentially private (ADP) learning method that optimally adapts noise to stepsize.
result ADP method significantly improves utility compared to standard differentially private methods.

DP-RandP improves privacy-utility tradeoff in DP-SGD by learning priors from random processes.

problem Improving the performance of differentially private stochastic gradient descent (DP-SGD) on private data.
method A three-phase approach that learns priors from images generated by random processes and transfers these priors to private data.
result New state-of-the-art accuracy on CIFAR10, CIFAR100, MedMNIST, and ImageNet for various privacy budgets.

The paper characterizes optimal solutions for utility optimization with stochastic elements.

problem Optimal portfolio optimization under uncertainty.
method Characterization of fully coupled FBSDEs in terms of BSDEs.
result Explicit examples and methods to quantify incompleteness and find optimal solutions.

Stability of the utility maximization problem with random endowment and indifference prices is studied for a sequence of financial markets in an incomplete Brownian setting. Our novelty lies in the nonequivalence of markets, in which the volatility of asset prices (as well as the drift) varies. Degeneracies arise from …

2014-10-03abs ↗pdf ↗

Study utility maximization in financial markets with bounded and unbounded payoffs.

problem Utility maximization in financial markets with constraints and unbounded payoffs.
method Combines quadratic backward stochastic differential equations and convex duality.
result Established utility indifference valuation, regime switching, and consumption-investment problems in unbounded markets.

Differentially private random block coordinate descent improves utility in machine learning.

problem Lack of privacy in classical CD methods when handling sensitive information.
method Proposes a differentially private random block coordinate descent method using sketch matrices and importance sampling.
result Demonstrates improved convergence rates and utility guarantees compared to non-private methods.

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.

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.

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.

Optimal reinsurance contracts for multiple dependent risks are derived without specific dependency assumptions.

problem Finding optimal reinsurance contracts for multiple dependent risks without assuming their dependency structure.
method Assumes maximal expected utility criterion and independent negotiation of reinsurance for each risk. Derives optimality conditions and shows that under mild assumptions, optimal contracts are classical (non-randomized) type.
result Optimal reinsurance contracts exist and can be classical (non-randomized) type under mild assumptions.

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.

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.