Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rafael Chaves

dblp:90/10669 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-8493-4019ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-authorTheory of computation · 2

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.

Theoretical computer science
2 papers
Mathematical optimization · 58% Information theory · 42%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
causal inference
0.412020
Semidefinite Tests for Latent Causal Structures · IEEE Trans. Inf. Theory 2020
Mathematical optimization
semidefinite programming
0.412020
Semidefinite Tests for Latent Causal Structures · IEEE Trans. Inf. Theory 2020
Information theory › information measures › information inequalities
entropic inequalities
0.212013
Entropic Inequalities and Marginal Problems · IEEE Trans. Inf. Theory 2013
Information theory › information measures
entropy
0.212013
Entropic Inequalities and Marginal Problems · IEEE Trans. Inf. Theory 2013
Information theory › information measures › information inequalities
non-shannon-type inequality
0.212013
Entropic Inequalities and Marginal Problems · IEEE Trans. Inf. Theory 2013
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
conditional independence
0.012013
Entropic Inequalities and Marginal Problems · IEEE Trans. Inf. Theory 2013
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.012013
Entropic Inequalities and Marginal Problems · IEEE Trans. Inf. Theory 2013

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

semidefinite programming · 0.4entropic inequality · 0.4fourier-motzkin elimination · 0.3
YearPublicationVenuePosition
2020 Semidefinite Tests for Latent Causal Structures
abstract
Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures where all correlations between observed quantities are solely due to the influence from latent variables. We show that each model of this type imposes a certain signature on the observable covariance matrix in terms of a particular decomposition into positive semidefinite components. This signature, and thus the underlying hypothetical latent structure, can be tested in a computationally efficient manner via semidefinite programming. This stands in stark contrast with the algebraic geometric tools required if the full observable probability distribution is taken into account. The semidefinite test is compared with tests based on entropic inequalities.
Aditya Kela, Kai Von Prillwitz, Johan Aberg, Rafael Chaves, David Gross 0003
IEEE Trans. Inf. Theory4
2019 Exclusivity Graph Approach to Instrumental Inequalities
Davide Poderini, Rafael Chaves, Iris Agresti, Gonzalo Carvacho, Fabio Sciarrino
UAI2
2014 Inferring latent structures via information inequalities
Rafael Chaves, Lukas Luft, Thiago O. Maciel, David Gross 0003, Dominik Janzing, Bernhard Schölkopf
UAI1
2013 Entropic Inequalities and Marginal Problems
abstract
A marginal problem asks whether a given family of marginal distributions for some set of random variables arises from some joint distribution of these variables. Here, we point out that the existence of such a joint distribution imposes nontrivial conditions already on the level of Shannon entropies of the given marginals. These entropic inequalities are necessary (but not sufficient) criteria for the existence of a joint distribution. For every marginal problem, a list of such Shannon-type entropic inequalities can be calculated by Fourier-Motzkin elimination, and we offer a software interface to a Fourier-Motzkin solver for doing so. For the case that the hypergraph of given marginals is a cycle graph, we provide a complete analytic solution to the problem of classifying all relevant entropic inequalities, and use this result to bound the decay of correlations in stochastic processes. Furthermore, we show that Shannon-type inequalities for differential entropies are not relevant for continuous-variable marginal problems; non-Shannon-type inequalities are both in the discrete and in the continuous case. In contrast to other approaches, our general framework easily adapts to situations where one has additional (conditional) independence requirements on the joint distribution, as in the case of graphical models. We end with a list of open problems. A complementary article discusses applications to quantum nonlocality and contextuality.
Tobias Fritz, Rafael Chaves
IEEE Trans. Inf. Theory2