activity
20202026
most citedStrudel: Learning Structured-Decomposable Probabilistic Circuits

6 citations · 13 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CL2026

Mitigating Bias in Locally Constrained Decoding via Tractable Proposals

Meihua Dang, Linxin Song, Honghua Zhang +3

Generations from large language models often fail to conform to desired constraints such as JSON schema. Existing locally constrained decoding (LCD) approaches enforce constraints…

cs.LG2025

Scaling Probabilistic Circuits via Monarch Matrices

Honghua Zhang, Meihua Dang, Benjie Wang +3

Probabilistic Circuits (PCs) are tractable representations of probability distributions allowing for exact and efficient computation of likelihoods and marginals. Recent advancemen…

cs.LG2023★ 1 cited

Scaling Pareto-Efficient Decision Making Via Offline Multi-Objective RL

Baiting Zhu, Meihua Dang, Aditya Grover

The goal of multi-objective reinforcement learning (MORL) is to learn policies that simultaneously optimize multiple competing objectives. In practice, an agent's preferences over…

cs.CL2023★ 3 cited

Tractable Control for Autoregressive Language Generation

Honghua Zhang, Meihua Dang, Nanyun Peng +1

Despite the success of autoregressive large language models in text generation, it remains a major challenge to generate text that satisfies complex constraints: sampling from the…

cs.LG2022★ 3 cited

Sparse Probabilistic Circuits via Pruning and Growing

Meihua Dang, Anji Liu, Guy Van den Broeck

Probabilistic circuits (PCs) are a tractable representation of probability distributions allowing for exact and efficient computation of likelihoods and marginals. There has been s…

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★ 6 cited

Strudel: Learning Structured-Decomposable Probabilistic Circuits

Meihua Dang, Antonio Vergari, Guy Van den Broeck

Probabilistic circuits (PCs) represent a probability distribution as a computational graph. Enforcing structural properties on these graphs guarantees that several inference scenar…