arXiv Machine Learning June 30, 2026 By Aparajithan Venkateswaran, Emilija Perkovi\'c

Towards Complete Causal Explanation with Expert Knowledge

Read the original on arXiv Machine Learning →

arXiv:2407. 07338v4 Announce Type: replace-cross Abstract: We study the problem of restricting a Markov equivalence class of maximal ancestral graphs (MAGs) to only those MAGs that contain certain edge marks, which we refer to as expert or orientation knowledge.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 18

Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms

The paper addresses causal discovery in Directed Acyclic Graphs where nodes are either ordinal (modeled with an ordered logit) or follow a one‑parameter exponential family distribution. It proves that the direction of edges between such nodes is identifiable for generic parameter values, extending prior Ordinal‑Poisson results. The authors also propose a score‑based exhaustive search and a masked continuous optimization method using DAGMA, and demonstrate through simulations that these approaches recover orientations that are otherwise unidentifiable under classical structural equation models.

By Sambit Mishra, Yingying Wang, Christine K. Johnson, Urbashi Mitra

arXiv Machine Learning

Jul 21

ExMAG: Learning of Maximally Ancestral Graphs

arXiv:2503. 08245v4 Announce Type: replace Abstract: In mixed graphs, there are both directed and bidirected edges.

By Petr Ry\v{s}av\'y, Pavel Ryt\'i\v{r}, Xiaoyu He, Georgios Korpas, Jakub Mare\v{c}ek

benchmarks

arXiv Statistics ML

2d ago

Notes on Forr\'e's Notion of Conditional Independence and Causal Calculus for Continuous Variables

arXiv:2603.24333v2 Announce Type: replace-cross Abstract: Recently, Forr\'e (arXiv:2104.11547, 2021) introduced transitional conditional independence, a notion of conditional independence that provid...

By Leihao Chen

arXiv AI

Aug 5

GENESIS: Towards Explainable Causal Discovery

arXiv:2608. 03868v1 Announce Type: cross Abstract: Causal Discovery (CD) from observational data faces two fundamental challenges.

By Abhinav Thorat, Ravi Kumar Kolla, Vishak K Bhat, Harsh Vardhan Singh Chauhan, Niranjan Pedanekar

llms benchmarks

arXiv AI

Sep 4

AutoGraphForge: Towards Automated Graph Theory Discovery

AutoGraphForge is a computational pipeline designed to automate the discovery, refutation, formalization, and proving of graph-theoretic conjectures. It generates conjectures using a Graffiti3 generator, filters out known results with a novelty filter, tests candidates against a large dataset of graphs, and refines surviving conjectures through counterexample search. The pipeline then translates each conjecture into Lean 4, verifies proofs with neural provers, and integrates the results into a formal library.

By J\'an Pastorek

Hugging Face Trending Papers

Jun 29

Grounding LLM Reasoning under Incomplete Graph Evidence

Knowledge graphs can guide large language models (LLMs) reasoning, but the graph seen by a system is usually a retrieved, linked, temporally scoped, and incomplete evidence state rather than a complete account of truth. We develop a theoretical perspective on grounding observable LLM trajectories under such incomplete graph evidence.

llms agents