Coordinate Descent with Online Adaptation of Coordinate Frequencies
Tobias Glasmachers, \"Ur\"un Dogan

TL;DR
This paper introduces an adaptive coordinate descent method that dynamically adjusts coordinate selection frequencies during optimization, leading to faster training of machine learning models like SVMs, LASSO, and logistic regression.
Contribution
The paper proposes the adaptive coordinate frequencies (ACF) mechanism for coordinate descent, eliminating the need for pre-estimated fixed frequencies and improving convergence speed.
Findings
Significant speed-ups over existing training methods.
Effective adaptation to changing optimization requirements.
Versatile application across various machine learning problems.
Abstract
Coordinate descent (CD) algorithms have become the method of choice for solving a number of optimization problems in machine learning. They are particularly popular for training linear models, including linear support vector machine classification, LASSO regression, and logistic regression. We consider general CD with non-uniform selection of coordinates. Instead of fixing selection frequencies beforehand we propose an online adaptation mechanism for this important parameter, called the adaptive coordinate frequencies (ACF) method. This mechanism removes the need to estimate optimal coordinate frequencies beforehand, and it automatically reacts to changing requirements during an optimization run. We demonstrate the usefulness of our ACF-CD approach for a variety of optimization problems arising in machine learning contexts. Our algorithm offers significant speed-ups over…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Face and Expression Recognition · Gaussian Processes and Bayesian Inference
