A Multi-parameter Updating Fourier Online Gradient Descent Algorithm for Large-scale Nonlinear Classification
Yigying Chen

TL;DR
This paper introduces MPU-FOGD, a novel online gradient descent algorithm with a new random feature map that improves adaptability and reduces dimensionality for large-scale nonlinear classification tasks.
Contribution
It proposes a multi-parameter updating strategy and a new random feature map that enhances model adaptability and reduces computational complexity in online nonlinear classification.
Findings
Achieves tighter error bounds than existing methods.
Obtains better test accuracy on benchmark datasets.
Reduces feature dimension while maintaining performance.
Abstract
Large scale nonlinear classification is a challenging task in the field of support vector machine. Online random Fourier feature map algorithms are very important methods for dealing with large scale nonlinear classification problems. The main shortcomings of these methods are as follows: (1) Since only the hyperplane vector is updated during learning while the random directions are fixed, there is no guarantee that these online methods can adapt to the change of data distribution when the data is coming one by one. (2) The dimension of the random direction is often higher for obtaining better classification accuracy, which results in longer test time. In order to overcome these shortcomings, a multi-parameter updating Fourier online gradient descent algorithm (MPU-FOGD) is proposed for large-scale nonlinear classification problems based on a novel random feature map. In the proposed…
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
TopicsMachine Learning and ELM · Face and Expression Recognition · Neural Networks and Applications
