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

Trend · papers per month

68136203271 · Jun 202019922001200920172026
48 results for context embeddings

Word embeddings are a powerful approach for capturing semantic similarity among terms in a vocabulary. In this paper, we develop exponential family embeddings, a class of methods that extends the idea of word embeddings to other types of high-dimensional data. As examples, we studied neural data with real-valued observ…

2016-08-02abs ↗pdf ↗

Low dimensional embeddings that capture the main variations of interest in collections of data are important for many applications. One way to construct these embeddings is to acquire estimates of similarity from the crowd. However, similarity is a multi-dimensional concept that varies from individual to individual. Ex…

2017-09-22abs ↗pdf ↗

With a simple architecture and the ability to learn meaningful word embeddings efficiently from texts containing billions of words, word2vec remains one of the most popular neural language models used today. However, as only a single embedding is learned for every word in the vocabulary, the model fails to optimally re…

2017-06-08abs ↗pdf ↗

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.

Unsupervised model learns word and context embeddings from character sequences.

problem Learning meaningful word and context embeddings from unlabeled data.
method Character-aware neural architecture that jointly learns word and context embeddings.
result Compact encoders achieve high performance in downstream tasks.

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.

We break down transformer embeddings into interpretable components revealing hidden geometric structures.

problem Understanding the hidden geometry and interpretability of transformer models.
method Decomposed transformer embeddings into position, context, and residual components.
result Pervasive mathematical structure in transformer embeddings, including position and context vectors.

This paper improves continuous adversarial training for LLMs using in-context learning theory.

problem Efficiently defending large language models (LLMs) against jailbreak attacks.
method The paper presents a theoretical analysis of continuous adversarial training (CAT) for LLMs based on in-context learning (ICL) theory, proving a robust generalization bound and proposing an improved regularization term.
result The robust generalization bound explains why CAT can defend against jailbreak prompts and shows that LLM robustness is related to embedding matrix singular values.

We propose a principle for exploring context in machine learning models. Starting with a simple assumption that each observation may or may not depend on its context, a conditional probability distribution is decomposed into two parts: context-free and context-sensitive. Then by employing the log-linear word production…

2019-01-10abs ↗pdf ↗

CADE learns dual node representations for better generalization.

problem Transductive graph embeddings cannot generalize to unseen nodes or across different graphs.
method CADE combines real-time neighborhoods with neighbor-attentioned representation, preserving known node memory.
result CADE outperforms state-of-the-art methods in generalization and context-awareness.

This paper takes a step towards theoretical analysis of the relationship between word embeddings and context embeddings in models such as word2vec. We start from basic probabilistic assumptions on the nature of word vectors, context vectors, and text generation. These assumptions are well supported either empirically o…

2019-02-26abs ↗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 ↗

A new model learns demand patterns from data, reducing complexity and improving accuracy.

problem Forecasting short-term demand from spatiotemporal data with complex patterns.
method Temporal-Guided Network (TGNet) using graph networks and temporal-guided embedding.
result TGNet achieves competitive performance with fewer parameters compared to state-of-the-art models.

We present a probabilistic language model for time-stamped text data which tracks the semantic evolution of individual words over time. The model represents words and contexts by latent trajectories in an embedding space. At each moment in time, the embedding vectors are inferred from a probabilistic version of word2ve…

2017-02-27abs ↗pdf ↗

A model for POI recommendation using relation embedding.

problem Challenges in POI recommendation due to sparse user-POI matrix and varying context.
method Translation-based relation embedding using Knowledge Graph Embedding techniques, combined matrix factorization framework.
result Demonstrates effectiveness of the proposed model on real-world datasets.

This research improves graph embeddings by optimizing node sampling with centrality weights.

problem Improving the accuracy and efficiency of graph embeddings using Skip-Gram methods.
method Implemented and analyzed four graph embedding techniques with different centrality-weighted sampling distributions.
result Centrality-weighted sampling leads to improved accuracy and faster learning times.

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 ↗

Integrates contextual constraints into embedding models for better recommendation quality.

problem Contextual constraints lead to incomplete or low-quality recommendations when applied independently.
method Merges constraint application and retrieval into one operation in the embedding space.
result Significant improvements in predictive performance compared to context-aware and standard models.

This paper assesses biases in contextualized word representations.

problem Analyzing biases in contextualized word representations.
method Proposes assessing bias at the contextual word level, capturing contextual effects of bias.
result Demonstrates evidence of bias in contextual word models, including racial bias and exacerbated effects for intersectional minorities.

Paper proposes a new topology for AML analysis using Poincaré embeddings.

problem Complex money laundering schemes and regulatory constraints hinder AML analysis and information sharing.
method Proposes a new topology for AML analysis using Poincaré embeddings.
result Demonstrates improved AML analysis and information sharing through Poincaré embeddings.

The paper introduces a new method for graph embedding using exponential family distributions.

problem Representing networks in a low dimensional latent space for various applications.
method Introduces the exponential family graph embedding model, generalizing random walk-based techniques to exponential family conditional distributions.
result The proposed techniques outperform existing methods in link prediction and node classification tasks.

Paper proves embedding theorem for conformally compact manifolds.

problem Embedding conformally compact manifolds into hyperbolic spaces.
method Proves analogous Nash Embedding Theorem for conformally compact manifolds.
result Conformally compact manifolds can be isometrically embedded into hyperbolic spaces.

Unified framework for word embedding models using noise examples.

problem Improving word embedding models with negative sampling.
method Formulated a Word-Context Classification (WCC) framework that generalizes SkipGram word embedding models.
result The best noise distribution is the data distribution, improving both performance and training speed.

Improved object detection for scientific document images.

problem Current object detectors fail to accurately localize regions in scientific document images.
method Revised R-CNN model with region embedding for fine-grained proposals.
result 17% mAP improvement over standard object detection models.

We find necessary and sufficient conditions for existence of a locally isometric embedding of a vacuum space-time into a conformally-flat 5-space. We explicitly construct such embeddings for any spherically symmetric Lorentzian metric in 3+13+1 dimensions as a hypersurface in R4,1R^{4, 1}. For the Schwarzschild metric the…

2018-12-13abs ↗pdf ↗