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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for discounted linear regression

Optimal online linear regression in dynamic environments using discounted Vovk-Azoury-Warmuth forecaster.

problem Achieving optimal performance in dynamic online linear regression without prior knowledge.
method Developed a discounted variant of the Vovk-Azoury-Warmuth forecaster to achieve optimal dynamic regret guarantees.
result Achieved dynamic regret of the form $O\left(d\log(T)\vee \sqrt{dP_{T}^γ(\vec{u})T} ight)$, with a learnable discount factor.

A new algorithm for non-stationary linear bandits with improved regret bound.

problem Non-stationary linear bandit problem with time-varying rewards.
method D-LinUCB, a discounted linear regression algorithm with exponential weights.
result Upper bound on dynamic regret of order d^{2/3} B_T^{1/3}T^{2/3}, optimal in slowly-varying and abruptly-changing environments.

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.

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.

Framework for transferring discount curve estimates across fixed-income product classes.

problem Challenges in estimating discount curves from sparse or noisy data.
method Proposes a vector-valued kernel ridge regression (KR) framework with economic regularization.
result Transfer learning tightens confidence intervals and improves extrapolation performance.

In this paper we extend the existing literature on xVA along three directions. First, we enhance current BSDE-based xVA frameworks to include initial margin in presence of defaults. Next, we solve the consistency problem that arises when the front-office desk of the bank uses trade-specific discount curves (CSA discoun…

2019-05-27abs ↗pdf ↗

Improved RL algorithm with linear MDPs for offline learning with partial data coverage.

problem Efficient offline RL with linear MDPs under partial data coverage.
method Primal-dual algorithm with O(ε2)O(ε^{-2}) sample complexity.
result First computationally efficient algorithm with O(ε2)O(ε^{-2}) sample complexity for offline RL with linear MDPs under partial data coverage.

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.

Two randomized algorithms improve performance in non-stationary linear bandits.

problem Conservatism in optimistic algorithms for non-stationary linear bandits.
method Two perturbation approaches: randomization and random perturbations.
result D-RandLinUCB and D-LinTS achieve optimal dynamic regret and are oracle-efficient.

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.

We present a non-parametric method to estimate the discount curve from market quotes based on the Moore-Penrose pseudoinverse. The discount curve reproduces the market quotes perfectly, has maximal smoothness, and is given in closed-form. The method is easy to implement and requires only basic linear algebra operations…

2016-06-13abs ↗pdf ↗

Adaptive policies solve a linear program to maximize rewards while minimizing costs in sales with discounts.

problem Maximizing rewards in sales with discounts while considering costs.
method Solves a linear program based on upper-confidence estimates of conversion probabilities.
result Achieves a regret bound of the typical order (OPT/BB) T\sqrt{T}, where B is the total budget allowed.

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.

We consider a general class of non-linear Bellman equations. These open up a design space of algorithms that have interesting properties, which has two potential advantages. First, we can perhaps better model natural phenomena. For instance, hyperbolic discounting has been proposed as a mathematical model that matches …

2019-07-08abs ↗pdf ↗

New algorithm for nonstationary GLBs reduces computation and memory costs.

problem Nonstationary generalized linear bandits with unknown time-varying parameters.
method Discounted Online Mirror Descent (DOMD) for parameter estimation.
result Dynamic regret bounds of order O(1)O(1) per round in drifting and piecewise-stationary environments.

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.

A new Twitter sentiment model predicts stock market trends with high accuracy.

problem Real-time prediction of future stock market prices.
method Baseline correlation approach using polynomial regression, classification, and lexicon-based sentiment analysis.
result Predicts stock market trends with 67.22% accuracy, up to 15 time samples in advance.

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.

This paper develops a Bayesian procedure for estimation and forecasting of the volatility of multivariate time series. The foundation of this work is the matrix-variate dynamic linear model, for the volatility of which we adopt a multiplicative stochastic evolution, using Wishart and singular multivariate beta distribu…

2008-02-01abs ↗pdf ↗

In this paper, we investigate the Merton portfolio management problem in the context of non-exponential discounting. This gives rise to time-inconsistency of the decision-maker. If the decision-maker at time t=0 can commit his/her successors, he/she can choose the policy that is optimal from his/her point of view, and …

2007-08-03abs ↗pdf ↗

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.

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 ↗

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 ↗

Study shows TD(0) with linear approx. converges for reversible Markov chains.

problem TD(0) divergence with off-policy and function approximation.
method Analyzes standard TD(0) with reversible Markov chains, adapting stochastic approximation framework.
result Establishes convergence with probability one for projected Bellman error = 0.

The paper uses regression trees/random forests to price Bermudan options more efficiently.

problem Pricing Bermudan options with conditional expectation estimation.
method Estimates conditional expectations using regression trees or random forests instead of traditional regression methods.
result Regression trees/random forests provide better results in high dimensions.

This paper shows how forward rate interpolations are equivalent to discount factor interpolations in yield curve construction.

problem The challenge of choosing between different interpolation methods for yield curve construction.
method Demonstrates the equivalence between forward rate interpolations and discount factor interpolations.
result Some popular interpolation methods on forward rates are equivalent to classical interpolation methods on discount factors.

This paper analyzes RMR under Markov-dependent samples, improving understanding of its generalization error.

problem Understanding the generalization error of RMR in Markov-dependent settings.
method Established the upper bound for RMR estimator under Markov-dependent samples, providing a learning rate.
result Markov dependence affects the generalization error, reducing it by a multiplicative factor of the spectral gap.

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild 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.