title: Greedy Criterion in Orthogonal Greedy Learning.
abstract: Orthogonal greedy learning (OGL) is a stepwise learning scheme that starts with selecting a new atom from a specified dictionary via the steepest gradient descent (SGD) and then builds the estimator through orthogonal projection. In this paper, we found that SGD is not the unique greedy criterion and introduced a new greedy criterion, called as " -greedy threshold" for learning. Based on this new greedy criterion, we derived a straightforward termination rule for OGL. Our theoretical study shows that the new learning scheme can achieve the existing (almost) optimal learning rate of OGL. Numerical experiments are also provided to support that this new scheme can achieve almost optimal generalization performance while requiring less computation than OGL.
authors.forename: Lin
authors.initials: L
authors.lastname: Xu
authors.forename: Shaobo
authors.initials: S
authors.lastname: Lin
authors.forename: Jinshan
authors.initials: J
authors.lastname: Zeng
authors.forename: Xia
authors.initials: X
authors.lastname: Liu
authors.forename: Yi
authors.initials: Y
authors.lastname: Fang
authors.forename: Zongben
authors.initials: Z
authors.lastname: Xu