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

316192122 · Jun 202019922001200920172026
48 results for nonlinear preferences

The paper solves portfolio selection for complex preferences in continuous time.

problem Dynamic portfolio selection for nonlinear preferences with time inconsistency.
method Stochastic maximum principle and verification theorems for equilibrium strategies.
result Equilibrium strategies derived in closed form for CRRA and CARA preferences.

The paper defines and characterizes conditional nonlinear expectations.

problem Defining and characterizing conditional nonlinear expectations.
method Embedding in decision theory, using state-dependent preferences, and continuous utility representation.
result Consistent backward conditional projections are characterized by the Sure-Thing Principle.

Paper solves a complex portfolio selection problem with time-inconsistent preferences.

problem Time-inconsistent preferences in portfolio selection.
method Unified framework with minimal assumptions, proving existence and uniqueness of solution.
result Existence and uniqueness of square-integrable solution for the integral equation.

We study the dynamic indifference pricing with ambiguity preferences. For this, we introduce the dynamic expected utility with ambiguity via the nonlinear expectation--G-expectation, introduced by Peng (2007). We also study the risk aversion and certainty equivalent for the agents with ambiguity. We obtain the dynamic …

2015-03-30abs ↗pdf ↗

Investor optimizes portfolio under dynamic risk preferences.

problem Optimizing investment under uncertain future risk attitudes.
method Developed a general equilibrium framework and solved for subgame-perfect equilibrium policies.
result Equilibrium policies include a novel hedging component to counteract anticipated risk aversion changes.

Novel representer theorem for metric and preference learning in RKHSs.

problem Metric and preference learning problems in Hilbert spaces.
method Regularization with respect to task structure norm, RKHS representation, and novel algorithm.
result Significant performance improvement over baseline methods in real-world rank inference benchmarks.

The paper explores how investors make decisions under disappointment aversion, finding that they prefer not to invest.

problem Continuous-time portfolio selection under generalized disappointment aversion.
method Sufficient and necessary condition for equilibrium strategies via fully nonlinear integral equation.
result Equilibrium strategy under disappointment aversion leads to less investment in the stock market compared to classical utility theory.

MAXMINLCB optimizes unknown target functions with preference feedback using a Stackelberg game approach.

problem Optimizing unknown target functions with pairwise comparisons and human feedback.
method MAXMINLCB, a zero-sum Stackelberg game, balances exploration and exploitation.
result MAXMINLCB consistently outperforms existing algorithms with a rate-optimal regret guarantee.

The data scarcity of user preferences and the cold-start problem often appear in real-world applications and limit the recommendation accuracy of collaborative filtering strategies. Leveraging the selections of social friends and foes can efficiently face both problems. In this study, we propose a strategy that perform…

2019-05-31abs ↗pdf ↗

Stochastic discount factor (SDF) processes in dynamic economies admit a permanent-transitory decomposition in which the permanent component characterizes pricing over long investment horizons. This paper introduces an empirical framework to analyze the permanent-transitory decomposition of SDF processes. Specifically, …

2014-12-15abs ↗pdf ↗

New MAB model incentivizes user arm-pulling with self-reinforcing preferences.

problem Balancing exploration and exploitation in recommender systems with incentivized user preferences.
method Proposes a new MAB model with random arm selection and two policies: At-Least-nn Explore-Then-Commit and UCB-List.
result Achieves O(logT)O(log T) expected regret and O(logT)O(log T) expected payment over a time horizon TT.

We analyze and calculate the early exercise boundary for a class of stationary generalized Black-Scholes equations in which the volatility function depends on the second derivative of the option price itself. A motivation for studying the nonlinear Black Scholes equation with a nonlinear volatility arises from option p…

2017-07-02abs ↗pdf ↗

Machine Learning improves macroeconomic forecasting by capturing nonlinearities.

problem Improving macroeconomic forecasting accuracy.
method Study four features (nonlinearities, regularization, cross-validation, loss function) in data-rich and data-poor environments.
result Nonlinearity is the key to improving forecasting accuracy.

Study Epstein-Zin preferences in mean field portfolio games, proving unique equilibria.

problem Analyzing portfolio games with Epstein-Zin preferences under non-Markovian conditions.
method Proves a one-to-one correspondence between Nash equilibria and BSDE solutions, using local stochastic maximum principle tailored to Epstein-Zin utility.
result Establishes uniqueness of equilibria in mean field portfolio games under Epstein-Zin preferences.

