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

Trend · papers per month

108217325433 · Jun 202019922001200920172026
48 results for information delay

We propose a model to study the effects of delayed information on option pricing. We first talk about the absence of arbitrage in our model, and then discuss super replication with delayed information in a binomial model, notably, we present a closed form formula for the price of convex contingent claims. Also, we addr…

2017-07-06abs ↗pdf ↗

Study optimal portfolios for traders with asymmetric information and delay.

problem Optimizing portfolios for traders with delayed insider information.
method Anticipating stochastic calculus and white noise approach.
result Optimal portfolios maximize expected logarithmic utility under various financial models.

New model for disability insurance reserving handles delays in claim information.

problem Disability insurance claims are affected by long delays and adjudication processes.
method Proposes a new individual reserving model for real-time claim evolution.
result Shows that new reserves can be calculated as modifications of classic reserves.

Study utility indifference pricing with delayed investment information in a Bachelier model.

problem Investment decisions based on delayed information in a Bachelier model.
method Developed discrete-time duality and used techniques from [7] to compute scaling limits.
result Utility indifference prices scaling limit for vanishing delay with quadratic penalty.

New algorithm handles delayed feedback robustly, reducing regret without knowing delay bounds.

problem Bandits with variably delayed feedback, especially excessive delays.
method Implicit exploration scheme, adaptive skipping, drifted regret control.
result Can tolerate arbitrary excessive delays up to order T, reducing regret.

We study a variant of the stochastic KK-armed bandit problem, which we call "bandits with delayed, aggregated anonymous feedback". In this problem, when the player pulls an arm, a reward is generated, however it is not immediately observed. Instead, at the end of each round the player observes only the sum of a number…

2017-09-20abs ↗pdf ↗

Study utility maximization with delayed information in continuous time Gaussian markets.

problem Maximizing utility with delayed information in continuous time Gaussian markets.
method Purely probabilistic approach based on Radon-Nikodym derivatives of Gaussian measures.
result Solution for optimal control and value in a specific Gaussian framework.

We construct and analyze symmetrized delay correlation matrices for empirical data sets for atmopheric and financial data to derive information about correlation between different entities of the time series over time. The information about correlations is obtained by comparing the results for the eigenvalue distributi…

2006-01-13abs ↗pdf ↗

Study online learning with delays and capacity constraints, achieving optimal regret bounds.

problem Online learning with delays and capacity constraints.
method Novel scheduling and preemptive techniques, matching upper and lower bounds.
result Achieves optimal regret bounds across all capacity levels.

We analyze the convergence of gradient-based optimization algorithms that base their updates on delayed stochastic gradient information. The main application of our results is to the development of gradient-based distributed optimization algorithms where a master node performs parameter updates while worker nodes compu…

2011-04-28abs ↗pdf ↗

Paper tackles delays in multi-agent reinforcement learning, improving performance.

problem Challenges in reinforcement learning due to delays in real-world systems.
method Proposes a novel framework for multi-agent reinforcement learning with delays, using Delay-Aware Markov Games and centralized-decentralized training.
result Demonstrates significant improvement in performance with delay-aware multi-agent reinforcement learning.

New algorithms handle online prediction with bandit and delayed feedback, improving regret bounds.

problem Achieving finite bounds on surrogate regret with limited feedback.
method Proposed algorithms for bandit and delayed feedback, including inverse-weighted gradient and pseudo-inverse matrix estimators.
result Achieved improved surrogate regret bounds of O(KT)O(\sqrt{KT}) and O(T2/3)O(T^{2/3}).

New method estimates traffic congestion delays using statistical causality.

problem Accurate estimation of traffic congestion delays during accidents.
method Proposes a novel time delay estimation method using lag-specific transfer entropy (TE) and Markov bootstrap techniques.
result Validated the method's efficacy using simulated and real data.

The paper develops methods for time-varying constrained online convex optimization.

problem Time-varying loss and constraint functions in online convex optimization.
method Model-based augmented Lagrangian methods (MALM) for time-varying and delayed feedback.
result Sublinear regret and constraint violation for both time-varying and delayed feedback scenarios.

Study proves duality in exotic option pricing under uncertain model and delayed information.

