Unveiling Multiple Descents in Unsupervised Autoencoders

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Rahimi, Kobi, Refael, Yehonathan, Tirer, Tom, Lindenbaum, Ofir
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915496226455552
author Rahimi, Kobi
Refael, Yehonathan
Tirer, Tom
Lindenbaum, Ofir
author_facet Rahimi, Kobi
Refael, Yehonathan
Tirer, Tom
Lindenbaum, Ofir
contents The phenomenon of double descent has challenged the traditional bias-variance trade-off in supervised learning but remains unexplored in unsupervised learning, with some studies arguing for its absence. In this study, we first demonstrate analytically that double descent does not occur in linear unsupervised autoencoders (AEs). In contrast, we show for the first time that both double and triple descent can be observed with nonlinear AEs across various data models and architectural designs. We examine the effects of partial sample and feature noise and highlight the importance of bottleneck size in influencing the double descent curve. Through extensive experiments on both synthetic and real datasets, we uncover model-wise, epoch-wise, and sample-wise double descent across several data types and architectures. Our findings indicate that over-parameterized models not only improve reconstruction but also enhance performance in downstream tasks such as anomaly detection and domain adaptation, highlighting their practical value in complex real-world scenarios.
format Preprint
id arxiv_https___arxiv_org_abs_2406_11703
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Unveiling Multiple Descents in Unsupervised Autoencoders
Rahimi, Kobi
Refael, Yehonathan
Tirer, Tom
Lindenbaum, Ofir
Machine Learning
The phenomenon of double descent has challenged the traditional bias-variance trade-off in supervised learning but remains unexplored in unsupervised learning, with some studies arguing for its absence. In this study, we first demonstrate analytically that double descent does not occur in linear unsupervised autoencoders (AEs). In contrast, we show for the first time that both double and triple descent can be observed with nonlinear AEs across various data models and architectural designs. We examine the effects of partial sample and feature noise and highlight the importance of bottleneck size in influencing the double descent curve. Through extensive experiments on both synthetic and real datasets, we uncover model-wise, epoch-wise, and sample-wise double descent across several data types and architectures. Our findings indicate that over-parameterized models not only improve reconstruction but also enhance performance in downstream tasks such as anomaly detection and domain adaptation, highlighting their practical value in complex real-world scenarios.
title Unveiling Multiple Descents in Unsupervised Autoencoders
topic Machine Learning
url https://arxiv.org/abs/2406.11703