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

25497498 · Jun 202019922001200920172026
48 results for Continuous-time bandits

Continuous-time algorithms improve online learning performance.

problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.

Paper solves Bayesian bandit problem with continuous-time limit and approximate policy.

problem Finding optimal policy in Bayesian bandit problems with large horizons.
method Reformulates Bayesian bandit problem as continuous Hamilton-Jacobi-Bellman (HJB) equation and proposes approximate Bayes-optimal policy.
result Approximate Bayes-optimal policy for large horizons with constant computational cost.

Study on policy gradient for stochastic bandits using diffusion approximation.

problem Improving policy gradient methods for stochastic bandits with optimal regret bounds.
method Continuous-time diffusion approximation of policy gradient with learning rate analysis.
result Proved optimal regret bound of O(klog(k)log(n)/η)O(k \log(k) \log(n) / η) for η=O(Δ2/log(n))η= O(Δ^2/\log(n)).

New framework improves restless bandit policies for large numbers of arms.

problem Efficiently compute policies for large numbers of arms in restless bandit problems.
method Follow-the-Virtual-Advice framework, converting single-armed policies to N-armed policies.
result Achieves an O(1/\sqrt{N}) optimality gap in both discrete and continuous settings.

ES reduces high-probability regret in stochastic linear bandits.

problem High-probability regret in stochastic linear bandits.
method Linear ensemble sampling with standard Gaussian perturbations, analyzing m=Θ(dlogn)m=Θ(d\log n) ensemble size.
result ES achieves ildeO(d3/2n) ilde O(d^{3/2}\sqrt n) high-probability regret, closing the gap to Thompson sampling.

New algorithms boost SAT solver performance by optimizing restart strategies.

problem Optimizing decision-making under time constraints with restarts.
method Developed online learning algorithms for a bandit problem with controlled restarts.
result Achieved O(log(τ))O(\log(τ)) and O(τlog(τ))O(\sqrt{τ\log(τ)}) regret bounds.

Algorithm identifies correct hypothesis from alternatives in bandit problems.

problem Efficiently identifying the correct hypothesis from a finite set of alternatives in structured stochastic multi-armed bandits.
method Frank-Wolfe Self-Play (FWSP) reformulates the game as a saddle-point problem, using a differential-inclusion argument to prove convergence.
result Convergence of the game value for best-arm identification in linear bandits, with uniform global convergence to the optimal value.

Continuous time framework for discrete data denoising models.

problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.

Develops DPG methods for continuous-time RL with deterministic policies.

problem High variance and slow convergence in stochastic policy RL methods.
method Derives continuous-time policy gradient formula and proposes CT-DDPG algorithm.
result CT-DDPG achieves superior stability and faster convergence in continuous-time RL.

Paper develops a continuous-time framework for financial markets without stochastic calculus.

problem Developing continuous-time financial models without stochastic calculus.
method A general framework using conditional topologies and pseudo-distance topologies.
result No-arbitrage conditions hold in continuous time if and only if they hold in discrete time.

Stochastic gradient descent in continuous time (SGDCT) provides a computationally efficient method for the statistical learning of continuous-time models, which are widely used in science, engineering, and finance. The SGDCT algorithm follows a (noisy) descent direction along a continuous stream of data. SGDCT performs…

2016-11-17abs ↗pdf ↗

Continuous-time SGD converges under certain conditions, useful for deep learning.

problem Minimizing population expected loss in learning problems.
method Continuous-time approximation of stochastic gradient descent.
result Establishes sufficient conditions for convergence, applicable to overparametrized neural networks.

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

Generalizes PCA and ICA for continuous-time signals using neural networks.

problem Low-rank decomposition of continuous-time vector-valued signals.
method Implicit neural network framework to learn numerical approximations of PCA and ICA.
result Unified approach to PCA and ICA in continuous domain, enforcing decorrelation and independence.

Study shows certainty equivalent policy minimizes regret in continuous-time systems.

problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.

Detects outliers in continuous-time event sequences, including unexpected absences and occurrences.

problem Identifying unexpected events in event sequences that may indicate abnormal situations.
method Developed methods based on Bayesian decision theory and hypothesis testing for context-aware outlier detection.
result Effective methods for detecting outliers in both synthetic and real-world data.

We consider a family of learning strategies for online optimization problems that evolve in continuous time and we show that they lead to no regret. From a more traditional, discrete-time viewpoint, this continuous-time approach allows us to derive the no-regret properties of a large class of discrete-time algorithms i…

2014-01-27abs ↗pdf ↗

Study a continuous-time PA problem with private effort and consumption decisions.

problem Continuous-time Principal-Agent problem with private information.
method Proposes a new sufficient condition for solving the agent's problem directly.
result Directly yields a solution to the agent's problem without verification.

New continuous-time optimization algorithms converge in finite time to local minima.

problem Finding local minima in optimization problems.
method Discontinuous dynamical systems with finite-time convergence via Lyapunov-based differential inequality.
result Finite-time convergence to strict local minima with provable settling time.

CT-OT Flow estimates continuous-time dynamics from discrete snapshots.

problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.

New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.

problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.

RL approach for continuous-time mean-variance portfolio selection with empirical validation.

problem Continuous-time mean-variance portfolio selection in unknown market coefficients.
method Reinforcement learning for diffusion processes, sublinear regret bound derivation.
result RL strategy consistently outperforms model-based counterparts, especially in volatile markets.

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.

This paper extends risk parity to continuous-time, solving risk budgeting problems.

problem Achieving robust risk across different assets in continuous-time.
method Characterizing risk contributions and solving risk budgeting problems using continuous-time terminal variance.
result Risk contributions and risk budgets can be represented as predictable processes in continuous-time.

This work compresses sequences by treating them as continuous-time processes, enabling efficient discretization.

problem Efficient compression of sequences, especially with deep learning models that scale with sequence length.
method Treat sequences as continuous-time processes, learn efficient discretization, and decode at different time intervals.
result Automatic bit rate reductions in video and motion capture sequences using learned discretization.

Paper solves POMDPs in continuous time and discrete spaces.

problem Optimal decision making in discrete state and action space systems under partial observability.
method Combining optimal filtering theory and deep learning to solve a Hamilton-Jacobi-Bellman equation.
result Derives a mathematical description and solution approach for continuous-time POMDPs.

We solve continuous-time reinforcement learning using distributional Hamilton-Jacobi-Bellman equations.

problem Predicting the distribution of returns in continuous-time, stochastic environments.
method We derive a distributional Hamilton-Jacobi-Bellman equation for Itô diffusions and Feller-Dynkin processes, and propose an algorithm based on a JKO scheme.
result We propose an online control algorithm that can be used to approximately solve the distributional HJB equation.

Topic models are probabilistic models for discovering topical themes in collections of documents. In real world applications, these models provide us with the means of organizing what would otherwise be unstructured collections. They can help us cluster a huge collection into different topics or find a subset of the co…

2013-02-28abs ↗pdf ↗

Continuous time Bayesian networks (CTBNs) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cyclic) dependency graph over a set of variables, each of which represents a finite state continuous time Markov process whose transition model is…

2012-10-19abs ↗pdf ↗

Study on optimal portfolio selection with varying borrowing and saving rates in continuous-time markets.

problem Optimal portfolio selection in markets with different borrowing and saving rates.
method Hamilton-Jacobi-Bellman equation, partial differential equation, verification argument.
result Existence and smoothness of the value function, identification of trading regions and strategies.