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

4897145193 · Jun 202019922001200920172026
48 results for Context-Specific Policies

CPR models complex decision processes by breaking them into context-specific policies, improving interpretability and accuracy.

problem Interpreting dynamic human decision-making processes in medical contexts.
method Develops Contextualized Policy Recovery (CPR) framework for multi-task learning, modeling each context-specific policy as a linear map.
result Achieves state-of-the-art performance in predicting medical decisions, closing the gap between interpretable and black-box methods.

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.

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.

Log-linear models are the popular workhorses of analyzing contingency tables. A log-linear parameterization of an interaction model can be more expressive than a direct parameterization based on probabilities, leading to a powerful way of defining restrictions derived from marginal, conditional and context-specific ind…

2014-09-09abs ↗pdf ↗

Build accurate DNN models requires training on large labeled, context specific datasets, especially those matching the target scenario. We believe advances in wireless localization, working in unison with cameras, can produce automated annotation of targets on images and videos captured in the wild. Using pedestrian an…

2018-09-22abs ↗pdf ↗

Study optimal and equitable encouragement policies for treatment adherence.

problem Optimal treatment adherence policies in the presence of human non-adherence.
method Covariate-conditional no-direct-effect model of encouragement; tractable policy characterizations under constraints.
result Induced treatment take-up is the fairness target, not recommendation rates.

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.

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.

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.

Paper tackles transfer RL under unobserved context, developing methods to reduce bias.

problem Transfer RL with unobserved contextual information leading to biased models.
method Develops causal bounds on transition and reward functions using demonstrator's data.
result Proposes Q learning and UCB-Q learning algorithms that converge to true value function without bias.

Learning the Markov network structure from data is a problem that has received considerable attention in machine learning, and in many other application fields. This work focuses on a particular approach for this purpose called independence-based learning. Such approach guarantees the learning of the correct structure …

2013-07-15abs ↗pdf ↗

The Dynamic Chain Event Graph (DCEG) is able to depict many classes of discrete random processes exhibiting asymmetries in their developments and context-specific conditional probabilities structures. However, paradoxically, this very generality has so far frustrated its wide application. So in this paper we develop an…

2018-08-17abs ↗pdf ↗

The paper introduces new Bayesian network classifiers for better classification accuracy.

problem Improving supervised classification accuracy using Bayesian network classifiers.
method Developed novel classes of generative classifiers based on staged tree models, extending Bayesian networks.
result Data-driven learning routines enhance the accuracy of the new classifiers.

Bayesian model identifies three types of travelers adapting to feedback.

problem Capturing adaptive, feedback-driven travel behavior in heterogeneous individuals.
method Latent Class Reinforcement Learning (LCRL) model with Variational Bayes estimation.
result Three distinct traveler classes identified: context-dependent, persistent exploitative, and exploratory.

We consider the task of Inverse Reinforcement Learning in Contextual Markov Decision Processes (MDPs). In this setting, contexts, which define the reward and transition kernel, are sampled from a distribution. In addition, although the reward is a function of the context, it is not provided to the agent. Instead, the a…

2019-05-23abs ↗pdf ↗

New algorithms minimize simple and cumulative regret in contextual bandits.

problem Minimizing simple and cumulative regret in contextual bandit settings.
method Proposed new algorithms using conformal arm sets (CASs).
result Near-optimal minimax guarantees for simple regret and state-of-the-art guarantees for cumulative regret.

Neural networks improve pricing and hedging of complex financial claims.

problem Pricing and hedging of high-dimensional, path-dependent contingent claims.
method Regress later Monte Carlo approach using neural networks for interpretability.
result Any contingent claim can be semi-statically hedged using a portfolio of short maturity options.

Competency questions help experts select best clustering for energy data.

problem Ad hoc and subjective selection of clustering structures by domain experts.
method Formalize expert knowledge and requirements with competency questions.
result Competency questions improve reproducibility and evaluation of clustering applications.

Proposes BehavDT model for context-aware user behavior prediction.

problem Building a context-aware predictive model based on diverse user behavioral activities.
method Introduces BehavDT, a behavioral decision tree that considers user behavior-oriented generalization.
result BehavDT model outperforms traditional machine learning approaches in predicting user diverse behaviors considering multi-dimensional contexts.

Collaborative filtering is a rapidly advancing research area. Every year several new techniques are proposed and yet it is not clear which of the techniques work best and under what conditions. In this paper we conduct a study comparing several collaborative filtering techniques -- both classic and recent state-of-the-…

2012-05-14abs ↗pdf ↗

OTSS learns personalized decision weights from logged decisions and outputs.

problem Learning context-specific decision weights from logged decisions and outputs.
method Output-targeted soft-segmentation model that deploys personalized decision-ready weight vectors.
result OTSS achieves the lowest mean regret in benchmark settings.

Tractable yet expressive density estimators are a key building block of probabilistic machine learning. While sum-product networks (SPNs) offer attractive inference capabilities, obtaining structures large enough to fit complex, high-dimensional data has proven challenging. In this paper, we present random sum-product …

2019-08-08abs ↗pdf ↗

This paper introduces a new probabilistic architecture called Sum-Product Graphical Model (SPGM). SPGMs combine traits from Sum-Product Networks (SPNs) and Graphical Models (GMs): Like SPNs, SPGMs always enable tractable inference using a class of models that incorporate context specific independence. Like GMs, SPGMs p…

2017-08-21abs ↗pdf ↗

We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry extensions are estimated by maximizing the log-likelihood, or an appropriately penalize…

2018-07-04abs ↗pdf ↗

Motivation: Cell-biological processes are regulated through a complex network of interactions between genes and their products. The processes, their activating conditions, and the associated transcriptional responses are often unknown. Organism-wide modeling of network activation can reveal unique and shared mechanisms…

2012-02-02abs ↗pdf ↗

Proposes a neural network for contextual regression.

problem Improving model efficiency and interpretability in regression with contextual features.
method Simple contextual neural network (SCtxtNN) that separates context identification from context-specific regression.
result SCtxtNN achieves lower excess mean squared error and more stable performance than feed-forward neural networks.

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 ↗

The paper tackles learning varying DAG structures based on contextual features.

problem Learning a single DAG for the entire population from observational data.
method A neural network that maps contextual features to a weighted adjacency matrix of a DAG, with a projection layer to ensure acyclicity.
result The new approach can recover context-specific DAGs where existing methods fail.

A Dynamic Chain Event Graph (DCEG) provides a rich tree-based framework for modelling a dynamic process with highly asymmetric developments. An N Time-Slice DCEG (NT-DCEG) is a useful subclass of the DCEG class that exhibits a specific type of periodicity in its supporting tree graph and embodies a time-homogeneity ass…

2018-10-22abs ↗pdf ↗

Proposes a non-conjugate model selection method for chain event graphs.

problem Existing model selection algorithms for chain event graphs rely on conjugate priors, which is unrealistic for many real-world applications.
method Proposes a mixture modelling approach to model selection in chain event graphs that does not rely on conjugacy.
result The proposed method is more scalable and robust than existing algorithms.