Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for Deep Autoencoder

A new model combines spectral clustering and deep autoencoder for robust clustering.

problem Robustness issues in clustering approaches due to deep autoencoder hyperparameters.
method Ensemble Deep Autoencoder Learning (SC-EDAE) framework integrating spectral clustering and deep learning.
result Demonstrates improved robustness and performance compared to state-of-the-art methods.

A new method for deep clustering uses autoencoded embeddings and local manifold learning.

problem Improving clustering performance in deep learning models.
method Learning an autoencoded embedding, then clustering the underlying manifold using a shallow algorithm.
result UMAP is best at finding the most clusterable manifold in the embedding.

This paper compares different deep learning techniques for feature learning from EHRs.

problem Extracting meaningful insights from high-dimensional, sparse clinical data.
method Uses stacked sparse autoencoders, deep belief networks, adversarial autoencoders, and variational autoencoders for feature representation.
result Variational autoencoders outperform other methods for large data sets, while stacked sparse autoencoders are superior for small data sets.

Proposes SDCN to integrate structural information into deep clustering.

problem Lack of attention to structural information in representation learning for clustering.
method Designs a delivery operator to transfer autoencoder representations to GCN layers and uses a dual self-supervised mechanism.
result SDCN consistently outperforms state-of-the-art techniques in clustering tasks.

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…

2018-10-16abs ↗pdf ↗

A cascaded autoencoder defends machine learning models from adversarial attacks.

problem Adversarial attacks on machine learning models.
method Denoising and dimensionality reduction using cascaded autoencoders.
result Preprocessed data with cascaded autoencoder pipeline improves model accuracy against adversarial perturbations.

Langevin autoencoders improve deep latent variable models with efficient posterior sampling.

problem Efficient posterior sampling in deep latent variable models using MCMC.
method Amortized Langevin dynamics (ALD) replaces datapoint-wise sampling with encoder updates.
result ALD is valid as an MCMC algorithm with the target posterior as a stationary distribution.

Autoencoders improve unsupervised and semi-supervised learning with new generalization bounds.

problem Lack of theoretical understanding of autoencoder generalization in unsupervised and semi-supervised learning.
method Utilized recent advances in deep learning theory and a novel reconstruction loss to provide generalization bounds.
result First theoretical generalization bounds for autoencoders in unsupervised and semi-supervised learning.

Deep autoencoder network solves spectrum sharing problems efficiently.

problem Resource allocation in wireless communications and D2D networks.
method Generative neural network (autoencoder) for solving linear sum assignment problems.
result Hybrid autoencoder architecture outperforms other methods in accuracy and speed.

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.

Deep neural networks can store and recall data efficiently.

problem Identifying computational mechanisms for memorization and retrieval of data.
method Training overparameterized autoencoders and sequence encoders using standard optimization methods.
result Overparameterized autoencoders and sequence encoders store and recall data efficiently as attractors.

Autoencoder identifies cancer cells from normal ones using gene expression data.

problem Distinguishing between normal and cancer cells using gene expression profiles.
method Autoencoder trained on large tumor dataset to capture latent representations, using HPC toolkit for efficiency.
result Autoencoder node saliency identifies key differentiating features between normal and cancer cells.

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…

2018-03-04abs ↗pdf ↗

A DL autoencoder tackles interference channels, improving SNR and INR.

problem Improving performance in interference channels with varying interference levels.
method Designing a DL neural network autoencoder for a k-user Gaussian interference channel, classifying interferences as weak to very strong.
result DL autoencoder significantly mitigates interference effects, especially with known α and low offset.

ADEC addresses feature randomness and drift in autoencoder-based clustering.

problem Clustering autoencoders learn unreliable pseudo-labels, distorting latent space and feature randomness.
method Adversarial training to balance reconstruction loss and clustering objective.
result ADEC outperforms state-of-the-art autoencoder-based clustering methods.

This work proposes a new method to train models with deep latent hierarchies using Optimal Transport.

problem Training models with deep latent hierarchies using VAEs often leads to the 'latent variable collapse' issue.
method Proposes a novel approach based on Optimal Transport to train models with deep latent hierarchies.
result The method avoids the 'latent variable collapse' issue and provides better sample generations and latent representation.

A deep learning autoencoder improves error correction for one-bit quantization.

problem Improving error correction for one-bit quantization in AWGN channels.
method Proposes a novel autoencoder-based coding scheme using turbo codes as implicit regularization.
result Empirically and theoretically shows nearly optimal performance of the proposed coding scheme.

In this paper we introduce the deep kernelized autoencoder, a neural network model that allows an explicit approximation of (i) the mapping from an input space to an arbitrary, user-specified kernel space and (ii) the back-projection from such a kernel space to input space. The proposed method is based on traditional a…

2017-02-08abs ↗pdf ↗

Deep learning improves sparse representation for better classification.

problem Improving classification accuracy using sparse representation.
method A transductive deep learning network combining convolutional autoencoder and fully-connected layers.
result The proposed network achieves better classification results than state-of-the-art SRC methods.

A new clustering method using deep autoencoder networks and spectral clustering.

problem Improving clustering accuracy in noisy data.
method Dual autoencoder network for robust latent representations, mutual information estimation for discriminative features, deep spectral clustering.
result Significantly outperforms state-of-the-art clustering approaches on benchmark datasets.

Currently there are two predominant ways to train deep neural networks. The first one uses restricted Boltzmann machine (RBM) and the second one autoencoders. RBMs are stacked in layers to form deep belief network (DBN); the final representation layer is attached to the target to complete the deep neural network. Autoe…

2016-12-22abs ↗pdf ↗

Paper uses RL and DCAE to classify large unstructured data with fewer features.

problem Classifying large unstructured data with high precision using fewer features.
method Deep Convolutional Autoencoder (DCAE) for feature learning and Double DQN/Retrace RL algorithms for policy optimization.
result The approach achieves high classification precision with fewer features than traditional methods.

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 …

2018-03-01abs ↗pdf ↗