Gabriele D'Acunto

dblp:305/7850 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 33% Probabilistic and Bayesian machine learning · 33% Trustworthy machine learning · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
causal abstraction
0.912025
Causal Abstraction Learning based on the Semantic Embedding Principle · ICML 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.912025
Causal Abstraction Learning based on the Semantic Embedding Principle · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal model
structural causal model
0.912025
Causal Abstraction Learning based on the Semantic Embedding Principle · ICML 2025
Mathematical optimization
riemannian optimization
0.312025
Causal Abstraction Learning based on the Semantic Embedding Principle · ICML 2025
Mathematical optimization › riemannian optimization
stiefel manifold optimization
0.312025
Causal Abstraction Learning based on the Semantic Embedding Principle · ICML 2025

Methods — techniques the papers use, named apart from their topics

riemannian optimization · 1.7kullback-leibler divergence · 1.7category theory · 1.7
YearPublicationVenuePosition
2025 Causal Abstraction Learning based on the Semantic Embedding Principle
abstract
Structural causal models (SCMs) allow us to investigate complex systems at multiple levels of resolution. The causal abstraction (CA) framework formalizes the mapping between high- and low-level SCMs. We address CA learning in a challenging and realistic setting, where SCMs are inaccessible, interventional data is unavailable, and sample data is misaligned. A key principle of our framework is *semantic embedding*, formalized as the high-level distribution lying on a subspace of the low-level one. This principle naturally links linear CA to the geometry of the *Stiefel manifold*. We present a category-theoretic approach to SCMs that enables the learning of a CA by finding a morphism between the low- and high-level probability measures, adhering to the semantic embedding principle. Consequently, we formulate a general CA learning problem. As an application, we solve the latter problem for linear CA; considering Gaussian measures and the Kullback-Leibler divergence as an objective. Given the nonconvexity of the learning task, we develop three algorithms building upon existing paradigms for Riemannian optimization. We demonstrate that the proposed methods succeed on both synthetic and real-world brain data with different degrees of prior information about the structure of CA.
Gabriele D'Acunto, Fabio Massimo Zennaro, Yorgos Felekis, Paolo Di Lorenzo
ICML1
2025 The Relativity of Causal Knowledge
abstract
Recent advances in *artificial intelligence* reveal the limits of purely predictive systems and call for a shift toward causal *and* collaborative reasoning. Drawing inspiration from the revolution of Grothendieck in mathematics, we introduce the *relativity of causal knowledge*, which posits structural causal models (SCMs) are inherently imperfect, subjective representations embedded within networks of relationships. By leveraging category theory, we arrange SCMs into a functor category and show that their observational and interventional probability measures naturally form convex structures. This result allows us to encode non-intervened SCMs with convex spaces of probability measures. Next, using sheaf theory, we construct the *network sheaf and cosheaf of causal knowledge*. These structures enable the transfer of causal knowledge across the network while incorporating interventional consistency and the perspective of the subjects, ultimately leading to the formal, mathematical definition of *relative causal knowledge*.
Gabriele D'Acunto, Claudio Battiloro
UAI1