30 citations · 148 across the 22 of their papers we have counts for
24 papers
Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation
Hanrui Zhang, Yu Cheng, Vincent Conitzer
We study equilibrium computation with extensive-form correlation in two-player turn-taking stochastic games. Our main results are two-fold: (1) We give an algorithm for computing a…
Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
Yu Cheng, Max Li, Honghao Lin +3
In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The f…
Hiding Data Helps: On the Benefits of Masking for Sparse Coding
Muthu Chidambaram, Chenwei Wu, Yu Cheng +1
Sparse coding, which refers to modeling a signal as sparse linear combinations of the elements of a learned dictionary, has proven to be a successful (and interpretable) approach i…
Efficient Algorithms for Planning with Participation Constraints
Hanrui Zhang, Yu Cheng, Vincent Conitzer
We consider the problem of planning with participation constraints introduced in [Zhang et al., 2022]. In this problem, a principal chooses actions in a Markov decision process, re…
Outlier-Robust Sparse Estimation via Non-Convex Optimization
Yu Cheng, Ilias Diakonikolas, Rong Ge +3
We explore the connection between outlier-robust high-dimensional statistics and non-convex optimization in the presence of sparsity constraints, with a focus on the fundamental ta…
Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time
Yu Cheng, Honghao Lin
We study the problem of learning Bayesian networks where an -fraction of the samples are adversarially corrupted. We focus on the fully-observable case where the underlying grap…