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

164328492656 · Jun 202019922001200920172026
48 results for attention computation

Clustered attention improves transformer efficiency for large sequences.

problem Quadratic complexity of transformer attention matrix for large sequences.
method Group queries into clusters, compute attention only for centroids, and use centroids to approximate key/query dot products.
result Linear complexity with respect to sequence length for a fixed number of clusters.

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.

Although deep neural networks generally have fixed network structures, the concept of dynamic mechanism has drawn more and more attention in recent years. Attention mechanisms compute input-dependent dynamic attention weights for aggregating a sequence of hidden states. Dynamic network configuration in convolutional ne…

2019-12-01abs ↗pdf ↗

Quaternion self-attention reduces computational cost and improves performance.

problem Existing quaternion self-attention increases computational cost and diverges attention distributions.
method Proposes a shared-score quaternion self-attention mechanism.
result Reduces score-computation multiplications by 75% and softmax operations from four to one.

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.

Transformer models waste resources on long-context tasks.

problem Redundant attention computations in Transformer models for long-context tasks.
method Reformulate sequence modeling as supervised learning, analyze attention sparsity, formulate attention optimization as linear coding problem, propose Dynamic Group Attention.
result DGA reduces computational costs while maintaining performance.

New interpretation of attention in Transformers and Graph Attention Networks.

problem Understanding and improving attention mechanisms in deep learning models.
method Decomposed attention into a kernel and a normalization term; generalized the kernel function and norm.
result Generalized attention leads to better performance on various tasks.

Analyzes self-attention in recurrent networks, proving it mitigates vanishing gradients.

problem Vanishing gradients in recurrent networks when capturing long-term dependencies.
method Formal analysis of self-attention's effect on gradient propagation, proposing a relevancy screening mechanism.
result Self-attention mitigates vanishing gradients in recurrent networks, providing guarantees.

Skyformer uses Gaussian kernel and Nyström method to speed up self-attention in transformers.

problem High computational cost of self-attention in transformers.
method Replaces softmax with Gaussian kernel and applies Nyström method for matrix approximation.
result Skyformer achieves comparable or better performance with fewer computation resources.

Elliptical Attention improves transformer performance by focusing on contextually relevant features.

problem Transformer models suffer from representation collapse and are vulnerable to contaminated samples.
method Uses Mahalanobis distance to define hyper-ellipsoidal neighborhoods for attention weights.
result Elliptical Attention reduces representation collapse and enhances model robustness.

A brain-inspired spiking Transformer reduces energy consumption and enhances interpretability.

problem Energy inefficiency and lack of interpretability in Transformer models.
method Spiking STDP Transformer using spike-timing-dependent plasticity (STDP) for self-attention.
result Achieves 94.35% and 78.08% accuracy on CIFAR-10 and CIFAR-100 datasets respectively, with 88.47% energy reduction.

FastGAT reduces GNN computation time by 10x using graph sparsification.

problem High computational burden in attention-based GNNs.
method Spectral sparsification to generate optimal graph pruning.
result Per-epoch time is almost linear in graph nodes, reducing computational time by up to 10x.

This paper proposes an attention module augmented relational network called SARN(Sequential Attention Relational Network) that can carry out relational reasoning by extracting reference objects and making efficient pairing between objects. SARN greatly reduces the computational and memory requirements of the relational…

2018-11-01abs ↗pdf ↗

SpGAT learns graph representations using spectral attention for efficiency.

problem Efficiently capturing global graph patterns with minimal parameters.
method Introduces Spectral Graph Attention Network (SpGAT) using spectral domain attention mechanisms and a fast Chebychev approximation.
result SpGAT achieves better global pattern recognition with fewer parameters compared to GAT.

This research integrates attention into XAI frameworks for better model explanations.

problem Improving the interpretability of transformer models.
method Developed two novel explanation methods: Shapley value decomposition and token-level directional derivatives.
result Attention weights can be meaningfully incorporated into XAI frameworks, enhancing transformer explainability.

Efficient sparse attention reduces self-attention complexity and improves model performance.

problem Quadratic compute and memory requirements of self-attention for long sequences.
method Content-based sparse attention with dynamic routing module.
result Routing Transformer achieves state-of-the-art performance on various benchmarks.

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.

Centroid Transformers reduce memory and computation by summarizing inputs into centroids.

problem Efficiently summarize inputs with reduced memory and computation.
method Generalizes self-attention to map N inputs to M centroids (M ≤ N), reducing complexity.
result Centroid Transformers reduce memory and computation while preserving key information.

