This paper concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a s…
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
48 results for “Recursive Perturbed 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.
Study uses reinforcement learning to optimize portfolios under recursive utility.
problem Improving portfolio allocation using risk-sensitive objectives.
method Approximated certainty equivalent via Monte Carlo, trained actor-critic algorithms (PPO, A2C).
result Recursive-utility agent outperforms discounted baseline in Sharpe ratio, max drawdown, and cumulative return.
Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.
problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.
Deep learning solves dynamic programming with recursive utility.
problem Challenges in solving high-dimensional discrete-time dynamic programming problems with recursive utility.
method Certainty Equivalent Learning (CEL) algorithm that learns certainty-equivalent value directly with neural networks.
result Accurate value and policy approximations in high-dimensional problems, comparable to VFI in some cases.
The paper uses LSM to solve complex monetary utility functions.
problem Computing dynamic monetary utility functions with high dimensions.
method Least Squares Monte Carlo (LSM) algorithm.
result LSM algorithm successfully applied to recursive Cost-of-Capital valuation.
CEFOL uses deep learning for dynamic programming with recursive utility.
problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.
Singular recursive utilitymath.OC
We introduce the concept of singular recursive utility. This leads to a kind of singular BSDE which, to the best of our knowledge, has not been studied before. We show conditions for existence and uniqueness of a solution for this kind of singular BSDE. Furthermore, we analyze the problem of maximizing the singular rec…
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 …
Approximate Hamiltonian Symmetry Groups and Recursion Operators for Perturbed Evolution Equationsmath.AP
In this paper, the method of approximate transformation groups which was proposed by Baikov, Gazizov and Ibragimov, is extended on Hamiltonian and bi-Hamiltonian systems of evolution equations. Indeed, as a main consequence, this extended procedure is applied in order to compute the approximate conservation laws and ap…
Paper introduces v-CMC linking causality and utility.
problem Linking causality and utility for value theory.
method Developed a new causal independence principle (v-CMC) and proved its equivalence.
result Equivalence of local, global, and decomposition versions of v-CMC.
Estimates and optimizes UBSR risk in recursive settings.
problem Estimating and optimizing UBSR risk in a recursive setting with one-at-a-time samples.
method Casts UBSR as a root finding problem, uses stochastic approximation and gradient descent.
result Derives non-asymptotic bounds on estimation and optimization errors.
Study stability of trading strategy under market perturbations.
problem Dynamic stability of trading strategy under market changes.
method Established reverse conjugacy characterizations, proved continuity and convergence of indirect utility process.
result Continuity and first-order convergence of indirect utility process under market perturbations.
Paper finds a new principle for optimizing consumption and wealth using Tsallis entropy.
problem Optimal consumption-investment problem with recursive utility.
method Established connection to quadratic BSDE, derived stochastic maximum principle.
result Proved existence of optimal strategy and analyzed coupled system.
We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain evaluations of <G,kc> grow exponentially as k goes to infinity and the growth rate…
We propose a conjecture to compute the all-order asymptotic expansion of the colored Jones polynomial of the complement of a hyperbolic knot, J_N(q = exp(2u/N)) when N goes to infinity. Our conjecture claims that the asymptotic expansion of the colored Jones polynomial is a the formal wave function of an integrable sys…
We introduce and study the Hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), which enumerates the number of linear chord diagrams of fixed genus with specified numbers of backbones generated by s and chords generated by t. For the one-cut solution, the partition function, correlators and free energies are co…
New approach solves utility maximization problems using Delta family.
problem Utility maximization in stochastic control problems.
method Directly solving DP equation with Delta function representation.
result Explicit series representation of value function.
A new asymptotic expansion scheme for backward SDEs (BSDEs) is proposed.The perturbation parameter is introduced just to scale the forward stochastic variables within a BSDE. In contrast to the standard small-diffusion asymptotic expansion method, the dynamics of variables given by the forward SDEs is treated exactly. …
Gradient descent with chaotic perturbations improves generalization.
problem Improving generalization of gradient descent.
method Introducing chaotic perturbations to gradient descent to achieve improved generalization.
result Gradient descent with chaotic perturbations converges to a heavy-tailed SDE, leading to improved generalization.
The paper studies risk-sensitive MDPs with recursive risk measures.
problem Risk-sensitive decision-making in MDPs with unbounded costs.
method Recursive application of static risk measures, Bellman equation derivation, existence of optimal policies.
result Existence of Markovian optimal policies for infinite planning horizons, contractive model for stationary optimal policy.
We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.
problem Deriving a recursion relation for hyperbolic string vertices and its implications for string field theory.
method Using systolic volumes and a modified Mirzakhani's recursion, we construct a higher-order vertex determination for hyperbolic string field theory.
result The higher order vertices in hyperbolic string field theory are determined by the cubic vertex iteratively for any background.
RocketStack integrates predictions from multiple base learners using a recursive stacking architecture up to ten levels.
problem Feature redundancy, complexity, and computational burden in deep stacking.
method Level-aware recursive stacking with pruning and compression techniques.
result Increasing accuracy with depth and outperforming standalone ensembles at later levels.
Gradient perturbation, widely used for differentially private optimization, injects noise at every iterative update to guarantee differential privacy. Previous work first determines the noise level that can satisfy the privacy requirement and then analyzes the utility of noisy gradient updates as in the non-private cas…
This study proposes an approach based on a perturbation technique to construct global solutions to dynamic stochastic general equilibrium models (DSGE). The main idea is to expand a solution in a series of powers of a small parameter scaling the uncertainty in the economy around a solution to the deterministic model, i…
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns), which is equivalent to the hyperspectral unmixing problem under the linear mixing mo…
A perturbative moment approach to option pricingcond-mat.stat-mech
In this paper we present a new methodology for option pricing. The main idea consists to represent a generic probability distribution function (PDF) via a perturbative expansion around a given, simpler, PDF (typically a gaussian function) by matching moments of increasing order. Because, as shown in literature, the pri…
Study optimal strategies for insurer's dividends, investments, and liabilities.
problem Maximize insurer's utility of dividend payments over an infinite horizon.
method Perturbation approach to obtain optimal strategy and value function in closed form.
result Obtained optimal strategy and value function for log and power utility.
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…
We provide a verification and characterization result of optimal maximal sub-solutions of BSDEs in terms of fully coupled forward backward stochastic differential equations. We illustrate the application thereof in utility optimization with random endowment under probability and discounting uncertainty. We show with ex…
Paper analyzes GCNN sensitivity to probabilistic graph perturbations.
problem Investigating how GCNNs handle probabilistic graph errors.
method Establishes error bounds and linear relationships between GSO perturbations and GCNN outputs.
result GCNNs maintain stability under graph edge perturbations if GSO errors are bounded.
In quantitative finance, it is often necessary to analyze the distribution of the sum of specific functions of observed values at discrete points of an underlying process. Examples include the probability density function, the hedging error, the Asian option, and statistical hypothesis testing. We propose a method to c…
R2-B2 optimizes game interactions with recursive reasoning.
problem Optimizing interactions between boundedly rational agents with unknown payoff functions.
method Recursive Reasoning-Based Bayesian Optimization (R2-B2) for repeated games.
result R2-B2 achieves faster asymptotic convergence to no regret than non-recursive methods.
The study examines neural networks with random weights and biases, finding that depth-to-width ratio controls fluctuations and correlations.
problem Exploring the exploding and vanishing gradient problem in neural networks with random weights and biases.
method Sharp estimates of joint cumulants and solving cumulant recursions in powers of 1/n.
result The depth-to-width ratio plays a crucial role in controlling fluctuations and correlations, leading to the occurrence of exploding and vanishing gradients.
Proposes a text perturbation method using a Mahalanobis metric to balance privacy and utility.
problem Low utility of text analysis when using spherical noise for privacy-preserving text embedding.
method Regularized Mahalanobis metric to add elliptical noise, accounting for embedding space density.
result Improves privacy statistics while maintaining utility, outperforming Laplace mechanism.
Recursive Compressed Sensingstat.ML
We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from…
Paper solves investment and consumption problem with unknown risk, providing explicit solutions.
problem Solving consumption-investment problem with unknown market price of risk and terminal liability constraint.
method Introduced a coupled forward-backward stochastic differential equation (FBSDE) and provided an explicit solution.
result Explicit expressions for optimal investment strategy and value function derived.
A new Bayesian method optimizes time-dependent expensive functions with lookahead.
problem Maximizing a time-dependent, expensive oracle with limited evaluations.
method Recursive, two-step lookahead expected payoff (r2LEY) acquisition function.
result r2LEY outperforms myopic methods in synthetic and real-world datasets.
In a market with stochastic investment opportunities, we study an optimal consumption investment problem for an agent with recursive utility of Epstein-Zin type. Focusing on the empirically relevant specification where both risk aversion and elasticity of intertemporal substitution are in excess of one, we characterize…
The study identifies conditions under which algorithmic stability explains generalization in interpolating learning systems.
problem Understanding when algorithmic stability explains generalization in interpolating learning systems.
method Modeling training as a function-space trajectory and measuring sensitivity to single-sample perturbations.
result There exist interpolating regimes with small risk where contractive sensitivity cannot hold, showing that stability is not a universal explanation.
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.
In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown that it is possible to carry out a recursive approximation to an arbitrarily highe…
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 examine the issue of sensitivity with respect to model parameters for the problem of utility maximization from final wealth in an incomplete Samuelson model and mainly, but not exclusively, for utility functions of positive power-type. The method consists in moving the parameters through change of measure, which we …
Cardinality potentials are a generally useful class of high order potential that affect probabilities based on how many of D binary variables are active. Maximum a posteriori (MAP) inference for cardinality potential models is well-understood, with efficient computations taking O(DlogD) time. Yet efficient marginalizat…
We introduce a unified framework for solving first passage times of time-homogeneous diffusion processes. According to the killed version potential theory and the perturbation theory, we are able to deduce closed-form solutions for probability densities of single-sided level crossing problem. The framework is applicabl…
We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursiv…
Paper proposes a recursive GPSSM for efficient online learning.
problem Efficient online learning for dynamical models with limited prior information.
method Recursive Gaussian Process State-Space Model with adaptive capabilities for domains and hyperparameters.
result Superior accuracy, computational efficiency, and adaptability compared to state-of-the-art methods.