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

Trend · papers per month

106213319425 · Jun 202019922001200920172026
48 results for context dependence

Efficiently selects top-m designs for various contexts using sequential sampling.

problem Optimizing selection of top-m designs across different contexts.
method Formulated as a stochastic dynamic programming problem, developed sequential sampling policy.
result Asymptotically optimal sampling ratios for efficient selection.

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

Object ranking is an important problem in the realm of preference learning. On the basis of training data in the form of a set of rankings of objects, which are typically represented as feature vectors, the goal is to learn a ranking function that predicts a linear order of any new set of objects. Current approaches co…

2018-03-15abs ↗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.

Choice functions accept a set of alternatives as input and produce a preferred subset of these alternatives as output. We study the problem of learning such functions under conditions of context-dependence of preferences, which means that the preference in favor of a certain choice alternative may depend on what other …

2019-01-29abs ↗pdf ↗

Bayesian context trees capture complex dependencies in categorical sequences.

problem Complex, long-range dependencies in categorical sequences are not well captured by simple models.
method Parsimonious Bayesian context trees with model-based agglomerative clustering for efficient inference.
result The proposed framework outperforms existing models on real-world data.

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 ↗

Improves TTS accuracy by correcting context-dependent units.

problem Improves text-to-speech accuracy through speaker adaptation.
method Statistical model predicting context-dependent phonetic unit classes and their mean error values.
result Corrected boundaries of units improve TTS accuracy compared to HMM segmentation.

New insights into how depth and width affect in-context learning in deep models.

problem Understanding how various resources impact in-context learning in deep models.
method Analyzed linear regression in a deep linear self-attention model, varying resources like depth, width, context length, and training steps.
result Increasing depth improves in-context learning even at infinite context length, contrary to previous findings.

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.

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.

Timer-XL predicts multidimensional time series using a unified Transformer approach.

problem Unified time series forecasting across various tasks and contexts.
method Decoder-only Transformers with a universal TimeAttention mechanism and deft position embedding.
result State-of-the-art performance across multiple forecasting benchmarks.

New approach predicts tokens in context, explaining how ICL emerges.

problem Limited understanding of in-context learning emergence.
method Auto-regressive next-token prediction (AR-NTP) with prompt token-dependency and a two-level expectation.
result ICL emerges from the generalization of sequences and topics.

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 ↗

Enhances activity recognition in wearable computing with context awareness and uncertainty quantification.

problem Context-dependent activity recognition and unknown contexts in wearable computing.
method Developed the α-{eta} network coupled with uncertainty quantification (UQ) based on maximum entropy.
result Improved accuracy and F-score by 10% through high-level context identification.

We consider a planning problem where the dynamics and rewards of the environment depend on a hidden static parameter referred to as the context. The objective is to learn a strategy that maximizes the accumulated reward across all contexts. The new model, called Contextual Markov Decision Process (CMDP), can model a cu…

2015-02-08abs ↗pdf ↗

A two-step approach efficiently selects hyperparameters for FCMs.

problem Efficiently selecting hyperparameters for FCMs in a computationally expensive process.
method Two-step sequential approach: first estimate context length k, then estimate α.
result The proposed method achieves comparable compression performance to exhaustive search but with reduced computational cost.

New techniques save bits in image compression with upsampling.

problem Lack of context dependence in current image compression methods with upsampling.
method Simple, inexpensive techniques exploiting context to predict Laplace distribution parameters.
result Average savings of 0.645 bits per difference, up to 1.489 bits.

CausalRegNet generates accurate data for gene perturbation experiments, improving CSL methods.

problem Assessing and selecting causal structure learning methods in gene perturbation experiments.
method CausalRegNet, a multiplicative effect structural causal model, generates accurate observational and interventional data.
result CausalRegNet generates more accurate distributions and scales better than current simulation frameworks.

Direct approach for handling contextual bandits with latent state dynamics.

problem Handling contextual bandits with latent state dynamics, especially when rewards depend on posterior probabilities of hidden states.
method Direct reduction to standard linear contextual bandits, extended analysis of HMM parameters, periodic update of reward-model parameters.
result Periodic update of reward-model parameters allows handling complex dependencies in hidden states.

Algorithm minimizes regret in dueling bandits with contextualized utilities.

problem Minimizing regret in dueling bandits with context-dependent utilities.
method Proposes CoLSTIM algorithm based on perturbed utility estimates.
result Achieves regret of order ildeO(dT) ilde O(\sqrt{dT}).

Paper proves tight lower bounds for online multicalibration, separating it from marginal calibration.

problem Proving lower bounds for online multicalibration in relation to marginal calibration.
method Information-theoretic approach, constructing group families from orthonormal bases.
result Establishes tight lower bounds for online multicalibration, matching upper bounds up to logarithmic factors.

We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation tasks that implements the underlying feedback sharing mechanism by estimating the neighborhood of users in a context-dependent manner. CAB makes sharp departures from the state of the art by incorporating collaborative effects into …

2016-08-06abs ↗pdf ↗

The paper examines how small positive dependence can lead to correlated tail risks.

problem Understanding the impact of dependence uncertainty on tail risk measures.
method Introducing a regular dependence measure and analyzing the aggregation of risks.
result Small positive dependence can result in perfectly correlated tail risks.

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 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 ↗

Transformers learn low-dimensional target functions efficiently in-context.

problem Efficiently learning nonlinear target functions in-context using transformers.
method Nonlinear MLP layer in transformers optimized by gradient descent, focusing on single-index target functions.
result Transformers can learn target functions with low-dimensional structures efficiently in-context.

Paper proposes linear transformers for efficient in-context learning without context length limitations.

problem Quadratic complexity of softmax transformers limits data processing speed.
method Investigates linear transformers under domain generalization, showing they learn mappings from context distributions to response functions.
result Linear transformers achieve in-context learning with a linear complexity in context length, offering a dimension-independent convergence rate.

To simultaneously capture syntax and global semantics from a text corpus, we propose a new larger-context recurrent neural network (RNN) based language model, which extracts recurrent hierarchical semantic structure via a dynamic deep topic model to guide natural language generation. Moving beyond a conventional RNN-ba…

2019-12-21abs ↗pdf ↗

Researchers analyze neural process architectures and their representational capacities.

problem Understanding what functions can be represented by different neural process architectures.
method Analyzing four types of neural process architectures: CNPs, ANPs, TNPs, and their latent variants.
result Prove these architectures form a strict hierarchy and characterize their representational capabilities.

Visual relationship detection can bridge the gap between computer vision and natural language for scene understanding of images. Different from pure object recognition tasks, the relation triplets of subject-predicate-object lie on an extreme diversity space, such as \textit{person-behind-person} and \textit{car-behind…

2018-09-11abs ↗pdf ↗

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.

Introduces CStrees for modeling context-specific causal models from observational and interventional data.

problem Modeling context-specific causal relationships from mixed data types.
method Introduces CStrees with a novel factorization criterion and graphical characterization for context-specific conditional independence models.
result Derives a graphical characterization of model equivalence for observational CStrees and extends it to CStree models under context-specific interventions.

Dirichlet processes (DP) are widely applied in Bayesian nonparametric modeling. However, in their basic form they do not directly integrate dependency information among data arising from space and time. In this paper, we propose location dependent Dirichlet processes (LDDP) which incorporate nonparametric Gaussian proc…

2017-07-02abs ↗pdf ↗