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

Trend · papers per month

4998146195 · Jun 202019922001200920172026
48 results for contextual attention

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.

Transformers model contextual relations using probabilistic measures, revealing their expressive power.

problem Lack of clear understanding of Transformer's ability to model contextual relations.
method Introduced a measure-theoretic framework connecting softmax attention and entropy-regularized optimal transport.
result Transformer architectures can approximate arbitrary contextual relations, and the choice of normalization affects how these relations are represented.

Study on how attention in prompt-tuning affects large language models.

problem Limited theoretical understanding of prompt-tuning and attention in LLMs.
method Exploration of prompt-tuning for one-layer attention architectures, contextual mixture-models, and self-contained prompt-attention model.
result Softmax-prompt-attention is more expressive than self-attention and linear-prompt-attention under contextual data model.

Graph attention is not always beneficial; conditions for perfect node classification are identified.

problem Understanding when graph attention mechanisms improve node classification performance.
method Theoretical analysis using Contextual Stochastic Block Models (CSBMs).
result Graph attention mechanisms are more effective when structure noise exceeds feature noise, and simpler graph convolution operations are better when feature noise predominates.

Multi-head attention mechanism is capable of learning various representations from sequential data while paying attention to different subsequences, e.g., word-pieces or syllables in a spoken word. From the subsequences, it retrieves richer information than a single-head attention which only summarizes the whole sequen…

2019-10-10abs ↗pdf ↗

CATA++ improves scientific article recommendations by learning latent spaces with attention.

problem Natural data sparsity limits MF performance in recommender systems.
method CATA++ uses a dual autoencoder with attention to learn latent spaces from content and contextual information.
result CATA++ significantly improves MF performance on real-world datasets.

MEANTIME improves sequential recommendation by using multi-temporal embeddings and attention mechanisms.

problem Limited use of timestamp information and information bottleneck in sequential recommendation models.
method MEANTIME employs multiple types of temporal embeddings and attention mechanisms to capture diverse patterns from user behavior sequences.
result MEANTIME outperforms state-of-the-art sequential recommendation methods.

SLiCE learns contextual node embeddings for link prediction in heterogeneous networks.

problem Link prediction requires specific contextual information not captured by static node embeddings.
method Self-supervised pre-training with localized attention mechanisms.
result SLiCE significantly outperforms existing methods on link prediction tasks.

We consider a novel formulation of the multi-armed bandit model, which we call the contextual bandit with restricted context, where only a limited number of features can be accessed by the learner at every iteration. This novel formulation is motivated by different online problems arising in clinical trials, recommende…

2017-05-10abs ↗pdf ↗

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 ↗

This paper introduces a new task to better understand Transformers in quantitative contexts.

problem Understanding Transformers in high-stakes quantitative and scientific applications.
method Introduces a novel contextual counting task and analyzes it with causal and non-causal Transformer architectures.
result Causal attention is better suited for the contextual counting task, and no positional embeddings lead to the best accuracy.

CRAUM-Net improves salient object detection with context and uncertainty modeling.

problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.

Transformers simplify modeling of small longitudinal cohort data by reducing parameters and incorporating attention mechanisms.

problem Challenges in modeling longitudinal cohort data due to complex temporal dependencies and large dataset requirements.
method Simplified transformer architecture with attention mechanism, autoregressive model, and kernel-based temporal decay.
result The approach recovers contextual dependencies even with small datasets, identifying temporal patterns in stress and mental health.

SARD improves deep learning clinical prediction performance.

problem Deep learning models struggle to match linear models in healthcare predictions.
method Reverse Distillation to initialize deep models, combined with contextual and temporal embeddings.
result SARD outperforms state-of-the-art methods on clinical prediction outcomes.

There are two variants of the classical multi-armed bandit (MAB) problem that have received considerable attention from machine learning researchers in recent years: contextual bandits and simple regret minimization. Contextual bandits are a sub-class of MABs where, at every time step, the learner has access to side in…

2018-10-17abs ↗pdf ↗

RKT model improves knowledge tracing by considering exercise relations and student forget behavior.

problem Traditional KT models fail to consider both exercise relations and student forget behavior.
method RKT model uses relation-aware self-attention to incorporate exercise relations and student forget behavior.
result RKT model outperforms state-of-the-art KT methods on real-world datasets.

FGTSVA improves Thompson Sampling for contextual bandits with optimal variance-aware regret.

