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

Trend · papers per month

4385128170 · Jun 202019922001200920172026
48 results for contextual embeddings

CAEL-MIPS learns embeddings to improve MIPS for better OPE in contextual bandits.

problem High variance in IPS weighting for OPE in large action spaces.
method Context-Action Embedding Learning (CAEL) for MIPS to minimize MSE.
result CAEL-MIPS outperforms baselines in MSE for OPE in contextual bandits.

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.

SCNode improves node embeddings for GNNs in both homophilic and heterophilic graphs.

problem Challenges in node representation quality and generalization in GNNs, especially in heterophilic graphs.
method SCNode integrates spatial and contextual information to create more discriminative and structurally aware node embeddings.
result SCNode achieves superior performance over conventional GNN models on benchmark datasets.

Study examines biases in clinical word embeddings, revealing performance gaps across groups.

problem Biases in clinical word embeddings leading to performance differences across groups.
method Pretrained BERT models on MIMIC-III, fill-in-the-blank method, fairness evaluation on clinical tasks.
result Classifiers trained from BERT representations exhibit statistically significant differences in performance across groups.

New algorithm tackles dynamic query routing to multiple embedding models.

problem Dynamic query routing to multiple embedding models under adversarial conditions.
method Formalized as adversarial contextual linear bandit with low-rank experts, proposed HPG algorithm.
result HPG algorithm achieves linearized policy regret of ildeO(sMT) ilde{\mathcal O}(s\sqrt{M T}).

New approach combines semi-supervised learning and bandits for better predictions.

problem Online semi-supervised learning with bandit feedback for applications like clinical trials and ad recommendations.
method Adjusted Graph Convolutional Network (GCN) for contextual bandits, with semi-supervised missing rewards imputation.
result Developed multi-GCN embedded contextual bandit algorithms verified on real-world datasets.

This paper explores the complexity of learning representations in contextual linear bandits.

problem Understanding the complexity of representation learning in contextual linear bandits.
method Systematic approach to representation learning in contextual linear bandits, focusing on instance-dependent perspective.
result Representation learning is fundamentally more complex than linear bandits, with some cases being arbitrarily harder.

IITK wins FinSim 2020 task on financial hypernym detection.

problem Classifying financial terms into hypernym concepts in an external ontology.
method Used context-dependent and context-independent word embeddings (Word2vec and BERT) for classification.
result Ranked 1st based on mean rank and accuracy metrics.

Embedding models, which learn latent representations of users and items based on user-item interaction patterns, are a key component of recommendation systems. In many applications, contextual constraints need to be applied to refine recommendations, e.g. when a user specifies a price range or product category filter. …

2019-06-21abs ↗pdf ↗

BERTopic improves financial text analysis with FinTextSim's contextual embeddings.

problem Analyzing financial text data for insights and predictions.
method Integrates BERTopic with FinTextSim for topic modeling and clustering.
result BERTopic performs better with FinTextSim's embeddings, improving topic clarity and reducing misclassification.

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.

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.

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 ↗

New OPE estimator improves offline policy evaluation for large action spaces.

problem Existing OPE estimators fail with large action spaces, leading to extreme bias and variance.
method Proposes a new estimator using marginalized importance weights and action embeddings.
result Empirical performance improvement enables reliable OPE even with many actions.

A new linear contextual bandit algorithm with improved regret bound.

problem Efficiently solving linear contextual bandit problems with reduced regret.
method Proposes a novel estimator embedded with exploration and a self-normalized bound.
result Regret bound matches lower bound of Ω(dT)Ω(\sqrt{dT}) up to logarithmic factors.

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.

Contextualizing financial news improves stock price predictions.

problem Predicting stock prices from financial news requires understanding historical context.
method Proposed a method using a large language model for main articles and a small model for historical context.
result Historical context significantly improves model performance across methods and time horizons.

Improves topic modeling using LLM embeddings and Poisson process.

problem Traditional topic modeling ignores word context; LLMs offer better contextual embeddings.
method Convert documents to word embeddings, model as Poisson process, estimate topics using flexible algorithm.
result Method integrates LLMs without fine-tuning, offers advantages over traditional methods.

Word embedding models offer continuous vector representations that can capture rich contextual semantics based on their word co-occurrence patterns. While these word vectors can provide very effective features used in many NLP tasks such as clustering similar words and inferring learning relationships, many challenges …

2017-02-24abs ↗pdf ↗

Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…

2016-11-29abs ↗pdf ↗

We consider the problem of developing suitable learning representations (embeddings) for library packages that capture semantic similarity among libraries. Such representations are known to improve the performance of downstream learning tasks (e.g. classification) or applications such as contextual search and analogica…

2019-03-27abs ↗pdf ↗

MBExplainer provides explanations for models combining graph embeddings and tabular features.

problem Explaining models using a mix of graph embeddings and tabular features.
method Model-agnostic approach using Shapley values and Monte Carlo Tree Search.
result MBExplainer efficiently finds human-readable explanations for model predictions.

GICDM corrects hubness in embedding spaces for better generative model evaluation.

problem Hubness phenomenon distorts distances in high-dimensional embedding spaces.
method Generative ICDM (GICDM) using multi-scale extension to correct neighborhood estimation.
result GICDM resolves hubness-induced failures and improves metric behavior.

Paper introduces G-LowTESTR for efficient tensor bandits.

problem Efficient decision-making in multi-dimensional data with non-linear reward functions.
method Generalized low-rank tensor contextual bandits model and G-LowTESTR algorithm.
result G-LowTESTR achieves superior regret bound compared to vectorization and matricization methods.

Contextual bandit learning is an increasingly popular approach to optimizing recommender systems via user feedback, but can be slow to converge in practice due to the need for exploring a large feature space. In this paper, we propose a coarse-to-fine hierarchical approach for encoding prior knowledge that drastically …

2012-06-27abs ↗pdf ↗

Model predicts political ideology using context vectors to mitigate bias and scarcity.

problem Scarcity and selection bias in political ideology prediction.
method Proposes a statistical model decomposing embeddings into context and position vectors, training an end-to-end model for deployment.
result Model can predict ideological labels even with minimal biased data, outperforming state-of-the-art methods.

A framework converts spatial data into embeddings for insurance risk modelling.

problem Improving underwriting precision and risk management in insurance with spatial data.
method Multi-view contrastive learning framework for generating spatial embeddings.
result Spatial embeddings consistently improve predictive accuracy across various models.

SADCBO optimizes contextual variables by balancing relevance and cost.

problem Optimizing contextual variables with varying costs and unknown relevance.
method Adaptive selection of relevant contextual variables using sensitivity analysis and early stopping.
result Consistent improvement in optimization across various examples.