Yu Cheng

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Efficient Algorithms for Planning with Participation Constraints.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Outlier-Robust Sparse Estimation via Non-Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Planning with Participation Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

A Simple Mechanism for a Budget-Constrained Buyer.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time.

[BibT_eX]

[DOI]

Anilesh Kollagunta Krishnaswamy

Honghao Lin

Proceedings of the 9th International Conference on Learning Representations, 2021

Sparsification of Directed Graphs via Cut Balance.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Fair for All: Best-effort Fairness Guarantees for Classification.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Classification with Few Tests through Self-Selection.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Automated Mechanism Design for Classification with Partial Verification.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Group Fairness in Committee Selection.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2020

High-dimensional Robust Mean Estimation via Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

High-Dimensional Robust Mean Estimation in Nearly-Linear Time.

[BibT_eX]

[DOI]

Ilias Diakonikolas

Rong Ge

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Distinguishing Distributions When Samples Are Strategically Transformed.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

When Samples Are Strategically Selected.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Faster Algorithms for High-Dimensional Robust Covariance Estimation.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

A Better Algorithm for Societal Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Robust Learning of Fixed-Structure Bayesian Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A Deterministic Protocol for Sequential Asymptotic Learning.

[BibT_eX]

[DOI]

Wade Hann-Caruthers

Omer Tamuz

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Non-Convex Matrix Completion Against a Semi-Random Adversary.

[BibT_eX]

[DOI]

Rong Ge

Proceedings of the Conference On Learning Theory, 2018

On the Distortion of Voting With Multiple Representative Candidates.

[BibT_eX]

[DOI]

Shaddin Dughmi

David Kempe

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Playing Anonymous Games using Simple Strategies.

[BibT_eX]

[DOI]

Ilias Diakonikolas

Alistair Stewart

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Of the People: Voting Is More Effective with Representative Candidates.

[BibT_eX]

[DOI]

Shaddin Dughmi

David Kempe

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

A Note on Teaching for VC Classes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

On the Recursive Teaching Dimension of VC Classes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015

Spectral Sparsification of Random-Walk Matrix Polynomials.

[BibT_eX]

[DOI]

CoRR, 2015

Well-Supported versus Approximate Nash Equilibria: Query Complexity of Large Games.

[BibT_eX]

[DOI]

CoRR, 2015

Near-Optimal Hardness Results for Signaling in Bayesian Games.

[BibT_eX]

[DOI]

CoRR, 2015

Mixture Selection, Mechanism Design, and Signaling.

[BibT_eX]

[DOI]