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

3727441,1161,488 · Jun 202019922001200920172026
48 results for long sequence modelling

Recurrent Neural Networks (RNN), Long Short-Term Memory Networks (LSTM), and Memory Networks which contain memory are popularly used to learn patterns in sequential data. Sequential data has long sequences that hold relationships. RNN can handle long sequences but suffers from the vanishing and exploding gradient probl…

2019-04-18abs ↗pdf ↗

We present the Compressive Transformer, an attentive sequence model which compresses past memories for long-range sequence learning. We find the Compressive Transformer obtains state-of-the-art language modelling results in the WikiText-103 and Enwik8 benchmarks, achieving 17.1 ppl and 0.97 bpc respectively. We also fi…

2019-11-13abs ↗pdf ↗

S3^3Attention improves long sequence attention with smoothed skeleton sketching.

problem Quadratic complexity of vanilla Attention makes it unsuitable for long sequence tasks.
method S3^3Attention uses smoothing and matrix sketching to balance information preservation and computation.
result S3^3Attention significantly outperforms vanilla Attention and other Attention variants.

Introduces Spectral Attention for better long-range time series forecasting.

problem Challenges in capturing long-range dependencies in time series forecasting.
method Spectral Attention mechanism that preserves temporal correlations and long-range dependencies.
result Achieves state-of-the-art results on 11 real-world time series datasets.

Skeinformer accelerates self-attention for long sequences with linear complexity.

problem Efficiency of Transformer models in processing long sequences.
method Matrix sketching and column sampling to reduce quadratic complexity to linear.
result Skeinformer outperforms alternatives with smaller time/space footprint.

New Performer model tackles long-sequence protein modeling.

problem Challenges of training complex Transformer models for long sequences.
method Linearly scalable long-context Transformer architecture, Performer.
result Performer provides strong theoretical guarantees and is effective for protein sequence modeling.

Summarization of long sequences into a concise statement is a core problem in natural language processing, requiring non-trivial understanding of the input. Based on the promising results of graph neural networks on highly structured data, we develop a framework to extend existing sequence encoders with a graph compone…

2018-11-05abs ↗pdf ↗

Missing value imputation is a fundamental problem in spatiotemporal modeling, from motion tracking to the dynamics of physical systems. Deep autoregressive models suffer from error propagation which becomes catastrophic for imputing long-range sequences. In this paper, we take a non-autoregressive approach and propose …

2019-01-30abs ↗pdf ↗

Representation and learning of long-range dependencies is a central challenge confronted in modern applications of machine learning to sequence data. Yet despite the prominence of this issue, the basic problem of measuring long-range dependence, either in a given data source or as represented in a trained deep model, r…

2019-04-08abs ↗pdf ↗

Reinforcement learning after next-token prediction aids in learning from diverse sequence lengths.

problem Learning from sequences of varying lengths and complexity.
method Introducing a framework to study reinforcement learning with autoregressive transformers, focusing on next-token prediction and mixture distributions of short and long sequences.
result Reinforcement learning after next-token prediction enables autoregressive transformers to generalize from long sequences, even when they are rare.

Despite recent advances in training recurrent neural networks (RNNs), capturing long-term dependencies in sequences remains a fundamental challenge. Most approaches use backpropagation through time (BPTT), which is difficult to scale to very long sequences. This paper proposes a simple method that improves the ability …

2018-03-01abs ↗pdf ↗

Several machine learning problems arising in natural language processing can be modeled as a sequence labeling problem. We provide Gaussian process models based on pseudo-likelihood approximation to perform sequence labeling. Gaussian processes (GPs) provide a Bayesian approach to learning in a kernel based framework. …

2014-12-25abs ↗pdf ↗

Hrrformer uses HRR to speed up self-attention for long sequences.

problem Infeasibility of using transformers with very long sequence lengths.
method Re-cast self-attention using Holographic Reduced Representations (HRR).
result Achieves near state-of-the-art accuracy with O(THlogH)\mathcal{O}(T H \log H) time complexity and O(TH)\mathcal{O}(T H) space complexity.

New method improves deep learning model robustness and accuracy for long sequences.

problem Challenges in learning long-range sequence tasks using state-space models.
method Proposes a perturb-then-diagonalize (PTD) methodology to address ill-posed diagonalization problems in SSMs.
result Demonstrates improved robustness and accuracy of S5-PTD model on Long-Range Arena benchmark.

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.

AverageTime uses simple averaging to enhance long-term time series forecasting.

problem Long-term time series forecasting with improved intra-sequence and cross-channel dependencies.
method Proposes AverageTime, a simple, efficient, and scalable forecasting model that reframes channel extraction as a stackable architecture.
result AverageTime surpasses state-of-the-art models in forecasting performance with near-linear complexity.

TRM improves long-horizon LLM RL by masking divergent sequences.

problem Long-horizon reinforcement learning with LLMs suffers from off-policy mismatch and approximation errors.
method Derives and applies trust region bounds to control divergence, proposing Trust Region Masking.
result First non-vacuous monotonic improvement guarantees for long-horizon LLM-RL.

