English
Related papers

Related papers: AA-DLADMM: An Accelerated ADMM-based Framework for…

200 papers

The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly to an approximate solution, but can take a long time to…

Optimization and Control · Mathematics 2020-06-29 Wenqing Ouyang , Yue Peng , Yuxin Yao , Juyong Zhang , Bailin Deng

State-of-the-art training algorithms for deep learning models are based on stochastic gradient descent (SGD). Recently, many variations have been explored: perturbing parameters for better accuracy (such as in Extragradient), limiting SGD…

Machine Learning · Computer Science 2022-03-23 Amirkeivan Mohtashami , Martin Jaggi , Sebastian U. Stich

In this project, we have successfully designed, implemented, deployed and tested a novel FPGA accelerated algorithm for neural network training. The algorithm itself was developed in an independent study option. This training method is…

Machine Learning · Computer Science 2020-09-08 Seyedeh Niusha Alavi Foumani , Ce Guo , Wayne Luk

This work demonstrates a hardware-efficient support vector machine (SVM) training algorithm via the alternative direction method of multipliers (ADMM) optimizer. Low-rank approximation is exploited to reduce the dimension of the kernel…

Signal Processing · Electrical Eng. & Systems 2019-07-24 Shuo-An Huang , Chia-Hsiang Yang

Momentum plays a crucial role in stochastic gradient-based optimization algorithms for accelerating or improving training deep neural networks (DNNs). In deep learning practice, the momentum is usually weighted by a well-calibrated…

Machine Learning · Computer Science 2020-12-04 Bao Wang , Qiang Ye

The vast majority of successful deep neural networks are trained using variants of stochastic gradient descent (SGD) algorithms. Recent attempts to improve SGD can be broadly categorized into two approaches: (1) adaptive learning rate…

Machine Learning · Computer Science 2019-12-04 Michael R. Zhang , James Lucas , Geoffrey Hinton , Jimmy Ba

Many modern computer vision and machine learning applications rely on solving difficult optimization problems that involve non-differentiable objective functions and constraints. The alternating direction method of multipliers (ADMM) is a…

Computer Vision and Pattern Recognition · Computer Science 2017-04-11 Zheng Xu , Mario A. T. Figueiredo , Xiaoming Yuan , Christoph Studer , Tom Goldstein

The nonconvex and nonsmooth finite-sum optimization problem with linear constraint has attracted much attention in the fields of artificial intelligence, computer, and mathematics, due to its wide applications in machine learning and the…

Optimization and Control · Mathematics 2023-07-11 Yuxuan Zeng , Zhiguo Wang , Jianchao Bai , Xiaojing Shen

Averaging techniques such as Ruppert--Polyak averaging and exponential movering averaging (EMA) are powerful approaches to accelerate optimization procedures of stochastic gradient descent (SGD) optimization methods such as the popular ADAM…

Optimization and Control · Mathematics 2025-05-29 Arnulf Jentzen , Julian Kranz , Adrian Riekert

In this paper, we propose Stochastic Block-ADMM as an approach to train deep neural networks in batch and online settings. Our method works by splitting neural networks into an arbitrary number of blocks and utilizes auxiliary variables to…

Machine Learning · Computer Science 2021-05-04 Saeed Khorram , Xiao Fu , Mohamad H. Danesh , Zhongang Qi , Li Fuxin

One of the crucial issues in federated learning is how to develop efficient optimization algorithms. Most of the current ones require full device participation and/or impose strong assumptions for convergence. Different from the widely-used…

Optimization and Control · Mathematics 2023-09-26 Shenglong Zhou , Geoffrey Ye Li

Recently, many variance reduced stochastic alternating direction method of multipliers (ADMM) methods (e.g.\ SAG-ADMM, SDCA-ADMM and SVRG-ADMM) have made exciting progress such as linear convergence rates for strongly convex problems.…

Machine Learning · Computer Science 2017-07-12 Yuanyuan Liu , Fanhua Shang , James Cheng

Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The alternating direction method of multipliers (ADMM) has…

Optimization and Control · Mathematics 2025-05-15 Xi Gao , Jinxin Xiong , Linxin Yang , Akang Wang , Weiwei Xu , Jiang Xue

In this paper, we propose a novel distributed algorithm for consensus optimization over networks and a robust extension tailored to deal with asynchronous agents and packet losses. Indeed, to robustly achieve dynamic consensus on the…

Optimization and Control · Mathematics 2025-09-04 Guido Carnevale , Nicola Bastianello , Giuseppe Notarstefano , Ruggero Carli

Stochastic Gradient Decent (SGD) is one of the core techniques behind the success of deep neural networks. The gradient provides information on the direction in which a function has the steepest rate of change. The main problem with basic…

Alternating direction method of multipliers (ADMM) is a popular optimization tool for the composite and constrained problems in machine learning. However, in many machine learning problems such as black-box attacks and bandit feedback, ADMM…

Optimization and Control · Mathematics 2019-07-31 Feihu Huang , Shangqian Gao , Songcan Chen , Heng Huang

We propose new methods to speed up convergence of the Alternating Direction Method of Multipliers (ADMM), a common optimization tool in the context of large scale and distributed learning. The proposed method accelerates the speed of…

Machine Learning · Computer Science 2016-04-05 Changkyu Song , Sejong Yoon , Vladimir Pavlovic

Stochastic alternating direction method of multipliers (ADMM), which visits only one sample or a mini-batch of samples each time, has recently been proved to achieve better performance than batch ADMM. However, most stochastic methods can…

Machine Learning · Computer Science 2015-07-21 Shen-Yi Zhao , Wu-Jun Li , Zhi-Hua Zhou

Weight pruning methods for deep neural networks (DNNs) have been investigated recently, but prior work in this area is mainly heuristic, iterative pruning, thereby lacking guarantees on the weight reduction ratio and convergence time. To…

Neural and Evolutionary Computing · Computer Science 2018-10-23 Tianyun Zhang , Shaokai Ye , Kaiqi Zhang , Jian Tang , Wujie Wen , Makan Fardad , Yanzhi Wang

Stochastic gradient decent~(SGD) and its variants, including some accelerated variants, have become popular for training in machine learning. However, in all existing SGD and its variants, the sample size in each iteration~(epoch) of…

Machine Learning · Statistics 2019-09-18 Shen-Yi Zhao , Hao Gao , Wu-Jun Li