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

89177266354 · Jun 202019922001200920172026
48 results for context variables

ContextFlow++ improves generative models by conditioning on mixed-variable contexts.

problem Lack of effective methods for context conditioning in flow-based generative models.
method Proposes ContextFlow++ with additive conditioning and mixed-variable architecture.
result ContextFlow++ achieves higher performance metrics and faster training.

Direct contextual policy search methods learn to improve policy parameters and simultaneously generalize these parameters to different context or task variables. However, learning from high-dimensional context variables, such as camera images, is still a prominent problem in many real-world tasks. A naive application o…

2016-11-10abs ↗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 ↗

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.

OCEAN infers online task identities from context variables.

problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.

Enhances neural processes for better context handling.

problem Real-world context sets are complex, requiring richer prior distributions.
method Introduces a graphical model for a richer prior on latent variables, enabling end-to-end optimization.
result Improves function modeling and test-time robustness with mixture and Student-t assumptions.

Method discovers local independence in systems with continuous variables.

problem Applying Context-Specific Independence (CSI) to continuous variables is impractical.
method Neural contextual decomposition (NCD) learns partition of joint outcome space.
result NCD successfully discovers local independence in synthetic and real-world systems.

This paper introduces and develops a novel variable importance score function in the context of ensemble learning and demonstrates its appeal both theoretically and empirically. Our proposed score function is simple and more straightforward than its counterpart proposed in the context of random forest, and by avoiding …

2015-01-25abs ↗pdf ↗

We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our grammar's rule probabilities are modulated by a per-sentence continuous latent variabl…

2019-06-24abs ↗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 ↗

SCHA-VAE generates novel data from limited examples using hierarchical context aggregation.

problem Generating data from a novel distribution with limited examples.
method Hierarchical context aggregation with attention-based point to set-level aggregation.
result Hierarchical approach better captures intrinsic variability in small data.

Bayesian Context Trees improve change-point detection in discrete data.

problem Detecting and segmenting change-points in discrete time series data.
method Bayesian Context Trees framework, Markov chain Monte Carlo sampling.
result Effective sampling from posterior distribution of change-points.

A new gradient estimator reduces variance near boundaries for binary latent variables.

problem Explosive gradient variance near boundaries in binary latent variable models.
method Introduces a new gradient estimator (bitflip-1) and an aggregated estimator (UGC) that uses either bitflip-1 or DisARM for each coordinate.
result UGC has uniformly lower variance than DisARM and achieves optimal optimization objectives.

New method learns exogenous variable distributions for better causal optimization.

problem Maximizing target variables in structural causal models.
method Learn exogenous variable distributions to improve surrogate models' fidelity.
result Improves approximation of structural causal models and broader application scenarios.

State variables are easily the most subtle dimension of sequential decision problems. This is especially true in the context of active learning problems (bandit problems") where decisions affect what we observe and learn. We describe our canonical framework that models {\it any} sequential decision problem, and present…

2020-02-14abs ↗pdf ↗

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.

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 ↗

A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Detecting hidden variables poses two problems: determining the relations to other variables in the model and determining the number of states of …

2013-01-10abs ↗pdf ↗

New model predicts drug effects across various cell types using causal imputation.

problem Predict drug effects across different cell types given limited data.
method Introduces a novel SCM-based model class with latent factor structure and uses Synthetic Interventions estimator.
result Method outperforms other matrix completion approaches in drug repurposing dataset.

E2Tree explains random forest models in regression tasks.

problem Lack of transparency in random forest models.
method E2Tree extends random forest to regression by explaining model predictions through graphical representation and dissimilarity measures.
result E2Tree provides a transparent explanation of random forest models in regression tasks.

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.

In this paper, we face the problem of simulating discrete random variables with general and varying distributions in a scalable framework, where fully parallelizable operations should be preferred. The new paradigm is inspired by the context of discrete choice models. Compared to classical algorithms, we add paralleliz…

2016-11-21abs ↗pdf ↗

A mathematical paradox shows secant planes don't always form a tangent plane, but some analogies hold with a specific vector product.

problem Secant planes of a two-variable smooth function do not always form a tangent plane, even for simple polynomials.
method Analogies with the one-variable case are explored, using Clifford's geometric vector product.
result Some analogies with the one-variable case still hold in the multi-variable context with a specific vector product.

New method tackles confounded bandit problems with dual instrumental variables.

problem Confounded contextual bandit problems where noise affects both contexts and rewards.
method Dual instrumental variable regression applied to reproducing kernel Hilbert spaces.
result Near-optimal convergence rate and computationally efficient algorithms proved.

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.

A new HMM model captures kernel dependencies using context-specific Bayesian networks.

problem Traditional HMMs struggle with non-Gaussian data and independence assumptions.
method Kernel density estimation with context-specific Bayesian networks.
result The proposed model outperforms related HMMs in likelihood and classification accuracy.

Geometric phases describe how in a continuous-time dynamical system the displacement of a variable (called phase variable) can be related to other variables (shape variables) undergoing a cyclic motion, according to an area rule. The aim of this paper is to show that geometric phases can exist also for discrete-time sy…

2016-03-17abs ↗pdf ↗