activity
20122026
most citedToward Trustworthy AI Development: Mechanisms for Supporting Verifiable Claims

219 citations · 1.8k across the 99 of their papers we have counts for

collaborators
Showing 2018Show all

7 papers · 1 filter

stat.ML2018

Self-Guided Belief Propagation -- A Homotopy Continuation Method

Christian Knoll, Adrian Weller, Franz Pernkopf

Belief propagation (BP) is a popular method for performing probabilistic inference on graphical models. In this work, we enhance BP and propose self-guided belief propagation (SBP)…

stat.ML2018★ 14 cited

Proceedings of the 2018 ICML Workshop on Human Interpretability in Machine Learning (WHI 2018)

Been Kim, Kush R. Varshney, Adrian Weller

This is the Proceedings of the 2018 ICML Workshop on Human Interpretability in Machine Learning (WHI 2018), which was held in Stockholm, Sweden, July 14, 2018. Invited speakers wer…

cs.LG2018★ 196 cited

A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indices

Till Speicher, Hoda Heidari, Nina Grgic-Hlaca +4

Discrimination via algorithmic decision making has received considerable attention. Prior work largely focuses on defining conditions for fairness, but does not define satisfactory…

stat.ML2018★ 31 cited

Blind Justice: Fairness with Encrypted Sensitive Attributes

Niki Kilbertus, Adrià Gascón, Matt J. Kusner +3

Recent work has explored how to train machine learning models which do not discriminate against any subgroup of the population as determined by sensitive attributes such as gender…

cs.LG2018★ 46 cited

Structured Evolution with Compact Architectures for Scalable Policy Optimization

Krzysztof Choromanski, Mark Rowland, Vikas Sindhwani +2

We present a new method of blackbox optimization via gradient approximation with the use of structured random orthogonal matrices, providing more accurate estimators than baselines…

stat.ML2018★ 2 cited

Gauged Mini-Bucket Elimination for Approximate Inference

Sungsoo Ahn, Michael Chertkov, Jinwoo Shin +1

Computing the partition function of a discrete graphical model is a fundamental inference challenge. Since this is computationally intractable, variational approximations are o…