activity
20172023
most citedTheoretically Principled Trade-off between Robustness and Accuracy

921 citations · 1.2k across the 18 of their papers we have counts for

collaborators
Showing cs.LGShow all

15 papers · 1 filter

cs.LG2023★ 1 cited

Federated Conformal Predictors for Distributed Uncertainty Quantification

Charles Lu, Yaodong Yu, Sai Praneeth Karimireddy +2

Conformal prediction is emerging as a popular paradigm for providing rigorous uncertainty quantification in machine learning since it can be easily applied as a post-processing ste…

cs.LG2022★ 5 cited

TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernels

Yaodong Yu, Alexander Wei, Sai Praneeth Karimireddy +2

State-of-the-art federated learning methods can perform far worse than their centralized counterparts when clients have dissimilar data distributions. For neural networks, even whe…

cs.LG2022

Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback

Tianyi Lin, Aldo Pacchiano, Yaodong Yu +1

Motivated by applications to online learning in sparse estimation and Bayesian optimization, we consider the problem of online unconstrained nonsubmodular minimization with delayed…

cs.LG2022

CLCNet: Rethinking of Ensemble Modeling with Classification Confidence Network

Yao-Ching Yu, Shi-Jinn Horng

In this paper, we propose a Classification Confidence Network (CLCNet) that can determine whether the classification model classifies input samples correctly. It can take a classif…

cs.LG2022★ 1 cited

What You See is What You Get: Principled Deep Learning via Distributional Generalization

Bogdan Kulynych, Yao-Yuan Yang, Yaodong Yu +2

Having similar behavior at training time and test time what we call a "What You See Is What You Get" (WYSIWYG) property is desirable in machine learning. Models trained wit…

cs.LG2021★ 54 cited

ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reduction

Kwan Ho Ryan Chan, Yaodong Yu, Chong You +3

This work attempts to provide a plausible theoretical framework that aims to interpret modern deep (convolutional) networks from the principles of data compression and discriminati…

cs.LG2021★ 6 cited

Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization

Yaodong Yu, Tianyi Lin, Eric Mazumdar +1

Distributionally robust supervised learning (DRSL) is emerging as a key paradigm for building reliable machine learning systems for real-world applications -- reflecting the need f…

cs.LG2021★ 10 cited

Understanding Generalization in Adversarial Training via the Bias-Variance Decomposition

Yaodong Yu, Zitong Yang, Edgar Dobriban +2

Adversarially trained models exhibit a large generalization gap: they can interpolate the training set even for large perturbation radii, but at the cost of large test error on cle…

cs.LG2020★ 9 cited

Deep Networks from the Principle of Rate Reduction

Kwan Ho Ryan Chan, Yaodong Yu, Chong You +3

This work attempts to interpret modern deep (convolutional) networks from the principles of rate reduction and (shift) invariant classification. We show that the basic iterative gr…

cs.LG2020★ 3 cited

Adversarial Robustness of Stabilized NeuralODEs Might be from Obfuscated Gradients

Yifei Huang, Yaodong Yu, Hongyang Zhang +2

In this paper we introduce a provably stable architecture for Neural Ordinary Differential Equations (ODEs) which achieves non-trivial adversarial robustness under white-box advers…

cs.LG2020★ 21 cited

Boundary thickness and robustness in learning models

Yaoqing Yang, Rajiv Khanna, Yaodong Yu +5

Robustness of machine learning models to various adversarial and non-adversarial corruptions continues to be of interest. In this paper, we introduce the notion of the boundary thi…

cs.LG2020★ 58 cited

Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction

Yaodong Yu, Kwan Ho Ryan Chan, Chong You +2

To learn intrinsic low-dimensional structures from high-dimensional data that most discriminate between classes, we propose the principle of Maximal Coding Rate Reduction ($\text{M…

cs.LG2020★ 80 cited

Rethinking Bias-Variance Trade-off for Generalization of Neural Networks

Zitong Yang, Yaodong Yu, Chong You +2

The classical bias-variance trade-off predicts that bias decreases and variance increase with model complexity, leading to a U-shaped risk curve. Recent work calls this into questi…

cs.LG2019★ 921 cited

Theoretically Principled Trade-off between Robustness and Accuracy

Hongyang Zhang, Yaodong Yu, Jiantao Jiao +3

We identify a trade-off between robustness and accuracy that serves as a guiding principle in the design of defenses against adversarial examples. Although this problem has been wi…

cs.LG2017★ 6 cited

Saving Gradient and Negative Curvature Computations: Finding Local Minima More Efficiently

Yaodong Yu, Difan Zou, Quanquan Gu

We propose a family of nonconvex optimization algorithms that are able to save gradient and negative curvature computations to a large extent, and are guaranteed to find an approxi…