Causal Discovery in Probabilistic Networks with an Identifiable Causal Effect
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Functional and structural connectivity alterations in short- and long-range projections have been reported across neurodevelopmental disorders (NDD). Interhemispheric callosal projection neurons (CPN) represent one of the major long-range projections in th ...
We present a multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty. The algorithm is based on a collective smoother that at each iteration sweeps over the ...
An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...
In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...
The presence of competing events, such as death, makes it challenging to define causal effects on recurrent outcomes. In this thesis, I formalize causal inference for recurrent events, with and without competing events. I define several causal estimands an ...
In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...
One major challenge in distributed learning is to efficiently learn for each client when the data across clients is heterogeneous or non iid (not independent or identically distributed). This provides a significant challenge as the data of the other client ...
We summarize what we consider to be the two main limitations of the "Estimands for Recurrent Event Endpoints in the Presence of a Terminal Event" (Schmidli et al. 2022). First, the authors did not give detailed guidance on how to choose an appropriate esti ...
Recent years have seen a surge of interest in learning high-level causal representations from low-level image pairs under interventions. Yet, existing efforts are largely limited to simple synthetic settings that are far away from real-world problems. In t ...
Many real‐life treatments are of limited supply and cannot be provided to all individuals in the population. For example, patients on the liver transplant waiting list usually cannot be assigned a liver transplant immediately at the time they reach highest ...
