Control-based algorithms for high dimensional online learning

doi:10.1016/j.jfranklin.2019.12.039

Control-based algorithms for high dimensional online learning

2020-02-01

4

PRE

AI

DOI：10.1016/j.jfranklin.2019.12.039

Original

Original request for help

Save

Abstract

En 中文

In the era of big data, the high-dimensional online learning problems require huge computing power. This paper proposes a novel approach for high-dimensional online learning. Two new algorithms are developed for online high-dimensional regression and classification problems, respectively. The problems are formulated as feedback control problems for some low dimensional systems. The novel learning algorithms are then developed via the control problems. Via an efficient polar decomposition, we derive the explicit solutions of the control problems, substantially reducing the corresponding computational complexity, especially for high dimensional large-scale data streams. Comparing with conventional methods, the new algorithm can achieve more robust and accurate performance with faster convergence. This paper demonstrates that optimal control can be an effective approach for developing high dimensional learning algorithms. We have also for the first time proposed a control-based robust algorithm for classification problems. Numerical results support our theory and illustrate the efficiency of our algorithm. (C) 2020 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Keywords:

SUPPORT VECTOR MACHINES

REGRESSION

NETWORKS

Control-based algorithms for high dimensional online learning

Abstract

AI Summary

Journal

Organization