← Search

Cheuk Ting Li

9 accepted papers

2025

Be More Diverse than the Most Diverse: Optimal Mixtures of Generative Models via Mixture-UCB Bandit Algorithms

ICLR 2025poster

The availability of multiple training algorithms and architectures for generative models requires a selection mechanism to form a single model over a group of well-trained generation models. The selection task is commonly addressed by identifying the model that maximizes an evaluation score based on…

2025

Unveiling Differences in Generative Models: A Scalable Differential Clustering Approach

CVPR 2025highlight

A fine-grained comparison of generative models requires the identification of sample types generated differently by each of the involved models. While quantitative scores have been proposed in the literature to rank different generative models, score-based evaluation and ranking do not reveal the nu…

2024

An Interpretable Evaluation of Entropy-based Novelty of Generative Models

ICML 2024poster

The massive developments of generative model frameworks require principled methods for the evaluation of a model's novelty compared to a reference dataset. While the literature has extensively studied the evaluation of the quality, diversity, and generalizability of generative models, the assessment…

2024

Communication-Efficient Laplace Mechanism for Differential Privacy via Random Quantization

ICASSP 2024accepted

We propose the first method that realizes the Laplace mechanism exactly (i.e., a Laplace noise is added to the data) that requires only a finite amount of communication (whereas the original Laplace mechanism requires the transmission of a real number) while guaranteeing privacy against the server a…

Cited by 0SourceScholar
2024

Compression with Exact Error Distribution for Federated Learning

AISTATS 2024poster

Compression schemes have been extensively used in Federated Learning (FL) to reduce the communication cost of distributed learning. While most approaches rely on a bounded variance assumption of the noise produced by the compressor, this paper investigates the use of compression and aggregation sche…

2024

On Convergence in Wasserstein Distance and f-divergence Minimization Problems

AISTATS 2024poster

The zero-sum game in generative adversarial networks (GANs) for learning the distribution of observed data is known to reduce to the minimization of a divergence measure between the underlying and generative models. However, the current theoretical understanding of the role of the target divergence…

Cited by 4SourcePDFScholar
2024

Universal Exact Compression of Differentially Private Mechanisms

NeurIPS 2024poster

To reduce the communication cost of differential privacy mechanisms, we introduce a novel construction, called Poisson private representation (PPR), designed to compress and simulate any local randomizer while ensuring local differential privacy. Unlike previous simulation-based local differential p…

2023

An Information-Theoretic Evaluation of Generative Models in Learning Multi-modal Distributions

NeurIPS 2023poster

The evaluation of generative models has received significant attention in the machine learning community. When applied to a multi-modal distribution which is common among image datasets, an intuitive evaluation criterion is the number of modes captured by the generative model. While several scores…