activity
20182024
most citedUnderstanding the Effectiveness of Lipschitz-Continuity in Generative Adversarial Nets

8 citations · 10 across the 10 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

math.OC2023

Gradient Tracking for High Dimensional Federated Optimization

Jiadong Liang, Yang Peng, Zhihua Zhang

In this paper, we study the (decentralized) distributed optimization problem with high-dimensional sparse structure. Building upon the FedDA algorithm, we propose a (Decentralized)…

stat.ML2023

Estimation and Inference in Distributional Reinforcement Learning

Liangyu Zhang, Yang Peng, Jiadong Liang +2

In this paper, we study distributional reinforcement learning from the perspective of statistical efficiency. We investigate distributional policy evaluation, aiming to estimate th…

math.OC2023

Convergence and Inference of Stream SGD, with Applications to Queueing Systems and Inventory Control

Xiang Li, Jiadong Liang, Xinyun Chen +1

Stream stochastic gradient descent (SGD) is a simple and efficient method for solving online optimization problems in operations research (OR), where data is generated by parameter…

cs.LG2023

Semi-Infinitely Constrained Markov Decision Processes and Efficient Reinforcement Learning

Liangyu Zhang, Yang Peng, Wenhao Yang +1

We propose a novel generalization of constrained Markov decision processes (CMDPs) that we call the \emph{semi-infinitely constrained Markov decision process} (SICMDP). Particularl…

math.OC2023

Asymptotic Behaviors and Phase Transitions in Projected Stochastic Approximation: A Jump Diffusion Approach

Jiadong Liang, Yuze Han, Xiang Li +1

In this paper we consider linearly constrained optimization problems and propose a loopless projection stochastic approximation (LPSA) algorithm. It performs the projection with pr…