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

133266399532 · Jun 202019922001200920172026
48 results for context information

A new framework uses directed information to efficiently select context chunks.

problem Efficiently selecting relevant context chunks for query understanding.
method Directed Information γγ-covering framework, formulated as a γγ-cover problem, with a greedy algorithm for context selection.
result The γγ-covering algorithm provides clear advantages in hard-decision regimes like context compression and single-slot prompt selection.

CCM improves context for Meta-RL by contrastive learning.

problem Improving context for Meta-RL to enable task generalization.
method CCM framework using contrastive learning for context encoding and information-gain-based trajectory collection.
result CCM outperforms state-of-the-art algorithms in benchmarks and sparse-reward environments.

Thompson Sampling tackles noisy context in stochastic bandits.

problem Designing an action policy for noisy, corrupted contexts in stochastic bandits.
method Introducing a Thompson Sampling algorithm for Gaussian bandits with Gaussian context noise, adopting an information-theoretic analysis.
result Demonstrates the Bayesian regret of the proposed algorithm concerning the oracle's action policy.

This paper improves context-aware recommender systems by selecting and incorporating relevant low-dimensional contextual information.

problem Generating accurate recommendations is not enough; contextual information can cause issues like battery drain and privacy.
method Developed a feature-selection algorithm based on genetic algorithms to reduce context dimensions while maintaining explainability.
result The approach improves accuracy and transparency in recommendations, outperforming state-of-the-art models.

LLMs generate answers under incomplete context, and their uncertainty should scale with missing information.

problem Evaluating the quality of LLM answers under incomplete context.
method A controlled framework with varying context availability, and two uncertainty measures (sampling-based confidence and response entropy) evaluated on SQuAD.
result Response entropy increases with context removal and explains more variance in accuracy than confidence, suggesting it is a more responsive uncertainty measure.

Proposes a new model for more accurate demand forecasting considering dynamic contextual information.

problem Traditional methods fail to capture spatio-temporal and dynamic contextual dependencies in demand forecasting.
method Integrates temporal, relational, spatial, and dynamic contextual dependencies using a Context Integrated Graph Neural Network (CIGNN).
result CIGNN outperforms state-of-the-art baselines in multi-step ahead demand forecasting.

We present a Bayesian nonparametric framework for multilevel clustering which utilizes group-level context information to simultaneously discover low-dimensional structures of the group contents and partitions groups into clusters. Using the Dirichlet process as the building block, our model constructs a product base-m…

2014-01-09abs ↗pdf ↗

FGN improves Chinese NER by integrating glyph information and interactive context.

problem Chinese named entity recognition is challenging due to the complexity of characters and their glyphs.
method FGN uses a novel CGS-CNN structure to capture glyph and interactive information, and a sliding window method to fuse BERT and glyph representations.
result FGN achieves state-of-the-art performance on four NER datasets, improving over previous methods.

We extend manifold capacity to nonlinear neural representations with contextual information.

problem Efficient processing of information through neural representations.
method Theoretical framework leveraging latent directions in input space related to contextual information.
result Derivation of an exact formula for context-dependent manifold capacity.

LLMs compress financial texts, but distort decision-making.

problem LLMs compress financial texts, altering decision-making.
method Analyzed two diagnostic patterns: decontextualization and model dependency. Proposed Agentic Context Compression.
result LLM-compressed financial texts alter decision-making.

In this work we address the problem of argument search. The purpose of argument search is the distillation of pro and contra arguments for requested topics from large text corpora. In previous works, the usual approach is to use a standard search engine to extract text parts which are relevant to the given topic and su…

2019-05-26abs ↗pdf ↗

Pre-training on different modalities improves Transformer performance in offline reinforcement learning.

problem Improving Transformer-based models for offline reinforcement learning tasks.
method Empirical investigation of pre-training on language and vision data, analysis of internal representations, and fine-tuning with no context.
result Pre-trained Transformers with language data can utilize context-like information to solve reinforcement learning tasks efficiently.

The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.

problem Finding relevant vertices in one graph using another graph's attributes and structure.
method Theoretical and practical exploration of vertex nomination schemes that leverage both content (edge and vertex attributes) and context (network topology).
result Necessary and sufficient conditions for schemes that use both content and context to outperform those using only one.

New estimator uses clustering to improve off-policy evaluation accuracy.

problem Improving off-policy evaluation accuracy when logging and evaluation policies differ.
method Proposes an estimator that shares information across similar contexts using clustering.
result Clustering contexts improves estimation accuracy, especially in deficient information settings.

NOTMAD estimates context-specific Bayesian networks without breaking datasets.

problem Non-convexity of acyclic graphs limits sharing information between context-specific estimators.
method NOTMAD models context-specific Bayesian networks as mixtures of archetypal DAGs, estimating structures and parameters jointly.
result NOTMAD shares information between context-specific acyclic graphs, enabling single-sample resolution.

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.

New DR-IC estimator reduces bias and variance in OPE.

problem Estimating value of a target policy using logged data from a different policy.
method DR-IC estimator that combines parametric reward model and context-based switching rule.
result DR-IC estimator outperforms state-of-the-art OPE algorithms.

We consider a reinforcement learning (RL) setting in which the agent interacts with a sequence of episodic MDPs. At the start of each episode the agent has access to some side-information or context that determines the dynamics of the MDP for that episode. Our setting is motivated by applications in healthcare where ba…

2017-11-15abs ↗pdf ↗

Recent studies have introduced end-to-end TTS, which integrates the production of context and acoustic features in statistical parametric speech synthesis. As a result, a single neural network replaced laborious feature engineering with automated feature learning. However, little is known about what types of context in…

2018-11-04abs ↗pdf ↗

In this paper we propose the multi-objective contextual bandit problem with similarity information. This problem extends the classical contextual bandit problem with similarity information by introducing multiple and possibly conflicting objectives. Since the best arm in each objective can be different given the contex…

2018-03-11abs ↗pdf ↗

In many cases, feature selection is often more complicated than identifying a single subset of input variables that would together explain the output. There may be interactions that depend on contextual information, i.e., variables that reveal to be relevant only in some specific circumstances. In this setting, the con…

2016-05-12abs ↗pdf ↗

CoDA adapts dynamics models to new physical systems by conditioning on context.

problem Generalizing to new physical systems with shared dynamics but different contexts.
method Context-informed dynamics adaptation (CoDA) using multiple environments and a hypernetwork.
result State-of-the-art generalization results on nonlinear dynamics.

Optimally explores dynamical systems with varying properties using context inference.

problem Learning dynamics models for systems with varying properties.
method Formulates dynamics models as stochastic processes conditioned on a latent context variable inferred from system transitions. Uses probabilistic formulation to compute optimal action sequences for exploration.
result Demonstrates effectiveness of the method on non-linear toy-problems and reinforcement learning environments.

We propose an approach to self-supervised representation learning based on maximizing mutual information between features extracted from multiple views of a shared context. For example, one could produce multiple views of a local spatio-temporal context by observing it from different locations (e.g., camera positions w…

2019-06-03abs ↗pdf ↗

LLMs learn to recommend models and hyperparameters from dataset metadata.

problem Model and hyperparameter selection in machine learning is challenging and resource-intensive.
method Converted datasets into metadata and prompted LLMs to recommend models and hyperparameters.
result LLMs can recommend competitive models and hyperparameters without search.

Local differential privacy (LDP) is a strong notion of privacy for individual users that often comes at the expense of a significant drop in utility. The classical definition of LDP assumes that all elements in the data domain are equally sensitive. However, in many applications, some symbols are more sensitive than ot…

2019-10-31abs ↗pdf ↗