problem Optimizing regret bounds for Thompson Sampling in contextual bandits.
method Developed FGTSVA, a variance-aware Thompson Sampling algorithm for contextual bandits with a new decoupling coefficient.
result Achieved optimal regret bound of ildeO(dclogFt=1Tσt2+dc) ilde{O}(\sqrt{\mathrm{dc}\cdot\log|\mathcal{F}|\sum_{t=1}^Tσ_t^2}+\mathrm{dc}).

This work bridges federated learning and contextual bandits, enhancing FL's utility.

problem Limited use of federated learning in contextual bandits despite its potential.
method Proposes FedIGW, a novel federated contextual bandits design that leverages regression-based algorithms and integrates various FL components.
result FedIGW better harnesses FL innovations and provides flexible, modular, and seamless integration of FL elements.

Generative adversarial networks have been successfully applied to inpainting in natural images. However, the current state-of-the-art models have not yet been widely adopted in the medical imaging domain. In this paper, we investigate the performance of three recently published deep learning based inpainting models: co…

2018-08-29abs ↗pdf ↗

Unified framework for non-linear attention using modern Hopfield networks.

problem Improving transformer model's understanding of complex relationships and efficiency.
method Proposes an energy functional based on Modern Hopfield Networks (MNH) to unify linear and non-linear attention mechanisms.
result Context wells encapsulate contextual relationships among tokens, offering a richer representation of non-linear data.

In automatic speech recognition (ASR) what a user says depends on the particular context she is in. Typically, this context is represented as a set of word n-grams. In this work, we present a novel, all-neural, end-to-end (E2E) ASR sys- tem that utilizes such context. Our approach, which we re- fer to as Contextual Lis…

2018-08-07abs ↗pdf ↗

Text segmentation plays an important role in various Natural Language Processing (NLP) tasks like summarization, context understanding, document indexing and document noise removal. Previous methods for this task require manual feature engineering, huge memory requirements and large execution times. To the best of our …

2018-08-29abs ↗pdf ↗

The paper provides bounds on the CDF of a variable under nonstationary conditions.

problem Estimating the complete distribution of a random variable under nonstationary conditions.
method Time-uniform and value-uniform bounds on the CDF of the running averaged conditional distribution.
result Presented computationally efficient bounds that are always valid and sometimes trivial.

In the classical contextual bandits problem, in each round tt, a learner observes some context cc, chooses some action ii to perform, and receives some reward ri,t(c)r_{i,t}(c). We consider the variant of this problem where in addition to receiving the reward ri,t(c)r_{i,t}(c), the learner also learns the values of $r_{i,t}(c…

2018-09-25abs ↗pdf ↗

Attention layers are sensitive to single words, improving generalization over random features.

problem Understanding why attention layers are effective in NLP tasks.
method Study of word sensitivity in random features using BERT-Base word embeddings.
result Attention layers have high word sensitivity, improving generalization over random features.

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.

Efficient algorithm for CLSBM reduces misclassification rate.

problem Reducing misclassification in community detection for CLSBM.
method Spectral-based algorithm for CLSBM, with theoretical misclassification bounds.
result Upper bound on misclassification rate of efficient algorithm.

Unified framework for sequence models using test-time regression.

problem Designing efficient sequence models with associative memory.
method Formalizing associative recall as regression over input tokens, deriving various sequence models.
result Clarifies the effectiveness of query-key normalization in softmax attention and offers new generalizations.

Outlier detection plays an essential role in many data-driven applications to identify isolated instances that are different from the majority. While many statistical learning and data mining techniques have been used for developing more effective outlier detection algorithms, the interpretation of detected outliers do…

2017-11-28abs ↗pdf ↗

Paper proposes a risk-aware decision-making framework for real-world sequential decisions.

problem Real-world sequential decision-making problems often have critical constraints that learning solutions often neglect.
method Actor multi-critic architecture with risk characterization.
result Our approach consistently satisfies system constraints with minimal performance toll.

LNUCB-TA improves MAB performance by dynamically adjusting exploration rates and recognizing spatiotemporal patterns.

problem Suboptimal performance in environments with rapidly changing reward structures and static exploration rates.
method Hybrid model combining linear and nonlinear estimation, with adaptive k-NN for temporal attention.
result Significantly outperforms state-of-the-art algorithms in cumulative and mean reward, convergence, and robustness.

A new approach to hedging using contextual bandit models outperforms traditional methods.

problem Effective replication of financial contracts in incomplete markets with low transaction costs.
method Viewing hedging as a contextual kk-armed bandit problem, using reinforcement learning.
result The contextual bandit model provides more accurate and sample-efficient hedging than QQ-learning.