For HyperBFs AGOP is a greedy approximation to gradient descent
Name
CBMM-Memo-148.pdf
Size
1.06 MB
Format
Adobe PDF
Checksum (MD5)
518352558665e6a4503756e13f0bfcd9
Author(s) •
Gan, Yulu
Poggio, Tomaso
Date Issued
July 13, 2024
Publisher
Center for Brains, Minds and Machines (CBMM)
Series/Report no.
CBMM Memo;148
Abstract
The Average Gradient Outer Product (AGOP) provides a novel approach to feature learning in neural networks. We applied both AGOP and Gradient Descent to learn the matrix M in the Hyper Basis Function Network (HyperBF) and observed very similar performance. We show formally that AGOP is a greedy approximation of gradient descent.
Persistent DSpace Link