## Portfolio item number 1

Short description of portfolio item number 1

Short description of portfolio item number 1

Short description of portfolio item number 2

Published in *Workshop on Real World Experiment Design and Active Learning at ICML 2020*, 2020

We present the first decentralized policy gradient method (MF-DPGM) for mean-field multi-agent reinforcement learning, where exchangeable agents of a large team communicate via a connected network. We also give a rigorous proof of the global convergence rate of MF-DPGM by studying the geometry of the problem and estimating one-step progress under a decentralized scheme.

Download __here__

Published in *OPT 2020 @ NeurIPS*, 2020

We provide a complete statistical and convergence guarantees for solving an infinite-dimensional zero-sum game via a provably efficient particle-based method under mild conditions.

Recommended citation: Liu, L., Zhang, Y., Yang, Z., Babanezhad, R., & Wang, Z. Infinite-Dimensional Game Optimization via Variational Transport. . __http://lewis-algo.com/files/vartr_game_main.pdf__

Published in *OPT 2020 @ NeurIPS.*, 2020

We introduce new structural assumptions on the problem (such as the directional smoothness) and derive an affine invariant, norm-independent analysis of Frank-Wolfe. Based on our analysis, we propose an affine invariant backtracking line-search. Interestingly, we show that typical backtracking line-searches using smoothness of the objective function surprisingly converge to an affine invariant step size, despite using affine-dependent norms in the computation of step sizes.

Recommended citation: Kerdreux, T., Liu, L., Lacoste-Julien, S., & Scieur, D. (2020). Affine Invariant Analysis of Frank-Wolfe on Strongly Convex Sets. *arXiv preprint*. __http://lewis-algo.com/files/aifw.pdf__

Published in *IEEE Trans. on Signal Processing (To appear)*, 2021

We formulate agnostic matrix phase retrieval as a rank-restricted largest eigenvalue problem by applying the second-order Steinâ€™s identity, and propose a new spectrum truncation power iteration (STPower) method to obtain the desired matrix efficiently. Also, we show a favorable rank recovery result by adopting the STPower method, i.e., a near-optimal statistical convergence rate under relatively general model assumptions from a wide range of applications.

Recommended citation: Liu, L., Lu, S., Zhao, T. & Wang, Z. Spectrum Truncation Power Iteration for Matrix Phase Retrieval. *IEEE Trans. on Signal Processing, 2021+*. __http://lewis-algo.com/files/TSP_matrix.pdf__

We formulate an adaptive distributionally robust facility location problem, where the facility location decisions are affected by diverse scenarios with different demand uncertainty. We learn the ambiguity set for describing the distributional information of demand in a data-driven way. The combination of data and robust stochastic optimization models is expected to yield better solutions in real-world complication.

graduate, *Applied Probability*, 2018

This is a note on Large Sample Theory.

graduate, *Asymptotic Theory*, 2018

This is a note on Asymptotic Theory.

graduate, *Statistical Topics*, 2018

This is a note on Large Sample Theory.