no code implementations • ICML 2020 • Guanyi Wang, Santanu Dey
We propose a new framework that finds out upper (dual) bounds for the sparse PCA within polynomial time via solving a convex integer program (IP).
no code implementations • 25 Jul 2023 • Guanyi Wang, Mengqi Lou, Ashwin Pananjady
We study a principal component analysis problem under the spiked Wishart model in which the structure in the signal is captured by a class of union-of-subspace models.
no code implementations • 11 Feb 2023 • Toru Kitagawa, Guanyi Wang
Focusing on sequential decision games of interacting agents, this paper develops a method to obtain optimal treatment assignment rules that maximize a social welfare criterion by evaluating stationary distributions of outcomes.
1 code implementation • NeurIPS 2021 • Tianyi Chen, Bo Ji, Tianyu Ding, Biyi Fang, Guanyi Wang, Zhihui Zhu, Luming Liang, Yixin Shi, Sheng Yi, Xiao Tu
Structured pruning is a commonly used technique in deploying deep neural networks (DNNs) onto resource-constrained devices.
no code implementations • 1 Jan 2021 • Tianyi Chen, Guanyi Wang, Tianyu Ding, Bo Ji, Sheng Yi, Zhihui Zhu
Optimizing with group sparsity is significant in enhancing model interpretability in machining learning applications, e. g., feature selection, compressed sensing and model compression.
1 code implementation • 7 Dec 2020 • Toru Kitagawa, Guanyi Wang
How to allocate vaccines over heterogeneous individuals is one of the important policy decisions in pandemic times.
1 code implementation • 7 Apr 2020 • Tianyi Chen, Tianyu Ding, Bo Ji, Guanyi Wang, Jing Tian, Yixin Shi, Sheng Yi, Xiao Tu, Zhihui Zhu
Sparsity-inducing regularization problems are ubiquitous in machine learning applications, ranging from feature selection to model compression.