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

77155232309 · Jun 202019922001200920172026
48 results for Guaranteed return

Deep reinforcement learning improves trading performance with predictable returns.

problem Improving trading performance in financial markets with low signal-to-noise ratio.
method Investigates model-free deep reinforcement learning traders in a market with known mean-reverting factors.
result DRL agents outperform benchmarks in misspecified price dynamics and extreme events.

Model approximates market prices and returns without prior market dynamics.

problem Simultaneously approximate market prices and log returns.
method GDN model of Kratsios and Papon (2022) for generalized Ornstein-Uhlenbeck process.
result Universal approximation guarantees for conditional distributions and contingent claims.

New algorithms improve performance guarantees for multi-armed bandits problems.

problem Allocating effort under uncertainty in scenarios like investing research effort.
method Proposed two new families of bandit algorithms with stronger guarantees.
result Achieved optimal dependence on k with additional properties of arm reward curves.

This paper applies quantum probability theory to model asset returns, avoiding assumptions about quantum effects.

problem Modeling asset returns with classical probability theory.
method Derives a Schrödinger-like trading equation using quantum probability, linking it to traders' decisions and market behaviors.
result Quantum probability can describe multimodal distributions of asset returns without assuming quantum effects.

This work provides guarantees for off-policy function estimation under realizability assumptions.

problem Estimating the value function of a policy under user-specified error-measuring distributions.
method The approach involves imposing a flexible regularization on the MIS objectives to account for an arbitrary user-specified distribution.
result Exact characterization of the optimal dual solution that determines the data-coverage assumption in the case of value-function learning.

A model explains stock returns and volatility using multifractal and rough components.

problem Reconciling multifractal stock returns and rough index volatilities.
method Nested factor model with multifractal and rough volatility components.
result The model explains stock index Hurst exponents larger than individual stock exponents.

Unified framework for reliable uncertainty quantification in RL.

problem Uncertainty quantification in high-stakes reinforcement learning.
method Unified conformal prediction framework integrating distributional RL and conformal calibration.
result Significantly improved coverage and reliability over standard methods.

Variable annuities (VA) are popular insurance products. VAs provides the insured with a guaranteed accumulation rate on their premium at maturity. In addition, the insured may receive extra benefit if returns of underlying funds are high enough. Here we consider a special case of VA with high-water mark feature and Gua…

2011-08-22abs ↗pdf ↗

New method tackles online DR-submodular maximization with improved regret guarantees.

problem Online maximization of non-monotone DR-submodular functions over down-closed convex sets.
method 1/e-linearization through exponential reparametrization, surrogate potential, and reduction to online linear optimization.
result Achieves O(T1/2)O(T^{1/2}) static regret with single gradient query per round, improving state of the art.

CDS (credit default swap) contracts that were initiated some time ago frequently have spreads and/or maturities that are not available on the current market of CDSs, and are thus illiquid. This article introduces an incomplete-market approach to valuing illiquid CDSs that, in contrast to the risk-neutral approach of cu…

2014-03-06abs ↗pdf ↗

We study the problem of maximizing a monotone set function subject to a cardinality constraint kk in the setting where some number of elements ττ is deleted from the returned set. The focus of this work is on the worst-case adversarial setting. While there exist constant-factor guarantees when the function is submodu…

2018-02-20abs ↗pdf ↗

We design a non-convex second-order optimization algorithm that is guaranteed to return an approximate local minimum in time which scales linearly in the underlying dimension and the number of training examples. The time complexity of our algorithm to find an approximate local minimum is even faster than that of gradie…

2016-11-03abs ↗pdf ↗

Understanding generalization in reinforcement learning (RL) is a significant challenge, as many common assumptions of traditional supervised learning theory do not apply. We focus on the special class of reparameterizable RL problems, where the trajectory distribution can be decomposed using the reparametrization trick…

2019-05-29abs ↗pdf ↗

New algorithm offers costless model selection in contextual bandits.

problem Minimizing cumulative regret in stochastic contextual bandits.
method Gradually increasing class complexity and adapting to the simplest class with dominant estimation variance.
result Costless model selection is feasible under certain conditions, providing improved regret guarantees.

MDS selects assets by combining daily returns and intraday risk curves, improving portfolio performance.

problem High estimation error in large-scale asset selection.
method Metric Dependence Screening (MDS) incorporating high frequency information as object valued data.
result MDS improves portfolio performance over benchmarks by preserving intraday risk dynamics.

We address the problem of computing reliable policies in reinforcement learning problems with limited data. In particular, we compute policies that achieve good returns with high confidence when deployed. This objective, known as the \emph{percentile criterion}, can be optimized using Robust MDPs~(RMDPs). RMDPs general…

2019-10-23abs ↗pdf ↗

Guaranteed bounds for posterior inference in probabilistic programs.

problem Approximating the posterior distribution of probabilistic programs with provable correctness.
method Interval-based trace semantics, soundness and completeness proofs, weight-aware interval type system.
result Guaranteed bounds on the posterior distribution of probabilistic programs are computed and proven to be correct.

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint kk, with the added twist that a number of items ττ from the returned set may be removed. We focus on the worst-case setting considered in (Orlin et al., 2016), in which a constant-factor approximation guarantee was g…

2017-06-15abs ↗pdf ↗

Proposes a model to generate high-dimensional financial returns using latent factor structure.

problem Challenges in financial scenario simulation, especially in high-dimensional and small data settings.
method Integrates latent factor structure into generative diffusion processes, decomposing the score function using time-varying orthogonal projections.
result Establishes rigorous statistical guarantees for score estimation and generated distribution, surpassing dimension-dependent limits.

The paper improves recommendation systems by ensuring their outputs are reliable.

problem Recommendation systems often lack reliability guarantees for their outputs.
method The method uses a pre-trained ranking model to create a set of items with rigorous FDR control.
result The approach provides a way to guarantee the reliability of recommendation outputs.

Paper develops a new estimator for MDPs' risk functionals with lower variance and bias.

problem Estimating the distribution of returns in MDPs with high variance and bias.
method Developed a doubly robust (DR) estimator for the CDF of returns in MDPs, incorporating model-based estimation to mitigate variance issues.
result The DR estimator achieves lower variance and bias compared to IS estimators, and matches minimax lower bounds.

A key problem in reinforcement learning for control with general function approximators (such as deep neural networks and other nonlinear functions) is that, for many algorithms employed in practice, updates to the policy or QQ-function may fail to improve performance---or worse, actually cause the policy performance …

2016-02-29abs ↗pdf ↗

Investors can achieve optimal risk-reward trade-offs with bonds and stocks under mean-reverting stock returns.

problem Optimizing investment strategies with mean-reverting stock returns.
method Calculus of variations to derive the entire family of extremal strategies, not just the optimal ones.
result The value of the portfolio is effectively bounded from below, providing a 'guarantee' on the horizon.

Paper proposes a new risk measure (reward volatility) for optimizing financial decisions.

problem Managing uncertainty and volatility in financial decision-making.
method Defines reward volatility, derives policy gradient theorem, develops actor-only algorithm.
result Risk-averse optimization improves both reward volatility and return variance.