Stochastic models analyze traffic network performance.
problem Evaluate traffic system performance.
method Stochastic cell transmission models, preference functionals, Gaussian process regression.
result Illustrated in two case studies.
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
48 results for “stochastic preferences”
Optimal insurance and investment strategy under exponential preferences in a correlated market model.
problem Optimal investment and reinsurance strategy for an insurance company under exponential preferences.
method Stochastic control techniques to construct a forward dynamic exponential utility and characterize the optimal strategy.
result Characterization of the optimal investment and reinsurance strategy in a correlated market model.
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 Impact of Local Geometry and Batch Size on Stochastic Gradient Descent for Nonconvex Problemsmath.OC
In several experimental reports on nonconvex optimization problems in machine learning, stochastic gradient descent (SGD) was observed to prefer minimizers with flat basins in comparison to more deterministic methods, yet there is very little rigorous understanding of this phenomenon. In fact, the lack of such work has…
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.
Bal-PM reduces preference labeling costs for LLMs.
problem Efficiently acquiring human feedback for preference modeling in large language models.
method Bayesian Active Learning with entropy maximization in feature space.
result Bal-PM reduces the number of required preference labels by 33% to 68%.
This paper develops, in a Brownian information setting, an approach for analyzing the preference for information, a question that motivates the stochastic differential utility (SDU) due to Duffie and Epstein [Econometrica 60 (1992) 353-394]. For a class of backward stochastic differential equations (BSDEs) including th…
In this paper, we investigate the impact of diverse user preference on learning under the stochastic multi-armed bandit (MAB) framework. We aim to show that when the user preferences are sufficiently diverse and each arm can be optimal for certain users, the O(log T) regret incurred by exploring the sub-optimal arms un…
New algorithm optimizes dueling bandits for both stochastic and adversarial preferences.
problem Optimizing decision-making in environments where only relative preferences are observed.
method Proposed a reduction from dueling bandits to multi-armed bandits, achieving optimal regret bounds.
result First best-of-both-world result for dueling bandits, optimal regret bound for Condorcet-winner benchmark.
This paper revisits optimal investment strategies for defined contribution pension schemes using forward preferences.
problem Optimal investment strategies derived from backward models are not time-consistent and sub-optimal in real scenarios.
method Introduces forward preferences and solves optimal investment strategies for defined contribution pension schemes.
result Constructs optimal investment strategies for defined contribution pension schemes using forward preferences.
Continuous-Time Portfolio Choice Under Monotone Mean-Variance Preferences-Stochastic Factor Caseq-fin.PM
We consider an incomplete market with a nontradable stochastic factor and a continuous time investment problem with an optimality criterion based on monotone mean-variance preferences. We formulate it as a stochastic differential game problem and use Hamilton-Jacobi-Bellman-Isaacs equations to find an optimal investmen…
AOT aligns LLMs on distributional preferences via optimal transport.
problem Current LLM alignment techniques lack distributional level alignment.
method Alignment via Optimal Transport (AOT) aligns LLMs on unpaired preference data.
result AOT enables alignment by penalizing reward distribution violations.
Portfolio Analysis Based on Markowitz Stochastic Dominance Criteria: A Behavioral Perspectiveq-fin.PM
The paper analyzes how behavioral investors make portfolio decisions using Markowitz Stochastic Dominance criteria.
problem Understanding how behavioral investors make portfolio decisions.
method Developed stochastic optimization problems and MILP models to capture subjective decision weights and probability weighting functions.
result The developed models can be used to formulate computationally tractable portfolio analysis problems.
Introduces SMMV preferences to avoid inconsistency in portfolio selection.
problem Monotone mean-variance preferences fail to differentiate strictly dominant payoffs.
method Introduces strictly monotone mean-variance preferences and applies them to portfolio selection problems.
result SMMV preferences provide a more rational basis for assessing prospects and coincide with MV preferences under certain conditions.
Enhances robo-advisors with client investment preference inference.
problem Accurately inferring clients' investment preferences from past activities.
method Stochastic control framework with continuous-time model and discounting scheme.
result Proves sufficient conditions for client investment preference identifiability.
New theory explains why normalization is preferred in SGD under heavy-tailed noise.
problem Understanding why normalization is preferred in stochastic gradient descent (SGD) under heavy-tailed noise.
method Developed a worst-case complexity theory for stochastically preconditioned SGD and its variants.
result Normalization guarantees convergence at optimal rates, while clipping may fail in the worst case.
Investigates optimal strategies for behavioral control problems with finite variation controls.
problem Behavioral singular stochastic control problems with finite variation controls.
method Abstract framework, applied to storage management and portfolio investment problems, using CPT preferences and Skorokhod representation theorem.
result Existence of optimal strategies for various goal functionals, including CPT preferences.
Paper analyzes finite-time guarantees for preference-based RL.
problem Understanding finite-time guarantees for preference-based RL.
method Combines dueling bandits and policy search to navigate state space.
result Identifies best policy up to accuracy ε with high probability.
Study portfolio optimization with transaction costs and recursive preferences.
problem Optimizing portfolios under transaction costs and recursive preferences.
method Recursive preferences, transaction costs, and Merton investment-consumption problem.
result Characterized all parameter combinations for well-posedness of the problem.
Study recovers investor preferences from portfolio data using synthetic data and robust optimization.
problem Recovering latent investor preferences from observed portfolio allocations under uncertainty.
method Inverse portfolio optimization framework integrating robust optimization and regret-based inference.
result Accurate recovery of transaction cost parameters and partial identifiability of ESG penalties under preference misspecification and market shocks.
Investor optimizes worst-case portfolio in uncertain markets.
problem Optimizing investment in markets with potential crashes.
method Enhanced martingale approach via BSDEs and PDEs.
result Characterized indifference optimal strategies for various models.
The paper develops a method to estimate consumer preferences from observed rankings.
problem Estimating consumer preferences from partial ranking information.
method Interpreting observed rankings as pairwise comparisons, modeling latent utility, and correcting for selection bias.
result The method improves recommendation performance, especially for previously unconsumed products.
Stochastic gradient descent with noise of machine learning type. Part II: Continuous time analysiscs.LG
Continuous-time analysis shows SGD with noise prefers flat minima.
problem Optimizing neural networks using SGD with noise.
method Continuous-time model for SGD with noise analysis.
result Optimization prefers flat minima in certain noise regimes.
New algorithm for learning preferences in decentralized matching markets reduces regret to logarithmic levels.
problem Learning preferences in decentralized matching markets without direct communication.
method Introduces a new algorithm for two-sided matching markets with competition.
result The algorithm achieves logarithmic stable regret in shared preferences and quadratic regret in general preferences.
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.
Study forward investment performance in semimartingale markets with stochastic factors.
problem Investigate forward investment performance in incomplete semimartingale markets with power risk preferences and stochastic integrated factors.
method Develop necessary and sufficient conditions for FIPP existence, use integral representations, and solve ill-posed HJB equations.
result Explicit constructions for time-monotone FIPPs in semimartingale models, generalizing from Brownian to semimartingale markets.
With ever-increasing available data, predicting individuals' preferences and helping them locate the most relevant information has become a pressing need. Understanding and predicting preferences is also important from a fundamental point of view, as part of what has been called a "new" computational social science. He…
Demon aligns diffusion models without retraining or backpropagation.
problem Aligning diffusion models with user preferences.
method Stochastic optimization to control noise distribution.
result Significantly improves aesthetics scores for text-to-image generation.
Extensions to the Wealth Tax Neutrality Frameworkphysics.soc-ph
Extends wealth tax neutrality framework to stochastic volatility and non-homothetic preferences.
problem Ensuring wealth taxes are neutral under various economic conditions.
method Extended Frøseth's neutrality framework to stochastic volatility and non-homothetic preferences, identified four channels of non-neutrality, and applied the framework to global minimum wealth taxes.
result Non-uniform assessment, general equilibrium effects, progressive thresholds, and endogenous labour supply can cause non-neutrality under CRRA preferences.
Zeroth-Order Policy Gradient for Reinforcement Learning from Human Feedback without Reward Inferencecs.LG
Paper develops methods to optimize policies directly from human feedback without reward inference.
problem Challenges in RLHF, including reward model overfitting and distribution shift.
method Develops two algorithms for RLHF without reward inference, using zeroth-order gradient approximators.
result Establishes polynomial convergence rates and outperforms existing methods in numerical experiments.
Paper shows equivalence between two dividend preference models.
problem Understanding investor and firm preferences for dividends.
method Formulated Epstein-Zin preference, proved equivalence with Maenhout's model.
result Robust dividend policy is equivalent to a threshold strategy based on surplus process.
Study optimal consumption and investment for investors with Epstein-Zin preferences.
problem Optimal consumption and investment for investors with Epstein-Zin preferences in an incomplete market.
method Variational characterisation and direct method to prove existence of optimal policies.
result Existence and uniqueness of optimal consumption and investment policies.
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.
This is a follow up of our previous paper - Trybuła and Zawisza \cite{TryZaw}, where we considered a modification of a monotone mean-variance functional in continuous time in stochastic factor model. In this article we address the problem of optimizing the mentioned functional in a market with a stochastic interest rat…
New algorithms learn stable matchings from uncertain user preferences.
problem Learning stable matchings from uncertain user preferences.
method Stochastic multi-armed bandit problem, incentive-aware learning objective, primal-dual formulation.
result Near-optimal regret bounds for learning stable matchings.
This paper solves optimal consumption-investment problems with time-varying preferences.
problem Optimal consumption-investment problems under time-varying incomplete preferences.
method Develops a martingale-type solution in a topological vector space, using stochastic processes and scalarization methods.
result Optimal investment policies are set-valued, with selectors decomposed into four components.
We quantify content availability and user discovery opportunities in recommender systems.
problem Determining the maximum probability of recommending content to users.
method Stochastic reachability to compute upper bounds on recommendation likelihood.
result Reachability metrics can detect biases and diagnose user discovery limitations.
Stable matching, a classical model for two-sided markets, has long been studied with little consideration for how each side's preferences are learned. With the advent of massive online markets powered by data-driven matching platforms, it has become necessary to better understand the interplay between learning and mark…
Learning to Infer Unobserved Behaviors: Estimating User's Preference for a Site over Other Sitescs.IR
Estimates users' preference for a site over others using engagement data.
problem Lack of data on users' interactions with other sites makes it hard to estimate preferences for a focal site.
method Uses Hierarchical Bayes Method with two estimation techniques: Markov Chain Monte Carlo and Stochastic Gradient with Langevin Dynamics.
result Good support found for the approach to computing personalized share of engagement.
This paper presents a non-trivial reconstruction of a previous joint topic-sentiment-preference review model TSPRA with stick-breaking representation under the framework of variational inference (VI) and stochastic variational inference (SVI). TSPRA is a Gibbs Sampling based model that solves topics, word sentiments an…
Study asset pricing with reference-dependent preferences, finding matching equity premia.
problem Understanding asset pricing under reference-dependent preferences.
method Discrete-time consumption-based capital asset pricing model with reference-dependent preferences.
result Models can generate equity premia matching empirical estimates, showing procyclical price-dividend ratio and countercyclical equity premium.
We propose a scalable Bayesian preference learning method for jointly predicting the preferences of individuals as well as the consensus of a crowd from pairwise labels. Peoples' opinions often differ greatly, making it difficult to predict their preferences from small amounts of personal data. Individual biases also m…
Study optimal portfolios for many players in a market model with random coefficients.
problem Optimal portfolio selection for many players under relative performance criteria in a market model with random coefficients.
method Game theory and stochastic optimal control, focusing on CARA and CRRA risk preferences, and extending to continuum of players.
result Existence of forward Nash equilibrium and mean field equilibrium for the n-agent game and corresponding mean field stochastic optimal control problem.
Stochastic gradient descent outperforms traditional force-directed methods.
problem Improving graph layout quality and efficiency.
method Applying stochastic gradient descent for stress minimization.
result Stochastic gradient descent is simpler and more robust than traditional methods.
Algorithm identifies Copeland winners in dueling bandits with ternary feedback.
problem Identifying Copeland winners in dueling bandits with indifferences.
method Proposed POCOWISTA algorithm with a sample complexity close to lower bound.
result Algorithm shows excellent performance, even for conventional dueling bandits.
This paper analyzes adaptive gradient algorithms for better performance in ill-conditioned problems.
problem Poor performance of standard stochastic gradient algorithms in ill-conditioned problems.
method Non-asymptotic analysis of adaptive gradient algorithms (Adagrad and Stochastic Newton) for strongly convex objectives.
result Theoretical analysis and adaptation to practical applications like linear regression and regularized GLM.
Investigates portfolio selection among competitive agents with mean-variance preferences.
problem Optimizing portfolios with multi-agent competition and relative wealth comparison.
method Reformulated as a constrained, non-homogeneous stochastic linear-quadratic control problem; derived optimal feedback strategies; used decoupling techniques and fixed-point theory to solve nonlinear BSDEs.
result Characterized three scenarios based on market and competition parameters: unique Nash equilibrium, no Nash equilibrium, or infinitely many Nash equilibria.
We study a generalized family of stochastic orders, semiparametrized by a distortion function H, namely H-distorted stochastic dominance, which may determine a continuum of dominance relations from the first- to the second-order stochastic dominance (and beyond). Such a family is especially suitable for representing a …