activity
20182026
most citedOn Tractable Computation of Expected Predictions

24 citations · 44 across the 8 of their papers we have counts for

collaborators

10 papers

cs.AI2026

A canonical generalization of OBDD

Florent Capelli, YooJung Choi, Stefan Mengel +2

We introduce Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes OBDD. They can be seen as a restriction of structured d-DNNF; that is, d-DNNF that respe…

cs.AI2024

A Compositional Atlas for Algebraic Circuits

Benjie Wang, Denis Deratani Mauá, Guy Van den Broeck +1

Circuits based on sum-product structure have become a ubiquitous representation to compactly encode knowledge, from Boolean functions to probability distributions. By imposing cons…

cs.DS2024★ 1 cited

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata

Antoine Amarilli, Marcelo Arenas, YooJung Choi +3

This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of…

stat.ML2021★ 3 cited

A Compositional Atlas of Tractable Circuit Operations: From Simple Transformations to Complex Information-Theoretic Queries

Antonio Vergari, YooJung Choi, Anji Liu +2

Circuit representations are becoming the lingua franca to express and reason about tractable generative and discriminative models. In this paper, we show how complex inference scen…

cs.LG2020

Group Fairness by Probabilistic Modeling with Latent Fair Decisions

YooJung Choi, Meihua Dang, Guy Van den Broeck

Machine learning systems are increasingly being used to make impactful decisions such as loan applications and criminal justice risk assessments, and as such, ensuring fairness of…

cs.LG2020★ 15 cited

Handling Missing Data in Decision Trees: A Probabilistic Approach

Pasha Khosravi, Antonio Vergari, YooJung Choi +2

Decision trees are a popular family of models due to their attractive properties such as interpretability and ability to handle heterogeneous data. Concurrently, missing data is a…

cs.LG2019★ 24 cited

On Tractable Computation of Expected Predictions

Pasha Khosravi, YooJung Choi, Yitao Liang +2

Computing expected predictions of discriminative models is a fundamental task in machine learning that appears in many interesting applications such as fairness, handling missing v…

cs.LG2019

Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination Patterns

YooJung Choi, Golnoosh Farnadi, Behrouz Babaki +1

As machine learning is increasingly used to make real-world decisions, recent research efforts aim to define and ensure fairness in algorithmic decision making. Existing methods of…

cs.LG2019★ 1 cited

What to Expect of Classifiers? Reasoning about Logistic Regression with Missing Features

Pasha Khosravi, Yitao Liang, YooJung Choi +1

While discriminative classifiers often yield strong predictive performance, missing feature values at prediction time can still be a challenge. Classifiers may not behave as expect…

cs.LG2018

On Robust Trimming of Bayesian Network Classifiers

YooJung Choi, Guy Van den Broeck

This paper considers the problem of removing costly features from a Bayesian network classifier. We want the classifier to be robust to these changes, and maintain its classificati…