← Search

Zhehui Chen

6 accepted papers

2023

Robust Multi-Agent Reinforcement Learning via Adversarial Regularization: Theoretical Foundation and Stable Algorithms

NeurIPS 2023poster

Multi-Agent Reinforcement Learning (MARL) has shown promising results across several domains. Despite this promise, MARL policies often lack robustness and are therefore sensitive to small changes in their environment. This presents a serious concern for the real world deployment of MARL algorithms,…

2019

On Computation and Generalization of Generative Adversarial Networks under Spectrum Control

ICLR 2019poster

Generative Adversarial Networks (GANs), though powerful, is hard to train. Several recent works (Brock et al., 2016; Miyato et al., 2018) suggest that controlling the spectra of weight matrices in the discriminator can significantly improve the training of GANs. Motivated by their discovery, we prop…

Cited by 26SourcePDFScholar
2019

On Constrained Nonconvex Stochastic Optimization: A Case Study for Generalized Eigenvalue Decomposition

AISTATS 2019poster

We study constrained nonconvex optimization problems in machine learning and signal processing. It is well-known that these problems can be rewritten to a min-max problem in a Lagrangian form. However, due to the lack of convexity, their landscape is not well understood and how to find the stable eq…

Cited by 16SourcePDFScholar
2017

Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability

ICML 2017poster

Multiview representation learning is popular for latent factor analysis. Many existing approaches formulate the multiview representation learning as convex optimization problems, where global optima can be obtained by certain algorithms in polynomial time. However, many evidences have corroborated t…

Cited by 5SourcePDFScholar