Complex-valued autoencoders

DOI10.1016/j.neunet.2012.04.011zbMath1258.68111arXiv1108.4135WikidataQ42240356 ScholiaQ42240356MaRDI QIDQ1941595

Zhiqin Lu, Pierre Baldi

Publication date: 13 March 2013

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.4135

zbMATH Keywords

EM algorithm; principal component analysis; critical points; differential geometry; unsupervised learning; linear networks; complex numbers; complex neural networks; autoencoders; deep architectures

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

92B20: Neural networks for/in biological studies, artificial life and related topics

Related Items

Learning the Structural Vocabulary of a Network, Boolean autoencoders and hypercube clustering complexity, Learning in the machine: random backpropagation and the deep learning channel, Piecewise convexity of artificial neural networks, Global optimization issues in deep network regression: an overview

Uses Software

• darch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Auto-association by multilayer perceptrons and singular value decomposition
• A simplified neuron model as a principal component analyzer
• Differential-geometrical methods in statistics.
• Exact matrix completion via convex optimization
• Reducing the Dimensionality of Data with Neural Networks
• Deep Belief Networks Are Compact Universal Approximators
• Complex-Valued Neural Networks
• A Connection Between Score Matching and Denoising Autoencoders
• A Fast Learning Algorithm for Deep Belief Nets