Search Results for author: Alessandro Antonucci

Found 28 papers, 13 papers with code

A Note on Bayesian Networks with Latent Root Variables

no code implementations26 Feb 2024 Marco Zaffalon, Alessandro Antonucci

We prove that (i) the likelihood of such a dataset from the original Bayesian network is dominated by the global maximum of the likelihood from the empirical one; and that (ii) such a maximum is attained if and only if the parameters of the Bayesian network are consistent with those of the empirical model.

Zero-shot Causal Graph Extrapolation from Text via LLMs

1 code implementation22 Dec 2023 Alessandro Antonucci, Gregorio Piqué, Marco Zaffalon

We evaluate the ability of large language models (LLMs) to infer causal relations from natural language.

Causal Inference

Tractable Bounding of Counterfactual Queries by Knowledge Compilation

1 code implementation5 Oct 2023 David Huber, Yizuo Chen, Alessandro Antonucci, Adnan Darwiche, Marco Zaffalon

We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models.

counterfactual

Hierarchical Multi-Agent Reinforcement Learning for Air Combat Maneuvering

1 code implementation20 Sep 2023 Ardian Selmonaj, Oleg Szehr, Giacomo Del Rio, Alessandro Antonucci, Adrian Schneider, Michael Rüegsegger

In our framework, the decision-making process is divided into two stages of abstraction, where heterogeneous low-level policies control the action of individual units, and a high-level commander policy issues macro commands given the overall mission targets.

Decision Making Multi-agent Reinforcement Learning +1

Approximating Counterfactual Bounds while Fusing Observational, Biased and Randomised Data Sources

no code implementations31 Jul 2023 Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber

We address the problem of integrating data from multiple, possibly biased, observational and interventional studies, to eventually compute counterfactuals in structural causal models.

counterfactual Selection bias

Efficient Computation of Counterfactual Bounds

no code implementations17 Jul 2023 Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti

This allows us to compute exact counterfactual bounds via algorithms for credal nets on a subclass of structural causal models.

Causal Inference counterfactual

Learning to Bound Counterfactual Inference from Observational, Biased and Randomised Data

1 code implementation6 Dec 2022 Marco Zaffalon, Alessandro Antonucci, David Huber, Rafael Cabañas

We address the problem of integrating data from multiple, possibly biased, observational and interventional studies, to eventually compute counterfactuals in structural causal models.

counterfactual Counterfactual Inference +1

Bounding Counterfactuals under Selection Bias

1 code implementation26 Jul 2022 Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas, David Huber, Dario Azzimonti

Causal analysis may be affected by selection bias, which is defined as the systematic exclusion of data from a certain subpopulation.

Selection bias

Belief Revision in Sentential Decision Diagrams

1 code implementation20 Jan 2022 Lilith Mattei, Alessandro Facchini, Alessandro Antonucci

Belief revision is the task of modifying a knowledge base when new information becomes available, while also respecting a number of desirable properties.

ADAPQUEST: A Software for Web-Based Adaptive Questionnaires based on Bayesian Networks

no code implementations29 Dec 2021 Claudio Bonesana, Francesca Mangili, Alessandro Antonucci

We introduce ADAPQUEST, a software tool written in Java for the development of adaptive questionnaires based on Bayesian networks.

Structural Learning of Probabilistic Sentential Decision Diagrams under Partial Closed-World Assumption

1 code implementation26 Jul 2021 Alessandro Antonucci, Alessandro Facchini, Lilith Mattei

Probabilistic sentential decision diagrams are a class of structured-decomposable probabilistic circuits especially designed to embed logical constraints.

Clustering

A New Score for Adaptive Tests in Bayesian and Credal Networks

no code implementations25 May 2021 Alessandro Antonucci, Francesca Mangili, Claudio Bonesana, Giorgia Adorni

Graphical models, such as Bayesian networks, are used for adaptive tests as they allow to model the uncertainty about the questions and the skills in an explainable fashion, especially when coping with multiple skills.

