2 citations · 7 across the 15 of their papers we have counts for
14 papers · 1 filter
Wasserstein Convergence of ODE-Based Samplers in Decentralized Diffusion Model via Velocity Field Decomposition
Chencheng Tang, Xuanyu Xue, Fangyikang Wang +2
Diffusion models have achieved impressive empirical success in generative tasks, and their convergence theory is now relatively well understood. Motivated by privacy and scalabilit…
Adaptive Patching Is Harder Than It Looks For Time-Series Forecasting
Federico Zucchi, Yi Xie, Chao Zhang +3
Adaptive patching has been proposed for time-series forecasting: allocate finer patches where the sequence looks locally informative. We compare three adaptive patching methods wit…
Neural Sinkhorn Gradient Flow
Huminhao Zhu, Fangyikang Wang, Chao Zhang +2
Wasserstein Gradient Flows (WGF) with respect to specific functionals have been widely used in the machine learning literature. Recently, neural networks have been adopted to appro…
GAD-PVI: A General Accelerated Dynamic-Weight Particle-Based Variational Inference Framework
Fangyikang Wang, Huminhao Zhu, Chao Zhang +2
Particle-based Variational Inference (ParVI) methods approximate the target distribution by iteratively evolving finite weighted particle systems. Recent advances of ParVI methods…
Towards Optimal Randomized Strategies in Adversarial Example Game
Jiahao Xie, Chao Zhang, Weijie Liu +2
The vulnerability of deep neural network models to adversarial example attacks is a practical challenge in many artificial intelligence applications. A recent line of work shows th…
PACER: A Fully Push-forward-based Distributional Reinforcement Learning Algorithm
Wensong Bai, Chao Zhang, Yichao Fu +3
In this paper, we propose the first fully push-forward-based distributional reinforcement learning algorithm, named PACER, which consists of a distributional critic, a stochastic a…
Accelerated Doubly Stochastic Gradient Algorithm for Large-scale Empirical Risk Minimization
Zebang Shen, Hui Qian, Tongzhou Mu +1
Nowadays, algorithms with fast convergence, small memory footprints, and low per-iteration complexity are particularly favorable for artificial intelligence applications. In this p…
An Asynchronous Decentralized Algorithm for Wasserstein Barycenter Problem
Chao Zhang, Hui Qian, Jiahao Xie
Wasserstein Barycenter Problem (WBP) has recently received much attention in the field of artificial intelligence. In this paper, we focus on the decentralized setting for WBP and…
SIGMA: A Structural Inconsistency Reducing Graph Matching Algorithm
Weijie Liu, Chao Zhang, Nenggan Zheng +1
Graph matching finds the correspondence of nodes across two correlated graphs and lies at the core of many applications. When graph side information is not available, the node corr…
DPVI: A Dynamic-Weight Particle-Based Variational Inference Framework
Chao Zhang, Zhijian Li, Hui Qian +1
The recently developed Particle-based Variational Inference (ParVI) methods drive the empirical distribution of a set of \emph{fixed-weight} particles towards a given target distri…
Approximating Optimal Transport via Low-rank and Sparse Factorization
Weijie Liu, Chao Zhang, Nenggan Zheng +1
Optimal transport (OT) naturally arises in a wide range of machine learning applications but may often become the computational bottleneck. Recently, one line of works propose to s…
CDMA: A Practical Cross-Device Federated Learning Algorithm for General Minimax Problems
Jiahao Xie, Chao Zhang, Zebang Shen +2
Minimax problems arise in a wide range of important applications including robust adversarial learning and Generative Adversarial Network (GAN) training. Recently, algorithms for m…
Generative Actor-Critic: An Off-policy Algorithm Using the Push-forward Model
Lingwei Peng, Hui Qian, Zhebang Shen +2
Model-free deep reinforcement learning has achieved great success in many domains, such as video games, recommendation systems and robotic control tasks. In continuous control task…
From One to All: Learning to Match Heterogeneous and Partially Overlapped Graphs
Weijie Liu, Hui Qian, Chao Zhang +3
Recent years have witnessed a flurry of research activity in graph matching, which aims at finding the correspondence of nodes across two graphs and lies at the heart of many artif…