paper-with-me

홈 › Papers

Stochastic Gradient Variance Reduction by Solving a Filtering Problem

2020-12-22 · Xingyi Yang

Deep neural networks (DNN) are typically optimized using stochastic gradient descent (SGD). However, the estimation of the gradient using stochastic samples tends to be noisy and unreliable, resulting in large gradient variance and bad convergence. In this paper, we propose \textbf{Filter Gradient Decent}~(FGD), an efficient stochastic optimization algorithm that makes the consistent estimation of the local gradient by solving an adaptive filtering problem with different design of filters. Our method reduces variance in stochastic gradient descent by incorporating the historical states to enhance the current estimation. It is able to correct noisy gradient direction as well as to accelerate the convergence of learning. We demonstrate the effectiveness of the proposed Filter Gradient Descent on numerical optimization and training neural networks, where it achieves superior and robust performance compared with traditional momentum-based methods. To the best of our knowledge, we are the first to provide a practical solution that integrates filtering into gradient estimation by making the analogy between gradient estimation and filtering problems in signal processing. (The code is provided in https://github.com/Adamdad/Filter-Gradient-Decent)

📄 PDF Abstract BibTeX arXiv:2012.12418

Code (1)

Adamdad/Filter-Gradient-Decent 공식 구현 pytorch

Tasks

Stochastic Optimization

Similar Papers 제목 키워드 기반

Kalman Gradient Descent: Adaptive Variance Reduction in Stochastic Optimization

2018-10-29 · James Vuckovic

We introduce Kalman Gradient Descent, a stochastic optimization algorithm that uses Kalman filtering to adaptively reduce gradient variance in stochastic gradient descent by filtering the gradient estimates. We present b…

BIG-bench Machine LearningStochastic OptimizationVariational Inference

Stochastic Proximal Gradient Descent with Acceleration Techniques

2014-12-01 · NeurIPS 2014 12 · Atsushi Nitanda

Proximal gradient descent (PGD) and stochastic proximal gradient descent (SPGD) are popular methods for solving regularized risk minimization problems in machine learning and statistics. In this paper, we propose and ana…

Forward-backward-forward methods with variance reduction for stochastic variational inequalities

2019-02-09 · Radu Ioan Bot, Panayotis Mertikopoulos, Mathias Staudigl, Phan Tu Vuong

We develop a new stochastic algorithm with variance reduction for solving pseudo-monotone stochastic variational inequalities. Our method builds on Tseng's forward-backward-forward (FBF) algorithm, which is known in the …

Stochastic Conjugate Gradient Algorithm with Variance Reduction

2017-10-27 · Xiao-Bo Jin, Xu-Yao Zhang, Kai-Zhu Huang, Guang-Gang Geng

Conjugate gradient (CG) methods are a class of important methods for solving linear equations and nonlinear optimization problems. In this paper, we propose a new stochastic CG algorithm with variance reduction and we pr…

Computational Efficiency

Stochastic Variance Reduction for Variational Inequality Methods

2021-02-16 · Ahmet Alacaoglu, Yura Malitsky

We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions. Our framework applies to extragradient, forward-backward-for…