← Search

Mucong Ding

10 accepted papers

2025

A Technical Report on “Erasing the Invisible”: The 2024 NeurIPS Competition on Stress Testing Image Watermarks

NeurIPS 2025poster

AI-generated images have become pervasive, raising critical concerns around content authenticity, intellectual property, and the spread of misinformation. Invisible watermarks offer a promising solution for identifying AI-generated images, preserving content provenance without degrading visual quali…

Cited by 0SourceScholar
2024

Easy2Hard-Bench: Standardized Difficulty Labels for Profiling LLM Performance and Generalization

NeurIPS 2024poster

Despite the abundance of datasets available for assessing large language models (LLMs), the scarcity of continuous and reliable difficulty labels for individual data points, in most cases, curtails their capacity to benchmark model generalization performance across different levels of complexity. Ad…

Cited by 0SourcePDFScholar
2024

SAFLEX: Self-Adaptive Augmentation via Feature Label Extrapolation

ICLR 2024poster

Data augmentation, a cornerstone technique in deep learning, is crucial in enhancing model performance, especially with scarce labeled data. While traditional techniques are effective, their reliance on hand-crafted methods limits their applicability across diverse data types and tasks. Although mod…

Cited by 1SourcePDFScholar
2024

WAVES: Benchmarking the Robustness of Image Watermarks

ICML 2024poster

In the burgeoning age of generative AI, watermarks act as identifiers of provenance and artificial content. We present WAVES (Watermark Analysis via Enhanced Stress-testing), a benchmark for assessing image watermark robustness, overcoming the limitations of current evaluation methods. WAVES integra…

2022

Robust Optimization As Data Augmentation for Large-Scale Graphs

CVPR 2022poster

Data augmentation helps neural networks generalize better by enlarging the training set, but it remains an open question how to effectively augment graph data to enhance the performance of GNNs (Graph Neural Networks). While most existing graph regularizers focus on manipulating graph topological st…

Cited by 122PDFcodeScholar
2022

Sketch-GNN: Scalable Graph Neural Networks with Sublinear Training Complexity

NeurIPS 2022accept

Graph Neural Networks (GNNs) are widely applied to graph learning problems such as node classification. When scaling up the underlying graphs of GNNs to a larger size, we are forced to either train on the complete graph and keep the full graph adjacency and node embeddings in memory (which is often…

Cited by 23SourcePDFScholar
2022

Transferring Fairness under Distribution Shifts via Fair Consistency Regularization

NeurIPS 2022accept

The increasing reliance on ML models in high-stakes tasks has raised a major concern about fairness violations. Although there has been a surge of work that improves algorithmic fairness, most are under the assumption of an identical training and test distribution. In many real-world applications, h…

2021

GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences

AISTATS 2021poster

Generative Adversarial Networks (GANs) are modern methods to learn the underlying distribution of a data set. GANs have been widely used in sample synthesis, de-noising, domain transfer, etc. GANs, however, are designed in a model-free fashion where no additional information about the underlying dis…

Cited by 10SourcePDFScholar
2021

Understanding Over-parameterization in Generative Adversarial Networks

ICLR 2021poster

A broad class of unsupervised deep learning methods such as Generative Adversarial Networks (GANs) involve training of overparameterized models where the number of parameters of the model exceeds a certain threshold. Indeed, most successful GANs used in practice are trained using overparameterized g…

Cited by 37SourcePDFScholar
2021

VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization

NeurIPS 2021poster

Most state-of-the-art Graph Neural Networks (GNNs) can be defined as a form of graph convolution which can be realized by message passing between direct neighbors or beyond. To scale such GNNs to large graphs, various neighbor-, layer-, or subgraph-sampling techniques are proposed to alleviate the "…