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

67134200267 · Jun 202019922001200920172026
48 results for context association

LLMs can be tricked into recalling facts based on context clues.

problem Manipulation of LLMs' factual recall through context changes.
method Mathematical exploration of transformers' associative memory properties.
result Transformers use self-attention and value matrix for associative memory.

The study compares feed-forward and attention layers in language models.

problem Understanding the role of feed-forward and attention layers in language models.
method Empirical and theoretical analysis in a synthetic setting.
result Feed-forward layers learn simple distributional associations, while attention layers focus on in-context reasoning.

Bayesian framework uses context trees for efficient time series modeling.

problem Building flexible and interpretable mixture models for real-valued time series.
method Hierarchical Bayesian modelling with context trees and autoregressive models.
result The methods outperform state-of-the-art techniques on simulated and real-world experiments.

Transformers recall from long distributions with statistical guarantees.

problem Designing Transformers that can recall from arbitrarily long, distributional contexts.
method Recast associative memory as probability measures, decomposing the task into recall and prediction.
result A shallow measure-theoretic Transformer learns the recall-and-predict map under spectral assumptions.

The paper introduces contexture theory to characterize representation learning from contexts.

problem Lack of systematic characterization of representation learning methods.
method Characterizes representation learning as learning from the association between input and context variable.
result Contexture theory shows that representations can be approximated by top singular functions of the context.

The associator of a non-associative algebra is the curvature of the Hochschild quasi-complex. The relationship ``curvature-associator'' is investigated. Based on this generic example, we extend the geometric language of vector fields to a purely algebraic setting, similar to the context of Gerstenhaber algebras. We int…

1999-10-05abs ↗pdf ↗

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

The dissertation establishes a contexture theory to mathematically characterize representation learning.

problem The lack of a scientific understanding of representation learning in foundation models.
method Introduces the contexture theory as a unified framework for analyzing representation learning methods.
result Representation learning is optimal when the association between input and context is neither too strong nor too weak.

Develops methods to analyze feature-outcome associations in subpopulations.

problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.

In the framework of Abstract Differential Geometry, we show that to a given principal sheaf and a representation of its stuctural sheaf in AnA^n, where A is a sheaf of associative, commutative, unital algebras (over R or C), we associate a vector sheaf. Moreover, under some natural assumptions on the compatibility of t…

1998-10-13abs ↗pdf ↗

Enhances neural processes to learn from multiple related datasets.

problem Improving predictions from datasets with shared similarities.
method Developed the in-context in-context learning pseudo-token TNP (ICICL-TNP) to condition on both sets of datapoints and sets of datasets.
result Demonstrated the importance and effectiveness of in-context in-context learning.

We consider generalized gradients in the general context of GG-structures. They are natural first order differential operators acting on sections of vector bundles associated to irreducible GG-representations. We study their geometric properties and show in particular their conformal invariance.

2009-08-17abs ↗pdf ↗

Framework detects anomalies in industrial processes using deep learning.

problem Detect anomalies in complex industrial processes.
method Causal-based framework with unsupervised deep learning.
result Successfully validated abstract contexts of blast furnace assets.

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.

A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it G-degree} of the involved graphs, which drives the {\it 1/N1/N expansion} in the tensor …

2017-07-27abs ↗pdf ↗

Multi-period measures of risk account for the path that the value of an investment portfolio takes. In the context of probabilistic risk measures, the focus has traditionally been on the magnitude of investment loss and not on the dimension associated with the passage of time. In this paper, the concept of temporal pat…

2015-01-07abs ↗pdf ↗

RNNs struggle with in-context retrieval, while Transformers excel.

problem In-context retrieval capability of RNNs.
method Theoretical analysis and experimental techniques (CoT, RAG, Transformer layer).
result Enhancing RNNs with techniques improves their in-context retrieval capability, closing the representation gap with Transformers.

In this paper, we introduce a novel layer designed to be used as the output of pre-trained neural networks in the context of classification. Based on Associative Memories, this layer can help design Deep Neural Networks which support incremental learning and that can be (partially) trained in real time on embedded devi…

2019-04-04abs ↗pdf ↗

We examine universal curvature identities for pseudo-Riemannian manifolds with boundary. We determine the Euler-Lagrange equations associated to the Chern-Gauss-Bonnet formula and show that they are given solely in terms of curvature {and the second fundamental form and do not involve covariant derivatives thus general…

2012-09-25abs ↗pdf ↗

In this paper we develop a general conceptual approach to the problem of existence of action-angle variables for dynamical systems, which establishes and uses the fundamental conservation property of associated torus actions: anything which is preserved by the system is also preserved by the associated torus actions. T…

2017-06-26abs ↗pdf ↗

TabPFN's internal geometry topology correlates with dataset reliability.

problem Understanding TabPFN's behavior on structurally difficult tabular geometries.
method Using zigzag persistent homology, studying TabPFN's internal representations on synthetic tabular tasks with known topology.
result Topology of TabPFN's internal representation geometry is strongly associated with dataset-level reliability.

We outline the notions and concepts of the calculus of variational multivectors within the Poisson formalism over the spaces of infinite jets of mappings from commutative (non)graded smooth manifolds to the factors of noncommutative associative algebras over the equivalence under cyclic permutations of the letters in t…

2011-12-25abs ↗pdf ↗

Let L2L^2 be the Lebesgue space of square-integrable functions on the unit circle. We show that the injectivity problem for Toeplitz operators is linked to the existence of geodesics in the Grassmann manifold of L2L^2. We also investigate this connection in the context of restricted Grassmann manifolds associated to $p…

2016-08-19abs ↗pdf ↗

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.

GOAT learns multiple node representations from graph structure alone.

problem Context-free graph representation learning limits model performance.
method Inspired by gossip and mutual attention, GOAT learns multiple node representations.
result GOAT outperforms 12 SOTA baselines on link prediction and clustering tasks.

In the context of generalized geometry we first show how the Courant bracket helps to define connections with skew torsion and then investigate a five-dimensional invariant functional and its associated geometry. A Hamiltonian flow arising from this corresponds to a version of the Nahm equations using the Courant brack…

2005-08-30abs ↗pdf ↗

New Thompson Sampling for partially observed context bandits reduces regret logarithmically with time.

problem Improving Thompson Sampling for partially observed context bandits.
method Proposed a Thompson Sampling algorithm for partially observable contextual multi-armed bandits with theoretical performance guarantees.
result Regret scales logarithmically with time and the number of arms, and linearly with the dimension.

Large language models based on transformers have achieved great empirical successes. However, as they are deployed more widely, there is a growing need to better understand their internal mechanisms in order to make them more reliable. These models appear to store vast amounts of knowledge from their training data, and…

2023-06-01abs ↗pdf ↗

New setting combines state evolution and corrupted context for better decision-making.

problem Decision-making in a changing state with unreliable context.
method Proposes a new algorithm using a referee to dynamically combine contextual bandit and multi-armed bandit policies.
result Improved empirical performance compared to existing algorithms.

Diffusion models learn hierarchical composition rules from data.

problem How many samples do generative models need to learn hierarchical composition rules?
method Theoretical and empirical investigation of diffusion models on probabilistic context-free grammars.
result Diffusion models learn hierarchical composition rules with sample complexity scaling polynomially with context size.

Consider a nonparametric contextual multi-arm bandit problem where each arm a[K]a \in [K] is associated to a nonparametric reward function fa:[0,1]Rf_a: [0,1] \to \mathbb{R} mapping from contexts to the expected reward. Suppose that there is a large set of arms, yet there is a simple but unknown structure amongst the arm reward…

2019-08-03abs ↗pdf ↗