1 code implementation • 27 Feb 2023 • Nikil Roashan Selvam, Honghua Zhang, Guy Van Den Broeck
We show that it is possible to parameterize this Mixture of All Trees (MoAT) model compactly (using a polynomial-size representation) in a way that allows for tractable likelihood computation and optimization via stochastic gradient descent.
1 code implementation • 5 Dec 2022 • Nikil Roashan Selvam, Guy Van Den Broeck, YooJung Choi
In this paper, we propose an algorithm to search for discrimination patterns in a general class of probabilistic models, namely probabilistic circuits.
1 code implementation • 18 Oct 2022 • Nikil Roashan Selvam, Sunipa Dev, Daniel Khashabi, Tushar Khot, Kai-Wei Chang
How reliably can we trust the scores obtained from social bias benchmarks as faithful indicators of problematic social biases in a given language model?