Interpretable ML helps discover insights from big data.
problem Validating data-driven discoveries from complex datasets.
method Statistical and machine learning techniques for interpretable models.
result Challenges in validating data-driven discoveries remain.
The paper integrates statistical significance and discriminative power in pattern discovery.
problem Discovering actionable patterns that meet rigorous statistical significance and discriminative power criteria.
method Integrates statistical significance and discriminative power criteria into state-of-the-art algorithms.
result Improves discriminative power and statistical significance of discovered patterns without quality deterioration.
TSCD is an algorithm for causal discovery using second-order statistics.
problem Causal discovery
method Tensor-based Second-order Causal Discovery (TSCD)
result Identifiable causal order and parameters from logarithmic number of interventions
New method reduces errors in causal discovery from data.
problem Errors in causal discovery from limited data.
method Hierarchical wrapper for constraint-based algorithms.
result Significantly fewer tests, more accurate graphs, shorter run-times.
New method controls false discoveries in financial asset pricing.
problem Controlling false discoveries in time series with unknown correlations.
method Double bootstrapping method to control false discovery rate.
result Superior statistical power and controlled false discovery rate.
New benchmarks show LLMs struggle with causal discovery.
problem Leveraging LLMs for causal discovery is unreliable due to dataset leakage.
method Developing science-grounded benchmarks and hybrid methods combining LLM predictions with statistical analysis.
result LLMs perform poorly on novel, real-world scientific studies compared to classical methods.
LOAD discovers optimal adjustments locally for scalable causal inference.
problem Scalable causal inference for unknown causal graphs.
method Local Optimal Adjustments Discovery (LOAD) method.
result LOAD combines local and global approaches for efficient and accurate causal effect estimation.
A model learns causal graphs from summary statistics of synthetic data.
problem Causal discovery algorithms are brittle with large sets of variables and limited data.
method A supervised model trained on synthetic data predicts causal graphs from summary statistics.
result The model generalizes well beyond its training set and runs on large graphs.
Machine learning discovers equations from simulated data.
problem Discovering equations from computer-generated data.
method Sparse regression for equation learning.
result Machine learning can discover equations from complex data.
New method prevents invalid inference after causal discovery.
problem Invalid inference after causal discovery.
method Developed tools for valid post-causal-discovery inference.
result Our method provides reliable coverage while achieving more accurate causal discovery.
FoundCause: Causal Discovery with Latent Confounders from Observational Data
problem Causal discovery from observational data
method FoundCause, an amortized causal discovery model trained on synthetic data
result FoundCause outperforms classical and amortized methods on real-world datasets
The false discovery rate (FDR)---the expected fraction of spurious discoveries among all the discoveries---provides a popular statistical assessment of the reproducibility of scientific studies in various disciplines. In this work, we introduce a new method for controlling the FDR in meta-analysis of many decentralized…
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.
Enhances FDR control in variable selection using neural networks.
problem Balancing rigorous error control with statistical power in high-dimensional variable selection.
method Learning-augmented T-Rex Selector framework with a neural network trained on synthetic datasets.
result Achieves superior detection of true variables compared to existing approaches.
New algorithm improves causal discovery in biomedical data.
problem Stability and accuracy issues in causal discovery algorithms.
method Exploits temporal structure and tiered background knowledge.
result Increases accuracy in finite samples for causal structure estimation.
Finite resources limit false discovery rate control in structured hypothesis spaces.
problem Controlling false discovery rate in hypothesis testing with finite data and structured hypothesis spaces.
method Framework for exact FDR control and adaptive power maximization.
result Exact FDR control and adaptive power maximization.
Bayesian approach controls FDR in high-dimensional models.
problem High-dimensional variable selection and inference.
method Adapted Mirror Statistic to Bayesian framework for FDR control.
result Effective FDR control without data splitting.
Simple bounds show most cross-sectional predictability findings are likely true.
problem Determining the validity of cross-sectional return predictability findings.
method Developed simple and intuitive bounds on the false discovery rate (FDR).
result Bounds show the FDR is small, indicating most findings are likely true.
Private variable selection method controls FDR with simulations showing reasonable power.
problem Performing variable selection with privacy constraints.
method Private knockoff filter using Gaussian and Laplace mechanisms.
result Achieves controlled false discovery rate (FDR) in variable selection.
New rules control false discoveries in online anomaly detection for time series data.
problem Controlling false discoveries in anomaly detection for time series data.
method Novel online false discovery rate control (FDRC) rules for time series anomaly detection.
result Ensures high power in detecting anomalies even when the alternative is rare and test statistics are serially dependent.
The paper establishes bounds for score-matching in causal discovery and generative modeling.
problem Estimating causal relationships from data.
method Training a deep neural network to estimate the score function and applying it to causal discovery.
result Bounds on the error rate of causal discovery methods using score-matching.
New method falsifies causal discovery results without ground truth.
problem Evaluation of causal discovery algorithms without ground truth data.
method Detects incompatibilities between causal graphs learned on different subsets of variables.
result Detection of incompatibilities can falsify wrongly inferred causal relations.
Improved time series causal discovery with bootstrap aggregation and confidence measures.
problem Uncertainty estimation in time series causal discovery.
method Bootstrap aggregation and confidence measures for time series causal discovery.
result Bagged-PCMCI+ improves precision and recall compared to PCMCI+.
With the rapid growth of crowdsourcing platforms it has become easy and relatively inexpensive to collect a dataset labeled by multiple annotators in a short time. However due to the lack of control over the quality of the annotators, some abnormal annotators may be affected by position bias which can potentially degra…
We study the performance of Local Causal Discovery (LCD), a simple and efficient constraint-based method for causal discovery, in predicting causal effects in large-scale gene expression data. We construct practical estimators specific to the high-dimensional regime. Inspired by the ICP algorithm, we use an optional pr…
Robust subgroup discovery finds non-redundant, statistically significant subgroups.
problem Finding interpretable, robust subgroups from data.
method Formulated subgroup lists for univariate and multivariate targets, used MDL principle and greedy heuristic SSD++.
result SSD++ outperforms previous methods in quality and size of subgroup lists.
QPE identifies causal effects without assuming mechanisms or noise.
problem Identifying causal relationships from observational data.
method Quantile Partial Effect (QPE) and Fisher Information.
result Causal directions can be distinguished using QPE and Fisher Information.
A new knockoff statistic using conditional prediction function improves variable selection in complex models.
problem Controlling false discovery rate in complex models with nonlinear relationships.
method Introducing a knockoff statistic based on the conditional prediction function for use with machine learning models.
result The CPF statistics provide superior power in detecting prognostic variables over existing knockoff statistics.
FinCARE combines financial data and AI reasoning to improve causal analysis of financial performance.
problem Correlation-based analysis fails to capture true causal relationships in financial performance.
method Hybrid framework integrating causal discovery algorithms with financial domain knowledge from SEC filings and LLM reasoning.
result KG+LLM-enhanced methods improve causal discovery across PC, GES, and NOTEARS by 36-366%.
AutoSciDACT detects scientific anomalies in noisy data.
problem Detecting anomalies in large, noisy scientific datasets.
method Contrastive pre-training for low-dimensional data representations, two-sample test using NPLM.
result Strong sensitivity to small anomalies across various scientific domains.
DeepGG generates graph distributions for drug discovery and molecular design.
problem Learning graph distributions for various applications.
method Improved deep graph generator based on deep state machines with graph and node embeddings.
result The state machine design favors specific graph distributions.
Improved CI test for heteroskedastic data enhances causal discovery.
problem CI testing assumptions fail in heteroskedastic data.
method Adapted partial correlation CI test for heteroskedastic noise.
result The adapted test outperforms standard CI test in heteroskedastic cases.
Scenario discovery is the process of finding areas of interest, known as scenarios, in data spaces resulting from simulations. For instance, one might search for conditions, i.e., inputs of the simulation model, where the system is unstable. Subgroup discovery methods are commonly used for scenario discovery. They find…
We discover subgroups for Cox model survival analysis, improving model accuracy.
problem Finding interpretable subsets of data where Cox model is highly accurate.
method Developed new metrics (EPE, CRS) and algorithms to solve subgroup discovery problem.
result Our methods improve model fit and recover known nonlinearities in data.
A method selects candidates based on predictions with statistical control.
problem Screening candidates for resource-intensive steps like hiring or drug discovery.
method Wraps around any prediction model to produce a subset of candidates with controlled false selection rate.
result Empirically demonstrates selection of candidates whose predictions exceed a data-dependent threshold.
Study finds a method to discover causal relationships that are invariant to marginal distributions.
problem Current causal discovery methods are sensitive to marginal distributions, leading to unreliable results.
method Proposes a non-parametric estimator that marginalizes the marginals to find intrinsic causal relationships.
result The proposed method yields causal estimators competitive with current methodologies and emphasizes uncertainty.
This work identifies redundant tests in conditional-independence-based discovery that can improve graphical model accuracy.
problem Reliability and sensitivity of conditional-independence-based discovery algorithms.
method Analysis of redundant tests and their impact on error detection and correction.
result Redundant tests can improve graphical model accuracy but not all are beneficial.
High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…
The paper tackles noisy matrix completion by developing new statistics and controlling false discovery rate.
problem Testing multiple linear forms for noisy matrix completion with low-rank structure.
method Introducing new statistics with sharp asymptotics for individual tests, controlling FDR via data splitting and aggregation.
result Valid FDR control can be achieved with guaranteed power under nearly optimal sample size requirements.
FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.
problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.
Private online FDR control for adaptive testing under differential privacy.
problem Controlling false discoveries in adaptive multiple hypothesis testing with privacy constraints.
method Private online algorithms based on non-private results, ensuring privacy and statistical performance.
result Strong guarantees for privacy and statistical performance in FDR and power.
An important problem in machine learning and statistics is to identify features that causally affect the outcome. This is often impossible to do from purely observational data, and a natural relaxation is to identify features that are correlated with the outcome even conditioned on all other observed features. For exam…
AcceleratedLiNGAM speeds up causal discovery methods for large datasets.
problem Slow causal discovery methods for large-scale datasets.
method Parallelized LiNGAM method with GPU acceleration.
result Up to 32-fold speed-up on benchmark datasets.
Discovery of causal relations from observational data is essential for many disciplines of science and real-world applications. However, unlike other machine learning algorithms, whose development has been greatly fostered by a large amount of available benchmark datasets, causal discovery algorithms are notoriously di…
NeurT-FDR controls FDR by incorporating auxiliary covariates in deep learning.
problem Controlling FDR in complex large-scale problems with indirect relations among covariates.
method NeurT-FDR uses a deep Black-Box framework that parametrizes test-level covariates as a neural network and adjusts auxiliary covariates through a regression framework.
result NeurT-FDR makes substantially more discoveries in real datasets compared to competitive baselines.
Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses H(n)=(H1,…,Hn), Benjamini and Hochberg introduced the false discovery rate (FDR), which is the expected proportion of false positives among rejected nu…
Nonparametric IPSS selects features with false discovery control.
problem Feature selection in high-dimensional data with theoretical false discovery control.
method Integrated Path Stability Selection (IPSS) applied to nonparametric feature importance scores.
result IPSS accurately controls false discovery rate and detects more true positives than existing methods.
Paper relaxes faithfulness assumption for causal discovery using interventions.
problem Violation of faithfulness assumption in natural systems leads to incorrect causal structure identification.
method Use intervention-immediacy faithfulness assumption to identify causal structures with hard interventions.
result Interventions contain information about causal structure that can identify causal structures when faithfulness is violated.