activity
20102023
most citedCLUB: A Contrastive Log-ratio Upper Bound of Mutual Information

58 citations · 372 across the 25 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2020★ 1 cited

WAFFLe: Weight Anonymized Factorization for Federated Learning

Weituo Hao, Nikhil Mehta, Kevin J Liang +3

In domains where data are sensitive or private, there is great value in methods that can learn in a distributed manner without the data ever leaving the local devices. In light of…

cs.LG2020★ 58 cited

CLUB: A Contrastive Log-ratio Upper Bound of Mutual Information

Pengyu Cheng, Weituo Hao, Shuyang Dai +3

Mutual information (MI) minimization has gained considerable interests in various machine learning tasks. However, estimating and minimizing MI in high-dimensional spaces remains a…

cs.LG2020★ 4 cited

Improving Disentangled Text Representation Learning with Information-Theoretic Guidance

Pengyu Cheng, Martin Renqiang Min, Dinghan Shen +4

Learning disentangled representations of natural language is essential for many NLP tasks, e.g., conditional text generation, style transfer, personalized dialogue systems, etc. Si…

cs.LG2019

Dynamic Embedding on Textual Networks via a Gaussian Process

Pengyu Cheng, Yitong Li, Xinyuan Zhang +3

Textual network embedding aims to learn low-dimensional representations of text-annotated nodes in a graph. Prior work in this area has typically focused on fixed graph structures;…

cs.LG2019★ 5 cited

Straight-Through Estimator as Projected Wasserstein Gradient Flow

Pengyu Cheng, Chang Liu, Chunyuan Li +3

The Straight-Through (ST) estimator is a widely used technique for back-propagating gradients through discrete random variables. However, this effective method lacks theoretical ju…