problem Pricing and hedging of multi-action exotic options under nondominated model uncertainty and delayed information.
method Reformulated superhedging problem as a European option problem, proving duality results.
result Superhedging price equals model-based price with future look-up power.

EviTrack improves sequential prediction in delayed disambiguation scenarios.

problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.

Stochastic linear bandits are a natural and well-studied model for structured exploration/exploitation problems and are widely used in applications such as online marketing and recommendation. One of the main challenges faced by practitioners hoping to apply existing algorithms is that usually the feedback is randomly …

2018-07-05abs ↗pdf ↗

ERDMD discovers sparse, nonuniformly timed DMD models from chaotic attractors.

problem Discovering high-fidelity, nonuniformly timed DMD models from chaotic data.
method Entropic regression for nonlinear information flow detection, combined with multi-step DMD.
result ERDMD produces highly efficient and robust models with minimal complexity.

New algorithm optimizes for long-term user satisfaction in delayed reward settings.

problem Optimizing for long-term user satisfaction in delayed reward settings.
method Developed a predictive model of delayed rewards and a bandit algorithm that combines rewards and surrogate outcomes.
result Our algorithm significantly outperforms methods that optimize for short-term proxies or rely solely on delayed rewards.

The problem of multi-hypothesis testing with controlled sensing of observations is considered. The distribution of observations collected under each control is assumed to follow a single-parameter exponential family distribution. The goal is to design a policy to find the true hypothesis with minimum expected delay whi…

2019-10-24abs ↗pdf ↗

OMGD algorithm optimizes online convex optimization with switching costs and delayed gradients.

problem Optimizing online convex optimization with switching costs and delayed gradients.
method Proposed an online multiple gradient descent (OMGD) algorithm for quadratic and linear switching costs.
result OMGD achieves optimal dynamic regret in the limited information setting.

Enhances SGLD for log-concave posteriors with asynchronous computation.

problem Sampling log-concave posterior distributions efficiently.
method Integrates asynchronous computation into SGLD with delayed gradients.
result Convergence in measure is not significantly affected by delayed gradient information.

A new method reduces communication costs in distributed learning.

problem Reduces communication bottlenecks in distributed learning.
method Local SGD with communication-computation overlap and delay-corrected sparse model averaging.
result Theoretical convergence guarantees for smooth non-convex objectives.

Paper tackles action delays in reinforcement learning, proposing a delay-aware framework.

problem Action delays degrade reinforcement learning performance in real-world systems.
method Formal definition of delay-aware MDP, transformation into standard MDP with augmented states, delay-aware model-based reinforcement learning framework.
result Proposed framework is more efficient in training and transferable between systems with various delay durations.

New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.

problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.

New method disentangles latent variables in nonstationary data.

problem Disentangling latent variables in nonstationary sequential data.
method NCTRL framework exploiting Markov assumption and temporal structure.
result Independent latent components can be recovered from nonlinear mixture without auxiliary variables.

The article explores how organisms and machines learn and recognize the world using Bayesian inference and thermodynamics.

problem Understanding how organisms and machines learn and recognize the world.
method Introducing a thermodynamic view of the Bayesian brain hypothesis, using a simple generative model of spiking neural populations.
result The process of Bayesian inference can be quantified using entropy, revealing the perceptual capacity of neural activity.

Study on synchronization in financial markets with time delays.

problem Understanding market dynamics and synchronization in financial systems with time delays.
method Examined a system of coupled non-linear delay-differential equations, linearized for small delays, and analyzed collective dynamics using bifurcation diagrams and numerical solutions.
result Demonstrated that limit cycles can be maintained in coupled N-asset models with appropriate parameterization, leading to market synchronization.

New method constructs multilayer networks from financial data, capturing dependencies across different risk factors.

problem Difficult construction of multilayer networks, neglecting time delays and interdependencies.
method Tucker tensor autoregression for direct multilayer network construction.
result Captures within and between connections, identifies strong interconnections between volumes and prices layers.

Thompson Sampling tackles noisy context in stochastic bandits.

problem Designing an action policy for noisy, corrupted contexts in stochastic bandits.
method Introducing a Thompson Sampling algorithm for Gaussian bandits with Gaussian context noise, adopting an information-theoretic analysis.
result Demonstrates the Bayesian regret of the proposed algorithm concerning the oracle's action policy.