Neural networks using transformer-based architectures have recently demonstrated great power and flexibility in modeling sequences of many types. One of the core components of transformer networks is the attention layer, which allows contextual information to be exchanged among sequence elements. While many of the prev…

2019-07-15abs ↗pdf ↗

New algorithms speed up attention computation for large models by limiting matrix entries.

problem Efficiently compute attention matrices for large language models.
method Developed algorithms that exploit the structure of the attention matrix AA to achieve subquadratic time complexity.
result There is a sharp transition at B=Θ(logn)B = Θ(\sqrt{\log n}) for efficient computation of attention matrices.

Deep neural network models have recently draw lots of attention, as it consistently produce impressive results in many computer vision tasks such as image classification, object detection, etc. However, interpreting such model and show the reason why it performs quite well becomes a challenging question. In this paper,…

2019-01-20abs ↗pdf ↗

Study integrates attentional and spacing factors to improve category learning models.

problem Understanding the impact of training sequences on category learning.
method Introduced a novel integration of attentional factors and spacing into logistic knowledge tracing models.
result Enhanced model predicts students' learning outcomes better than existing models.

Attention mechanisms in deep neural networks have achieved excellent performance on sequence-prediction tasks. Here, we show that these recently-proposed attention-based mechanisms---in particular, the Transformer with its parallelizable self-attention layers, and the Memory Fusion Network with attention across modalit…

2019-07-08abs ↗pdf ↗

Attention mechanisms and non-local mean operations in general are key ingredients in many state-of-the-art deep learning techniques. In particular, the Transformer model based on multi-head self-attention has recently achieved great success in natural language processing and computer vision. However, the vanilla algori…

2019-05-24abs ↗pdf ↗

Kernel PCA explains self-attention mechanisms in deep learning models.

problem Understanding and explaining self-attention mechanisms in deep learning models.
method Deriving self-attention from kernel principal component analysis (kernel PCA).
result RPC-Attention, a robust attention mechanism, outperforms softmax attention in various tasks.

LUNA improves linear attention for long sequences without sacrificing accuracy.

problem Quadratic computational cost of softmax attention in long-sequence domains.
method LUNA learns a learnable kernel feature map to reduce attention cost to linear while maintaining accuracy.
result LUNA achieves state-of-the-art performance on the LRA and excels at post-hoc conversion.

This work generalizes transformer attention to capture higher-order correlations efficiently.

problem Detecting triple-wise connections that were impossible for transformers.
method Developed a generalized attention scheme using Kronecker computation, showing near-linear time algorithms for bounded entries.
result A near-linear time algorithm for generalized attention computation in the bounded-entry setting.

LARF improves random forests with attention mechanisms and contamination models.

problem Improving accuracy in classification tasks with random forests.
method Introduces a two-level attention mechanism and uses a mixture of contamination models.
result Significantly improved classification performance on various datasets.

LoLCATs improves linearized LLM quality with less memory and compute.

problem Linearizing large language models (LLMs) often degrades model quality and requires expensive training.
method Two-step method: attention transfer and low-rank adaptation.
result Significant improvement in linearizing quality with 20+ points on 5-shot MMLU.

A study on optimizing self-attention in tabular data using Optimal Transport.

problem Improving efficiency and accuracy of self-attention in tabular classification tasks.
method Developed an OT-based algorithm to generate class-specific dummy Gaussian distributions and train an MLP.
result Achieved comparable accuracy to Transformers with reduced computational cost and efficiency.

Sparse Transformers can approximate dense Transformers with only O(n) connections.

problem Can sparse Transformers approximate arbitrary sequence-to-sequence functions?
method Proposed sufficient conditions for universal approximation and proved that sparse Transformers with O(n) connections can approximate dense models.
result Sparse Transformers with O(n) connections can approximate the same function class as dense models with n^2 connections.

We propose a novel self-attention mechanism that can learn its optimal attention span. This allows us to extend significantly the maximum context size used in Transformer, while maintaining control over their memory footprint and computational time. We show the effectiveness of our approach on the task of character lev…

2019-05-19abs ↗pdf ↗

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…

2017-12-14abs ↗pdf ↗

Existing deep architectures cannot operate on very large signals such as megapixel images due to computational and memory constraints. To tackle this limitation, we propose a fully differentiable end-to-end trainable model that samples and processes only a fraction of the full resolution input image. The locations to p…

2019-05-03abs ↗pdf ↗