arXiv:2601. 19179v2 Announce Type: replace Abstract: Autoencoders have long been considered a nonlinear extension of Principal Component Analysis (PCA).
By Qipeng Zhan, Zhuoping Zhou, Zexuan Wang, Li Shen
arXiv:2502. 03227v2 Announce Type: replace Abstract: Minimally redundant representations are typically learned by minimizing feature covariance.
By Pierre-Fran\c{c}ois De Plaen, Tinne Tuytelaars, Marc Proesmans, Luc Van Gool
arXiv:2606. 28854v1 Announce Type: cross Abstract: The common factor analytic model is related to Helmholtz and Boltzmann machines, can be conceived as a linear autoencoder, or can be thought of as a single-hidden-layer generative neural network.
By Carel F. W. Peeters
arXiv:2402. 14031v2 Announce Type: replace-cross Abstract: This paper presents an autoencoder with ordered variance (AEO), in which the conventional reconstruction loss is augmented by a variance-based regularization term that promotes an ordered structure within the latent space.
By Midhun T. Augustine, Parag Patil, Mani Bhushan, Sharad Bhartiya
arXiv:2607. 05653v1 Announce Type: new Abstract: Principal Component Analysis or PCA-like properties (orthogonality, variance ranking) are seldom realized in deep autoencoder architectures.
By Jeanie Schreiber, Tyrus Berry, Zeeshan Ahmed
arXiv:2606. 03553v1 Announce Type: cross Abstract: While principal component analysis (PCA) is a fundamental tool for dimensionality reduction, its dense representations make it ill-suited for high-dimensional data.
By David V\"avinggren, Francis Bach, Andr\'e M. H. Teixeira, Dave Zachariah, Ant\^onio H. Ribeiro
arXiv:2608.29867v1 Announce Type: new
Abstract: Autoencoders are widely used for nonlinear dimensionality reduction and manifold learning. While most common implementations rely on both nonlinear enc...
By Louen Pottier, Louis Lesueur, Anders Thorin
arXiv:2511. 09432v2 Announce Type: replace Abstract: Machine learning (ML) models achieve remarkable performance but remain hard to interpret due to their scale and complexity.
By Ege Erdogan, Ana Lucic
arXiv:2606. 05335v1 Announce Type: new Abstract: Theoretical studies of machine learning models commonly consider different limiting regimes in which the learning dynamics of gradient descent becomes theoretically tractable.
By Eugene Golikov, Yaroslav Gusev, Dmitry Yarotsky
arXiv:2608. 16245v1 Announce Type: new Abstract: Disentangled representation learning seeks latent representations whose indicidual dimensions each align with a distinct covariate.
By Ma{\l}gorzata {\L}az\k{e}cka, Ewa Szczurek
arXiv:2606. 18538v1 Announce Type: new Abstract: One of the major difficulties in the mechanistic interpretability of neural networks is the occurrence of polysemanticity, which suggests that each neuron is typically responsible for multiple different tasks, impeding a clean interpretation of their function.
By Mriganka Basu Roy Chowdhury, Eric McLaughlin Weiner
arXiv:2509. 24467v3 Announce Type: replace Abstract: Self-supervised learning (SSL) learns representations from massive unlabeled data, yet the resulting models typically operate as black boxes, necessitating domain-specific explanations.
By Maedeh Zarvandi, Michael Timothy, Theresa Wasserer, Debarghya Ghoshdastidar