AEGCN uses autoencoder constraints to improve graph node classification.
problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.
Autoencoders compress and reconstruct data for various applications.
problem Efficiently compress and reconstruct data.
method Neural network architecture that encodes and decodes data.
result Autoencoders can be applied to various data types and applications.
Study on dynamics of non-linear autoencoders learning principal components.
problem Technical difficulty in studying non-linear autoencoders due to non-trivial correlations.
method Derive asymptotically exact equations for SGD training of shallow, non-linear autoencoders.
result Autoencoders learn principal components sequentially and tie weights are ineffective.
In this paper we propose a Deep Autoencoder MIxture Clustering (DAMIC) algorithm based on a mixture of deep autoencoders where each cluster is represented by an autoencoder. A clustering network transforms the data into another space and then selects one of the clusters. Next, the autoencoder associated with this clust…
SidAE combines autoencoders and Siamese networks for self-supervised feature extraction.
problem Efficiently extract meaningful features from unlabeled data.
method Proposes SidAE, a combination of autoencoders and Siamese networks for self-supervised image classification.
result SidAE outperforms self-supervised baselines across multiple datasets and scenarios, especially with limited labeled data.
The ability of deep neural networks to generalize well in the overparameterized regime has become a subject of significant research interest. We show that overparameterized autoencoders exhibit memorization, a form of inductive bias that constrains the functions learned through the optimization process to concentrate a…
Detects adversarial examples using autoencoders at hidden layers.
problem Identifying adversarial examples in deep neural networks.
method Trains autoencoders on intermediate layers to detect deviations from true data.
result Outperforms state-of-the-art methods in both supervised and unsupervised settings.
Proposes SOMDAGMM for more accurate network intrusion detection.
problem Inaccurate network intrusion detection in secure network environments.
method Integrates self-organizing map with deep autoencoding Gaussian mixture model.
result SOMDAGMM outperforms state-of-the-art DAGMM with up to 15.58% improvement in F1 score.
Spectrum management and resource allocation (RA) problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks. The traditional approaches for solving such problems usually consume time and memory, especially for large size problems. Recently different ma…
Regularization preserves topological data structure in autoencoders.
problem Ensuring topological data structure preservation in autoencoders.
method Regularization using Legendre nodes to preserve manifold embedding.
result Regularized autoencoders ensure one-to-one embedding of data manifolds.
A new autoencoder architecture captures multiscale data.
problem Multiscale spatio-temporal data representation.
method Integrates multigrid methods, convolutional autoencoders, and transfer learning.
result Adaptive, hierarchical architecture captures different scaled features dynamically.
Sigmoid autoencoders can implement associative memory with certain conditions.
problem Implementing associative memory in neural networks.
method Theoretical analysis of overparameterized sigmoid autoencoders using the NTK and iterative maps.
result Overparameterized sigmoid autoencoders can have attractors in the NTK limit, leading to associative memory.
Batch normalization with regularization turns deterministic autoencoders into generative models.
problem Creating generative models from deterministic autoencoders.
method Using batch normalization as a source of non-determinism and adding entropic regularization.
result Deterministic autoencoders can be transformed into generative models with similar performance to variational autoencoders.
Feature extraction becomes increasingly important as data grows high dimensional. Autoencoder as a neural network based feature extraction method achieves great success in generating abstract features of high dimensional data. However, it fails to consider the relationships of data samples which may affect experimental…
Network embedding represents nodes in a continuous vector space and preserves structure information from the Network. Existing methods usually adopt a "one-size-fits-all" approach when concerning multi-scale structure information, such as first- and second-order proximity of nodes, ignoring the fact that different scal…
A neural network visualizes data structure and concepts.
problem Data visualization and concept understanding.
method Mixing autoencoder and classifier for multi-perspective visualization.
result The network produces different topological maps based on training as autoencoder or classifier.
Deep neural network for cancer classification using autoencoders.
problem Cancer classification using molecular information.
method Using a Denoising Autoencoder (DAE) as weight initialization for a deep neural network, comparing two approaches: fixed weights and fine-tuning. Embedding strategies included encoding layers and complete autoencoder.
result Best F1 score of 98.04% for identifying thyroid cancer samples.
A new model for multiview data analysis using graph autoencoders.
problem Nonlinear multiview canonical correlation analysis for large datasets.
method Variational approach with graph convolutional neural networks.
result Competitive performance on classification, clustering, and recommendation tasks.
Deep clustering has increasingly been demonstrating superiority over conventional shallow clustering algorithms. Deep clustering algorithms usually combine representation learning with deep neural networks to achieve this performance, typically optimizing a clustering and non-clustering loss. In such cases, an autoenco…
AnomalyDAE detects anomalies in networks by learning cross-modality interactions.
problem Detecting anomalies in attributed networks where structure and attributes interact.
method Dual autoencoder framework with attention mechanism for joint learning of structure and attribute embeddings.
result AnomalyDAE effectively detects anomalies by reconstructing node attributes and structures.
Autoencoders identify brain networks linked to stress and genotype.
problem Designing effective brain stimulation protocols for mental illnesses.
method Supervised autoencoders to model multi-region brain activity.
result Autoencoders reveal a stress-related brain network associated with a bipolar disorder genotype.
Variational autoencoders often collapse, showing latent variables are non-identifiable.
problem Posterior collapse in variational autoencoders due to non-identifiable latent variables.
method Proves latent variable non-identifiability causes posterior collapse. Proposes latent-identifiable models using Brenier maps and input convex neural networks.
result Latent-identifiable models resolve posterior collapse and provide meaningful representations.
This paper introduces structure learning for autoencoder recommenders to improve performance and generalization.
problem Efficient training and generalization in sparse collaborative filtering data.
method Learn groups of related items and use this information to determine the connectivity structure of an auto-encoding neural network.
result The proposed structure learning method results in a sparse network that converges to a local optimum with smaller spectral norm and generalization error.
To train an inference network jointly with a deep generative topic model, making it both scalable to big corpora and fast in out-of-sample prediction, we develop Weibull hybrid autoencoding inference (WHAI) for deep latent Dirichlet allocation, which infers posterior samples via a hybrid of stochastic-gradient MCMC and…
The study explores the compressive power of Boolean threshold autoencoders, finding that seven layers are necessary but three are not.
problem Understanding the compressive limits of Boolean threshold autoencoders.
method Investigation into the minimum number of layers and nodes required for autoencoders to accurately transform binary vectors.
result There exists a seven-layer autoencoder with a logarithmic middle layer size for any set of distinct vectors, but not a three-layer one.
FisherNet extends Autoencoder using Fisher information for better data reconstruction.
problem Data reconstruction accuracy and model scalability in high-dimensional latent spaces.
method Introduces FisherNet architecture that uses Fisher information to quantify and account for latent space uncertainty.
result FisherNet produces more accurate reconstructions and scales better with latent space dimensions compared to VAE.
Improves latent space structure for better data representation.
problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.
This paper explores using SSIM for better image generation in generative models.
problem Improving perceptual quality in generated images using ℓ2 norm. method Theoretical discussion and practical implementation of SSIM in generative models and autoencoders.
result SSIM can be used in generative models and autoencoders to generate better images.
The problem of learning a manifold structure on a dataset is framed in terms of a generative model, to which we use ideas behind autoencoders (namely adversarial/Wasserstein autoencoders) to fit deep neural networks. From a machine learning perspective, the resulting structure, an atlas of a manifold, may be viewed as …
Survey of GANs and autoencoders, addressing mode collapse and likelihood issues.
problem Addressing mode collapse and likelihood issues in GANs and autoencoders.
method Explains various GAN and autoencoder variants, their applications, and methods to resolve issues.
result Various methods to resolve mode collapse and improve likelihood in GANs and autoencoders.
Bidirectional VAE reduces parameters and improves image tasks.
problem Improving image reconstruction, classification, interpolation, and generation.
method Uses a single neural network for both encoding and decoding in both forward and backward directions.
result Bidirectional VAEs reduce parameters by almost 50% and slightly outperform unidirectional VAEs.
AEGR method improves anomaly detection in autoencoders without needing anomaly-free training data.
problem Challenges in anomaly detection, especially high dimensionality and noise in training sets.
method Gradient-reversal method for autoencoders, using reconstruction error and Local Outlier Factor.
result The proposed AEGR model outperforms other methods in detecting network anomalies.
Imbalanced data classification problem has always been a popular topic in the field of machine learning research. In order to balance the samples between majority and minority class. Oversampling algorithm is used to synthesize new minority class samples, but it could bring in noise. Pointing to the noise problems, thi…
We introduce the concrete autoencoder, an end-to-end differentiable method for global feature selection, which efficiently identifies a subset of the most informative features and simultaneously learns a neural network to reconstruct the input data from the selected features. Our method is unsupervised, and is based on…
Develops scalable autoencoder for document networks.
problem Sparse and skewed latent node representations in document relational networks.
method Combines graph Poisson factor analysis with Weibull-based graph inference networks.
result Extracts high-quality hierarchical latent document representations.
New method denoises and fills in missing image data without clean training data.
problem Denoising and inpainting images with noisy, incomplete data.
method Robust Hadamard Autoencoders trained on noisy, incomplete data.
result Autoencoders can perform denoising and inpainting simultaneously.
The problem of estimating event truths from conflicting agent opinions in a social network is investigated. An autoencoder learns the complex relationships between event truths, agent reliabilities and agent observations. A Bayesian network model is proposed to guide the learning process by modeling the relationship of…
End-to-end Sinkhorn Autoencoder reduces data simulation time with noise generation.
problem Efficiently simulating data collection processes with high fidelity and speed.
method End-to-end Sinkhorn Autoencoder with noise generator.
result Outperforms competing methods on various datasets.
There has been a lot of recent interest in designing neural network models to estimate a distribution from a set of examples. We introduce a simple modification for autoencoder neural networks that yields powerful generative models. Our method masks the autoencoder's parameters to respect autoregressive constraints: ea…
In this paper we study generative modeling via autoencoders while using the elegant geometric properties of the optimal transport (OT) problem and the Wasserstein distances. We introduce Sliced-Wasserstein Autoencoders (SWAE), which are generative models that enable one to shape the distribution of the latent space int…
Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whereas Adversarial Autoencoder (AAE) [1] uses {\it generative adversarial networks} GAN [3]. GAN trade…
A novel disentangled graph autoencoder improves treatment effect estimation from networked observational data.
problem Treatment effect estimation from observational data is challenging due to unconfoundedness assumption and latent confounders.
method Proposes a disentangled variational graph autoencoder to disentangle latent factors and enforce factor independence.
result Extensive experiments show superior performance compared to state-of-the-art approaches.
A new deep clustering model learns both clustering and embedding simultaneously.
problem Optimizing autoencoders for clustering and embedding separately.
method Integrating clustering module into a deep autoencoder.
result Joint learning of clustering and embedding improves performance.
We demonstrate a new deep learning autoencoder network, trained by a nonnegativity constraint algorithm (NCAE), that learns features which show part-based representation of data. The learning algorithm is based on constraining negative weights. The performance of the algorithm is assessed based on decomposing data into…
Graph regularized autoencoder improves anomaly detection performance.
problem Unsupervised anomaly detection in high-dimensional data.
method Developed a graph regularized autoencoder using MST-based distances.
result Outperforms alternative methods on 20 benchmark anomaly detection datasets.
New methods improve gradient estimation in autoencoders, enhancing generative network performance.
problem Improving gradient estimation in autoencoders to enhance learning.
method Developed and studied three methods: PIWAE, MIWAE, CIWAE.
result Generated approximate posterior distributions closer to true posterior distribution.
We present a representation learning method that learns features at multiple different levels of scale. Working within the unsupervised framework of denoising autoencoders, we observe that when the input is heavily corrupted during training, the network tends to learn coarse-grained features, whereas when the input is …
Identifying computational mechanisms for memorization and retrieval of data is a long-standing problem at the intersection of machine learning and neuroscience. Our main finding is that standard overparameterized deep neural networks trained using standard optimization methods implement such a mechanism for real-valued…