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.

169,042 papers · 148 categories

Trend · papers per month

94187281374 · Jun 202019922001200920172026
48 results for continuous attention

Paper extends sparse alternatives to softmax for continuous domains, enabling efficient attention mechanisms.

problem Efficiently assigning zero probability to irrelevant categories in continuous domains.
method Extend alpha-entmax to continuous domains, introducing continuous-domain attention mechanisms.
result Continuous attention allows attending to time intervals and compact regions, improving text classification, machine translation, and visual question answering.

Lipschitz normalization boosts deep attention models, especially for graph neural networks.

problem Gradient explosion in deep graph attention networks leads to poor performance.
method Enforcing Lipschitz continuity by normalizing attention scores.
result Deep GAT models with LipschitzNorm achieve state-of-the-art results for tasks with long-range dependencies.

Bidirectional attention is shown to be equivalent to a continuous bag of words model with mixture-of-experts.

problem Understanding the statistical underpinnings of bidirectional attention.
method Exploring bidirectional attention as a mixture-of-experts model and reparameterizing it.
result Bidirectional attention can be viewed as a continuous bag of words model with mixture-of-experts weights.

The paper shows how continuous attention can lead to better object representations.

problem Learning good representations from data without labeled examples.
method Integrating unsupervised learning and reinforcement learning with intrinsic motivation.
result The proposed algorithm improves object recognition in few-shot settings.

Paper introduces kernel deformed exponential families for sparse continuous attention.

problem Creating efficient attention mechanisms for sparse data.
method Developed kernel deformed exponential families, theoretically and experimentally.
result Kernel deformed exponential families can attend to multiple compact regions of data.

New model recognizes emotions with missing modalities, improving accuracy.

problem Handling missing modalities in emotion recognition.
method Transformer-based architecture with cross-attention and self-attention mechanisms.
result Improvement of 37% in predicting arousal values and 30% in valence values compared to baseline.

This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.

problem Creating flexible continuous distributions with varying support for machine learning applications.
method Defining ΩΩ-regularized prediction maps and Fenchel-Young losses for arbitrary domains, and deriving new types of Gaussians and attention mechanisms.
result Sparse alternatives to continuous distributions, including deformed exponential families and ββ-Gaussians, are introduced.

Transformers can solve complex filtering problems for non-Gaussian signals.

problem Non-linear and non-Markovian filtering problems for conditionally Gaussian signals.
method Continuous-time transformer models called filterformers.
result Filterformers can approximate the conditional law of non-Markovian and conditionally Gaussian signal processes.

GOAT improves attention mechanisms by learning better priors.

problem Standard attention mechanisms use a naive uniform prior, limiting flexibility and generalization.
method GOAT introduces a trainable, continuous prior that replaces the uniform assumption, maintaining compatibility with optimized kernels.
result GOAT avoids representational trade-offs and learns an extrapolatable prior that combines positional flexibility with length generalization.

Single-head attention approximates any function under various norms.

problem Universal approximation of functions using attention mechanisms.
method Interpreting attention as partitioning and summing linear transformations.
result Single-head attention can approximate any continuous function under LL_\infty-norm and Lebesgue integrable functions under LpL_p-norm.

Softmax attention approximates complex functions and subsumes many known universal approximators.

problem Universal approximation of continuous sequence-to-sequence functions.
method Interpolation-based analysis of attention's internal mechanism, showing its ability to approximate ReLU functions.
result Softmax attention is a universal approximator for continuous sequence-to-sequence functions.

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.

Bayesian theory explains abrupt emergence of copy subcircuit in attention.

problem Understanding the abrupt emergence of the copy subcircuit in attention during training.
method Deriving a closed-form posterior over the attention matrix and reducing it to a low-dimensional order parameter space.
result Derive a phase transition in the amount of training data.

Transformers can approximate any sequence-to-sequence function, surprising given their complexity.

problem Understanding the expressive power of Transformer models for sequence-to-sequence functions.
method Established that Transformers are universal approximators of continuous permutation equivariant sequence-to-sequence functions with compact support, and extended this to arbitrary functions using positional encodings.
result Transformers are universal approximators of arbitrary continuous sequence-to-sequence functions on a compact domain.

Transformers can predict new tokens based on any number of context tokens, approximating continuous mappings with fixed resources.

problem Handling an arbitrarily large number of context tokens in transformers.
method Mathematical analysis of transformer's expressivity using Wasserstein distance and continuous mappings.
result Deep transformers are universal and can approximate continuous in-context mappings to arbitrary precision, uniformly over compact token domains.

