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

Trend · papers per month

163327490653 · Jun 202019922001200920172026
48 results for discount functions

Study optimal portfolio strategies with time-varying discount rates.

problem Optimizing portfolio decisions with a non-constant discount rate.
method Introduced subgame perfect strategies to handle time inconsistency, using fixed point iteration to find the utility-weighted discount rate.
result Subgame perfect strategies are equivalent to optimal strategies under certain utility function assumptions.

New RL approach handles non-exponential discounting for sequential decisions.

problem Modeling human discounting in sequential decision-making tasks.
method Generalized model-based reinforcement learning with arbitrary discount functions, using Hamilton-Jacobi-Bellman equation and collocation method.
result Validated approach on simulated problems, showing applicability to human discounting.

Reinforcement learning (RL) typically defines a discount factor as part of the Markov Decision Process. The discount factor values future rewards by an exponential scheme that leads to theoretical convergence guarantees of the Bellman equation. However, evidence from psychology, economics and neuroscience suggests that…

2019-02-19abs ↗pdf ↗

In this paper, we study the dividend strategies for a shareholder with non-constant discount rate in a diffusion risk model. We assume that the dividends can only be paid at a bounded rate and restrict ourselves to the Markov strategies. This is a time inconsistent control problem. The extended HJB equation is given an…

2013-04-30abs ↗pdf ↗

Study optimal stopping for group with diverse discount rates using an attitude function.

problem Optimal stopping for a group with diverse discount rates under an aggregation preference.
method Develop iterative approach using consistent planning for time-consistent equilibria.
result Characterize all time-consistent mild equilibria as fixed points of an operator.

Investment decisions shift earlier as patience decreases, with implications for pasting conditions.

problem Investment timing under decreasing impatience.
method Game-theoretic framework with continuous-time capacity expansion problem.
result Decreasing impatience leads to earlier investment decisions, but can violate smooth pasting conditions.

The paper analyzes optimal dividend and capital injection strategies under time-inconsistent preferences.

problem Optimal dividend and capital injection strategies under time-inconsistent preferences.
method Diffusion risk model with general discount functions, weak equilibrium definition, HJB equation system.
result Explicit solutions and threshold types of optimal strategies derived under different discount functions.

We optimize discounts to maximize influence spread in social networks.

problem Maximizing influence spread in social networks with fractional discounts.
method Developed an efficient (1-1/e)-approximation algorithm for NP-hard problem.
result Achieved an approximation of 1-1/e for influence maximization.

This paper presents an algorithm for pricing perpetual American put options with asset-dependent discounting.

problem Pricing perpetual American put options with asset-dependent discounting.
method The approach involves a value function described by a stochastic process with negative exponential jumps and a discount function that depends on the asset price.
result Under certain conditions, the value function can be convex and represented in a closed form.

New findings reveal discount regularization can be seen as a strong prior, leading to poor performance in unevenly sampled data.

problem Discount regularization leads to poor performance in unevenly sampled data.
method Equivalence theorem showing discount regularization as a strong prior, setting regularization parameters locally for individual state-action pairs.
result Discount regularization can be seen as a strong prior, leading to poor performance in unevenly sampled data.

A central problem in ranking is to design a ranking measure for evaluation of ranking functions. In this paper we study, from a theoretical perspective, the widely used Normalized Discounted Cumulative Gain (NDCG)-type ranking measures. Although there are extensive empirical studies of NDCG, little is known about its t…

2013-04-24abs ↗pdf ↗

In a continuous time stochastic economy, this paper considers the problem of consumption and investment in a financial market in which the representative investor exhibits a change in the discount rate. The investment opportunities are a stock and a riskless account. The market coefficients and discount factor switches…

2011-07-10abs ↗pdf ↗

The paper analyzes perpetual American options with asset-dependent discounting.

problem Optimal stopping problem for perpetual American options with varying discount rates.
method Analyzes the convexity of the value function, determines stopping regions, and proves HJB equation.
result Identifies the form of the value function and proves put-call symmetry.

New algorithm reduces online regression error in RKHS.

problem Online regression with time-varying functions in RKHS.
method Hierarchical Vovk-Azoury-Warmuth with discounting.
result Achieves optimal dynamic regret with O(T2/3PT1/3+TlnT)O(T^{2/3}P_T^{1/3} + \sqrt{T}\ln T) regret bound.

Study optimal stopping times for multi-dimensional processes with non-exponential discounting.

problem Optimal stopping in multi-dimensional processes with non-exponential discounting.
method Probabilistic potential theory to establish existence of optimal equilibria.
result Existence of optimal equilibria for multi-dimensional stopping problems.

Paper tackles time inconsistency in portfolio management with stochastic volatility and power utility.

problem Time inconsistency in portfolio management with stochastic volatility and power utility.
method Extended Hamilton Jacobi Bellman (HJB) equation, fixed point iteration, and linear parabolic PDE.
result Subgame perfect strategies are characterized and solved through numerical experiments.

A firm with heterogeneous shareholders optimizes dividends under ambiguity aggregation.

problem Optimizing dividends for a firm with heterogeneous shareholders under ambiguity aggregation.
method Characterizing equilibrium dividends using a partition of the state space.
result Time-homogeneous equilibrium dividend law characterized by a partition of the state space.