Transformers are powerful sequence models, but require time and memory that grows quadratically with the sequence length. In this paper we introduce sparse factorizations of the attention matrix which reduce this to O(nn)O(n \sqrt{n}). We also introduce a) a variation on architecture and initialization to train deeper net…

2019-04-23abs ↗pdf ↗

TRM improves long-horizon reinforcement learning for LLMs by masking divergent sequences.

problem Long-horizon reinforcement learning for LLMs suffers from off-policy mismatch and approximation errors.
method Derives and applies trust region bounds to control divergence, proposing Trust Region Masking.
result First non-vacuous monotonic improvement guarantees for long-horizon LLM-RL.

Sequence models assign probabilities to variable-length sequences such as natural language texts. The ability of sequence models to capture temporal dependence can be characterized by the temporal scaling of correlation and mutual information. In this paper, we study the mutual information of recurrent neural networks …

2019-05-10abs ↗pdf ↗

Compact Recurrent Transformer (CRT) improves Transformer efficiency for long sequences.

problem Efficiently scaling Transformer architecture to long sequences with limited compute resources.
method Combines shallow Transformer models with recurrent neural networks and persistent memory.
result CRT achieves comparable or superior performance to full-length Transformers with shorter segments and reduced FLOPs.

Variable order sequence modeling is an important problem in artificial and natural intelligence. While overcomplete Hidden Markov Models (HMMs), in theory, have the capacity to represent long-term temporal structure, they often fail to learn and converge to local minima. We show that by constraining HMMs with a simple …

2019-05-01abs ↗pdf ↗

In this paper we construct Cech cohomology groups that form a Gysin-type long exact sequence for principal torus bundles. This sequence is modeled on a de Rham cohomology sequence published in earlier work by Bouwknegt, Hannabuss and Mathai, which was developed to compute the global properties of T-duality in the prese…

2011-09-26abs ↗pdf ↗

Study compares LSTM, Transformer, and Mamba for bladder cancer recurrence analysis.

problem Complex time-dependent data in bladder cancer recurrence analysis.
method Evaluation of LSTM, Transformer, and Mamba models using Cox proportional hazards model.
result LSTM-Cox model outperforms Transformer-Cox and Mamba-Cox models in prediction accuracy.

Large Transformer models routinely achieve state-of-the-art results on a number of tasks but training these models can be prohibitively costly, especially on long sequences. We introduce two techniques to improve the efficiency of Transformers. For one, we replace dot-product attention by one that uses locality-sensiti…

2020-01-13abs ↗pdf ↗

KEDformer improves long-term time series forecasting with seasonal-trend decomposition.

problem Accurate long-term predictions in energy, finance, and meteorology.
method Knowledge extraction-driven framework integrating seasonal-trend decomposition.
result KEDformer enhances model's ability to capture short-term and long-term patterns.

Global Memory Augmentation (GMAT) improves Transformer performance on long documents.

problem Large memory requirements of Transformer pairwise dot-product attention for long sequences.
method Integrates a dense global memory of length M into sparse Transformer blocks.
result Significant improvement on various tasks, including synthetic tasks, masked language modeling, and reading comprehension.

Learning to solve sequential tasks with recurrent models requires the ability to memorize long sequences and to extract task-relevant features from them. In this paper, we study the memorization subtask from the point of view of the design and training of recurrent neural networks. We propose a new model, the Linear Me…

2020-01-31abs ↗pdf ↗

New model captures long-range patterns in sequences efficiently.

problem Efficiently capturing long-range patterns in sequential data.
method Inspired by wavelet multiresolution analysis, introduces MultiresLayer with multiresolution convolution.
result State-of-the-art performance on sequence classification and autoregressive density estimation tasks.

Spacetimeformer learns spatiotemporal relationships from data alone.

problem Forecasting multivariate time series with distinct spatial relationships.
method Transformers with dynamic graph connections learning interactions between space, time, and value.
result Competitive results on various time series prediction benchmarks.

Goodwillie's model connects knot spaces to cosimplicial spaces, aiding in knot homotopy computation.

problem Computing the homotopy spectral sequence of the space of long knots.
method Using cosimplicial spaces and Goodwillie's correspondence, computing the first page of the spectral sequence.
result A combinatorial interpretation of differentials in the spectral sequence, via marked graphs.

SSMs have a built-in bias towards low-frequency components, which can be adjusted.

problem Frequency bias in SSMs affects their performance on long-range sequences.
method Proposed two mechanisms to tune frequency bias: scaling initialization or applying a Sobolev-norm-based filter.
result Tuning frequency bias improves SSMs' performance on long-range sequence learning tasks.

D-LinOSS models learn to dissipate energy, improving performance on long-range tasks.

problem Representational limitations of LinOSS models in long-range reasoning.
method Introducing Damped Linear Oscillatory State-Space models (D-LinOSS) that learn to dissipate latent state energy on arbitrary time scales.
result D-LinOSS consistently outperforms previous LinOSS methods on long-range learning tasks, achieving faster convergence and reducing hyperparameter search space.