Permutative redundancy and uncertainty of the objective in deep learning

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Glukhov, Vacslav
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910693985353728
author Glukhov, Vacslav
author_facet Glukhov, Vacslav
contents Implications of uncertain objective functions and permutative symmetry of traditional deep learning architectures are discussed. It is shown that traditional architectures are polluted by an astronomical number of equivalent global and local optima. Uncertainty of the objective makes local optima unattainable, and, as the size of the network grows, the global optimization landscape likely becomes a tangled web of valleys and ridges. Some remedies which reduce or eliminate ghost optima are discussed including forced pre-pruning, re-ordering, ortho-polynomial activations, and modular bio-inspired architectures.
format Preprint
id arxiv_https___arxiv_org_abs_2411_07008
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Permutative redundancy and uncertainty of the objective in deep learning
Glukhov, Vacslav
Artificial Intelligence
Implications of uncertain objective functions and permutative symmetry of traditional deep learning architectures are discussed. It is shown that traditional architectures are polluted by an astronomical number of equivalent global and local optima. Uncertainty of the objective makes local optima unattainable, and, as the size of the network grows, the global optimization landscape likely becomes a tangled web of valleys and ridges. Some remedies which reduce or eliminate ghost optima are discussed including forced pre-pruning, re-ordering, ortho-polynomial activations, and modular bio-inspired architectures.
title Permutative redundancy and uncertainty of the objective in deep learning
topic Artificial Intelligence
url https://arxiv.org/abs/2411.07008