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

4080120160 · Jun 202019922001200920172026
48 results for continuous-time sequence

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.

Continuous-time event sequences represent discrete events occurring in continuous time. Such sequences arise frequently in real-life. Usually we expect the sequences to follow some regular pattern over time. However, sometimes these patterns may be interrupted by unexpected absence or occurrences of events. Identificat…

2019-12-19abs ↗pdf ↗

Events in the world may be caused by other, unobserved events. We consider sequences of events in continuous time. Given a probability model of complete sequences, we propose particle smoothing---a form of sequential importance sampling---to impute the missing events in an incomplete sequence. We develop a trainable fa…

2019-05-14abs ↗pdf ↗

Develops a framework for modeling set-valued data in continuous-time.

problem Handling sequences where each event is associated with a set of items.
method General framework for modeling set-valued data, developed inference methods, and importance sampling techniques.
result Orders-of-magnitude improvements in efficiency for probabilistic queries over direct sampling.

This paper introduces a new neural ODE model for continuous-time sequence generation.

problem Representing and predicting continuous-time sequences with high accuracy.
method A neural emission model and neural ODE define the latent state evolution, with an Energy-based model for prior distribution.
result The model outperforms existing methods in various tasks, including long-horizon predictions.

Rough Transformers improve time series modeling with lower costs and better performance.

problem Inefficient modeling of irregularly sampled time series data.
method Signature patching for continuous-time representations, reducing computational costs.
result Rough Transformers outperform vanilla Transformers and Neural ODE models.

We address the problem of combining sequence models of symbolic music with user defined constraints. For typical models this is non-trivial as only the conditional distribution of each symbol given the earlier symbols is available, while the constraints correspond to arbitrary times. Previously this has been addressed …

2019-09-10abs ↗pdf ↗

Study shows financial value of weak information converges in discrete vs continuous markets.

problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.

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.

TG-GAN models dynamic graph evolution for continuous-time temporal graphs.

problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.

This paper considers a sequence of discrete-time random walk markets with a safe and a single risky investment opportunity, and gives conditions for the existence of arbitrages or free lunches with vanishing risk, of the form of waiting to buy and selling the next period, with no shorting, and furthermore for weak conv…

2012-06-25abs ↗pdf ↗

In the continuous time mean-variance model, we want to minimize the variance (risk) of the investment portfolio with a given mean at terminal time. However, the investor can stop the investment plan at any time before the terminal time. To solve this kind of problem, we consider to minimize the variances of the investm…

2019-12-04abs ↗pdf ↗

Model proposes neural network for continuous time dynamics with inductive biases.

problem Training neural networks for small datasets with nonlinear dynamics.
method Inductive biases on decay rates and frequencies using Koopman operator theory.
result Higher forecasting performance with single short training sequence.

Survey on modeling event sequences through temporal processes.

problem Modeling phenomena with sequences of events over continuous time.
method Probabilistic models based on point processes, categorized into simple, marked, and spatio-temporal.
result Analysis of existing approaches and their applicability to prediction and modeling.

Develops a new point process model for detecting neural spike sequences.

problem Detecting sparse sequences of neural spikes in high-dimensional spike trains.
method A point process model that represents sequence occurrences as marked events in continuous time, with learnable time warping parameters.
result Demonstrates improved detection and modeling of neural spike sequences.

The original Kelly criterion provides a strategy to maximize the long-term growth of winnings in a sequence of simple Bernoulli bets with an edge, that is, when the expected return on each bet is positive. The objective of this work is to consider more general models of returns and the continuous time, or high frequenc…

2020-02-09abs ↗pdf ↗

In this paper, two Q-learning (QL) methods are proposed and their convergence theories are established for addressing the model-free optimal control problem of general nonlinear continuous-time systems. By introducing the Q-function for continuous-time systems, policy iteration based QL (PIQL) and value iteration based…

2014-10-11abs ↗pdf ↗

Improved prediction algorithm for 'easy' sequences with reduced regret.

problem Prediction with expert advice for 'easy' sequences.
method Variant of NormalHedge algorithm using second-order εε-quantile regret bound.
result Second-order εε-quantile regret bound of O(VTlog(VT/ε))O\big(\sqrt{V_T \log(V_T/ε)}\big) for VT>logNV_T > \log N.

This primer explains diffusion models in general state spaces.

problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.

Sequential modelling with self-attention has achieved cutting edge performances in natural language processing. With advantages in model flexibility, computation complexity and interpretability, self-attention is gradually becoming a key component in event sequence models. However, like most other sequence models, self…

2019-11-28abs ↗pdf ↗

Paper introduces second-order Esscher densities for continuous-time models.

problem Modeling continuous-time market models with second-order Esscher densities.
method Introduced linear and exponential classes of second-order Esscher densities, characterized using semimartingale characteristics and pointwise equations.
result Characterized the relationship between linear and exponential classes for one-dimensional case and showed their connection in compound Poisson and jump-diffusion models.

Geometric tempering improves sampling from distributions, with exponential convergence rates.

problem Sampling from probability distributions using gradient flow dynamics.
method Geometric tempering of the target distribution in Wasserstein and Fisher-Rao gradient flows.
result Exponential convergence in continuous and discrete time for geometric tempering.

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.

In this paper, a method of prediction on continuous time series variables from the production or flow -- an LSTM algorithm based on multivariate tuning -- is proposed. The algorithm improves the traditional LSTM algorithm and converts the time series data into supervised learning sequences regarding industrial data's f…

2019-08-09abs ↗pdf ↗

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.

GTEA learns node representations in temporal interaction graphs.

problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.

Rough Transformers improve efficiency for medical time-series data.

problem Efficiently modeling irregularly sampled, long-range time-series data.
method Introducing Rough Transformers, a Transformer variant with continuous-time representations and multi-view signature attention.
result Rough Transformers outperform vanilla Transformers while using less computational resources.