Hybrid model predicts flow and pressure in water systems.

problem Predicting flow and pressure in water distribution systems with complex spatial-temporal correlations.
method Hybrid dual-stage spatial-temporal attention-based recurrent neural networks (hDS-RNN).
result Our model outperformed 9 baseline models in flow and pressure series prediction.

SNI framework for mixed-type data imputation interprets and explains missing values.

problem Missing data in mixed-type databases skew analysis results.
method SNI couples statistical priors with neural attention to impute and explain missing values.
result SNI provides interpretable feature dependency diagnostics and soft regularization of attention.

SE(3)-Transformers maintain equivariance for 3D data under rotations and translations.

problem Ensuring stable and predictable performance in 3D data under transformations.
method Introducing a self-attention module that is equivariant under continuous 3D roto-translations.
result The SE(3)-Transformer outperforms non-equivariant and non-attention models on real-world datasets.

Machine learning models that can exploit the inherent structure in data have gained prominence. In particular, there is a surge in deep learning solutions for graph-structured data, due to its wide-spread applicability in several fields. Graph attention networks (GAT), a recent addition to the broad class of feature le…

2018-11-01abs ↗pdf ↗

New analysis shows RPE-based Transformers can't approximate all functions.

problem Understanding the limitations of RPE-based Transformers in approximating continuous functions.
method Mathematical analysis and development of a novel attention module (URPE) to overcome limitations.
result RPE-based Transformers can't approximate all continuous sequence-to-sequence functions, even with depth and width.

Study reveals attention mechanism's similarity computation parallels traditional machine learning.

problem Understanding the essence and principles of attention mechanism in deep learning.
method Examined classic metrics and vector space properties in manifold learning, clustering, and supervised learning to identify key characteristics of similarity computation and information propagation.
result Self-attention mechanism in deep learning adheres to the same principles but operates more flexibly and adaptively.

We examine the dependence of the deformation obtained by bending quasi-Fuchsian structures on the bending lamination. We show that when we consider bending quasi-Fuchsian structures on a closed surface, the conditions obtained by Epstein and Marden to relate weak convergence of arbitrary laminations to the convergence …

1998-10-27abs ↗pdf ↗

The paper identifies patterns in language model weights used for memorizing paragraphs.

problem Locating the specific mechanisms and weights used by language models to memorize paragraphs.
method Examined gradients and attention patterns in language models to identify memorized paragraphs.
result Gradients of memorized paragraphs have a distinguishable spatial pattern, and localized attention heads are involved in paragraph memorization.

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.

New method embeds time span into self-attention for better temporal pattern recognition.

problem Capturing temporal patterns in event sequences without recurrent networks.
method Functional time representation learning with Bochner's and Mercer's Theorems.
result Proposed methods outperform baseline models in various continuous-time event sequence prediction tasks.

DAFT models attention as a dynamical system to make neural networks more interpretable.

problem Uninterpretable features learned by neural networks without human priors.
method DAFT models attention as a continuous dynamical system using neural ODEs.
result DAFT reduces the number of reasoning steps while maintaining similar performance.

Zero-Copy Architecture Detects Cross-Company Financial Signals Instantly.

problem Financial models miss cross-company disruptions due to static data.
method Heterogeneous Rust-Python streaming architecture that maps cross-company attention as a continuous-time graph.
result Zero-copy parsing and inference process delivers real-time cross-company signal detection.

Graph embedding methods represent nodes in a continuous vector space, preserving information from the graph (e.g. by sampling random walks). There are many hyper-parameters to these methods (such as random walk length) which have to be manually tuned for every graph. In this paper, we replace random walk hyper-paramete…

2017-10-26abs ↗pdf ↗

New method tackles anomaly detection in video surveillance using continual learning.

problem Challenges in continual learning for high-dimensional applications like video surveillance.
method Transfer learning and continual learning for online anomaly detection.
result Significantly reduces training complexity and continual learning from recent data.

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.

Bitcoins and Blockchain technologies are attracting the attention of different scientific communities. In addition, their widespread industrial applications and the continuous introduction of cryptocurrencies are also stimulating the attention of the public opinion. The underlying structure of these technologies consti…

2018-04-06abs ↗pdf ↗

A new model tackles language generation issues by using discrete variational attention.

problem Information under-representation and posterior collapse in variational autoencoders.
method Proposes a discrete variational attention model with categorical distribution over attention mechanism.
result Enhances latent space for language generation and avoids posterior collapse.