2 citations · 3 across the 13 of their papers we have counts for
13 papers
Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework
Junwen Qiu, Bohao Ma, Andre Milzarek +1
Unit excitation (UE) is a common assumption in stochastic saddle avoidance: the stochastic error must have a uniformly positive component along every direction, in expectation. Thi…
Zero-VC: Zero-Lookahead Streaming Voice Conversion via Speaker Anonymization
Yudong Li, Zihao Fang, Junwen Qiu +4
Streaming zero-shot voice conversion struggles to disentangle timbre from linguistic content without degrading utility or inflating latency. Current methods rely on information bot…
FlexiSLM: A Spoken Language Model with Dynamic and Controllable Frame Rates
Jiaqi Li, Chaoren Wang, Xiaohai Tian +9
Spoken language models (SLMs) extend LLMs to speech input and output, but existing systems use fixed frame rates (e.g., 25 or 12.5 Hz), overlooking speech's time-varying informatio…
Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
Junwen Qiu, Leilei Mei, Junyu Zhang
The global Lipschitz smoothness condition underlies most convergence and complexity analyses via two key consequences: the descent lemma and the gradient Lipschitz continuity. How…
A New Kernel Regularity Condition for Distributed Mirror Descent: Broader Coverage and Simpler Analysis
Junwen Qiu, Ziyang Zeng, Leilei Mei +1
Existing convergence analyses of distributed optimization methods in non-Euclidean geometries typically rely on kernel assumptions: (i) global Lipschitz smoothness and (ii) bi-conv…
A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
Junwen Qiu, Bohao Ma, Xiao Li +1
We propose a novel analysis framework for non-descent-type optimization methodologies in nonconvex scenarios based on the Kurdyka-Lojasiewicz property. Our framework allows coverin…
A Generalized Version of Chung's Lemma and its Applications
Li Jiang, Xiao Li, Andre Milzarek +1
Chung's Lemma is a classical tool for establishing asymptotic convergence rates of (stochastic) optimization methods under strong convexity-type assumptions and appropriate polynom…
Convergence of SGD with momentum in the nonconvex case: A time window-based analysis
Junwen Qiu, Bohao Ma, Andre Milzarek
The stochastic gradient descent method with momentum (SGDM) is a common approach for solving large-scale and stochastic optimization problems. Despite its popularity, the convergen…
Random Reshuffling with Momentum: Complexity Bounds and Last-iterate Convergence
Junwen Qiu, Bohao Ma, Andre Milzarek
Random reshuffling with momentum (RRM) corresponds to the SGD optimizer with the 'momentum' option enabled, as found in many machine learning libraries such as PyTorch and TensorFl…
A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
Junwen Qiu, Xiao Li, Andre Milzarek
Random reshuffling techniques are prevalent in large-scale applications, such as training neural networks. While the convergence and acceleration effects of random reshuffling-type…
A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
Junwen Qiu, Li Jiang, Andre Milzarek
The proximal stochastic gradient method (PSGD) is one of the state-of-the-art approaches for stochastic composite-type problems. In contrast to its deterministic counterpart, PSGD…
Distributed Random Reshuffling over Networks
Kun Huang, Xiao Li, Andre Milzarek +2
In this paper, we consider distributed optimization problems where agents, each possessing a local cost function, collaboratively minimize the average of the local cost functio…
Convergence of Random Reshuffling Under The Kurdyka-Łojasiewicz Inequality
Xiao Li, Andre Milzarek, Junwen Qiu
We study the random reshuffling (RR) method for smooth nonconvex optimization problems with a finite-sum structure. Though this method is widely utilized in practice such as the tr…