activity
20122022
most citedHybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications

128 citations · 505 across the 21 of their papers we have counts for

collaborators
Showing 2019Show all

9 papers · 1 filter

math.OC2019★ 5 cited

Leveraging Two Reference Functions in Block Bregman Proximal Gradient Descent for Non-convex and Non-Lipschitz Problems

Tianxiang Gao, Songtao Lu, Jia Liu +1

In the applications of signal processing and data analytics, there is a wide class of non-convex problems whose objective function is freed from the common global Lipschitz continu…

cs.LG2019★ 23 cited

Learn Electronic Health Records by Fully Decentralized Federated Learning

Songtao Lu, Yawen Zhang, Yunlong Wang +1

Federated learning opens a number of research opportunities due to its high communication efficiency in distributed training problems within a star network. In this paper, we focus…

math.OC2019★ 12 cited

Improving the Sample and Communication Complexity for Decentralized Non-Convex Optimization: A Joint Gradient Estimation and Tracking Approach

Haoran Sun, Songtao Lu, Mingyi Hong

Many modern large-scale machine learning problems benefit from decentralized and stochastic optimization. Recent works have shown that utilizing both decentralized computing and lo…

cs.LG2019★ 1 cited

No-regret Non-convex Online Meta-Learning

Zhenxun Zhuang, Yunlong Wang, Kezi Yu +1

The online meta-learning framework is designed for the continual lifelong learning setting. It bridges two fields: meta-learning which tries to extract prior knowledge from past ta…

cs.LG2019★ 18 cited

Min-Max Optimization without Gradients: Convergence and Applications to Adversarial ML

Sijia Liu, Songtao Lu, Xiangyi Chen +5

In this paper, we study the problem of constrained robust (min-max) optimization ina black-box setting, where the desired optimizer cannot access the gradients of the objective fun…

math.OC2019★ 5 cited

SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems

Songtao Lu, Meisam Razaviyayn, Bo Yang +2

This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. Wh…

eess.SP2019★ 52 cited

Signal Demodulation with Machine Learning Methods for Physical Layer Visible Light Communications: Prototype Platform, Open Dataset and Algorithms

Shuai Ma, Jiahui Dai, Songtao Lu +4

In this paper, we investigate the design and implementation of machine learning (ML) based demodulation methods in the physical layer of visible light communication (VLC) systems.…

eess.SP2019★ 65 cited

Deep Learning for Signal Demodulation in Physical Layer Wireless Communications: Prototype Platform, Open Dataset, and Analytics

Hongmei Wang, Zhenzhen Wu, Shuai Ma +4

In this paper, we investigate deep learning (DL)-enabled signal demodulation methods and establish the first open dataset of real modulated signals for wireless communication syste…

math.OC2019★ 128 cited

Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications

Songtao Lu, Ioannis Tsaknakis, Mingyi Hong +1

The min-max problem, also known as the saddle point problem, is a class of optimization problems which minimizes and maximizes two subsets of variables simultaneously. This class o…