paper-with-me

홈 › Papers

Block-Cyclic Stochastic Coordinate Descent for Deep Neural Networks

2017-11-20 · Kensuke Nakamura, Stefano Soatto, Byung-Woo Hong

We present a stochastic first-order optimization algorithm, named BCSC, that adds a cyclic constraint to stochastic block-coordinate descent. It uses different subsets of the data to update different subsets of the parameters, thus limiting the detrimental effect of outliers in the training set. Empirical tests in benchmark datasets show that our algorithm outperforms state-of-the-art optimization methods in both accuracy as well as convergence speed. The improvements are consistent across different architectures, and can be combined with other training techniques and regularization methods.

📄 PDF Abstract BibTeX arXiv:1711.07190

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Cyclic Block Coordinate Descent With Variance Reduction for Composite Nonconvex Optimization

2022-12-09 · Xufeng Cai, Chaobing Song, Stephen J. Wright, Jelena Diakonikolas

Nonconvex optimization is central in solving many machine learning problems, in which block-wise structure is commonly encountered. In this work, we propose cyclic block coordinate methods for nonconvex optimization prob…

Importance sampling strategy for non-convex randomized block-coordinate descent

2016-06-23 · Rémi Flamary, Alain Rakotomamonjy, Gilles Gasso

As the number of samples and dimensionality of optimization problems related to statistics an machine learning explode, block coordinate descent algorithms have gained popularity since they reduce the original problem to…

Markov Chain Block Coordinate Descent

2018-11-22 · Tao Sun, Yuejiao Sun, Yangyang Xu, Wotao Yin

The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Mark…

Distributed Optimization

Semi-Cyclic Stochastic Gradient Descent

2019-04-23 · Hubert Eichner, Tomer Koren, H. Brendan McMahan, Nathan Srebro 외

We consider convex SGD updates with a block-cyclic structure, i.e. where each cycle consists of a small number of blocks, each with many samples from a possibly different, block-specific, distribution. This situation ari…

Federated Learning

Randomized Block Coordinate Descent for Online and Stochastic Optimization

2014-07-01 · Huahua Wang, Arindam Banerjee

Two types of low cost-per-iteration gradient descent methods have been extensively studied in parallel. One is online or stochastic gradient descent (OGD/SGD), and the other is randomzied coordinate descent (RBCD). In th…

Stochastic Optimization