Matrix factorization is a key component of collaborative filtering-based recommendation systems because it allows us to complete sparse user-by-item ratings matrices under a low-rank assumption that encodes the belief that similar users give similar ratings and that similar items garner similar ratings. This paradigm h…

2016-04-21abs ↗pdf ↗

This paper analyzes optimal consumption strategies for loss-averse investors with multiplicative habit formation.

problem Optimal consumption strategies for loss-averse investors with multiplicative habit formation.
method The study uses a concave envelope of the S-shaped utility function and a nonlinear free boundary problem to analyze the HJB equation.
result The paper provides optimal consumption and investment policies in feedback form.

We study risk-sharing economies where heterogenous agents trade subject to quadratic transaction costs. The corresponding equilibrium asset prices and trading strategies are characterised by a system of nonlinear, fully-coupled forward-backward stochastic differential equations. We show that a unique solution generally…

2019-01-30abs ↗pdf ↗

We study existence and uniqueness of continuous-time stochastic Radner equilibria in an incomplete market model among a group of agents whose preference is characterized by cash invariant time-consistent monetary utilities. An assumption of "smallness" type is shown to be sufficient for existence and uniqueness. In par…

2015-05-27abs ↗pdf ↗

We reveal a model rank that predicts successful recovery of target functions at overparameterization.

problem Understanding the mysterious good generalization performance of overparameterized nonlinear models.
method Rank stratification and linear stability theory for general nonlinear models.
result Linearly stable functions are preferred by nonlinear training, and model rank predicts minimal training data size.

New model improves recommendation systems by analyzing user-item interactions.

problem Improving recommendation systems for better user-item interactions.
method Sliced Anti-symmetric Decomposition (SAD) model using tensor decomposition.
result SAD produces the most consistent personalized preferences compared to SOTA models.

Paper proves existence and uniqueness of solutions to nonlocal systems, generalizing stochastic game theory.

problem Time inconsistency in stochastic differential games.
method Proves existence and uniqueness of solutions to nonlocal fully-nonlinear parabolic systems.
result Generalizes stochastic game theory to include time-inconsistent preferences.

The study compares Euclidean and cosine distances in medical drug prescription prediction.

problem Comparing Euclidean and cosine distances in medical drug prescription prediction.
method Established geometric properties and compared distances in real-world medical data.
result Different distances lead to different optimizing nonlinear kernel embedding frameworks.

New convergence bounds for online learning with heavy-tailed noise.

problem Learning on streaming data with heavy-tailed noise.
method Nonlinear stochastic gradient descent (SGD) for non-convex and strongly convex costs.
result Strong convergence rates for various nonlinearities and noise distributions.

Study on self-consuming generative models with diverse human curation, focusing on convergence and stability.

problem Analyzing self-consuming generative models with heterogeneous human curation.
method Investigates the asymptotic behavior of retraining dynamics using nonlinear Perron--Frobenius theory and Banach contraction mapping.
result Improves convergence results and provides stability and non-stability analyses for the model.

Investors adjust spending based on a social norm, spending less during losses and more during gains.

problem Managing spending and portfolio decisions while adhering to a social norm.
method Formulated a preference ordering with two CRRA preference orderings, solved analytically and numerically.
result Annual spending should be lower than expected financial return and procyclical, with spending cuts following losses.

New decision-theoretic characterization separates belief and decision posteriors.

problem Understanding the conditions under which loss-based updating coincides with Bayesian updating.
method Decision-theoretic approach to distinguish belief and decision posteriors.
result Generalized Bayes coincides with ordinary Bayesian updating only if the loss is proportional to negative log-likelihood.

Two single-timescale algorithms improve TD learning with nonlinear approximations.

problem Optimizing TD learning with nonlinear smooth function approximation.
method Proposes two single-timescale single-loop algorithms with momentum and variance reduction.
result Achieves O(ε4)O(\varepsilon^{-4}) sample complexity for the first algorithm and O(ε3)O(\varepsilon^{-3}) for the second.

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.

Matching Markets meet Cumulative Prospect Theory: Towards Optimal and Adversarially Robust Learning

problem Multi-agent multi-armed bandit problem in competitive setup with two-sided matching markets under human-centric decision making model
method Using cumulative prospect theory (CPT) to emulate human preferences
result Improved regret guarantees in adversarial markets with CPT as risk-sensitive measure

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 ↗