CREPO: An Open Repository to Benchmark Credal Network Algorithms

1 code implementation10 May 2021 Rafael Cabañas, Alessandro Antonucci

Credal networks are a popular class of imprecise probabilistic graphical models obtained as a Bayesian network generalization based on, so-called credal, sets of probability mass functions.

Benchmarking

Robust Model Checking with Imprecise Markov Reward Models

1 code implementation8 Mar 2021 Alberto Termine, Alessandro Antonucci, Alessandro Facchini, Giuseppe Primiero

However, only extensions based on discrete-time imprecise Markov chains have been considered so far for such a robust approach to model checking.

Logic in Computer Science Logic Probability

Relation Clustering in Narrative Knowledge Graphs

no code implementations27 Nov 2020 Simone Mellace, K Vani, Alessandro Antonucci

When coping with literary texts such as novels or short stories, the extraction of structured information in the form of a knowledge graph might be hindered by the huge number of possible relations between the entities corresponding to the characters in the novel and the consequent hurdles in gathering supervised information about them.

Clustering Descriptive +2

Causal Expectation-Maximisation

1 code implementation4 Nov 2020 Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas

Structural causal models are the basic modelling unit in Pearl's causal theory; in principle they allow us to solve counterfactuals, which are at the top rung of the ladder of causation.

counterfactual Counterfactual Inference

SST-BERT at SemEval-2020 Task 1: Semantic Shift Tracing by Clustering in BERT-based Embedding Spaces

2 code implementations SEMEVAL 2020 K Vani, Sandra Mitrovic, Alessandro Antonucci, Fabio Rinaldi

Lexical semantic change detection (also known as semantic shift tracing) is a task of identifying words that have changed their meaning over time.

Change Detection Clustering

Tractable Inference in Credal Sentential Decision Diagrams

no code implementations19 Aug 2020 Lilith Mattei, Alessandro Antonucci, Denis Deratani Mauá, Alessandro Facchini, Julissa Villanueva Llerena

In this work, we develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with (so-called credal) sets of mass functions.

Structural Causal Models Are (Solvable by) Credal Networks

1 code implementation2 Aug 2020 Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas

A structural causal model is made of endogenous (manifest) and exogenous (latent) variables.

Causal Inference

Temporal Embeddings and Transformer Models for Narrative Text Understanding

no code implementations19 Mar 2020 Vani K, Simone Mellace, Alessandro Antonucci

We present two deep learning approaches to narrative text understanding for character relationship modelling.

Clustering De-aliasing +3

Approximate MMAP by Marginal Search

1 code implementation12 Feb 2020 Alessandro Antonucci, Thomas Tiotto

We present a heuristic strategy for marginal MAP (MMAP) queries in graphical models.

Imaginary Kinematics

no code implementations1 Aug 2018 Sabina Marchetti, Alessandro Antonucci

We introduce a novel class of adjustment rules for a collection of beliefs.

Reliable Uncertain Evidence Modeling in Bayesian Networks by Credal Networks

no code implementations15 Feb 2018 Sabina Marchetti, Alessandro Antonucci

A reliable modeling of uncertain evidence in Bayesian networks based on a set-valued quantification is proposed.

Global Sensitivity Analysis for MAP Inference in Graphical Models

no code implementations NeurIPS 2014 Jasper De Bock, Cassio P. de Campos, Alessandro Antonucci

We study the sensitivity of a MAP configuration of a discrete probabilistic graphical model with respect to perturbations of its parameters.

On the Complexity of Strong and Epistemic Credal Networks

no code implementations26 Sep 2013 Denis D. Maua, Cassio Polpo de Campos, Alessio Benavoli, Alessandro Antonucci

In this paper, we study inferential complexity under the concepts of epistemic irrelevance and strong independence.

Cannot find the paper you are looking for? You can Submit a new open access paper.