Causal discovery predicts unobserved joint statistics from observed data.
problem Inferring properties of unobserved joint distributions from observed data.
method Infer causal models from observed data to predict statistical properties of unobserved sets.
result Sparse causal graphs can be more useful than dense ones in predicting unobserved joint distributions.
Paper identifies unobserved variables from observable data.
problem Missing variables in empirical studies.
method Function mapping from observables to unobservables based on joint distribution.
result Uniqueness of latent values in each observation.
A new method uses randomized trials to estimate the strength of unobserved confounding.
problem Unobserved confounding compromises causal conclusions from non-randomized studies.
method Designs a statistical test to detect unobserved confounding strength and estimates a lower bound.
result Estimates an asymptotically valid lower bound on unobserved confounding strength.
The edge structure of the graph defining an undirected graphical model describes precisely the structure of dependence between the variables in the graph. In many applications, the dependence structure is unknown and it is desirable to learn it from data, often because it is a preliminary step to be able to ascertain c…
KRCD detects unobserved confounders in nonlinear observational data.
problem Detecting unobserved confounders in nonlinear observational studies.
method Kernel Regression Confounder Detection (KRCD) using reproducing kernel Hilbert spaces.
result KRCD outperforms existing methods and achieves superior computational efficiency.
Raising statistical hurdles may not be justified due to data bias.
problem Data bias leads to unobserved results that weaken identification of revised hurdles.
method Theoretical and empirical analysis of statistical hurdles and data bias.
result Statistics targeting only published findings can be strongly identified.
New method scores DAGs by identifying unobserved confounding.
problem Unobserved confounding complicates causal discovery.
method Score-based causal discovery algorithm that accounts for unobserved confounding.
result Sparse linear Gaussian DAGs can be recovered from observed data.
New model improves multimodal autoencoders by learning joint and conditional distributions.
problem Limitations in recent multimodal autoencoders restrict their quality on complex datasets.
method Proposes a multistage training process with variational inference and Normalizing Flows, leveraging shared modality information.
result Achieves state-of-the-art results on benchmark datasets.
Paper tackles unobserved confounding in human-AI collaborations.
problem Unobserved confounding undermines human-AI collaboration effectiveness.
method Combines sensitivity analysis from causal inference with AI-driven statistical modeling.
result Enhances robustness and reliability of collaborative outcomes.
New method estimates policy performance under unobserved confounding.
problem Estimating policy performance when decisions depend on unobserved variables.
method Developed worst-case bounds for robust OPE under unobserved confounding.
result Efficient procedure for computing worst-case bounds, proving statistical consistency.
A probabilistic query may not be estimable from observed data corrupted by missing values if the data are not missing at random (MAR). It is therefore of theoretical interest and practical importance to determine in principle whether a probabilistic query is estimable from missing data or not when the data are not MAR.…
This work highlights problems with off-policy estimation in recommender systems due to unobserved confounders.
problem Evaluation of recommender systems under unobserved confounders.
method Policy-based estimators and characterisation of statistical bias due to confounding.
result Naive propensity estimation under confounding leads to severely biased metric estimates.
We introduce a variant of the Barndorff-Nielsen and Shephard stochastic volatility model where the non Gaussian Ornstein-Uhlenbeck process describes some measure of trading intensity like trading volume or number of trades instead of unobservable instantaneous variance. We develop an explicit estimator based on marting…
We describe a method that infers whether statistical dependences between two observed variables X and Y are due to a "direct" causal link or only due to a connecting causal path that contains an unobserved variable of low complexity, e.g., a binary variable. This problem is motivated by statistical genetics. Given a ge…
Credit risk analysis improved with a joint model for spatial and temporal effects.
problem Predicting borrower's time-to-event with spatial and temporal covariates.
method Spatio-Temporal Joint Model (STJM) using Bayesian hierarchical approach and INLA.
result Spatial effects improve joint model performance, but spatio-temporal interactions have less impact.
New method combines score lists using joint CDFs, improving computation.
problem Combining non-comparable score lists over a common index set.
method New algorithm for computing joint CDF values, linear runtime.
result Improved computation of joint CDF values for N-dimensional order statistics.
Method learns CTMC models from steady-state data, predicting unseen states.
problem Learning CTMC models from aggregate steady-state statistics without sequence examples.
method ∞-SGD, a stochastic gradient descent method that avoids infinite sums.
result Successfully learns CTMC models and predicts unseen states.
Paper learns Cartesian product graphs with Laplacian constraints.
problem Learning Cartesian product graphs from Laplacian constraints.
method Penalized maximum likelihood estimation (MLE) and efficient algorithm.
result Statistical consistency for Cartesian product Laplacian estimation.
New method for robust policy evaluation in offline reinforcement learning with sequentially exogenous unobserved confounders.
problem Offline reinforcement learning in domains with unobserved confounders.
method Orthogonalized robust fitted-Q-iteration with closed-form solutions and bias-correction.
result Effective in simulations and real-world data, improving robustness and computational ease.
GUM tackles MARL by avoiding overestimation through state-marginal restriction.
problem Overestimation of values in large joint state-action spaces.
method Greedy UnMixing through state-marginal restriction and unmixing.
result Superior performance compared to existing Q-learning and general MARL algorithms.
Framework improves CATE estimation by aligning active learning with causal objectives.
problem High cost of outcome measurements limits CATE estimation.
method Causal-EPIG framework, targeting unobservable causal quantities.
result Strategies outperform standard baselines, revealing context-dependent optimal approaches.
New method predicts dynamic relationships in terrorist networks.
problem Dynamic co-evolution of multiplex graphs and nodal attributes in terrorism networks.
method Time-varying stochastic latent factor models with neural network Gaussian processes.
result Superior performance in predicting unobserved dynamic relationships.
We provide a distribution-free test that can be used to determine whether any two joint distributions p and q are statistically different by inspection of a large enough set of samples. Following recent efforts from Long et al. [1], we rely on joint kernel distribution embedding to extend the kernel two-sample test…
Using AI predictions as data can mislead inference, study shows.
problem Misleading inference when using AI predictions instead of real data.
method Characterized statistical challenges and reviewed methods for IPD.
result High predictive accuracy doesn't ensure valid inference.
Monte Carlo Tree Search (MCTS) algorithms have achieved great success on many challenging benchmarks (e.g., Computer Go). However, they generally require a large number of rollouts, making their applications costly. Furthermore, it is also extremely challenging to parallelize MCTS due to its inherent sequential nature:…
Paper uses non-Euclidean analysis to classify brain structure variations.
problem Classifying joint variations in multi-object brain structures.
method Combines non-Euclidean statistics and non-parametric integrative analysis.
result Effective, robust, and interpretable joint structure found.
Predictive models can fail to generalize from training to deployment environments because of dataset shift, posing a threat to model reliability and the safety of downstream decisions made in practice. Instead of using samples from the target distribution to reactively correct dataset shift, we use graphical knowledge …
Paper studies estimating network properties with missing data using SRL and GNN.
problem Estimating aggregate properties in networks with missing data attributes.
method Comparative study of SRL and GNN approaches for inferring missing attributes and estimating aggregate properties.
result SRL-based approaches tend to outperform GNN-based approaches in estimating aggregate properties and predictive accuracy.
Surveying joint Gaussian graphical models to identify shared structures across domains.
problem Estimating shared structures across different data sources.
method Statistical inference of joint Gaussian graphical models.
result Improved estimation power for high-dimensional data.
Unified framework infers time-varying graphs from incomplete signals.
problem Jointly inferring time-varying network topologies and imputing missing data from partial observations.
method Unified non-convex optimization framework with Proximal Alternating Direction Method of Multipliers (PADMM) algorithm.
result Superior robustness in high missing-data regimes, demonstrated through extensive numerical experiments.
A statistical test of independence may be constructed using the Hilbert-Schmidt Independence Criterion (HSIC) as a test statistic. The HSIC is defined as the distance between the embedding of the joint distribution, and the embedding of the product of the marginals, in a Reproducing Kernel Hilbert Space (RKHS). It has …
We take a new look at the problem of disentangling the volatility and jumps processes of daily stock returns. We first provide a computational framework for the univariate stochastic volatility model with Poisson-driven jumps that offers a competitive inference alternative to the existing tools. This methodology is the…
AI task delegation faces incentive collapse with unbounded payments as AI accuracy rises.
problem Incentive collapse in AI-assisted task delegation schemes.
method General impossibility result and sentinel-auditing payment mechanism.
result Sentinel-auditing mechanism enforces positive human effort at finite cost, independent of AI accuracy.
A two-step nonparametric method estimates financial systemic risk.
problem Estimating CoVaR due to unobservability of multivariate-quantiles.
method Two-step nonparametric approach using Monte-Carlo simulation and kernel method.
result Consistency and asymptotic normality of the two-step estimator established.
Valid causal inference with unobserved confounding in high-dimensional settings.
problem Estimating causal effects with unobserved confounders in high-dimensional data.
method Proposes methods to estimate causal effects with valid confidence intervals in the presence of unobserved confounders and high-dimensional nuisance models.
result Valid semiparametric inference can be obtained with unobserved confounding, and uncertainty intervals are proposed.
This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a…
The paper explores the relationship between joint mixability and negative dependence structures.
problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.
We study the problem of identifying the causal relationship between two discrete random variables from observational data. We recently proposed a novel framework called entropic causality that works in a very general functional model but makes the assumption that the unobserved exogenous variable has small entropy in t…
Extends SW and GSW to compare heterogeneous joint distributions.
problem Limited applicability of SW and GSW to heterogeneous joint distributions.
method Introduces HHRT and PGRT to extend SW and GSW.
result H2SW distance for heterogeneous joint distributions.
Proposes a novel tensor-based approach for multi-level link prediction.
problem Inferring potential links from observed networks.
method Tensor-based joint network embedding capturing pairwise and hyperlinks.
result Improves hyperlink and pairwise link prediction accuracy.
New method estimates treatment effects over time with unobserved confounders.
problem Estimating treatment effects from observational data with unobserved confounders.
method Sequential Deconfounder using Gaussian process latent variable model.
result Unbiased estimates of individualized treatment responses over time.
Biased sampling and missing data complicates statistical problems ranging from causal inference to reinforcement learning. We often correct for biased sampling of summary statistics with matching methods and importance weighting. In this paper, we study nearest neighbor matching (NNM), which makes estimates of populati…
New research shows imputation and regression together can predict better than separate steps.
problem Predicting with data missing values without strong assumptions.
method Proposes a joint imputation and regression approach using NeuMiss neural network.
result Joint imputation and regression outperforms separate imputation and regression methods.
Individual risk models need to capture possible correlations as failing to do so typically results in an underestimation of extreme quantiles of the aggregate loss. Such dependence modelling is particularly important for managing credit risk, for instance, where joint defaults are a major cause of concern. Often, the d…
We propose a tensor-based model that fuses a more granular representation of user preferences with the ability to take additional side information into account. The model relies on the concept of ordinal nature of utility, which better corresponds to actual user perception. In addition to that, unlike the majority of h…
New method recovers predictions from unobservable source subpopulation in binary classification.
problem Challenging binary classification with unobservable subpopulation in source domain.
method Distribution matching method to estimate subpopulation proportions, rigorous derivation of prediction models.
result Our method outperforms naive benchmarks in synthetic and real-world datasets.
New method detects causal relationships from noisy measurements.
problem Discover causal relationships from noisy, imperfect measurements.
method Transformed Independent Noise (TIN) condition and ordered group decomposition.
result Identifies causal graph structure without over-complete ICA.
CDVAE estimates treatment effects over time by accounting for unobserved variables.
problem Estimating treatment effects over time in the presence of unobserved confounders.
method Causal Dynamic Variational Autoencoder (CDVAE) that addresses unconfoundedness and unobserved heterogeneity.
result CDVAE outperforms existing methods in estimating Conditional Average Treatment Effects (CATEs).