activity
20182025
most citedUnderstanding Overparameterization in Generative Adversarial Networks

12 citations · 61 across the 17 of their papers we have counts for

collaborators

18 papers

cs.LG2025

PICore: Physics-Informed Unsupervised Coreset Selection for Data Efficient Neural Operator Training

Anirudh Satheesh, Anant Khandelwal, Mucong Ding +1

Neural operators offer a powerful paradigm for solving partial differential equations (PDEs) that cannot be solved analytically by learning mappings between function spaces. Howeve…

cs.LG2025

EnsemW2S: Enhancing Weak-to-Strong Generalization with Large Language Model Ensembles

Aakriti Agrawal, Mucong Ding, Zora Che +6

With Large Language Models (LLMs) rapidly approaching and potentially surpassing human-level performance, it has become imperative to develop approaches capable of effectively supe…

cs.LG2024

SAFLEX: Self-Adaptive Augmentation via Feature Label Extrapolation

Mucong Ding, Bang An, Yuancheng Xu +2

Data augmentation, a cornerstone technique in deep learning, is crucial in enhancing model performance, especially with scarce labeled data. While traditional techniques are effect…

cs.LG2024★ 1 cited

EnsemW2S: Enhancing Weak-to-Strong Generalization with Large Language Model Ensembles

Aakriti Agrawal, Mucong Ding, Zora Che +6

With Large Language Models (LLMs) rapidly approaching and potentially surpassing human-level performance, it has become imperative to develop approaches capable of effectively supe…

cs.LG2024★ 3 cited

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

Mucong Ding, Chenghao Deng, Jocelyn Choo +8

While generalization over tasks from easy to hard is crucial to profile language models (LLMs), the datasets with fine-grained difficulty annotations for each problem across a broa…

cs.LG2024★ 7 cited

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

Mucong Ding, Tahseen Rabbani, Bang An +2

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 force…

cs.LG2024★ 1 cited

SAIL: Self-Improving Efficient Online Alignment of Large Language Models

Mucong Ding, Souradip Chakraborty, Vibhu Agrawal +5

Reinforcement Learning from Human Feedback (RLHF) is a key method for aligning large language models (LLMs) with human preferences. However, current offline alignment approaches li…

cs.LG2024

Calibrated Dataset Condensation for Faster Hyperparameter Search

Mucong Ding, Yuancheng Xu, Tahseen Rabbani +5

Dataset condensation can be used to reduce the computational cost of training multiple models on a large dataset by condensing the training dataset into a small synthetic set. Stat…

cs.LG2024

Spectral Greedy Coresets for Graph Neural Networks

Mucong Ding, Yinhan He, Jundong Li +1

The ubiquity of large-scale graphs in node-classification tasks significantly hinders the real-world applications of Graph Neural Networks (GNNs). Node sampling, graph coarsening,…

cs.CV2024

WAVES: Benchmarking the Robustness of Image Watermarks

Bang An, Mucong Ding, Tahseen Rabbani +8

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 ben…

cs.LG2022★ 10 cited

Transferring Fairness under Distribution Shifts via Fair Consistency Regularization

Bang An, Zora Che, Mucong Ding +1

The increasing reliance on ML models in high-stakes tasks has raised a major concern on fairness violations. Although there has been a surge of work that improves algorithmic fairn…

cs.LG2021★ 11 cited

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

Mucong Ding, Kezhi Kong, Jingling Li +4

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 sca…

cs.LG2021★ 12 cited

Understanding Overparameterization in Generative Adversarial Networks

Yogesh Balaji, Mohammadmahdi Sajedi, Neha Mukund Kalibhat +4

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 th…

cs.LG2020★ 10 cited

Robust Optimization as Data Augmentation for Large-scale Graphs

Kezhi Kong, Guohao Li, Mucong Ding +5

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 perfor…

cs.LG2020★ 2 cited

GANs with Conditional Independence Graphs: On Subadditivity of Probability Divergences

Mucong Ding, Constantinos Daskalakis, Soheil Feizi

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 tra…

cs.LG2018★ 2 cited

Effective Feature Learning with Unsupervised Learning for Improving the Predictive Models in Massive Open Online Courses

Mucong Ding, Kai Yang, Dit-Yan Yeung +1

The effectiveness of learning in massive open online courses (MOOCs) can be significantly enhanced by introducing personalized intervention schemes which rely on building predictiv…

cs.LG2018

Transfer Learning using Representation Learning in Massive Open Online Courses

Mucong Ding, Yanbang Wang, Erik Hemberg +1

In a Massive Open Online Course (MOOC), predictive models of student behavior can support multiple aspects of learning, including instructor feedback and timely intervention. Ongoi…

cond-mat.stat-mech2018★ 2 cited

First-passage time distribution for random walks on complex networks using inverse Laplace transform and mean-field approximation

Mucong Ding, Kwok Yip Szeto

We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the sum…