The policy gradient theorem describes the gradient of the expected discounted return with respect to an agent's policy parameters. However, most policy gradient methods drop the discount factor from the state distribution and therefore do not optimize the discounted objective. What do they optimize instead? This has be…

2019-06-17abs ↗pdf ↗

We consider an economic agent (a household or an insurance company) modelling its surplus process by a deterministic process or by a Brownian motion with drift. The goal is to maximise the expected discounted spendings/dividend payments, given that the discounting factor is given by an exponential CIR process. In the d…

2018-08-30abs ↗pdf ↗

Study on investment strategy for agents with periodic preferences and discounting.

problem Investment decisions by agents with periodic S-shaped preferences and present bias.
method Infinite-horizon, continuous-time portfolio selection problem with quasi-hyperbolic discounting.
result Time-consistent planning strategy can be formulated as an equilibrium to a static mean field game.

Paper develops a discounted algorithm for online convex optimization that adapts to unknown discount factors.

problem Developing an algorithm that can adapt to an unknown discount factor in online convex optimization.
method Smoothed Online Gradient Descent (SOGD) with Discounted-Normal-Predictor (DNP).
result Achieves a uniform O(logT/1λ)O(\sqrt{\log T/1-λ}) discounted regret across a continuous interval of discount factors.

Paper introduces non-linear discounting models for default compensation and climate valuation.

problem Valuation of non-replicable value and damage under default risk.
method Develops two models: one for risk-neutralising discounting and another for survival probability dependent discounting.
result Non-decaying discount factors (negative discount rates) are possible under certain scenarios.

We introduce and analyze a form of variance-reduced QQ-learning. For γγ-discounted MDPs with finite state space X\mathcal{X} and action space U\mathcal{U}, we prove that it yields an εε-accurate estimate of the optimal QQ-function in the \ell_\infty-norm using $\mathcal{O} \left(\left(\frac{D}{ ε^2 (1-γ)^3} \ri…

2019-06-11abs ↗pdf ↗

Study uses FDA to analyze discount functions of different temperaments.

problem Traditional finance models fail to capture individual differences in investment choices.
method Functional Data Analysis (FDA) to investigate temporal discounting behaviors.
result Heterogeneity within each temperament revealed, suggesting diverse investor profiles.

New algorithm reduces reinforcement learning regret to sqrt(T) without strong dynamics assumptions.

problem Infinite-horizon average-reward reinforcement learning with linear MDPs.
method Approximate by discounted-reward MDPs and apply optimistic value iteration.
result Achieves O(sqrt(T)) regret with polynomial complexity.

In the "positive interest" models of Flesaker-Hughston, the nominal discount bond system is determined by a one-parameter family of positive martingales. In the present paper we extend this analysis to include a variety of distributions for the martingale family, parameterised by a function that determines the behaviou…

2010-12-08abs ↗pdf ↗

In many finite horizon episodic reinforcement learning (RL) settings, it is desirable to optimize for the undiscounted return - in settings like Atari, for instance, the goal is to collect the most points while staying alive in the long run. Yet, it may be difficult (or even intractable) mathematically to learn with th…

2019-02-05abs ↗pdf ↗

Empirical study on long-term discount rates using historical bond prices.

problem Estimating long-term real interest rates and discount rates from historical bond data.
method Using Fourier transforms to derive the discount function and fitting it to historical data.
result Estimated long-term discount rates of 1.7% for UK and 2.2% for US.

New Q-learning algorithm reduces sample complexity for large discount factors.

problem Large discount factors make Q-learning algorithms inefficient.
method Introduces a new Q-learning algorithm with uniformly bounded sample complexity.
result The new algorithm achieves asymptotic covariance that is a quadratic in 1/(1ργ)1/(1- ρ^* γ).

For environmental problems such as global warming future costs must be balanced against present costs. This is traditionally done using an exponential function with a constant discount rate, which reduces the present value of future costs. The result is highly sensitive to the choice of discount rate and has generated …

2013-11-16abs ↗pdf ↗

New method uses PINNs to efficiently compute Gerber-Shiu functions.

problem Calculating the Gerber-Shiu function efficiently.
method Physics-informed neural networks (PINNs) embedded with differential equations.
result Demonstrates good performance in approximating Gerber-Shiu functions.

Study analyzes how discounts affect train ticket purchases and rescheduling in Switzerland.

problem Understanding how discounts influence train ticket buying and rescheduling behavior.
method Machine learning techniques, including causal machine learning, to analyze survey data.
result Increasing a discount rate by 1% increases the rescheduled trip share by 0.16% among always buyers.

There is an observed basis between repo discounting, implied from market repo rates, and bond discounting, stripped from the market prices of the underlying bonds. Here, this basis is explained as a convexity effect arising from the decorrelation between the discount rates for derivatives and bonds. Using a Hull-White …

2019-05-08abs ↗pdf ↗

Paper proposes an efficient RL algorithm for discounted MDPs using feature mapping.

problem Efficient reinforcement learning for large state and action spaces.
method Uses feature mapping to represent states and actions in a low-dimensional space, proposing a novel algorithm with polynomial regret bound.
result Achieves a O(dT/(1γ)2)O(d\sqrt{T}/(1-γ)^2) regret bound, near-optimal up to a (1γ)0.5(1-γ)^{-0.5} factor.