Gradient descent decomposition for multi-objective learning

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multi-objective learning has been explored in neural network because it adjusts the model capacity providing better generalization properties. It usually requires sophisticated algorithms such as ellipsoidal, sliding-mode, genetic algorithms, among others. This paper proposes an affordable algorithm that decomposes the gradient into two components and it adjusts the weights of the network separately. By doing so multi-objective learning with L 2 norm control is accomplished. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Costa, M. A., & Braga, A. P. (2011). Gradient descent decomposition for multi-objective learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6936 LNCS, pp. 377–384). https://doi.org/10.1007/978-3-642-23878-9_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free