Unsupervised relation discovery aims to discover new relations from a given text corpus without annotated data. However, it does not consider existing human annotated knowledge bases even when they are relevant to the relations to be discovered. In this paper, we study the problem of how to use out-of-relation knowledg…
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,786 papers · 148 categories
Trend · papers per month
48 results for “Relation Discovery”
Amortized Causal Discovery learns to infer causal graphs from time-series data, improving performance.
problem Inference of causal graphs from time-series data is inefficient due to fitting new models for each sample.
method Proposes Amortized Causal Discovery, a variational model that leverages shared dynamics across samples with different causal graphs.
result Significant improvements in causal discovery performance demonstrated experimentally.
Python library for causal discovery from observational data.
problem Revealing causal relations from observational data.
method Comprehensive collection of causal discovery methods in Python.
result Ease of use for non-specialists and modular building blocks for developers.
New methods discover causal relationships from multiple related data views.
problem Causal discovery from non-Gaussian data.
method Multi-view linear Structural Equation Model (SEM) with weak assumptions.
result Identifiability of acyclic SEMs and successful causal graph estimation.
The paper develops a method to discover causal relations and predict material laws with uncertainty quantification.
problem Discovering causal relations and predicting material laws with uncertainty in civil engineering applications.
method The paper develops a causal discovery algorithm to infer causal relations among time-history data. It uses a deep neural network with dropout layers for uncertainty quantification and propagates predictions through a causal graph.
result The method accurately predicts material laws and quantifies uncertainty, as demonstrated in two numerical examples.
Study improves CI tests for relational data to robustly discover causal structures.
problem Learning causal relationships from relational data.
method Conduct CI tests against relational data to robustly recover causal structure.
result Effective approach demonstrated through experiments.
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…
Extends linear structural causal models to include deterministic relations and latent confounders for causal discovery.
problem Causal discovery in linear SCMs with deterministic relations and latent confounders.
method Extended existing results to include deterministic relations and latent confounders, derived necessary and sufficient conditions for unique identifiability, proposed an algorithm for recovery.
result First work on identifiability results for causal discovery under latent confounding and deterministic relationships.
The paper extends graph embedding models to handle multiple relations.
problem Link prediction in multi-relational networks.
method Generalized pseudo-Riemannian embedding models to multi-relational networks, considering relations as submanifolds.
result Validation of the approach in link prediction tasks, including knowledge graph completion and biological domain analysis.
Causal Razorscs.LG
The study examines causal razors and their logical relations, highlighting a dilemma in causal discovery.
problem Selecting a reasonable scoring criterion for causal discovery algorithms.
method Review and logical comparison of numerous causal razors, focusing on parameter minimality in multinomial models.
result Parameter minimality poses a dilemma in selecting a reasonable scoring criterion for causal discovery algorithms.
Aggregation distorts causal discovery results but recovery is possible with partial linearity or prior.
problem Understanding how temporal aggregation affects causal discovery in aggregated data.
method Functional consistency and conditional independence consistency methods.
result Causal discovery results may be distorted by aggregation, but recovery is possible with certain conditions.
Discovering causal relations is fundamental to reasoning and intelligence. In particular, observational causal discovery algorithms estimate the cause-effect relation between two random entities and , given samples from . In this paper, we develop a framework to estimate the cause-effect relation bet…
New method detects latent common causes from observational data.
problem Detecting latent common causes in observational data.
method Modified causal discovery algorithms to detect latent common causes.
result Successfully detects latent common causes in various noise regimes and real data.
The gold standard for discovering causal relations is by means of experimentation. Over the last decades, alternative methods have been proposed that can infer causal relations between variables from certain statistical patterns in purely observational data. We introduce Joint Causal Inference (JCI), a novel approach t…
New algorithm learns causal structures from multiple overlapping datasets.
problem Discovering causal relations from multiple datasets with overlapping variables.
method Adapting and extending bivariate causal discovery algorithms to handle overlapping datasets.
result Outperforms previous approaches on synthetic and real data.
From Temporal to Contemporaneous Iterative Causal Discovery in the Presence of Latent Confounderscs.AI
Algorithm learns causal structures from time-series data, reducing tests for temporal vs. contemporaneous relations.
problem Learning causal structures from time-series data with latent confounders.
method Constraint-based algorithm that refines a causal graph by learning temporal relations first, then contemporaneous ones.
result Reduces the number of statistical tests and improves accuracy for synthetic and real-world data.
Improves material discovery through better model evaluation metrics.
problem Standard error metrics mislead in material discovery.
method Introduces Pareto shell-scope error for model evaluation.
result Novel diagnostic tools and insights for acquisition function design.
The paper compares two methods for handling missing data in causal discovery.
problem Handling missing data in causal discovery algorithms.
method Test-wise deletion and multiple imputation.
result Multiple imputation is more challenging for causal discovery than for estimation.
Bayesian method for causal discovery from unknown general interventions.
problem Learning causal DAGs from unknown interventions that modify parent sets.
method Bayesian approach with MCMC for approximating posterior DAGs and intervention targets.
result Bayesian method can identify DAGs and intervention targets up to equivalence classes.
Proposes supervised method for whole DAG causal structure learning.
problem Learning causal directions from data, especially for whole DAG structure.
method Supervised learning approach using permutation equivariant models.
result Promising results compared to previous approaches on synthetic and real data.
Causal discovery algorithms infer causal relations from data based on several assumptions, including notably the absence of measurement error. However, this assumption is most likely violated in practical applications, which may result in erroneous, irreproducible results. In this work we show how to obtain an upper bo…
Model learns to discover and disambiguate entities and relations in text streams.
problem Learning to follow and resolve mentions in a continuous text stream.
method End-to-end trainable memory network for online, one-shot learning.
result Improves disambiguation and discovery skills with minimal supervision.
In nonlinear latent variable models or dynamic models, if we consider the latent variables as confounders (common causes), the noise dependencies imply further relations between the observed variables. Such models are then closely related to causal discovery in the presence of nonlinear confounders, which is a challeng…
Missing data are ubiquitous in many domains including healthcare. When these data entries are not missing completely at random, the (conditional) independence relations in the observed data may be different from those in the complete data generated by the underlying causal process. Consequently, simply applying existin…
Bayesian network structure learning algorithms with limited data are being used in domains such as systems biology and neuroscience to gain insight into the underlying processes that produce observed data. Learning reliable networks from limited data is difficult, therefore transfer learning can improve the robustness …
New algorithms learn polytree structures from data.
problem Learning causal graphs from non-Gaussian data.
method Combines Chow-Liu algorithm with edge orientation schemes.
result Established high-dimensional consistency results.
Bayesian method optimizes interventions for causal discovery.
problem Active interventions are needed for causal discovery when observational data is insufficient.
method Bayesian optimization-based approach using observational data and pre-experimental evaluation of interventions.
result Demonstrated effectiveness through various experiments.
Paper tackles multi-task learning for molecular property prediction with limited data.
problem Limited labeled data for each molecular property task in drug discovery.
method Proposes SGNN-EBM method to utilize relation graph between tasks and improve multi-task learning performance.
result Empirical results show the effectiveness of SGNN-EBM.
Bayesian method clusters, discovers patterns, detects anomalies in diverse time series.
problem Analyzing and describing heterogeneous time series data.
method Interpretable kernel embedding for heterogeneous time series, leveraging intermediate results.
result Practical utility in clustering, pattern discovery, and anomaly detection.
New scoring rule predicts causal relations from data with selection bias.
problem Discovering causal relations from independence constraints under selection bias and confounding.
method Local Y-Structure patterns and a scoring rule for Y-Structures.
result Y-Structure scoring rule successfully predicts causal relations in real-world data.
We use the score function for causal discovery, tackling challenges with hidden variables.
problem Causal discovery from observational data with hidden variables.
method Fine-tuning identifiability results, establishing conditions for inferring causal relations from the score, proposing a flexible algorithm.
result Empirical validation of the proposed algorithm for causal discovery on linear, nonlinear, and latent variable models.
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.
DESMILES uses deep learning to improve drug discovery by optimizing molecule properties.
problem Improving the efficiency and accuracy of drug discovery through better molecular design.
method DESMILES is a deep neural network model that optimizes molecular properties for drug discovery.
result DESMILES achieved a 77% lower failure rate in modifying molecules to inhibit the dopamine receptor D2 compared to state-of-the-art models.
A deep learning framework discovers causal relationships from incomplete data.
problem Discovering causal knowledge from incomplete observational data.
method Imputated Causal Learning (ICL) framework for iterative missing data imputation and causal structure discovery.
result ICL outperforms state-of-the-art methods in various missing data scenarios.
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.
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.
Python toolbox for causal structure learning from data.
problem Causal structure learning from data.
method Generates data from simulators or real-world datasets, learns causal structure, evaluates graphs, and includes gradient-based methods.
result Convenience and efficiency in causal discovery with GPU acceleration.
SNAP: Sequential Non-Ancestor Pruning for Targeted Causal Effect Estimation With an Unknown Graphstat.ML
SNAP efficiently identifies causal effects without needing full graph learning.
problem Efficiently estimating causal effects on a subset of variables.
method Sequential Non-Ancestor Pruning (SNAP) framework.
result SNAP reduces independence tests and computation time without sacrificing causal effect estimations.
Develops a model for causal discovery in path spaces.
problem Discover causal relationships in path spaces using asymmetric independence.
method Theory linking E-separation in DMGs to conditional independence in SDEs, proving global Markov property, characterizing equivalence classes of graphs.
result Each equivalence class of graphs has a greatest element as a parsimonious representation, which can be identified from data.
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.
Proposes VILMAP for finding motifs and segmenting words in time series.
problem Finding motifs and segmenting words in time series data.
method Self-Organizing Maps with variable input length.
result VILMAP identifies motifs of varying lengths and avoids catastrophic forgetting.
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.
Tree-Query uses LLMs to discover causal relationships in a transparent, interpretable manner.
problem Error propagation in classical causal discovery methods and opaque, confidence-free behavior of recent LLM-based causal oracles.
method Tree-Query is a tree-structured, multi-expert LLM framework that reduces causal discovery to queries about backdoor paths and dependencies.
result Tree-Query provides interpretable judgments with robustness-aware confidence scores and improves structural metrics over LLM baselines.
Generates synthetic manufacturing data for causal discovery benchmarking.
problem Lack of suitable real data for validating causal discovery algorithms.
method Distributional random forests for estimating conditional distributions.
result Semisynthetic manufacturing data adheres to a causal model.
Media tone around earnings announcements predicts stock returns.
problem Determining if media tone around earnings announcements provides useful information for stock prices.
method Conducted an event study on media tone around earnings announcements for nonfinancial S&P 500 firms.
result Media tone around earnings announcements predicts abnormal stock returns.
SMILES Transformer learns molecular fingerprints for drug discovery.
problem Poor performance of rule-based molecular fingerprints in shallow prediction models or small datasets.
method Unsupervised pre-training of a sequence-to-sequence language model on a corpus of SMILES.
result SMILES Transformer outperformed existing methods in small-data settings.
With the expeditious advancement of information technologies, health-related data presented unprecedented potentials for medical and health discoveries but at the same time significant challenges for machine learning techniques both in terms of size and complexity. Those challenges include: the structured data with var…
CauScale efficiently discovers causal relationships in large graphs.
problem Efficiency bottlenecks in causal discovery for large graphs.
method Neural architecture with reduction unit and tied attention weights.
result Achieves 99.6% mAP on in-distribution data and 84.4% on out-of-distribution data.