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,051 papers · 148 categories

Trend · papers per month

4283125166 · Jun 202019922001200920182026
48 results for class-aware attention

This work improves deep metric learning by online soft mining and class-aware attention.

problem Slow convergence and poor performance due to a large fraction of trivial samples in deep metric learning.
method Online Soft Mining (OSM) and Class-Aware Attention (CAA) to select and focus on relevant samples.
result Significantly outperforms state-of-the-art methods on fine-grained visual categorization and video-based person re-identification datasets.

SRP efficiently learns class-aware embeddings for large datasets.

problem High computational complexity in supervised dimensionality reduction for large datasets.
method Supervised random projections (SRP) for direct class-aware embedding learning.
result SRP achieves 1-2 orders of magnitude better computational performance.

FSD-CAP improves graph feature imputation under high missing rates.

problem Challenges in imputing missing node features in graphs, especially under high missing rates.
method Two-stage framework: subgraph expansion, fractional diffusion, class-aware propagation.
result Significantly improved imputation quality compared to existing methods, achieving high accuracy on benchmark datasets.

Proposes DFDG for robust domain generalization without source domain labels.

problem Robustness of deep learning models in real-world applications where train and test distributions differ.
method Model-agnostic, class-aware alignment of class relationships through saliency maps.
result Competitive performance on time series sensor and image classification datasets.

DMRL improves UDA by mixing source and target samples and enriching latent space structures.

problem Lack of class-aware information and insufficient samples for domain-invariant feature extraction.
method Dual Mixup Regularized Learning (DMRL) that conducts category and domain mixup regularizations.
result DMRL achieves state-of-the-art performance on domain adaptation benchmarks.

Class labels have been empirically shown useful in improving the sample quality of generative adversarial nets (GANs). In this paper, we mathematically study the properties of the current variants of GANs that make use of class label information. With class aware gradient and cross-entropy decomposition, we reveal how …

2017-03-06abs ↗pdf ↗

RegMixMatch optimizes Mixup for semi-supervised learning by integrating high- and low-confidence samples.

problem Mixup degrades SSL performance by compromising artificial labels purity.
method RegMixMatch integrates high- and low-confidence samples, uses class-aware Mixup, and mitigates confirmation bias.
result RegMixMatch achieves state-of-the-art performance in SSL benchmarks.

Study reveals class-dependent effects in perturbation-based feature attribution metrics for time series classification.

problem Varying effectiveness of perturbation-based metrics across different classes in time series models.
method Systematic empirical analysis across multiple datasets, model architectures, and perturbation strategies.
result Perturbation-based metrics show varying effectiveness across classes, with some metrics performing better for certain classes.

DeepFRC learns both alignment and classification of functional data in one model.

problem Phase variability in functional data obscures underlying patterns and degrades model performance.
method End-to-end deep learning framework that combines diffeomorphic warping functions and a classifier.
result DeepFRC outperforms state-of-the-art methods in both alignment quality and classification accuracy.

New benchmarks improve model performance by accounting for isomorphism classes in multi-relational datasets.

problem Synthetic multi-relational datasets lack isomorphism class awareness, leading to overestimation of model performance.
method Proposed isomorphism-aware synthetic benchmarks and a prioritisation scheme to improve model performance and stability.
result Isomorphism classes can be utilised to improve model performance, stability during training, and reduce training time.

Interpretable representations improve explainable AI by translating complex data into understandable concepts.

problem Many explainers use interpretable representations but overlook their full potential and assumptions.
method An in-depth analysis of interpretable representations for tabular, image, and text data, identifying strengths, weaknesses, and desiderata.
result Linear model quantifies interpretable concepts' influence on black-box predictions, revealing their explanatory properties and manipulability.

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.

New approach improves multi-head attention by making heads less similar.

problem Multi-head attention can lead to similar features, reducing model expressiveness.
method Proposes a non-parametric approach using Bayesian techniques to make heads repel each other.
result Improves feature diversity, leading to better representations and performance.

Aligns attention distributions for improved accuracy and robustness.

problem Improving the accuracy and robustness of neural networks using attention mechanisms.
method Alignment attention that encourages key and query distributions to match within each head.
result Alignment attention leads to better accuracy, uncertainty estimation, and robustness across various tasks.

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.

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.

Study examines asset pricing using various attention models, finding global self-attention and sliding window sparse attention models perform well.

problem Traditional asset pricing models miss temporal dependency and short memory issues.
method Investigates RNN attention models with various attention mechanisms for large-cap US stocks.
result Global self-attention and sliding window sparse attention models outperform in deriving returns and hedging risks, especially during the pandemic.

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.

Gated attention improves performance by using a hierarchical mixture of experts.

problem Improving performance of self-attention mechanisms in Transformers.
method Rigorously show that gated attention can be modeled as a hierarchical mixture of experts, providing a theoretical justification for its benefits.
result Gated attention is more sample-efficient than multi-head self-attention, requiring fewer data points to achieve the same estimation error.

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.

Multi-head attention outperforms single-head in in-context linear regression tasks.

problem Comparing performance of transformer with single-/multi-head attention in in-context learning.
method Theoretical analysis of performance of transformers with different attention mechanisms in linear regression tasks.
result Multi-head attention with a substantial embedding dimension outperforms single-head attention in in-context linear regression tasks.

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.

SympFormer accelerates attention blocks using inertial dynamics on density spaces.

problem Improving the efficiency of self-attention blocks in Transformers.
method Introduced accelerated attention blocks derived from inertial Nesterov dynamics on density spaces.
result Accelerated attention blocks converge faster than classical blocks while preserving oracle calls.

New approach improves linear-time attention for language models.

problem Challenges of quadratic attention in long-sequence modelling, especially for discrete data.
method Reinterpreting linear attention through latent probabilistic graphical models, introducing asymmetric structure and recurrent parameterisation.
result Our model achieves competitive performance and outperforms existing linear attention variants on language modelling benchmarks.

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.

Attention weights may not accurately highlight important parts due to combinatorial shortcuts.

problem Inaccurate interpretation of attention weights in models.
method Theoretical analysis and design of experiments to show combinatorial shortcuts. Proposed two methods to mitigate this issue.
result Proposed methods improve the interpretability of attention mechanisms.

Active-memory mechanisms can replace self-attention in Transformers, but optimal results often require both.

problem Replacing self-attention with active-memory mechanisms in Transformers.
method Evaluation of various active-memory mechanisms in a Transformer model.
result Active-memory mechanisms can achieve comparable results to self-attention for language modeling, but optimal results are often achieved by combining both mechanisms.

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.

Self-supervised approach improves reinforcement learning with attention.

problem Previous attempts at integrating attention with reinforcement learning failed to produce significant improvements.
method Utilizes Markovian properties of state input and multiple simultaneous foci of attention.
result New state-of-the-art results in the Arcade Learning Environment.

Combining visual attention with deep reinforcement learning improves sample efficiency.

problem Improving sample efficiency in deep reinforcement learning.
method Visual selective attention mechanism implemented using optical flow and batch normalization.
result Visual selective attention leads to improvements in sample efficiency on Atari games.

Transformers with linear space and time complexity for accurate attention estimation.

problem Efficiently estimating attention in large-scale tasks without relying on priors.
method Performers use Fast Attention Via positive Orthogonal Random features (FAVOR+) for linear approximation of softmax attention.
result Performers achieve competitive results on various tasks, demonstrating the effectiveness of their attention-learning approach.

Neural attention has become central to many state-of-the-art models in natural language processing and related domains. Attention networks are an easy-to-train and effective method for softly simulating alignment; however, the approach does not marginalize over latent alignments in a probabilistic sense. This property …

2018-07-10abs ↗pdf ↗