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…
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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “autoencoding”
Autoencoderscs.LG
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.
Proposes a Bayesian Autoencoder with sparse Gaussian process priors to capture data correlations.
problem Autoencoders' i.i.d. assumption of latent representations fails to capture data correlations.
method Imposes fully Bayesian sparse Gaussian Process priors on the latent space of a Bayesian Autoencoder and uses stochastic gradient Hamiltonian Monte Carlo for posterior estimation.
result Consistently outperforms alternatives relying on Variational Autoencoders on various tasks.
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.
A new algorithmic framework is proposed for learning autoencoders of data distributions. We minimize the discrepancy between the model and target distributions, with a \emph{relational regularization} on the learnable latent prior. This regularization penalizes the fused Gromov-Wasserstein (FGW) distance between the la…
Chart autoencoders learn latent features preserving manifold topology and geometry, with robust denoising capabilities.
problem Learning low-dimensional latent features of high-dimensional data sampled near a manifold.
method Chart autoencoders encode data into latent features on charts, preserving manifold topology and geometry.
result Chart autoencoders achieve a squared generalization error of under proper network architectures.
POTATOES improves autoencoder UOD accuracy without tuning.
problem Improving unsupervised outlier detection accuracy.
method Randomly partition data, overfit each part with an autoencoder, use max reconstruction error as anomaly score.
result Significant improvement in UOD performance for dense inlier sets.
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…
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.
GE-autoencoder identifies spontaneous symmetry breaking in systems.
problem Locating phase boundaries and identifying spontaneously broken symmetries in systems.
method Group-equivariant autoencoder using group theory to constrain parameters and learn invariant order parameters.
result GE-autoencoder accurately determines spontaneous symmetry breaking and estimates critical temperatures more efficiently.
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.
Learning Nonparametric High-Dimensional Generative Models: The Empirical-Beta-Copula Autoencoderstat.ML
A new autoencoder method uses empirical beta copulas for generating data.
problem Creating a generative model from an autoencoder's latent space.
method Empirical Beta Copula Autoencoder method.
result The Empirical Beta Copula Autoencoder outperforms other methods in simplicity and effectiveness.
Variational autoencoders provide a principled framework for learning deep latent-variable models and corresponding inference models. In this work, we provide an introduction to variational autoencoders and some important extensions.
We provide a series of results for unsupervised learning with autoencoders. Specifically, we study shallow two-layer autoencoder architectures with shared weights. We focus on three generative models for data that are common in statistical machine learning: (i) the mixture-of-gaussians model, (ii) the sparse coding mod…
Deep Autoencoder outperforms in anomaly detection for building energy data.
problem Automated detection of faulty data in learning applications.
method Training and comparison of Simple, Deep, and Supervised Deep Autoencoders on ASHRAE building energy dataset.
result Supervised Deep Autoencoder outperforms in total anomalies detected.
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…
Paper uses autoencoders for efficient reduced-order modeling of eigenvalue problems.
problem Efficiently modeling eigenvalue problems in high dimensions.
method Autoencoder-based reduced-order modeling for eigenvalue problems.
result Autoencoder-based models outperform standard POD-Galerkin methods in neutron diffusion applications.
We present a variation of the Autoencoder (AE) that explicitly maximizes the mutual information between the input data and the hidden representation. The proposed model, the InfoMax Autoencoder (IMAE), by construction is able to learn a robust representation and good prototypes of the data. IMAE is compared both theore…
TES-AE uses tree grammars to speed up autoencoding for tree data.
problem Challenges in autoencoding tree data due to its non-vectorial and discrete nature.
method TES-AE combines reservoir computing with tree grammars for faster training.
result TES-AE outperforms D-VAE in speed and accuracy for tree data.
In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoe…
A Novel Fusion of Attention and Sequence to Sequence Autoencoders to Predict Sleepiness From Speecheess.AS
Novel fusion of autoencoders predicts sleepiness from speech.
problem Predicting sleepiness from speech recordings.
method Attention-based and recurrent sequence to sequence autoencoders for unsupervised representation learning.
result Fusion of autoencoders' representations achieves higher correlation with sleepiness scales.
Adversarial training improves graph autoencoder generalization.
problem Improving graph autoencoder generalization.
method Formulated L2 and L1 adversarial training for graph autoencoders and variational graph autoencoders.
result Adversarial training boosts graph autoencoder and variational graph autoencoder generalization.
Autoencoder Treescs.LG
We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall output is the average of all leaves weighted by the gating values on their path. …
Paper proposes a faster RAE with sequence-aware encoding.
problem Training recurrent autoencoders is challenging and time-consuming.
method Introduces a recurrent autoencoder with sequence-aware encoding using 1D convolutional layers.
result The proposed autoencoder trains faster than standard RAE.
Autoencoders, as a dimensionality reduction technique, have been recently applied to outlier detection. However, neural networks are known to be vulnerable to overfitting, and therefore have limited potential in the unsupervised outlier detection setting. Current approaches to ensemble-based autoencoders do not generat…
Autoencoders have been successful in learning meaningful representations from image datasets. However, their performance on text datasets has not been widely studied. Traditional autoencoders tend to learn possibly trivial representations of text documents due to their confounding properties such as high-dimensionality…
VCAE improves autoencoder quality on MNIST and CelebA.
problem Overfitting and poor generative/reconstruction quality in autoencoders.
method Proposes variance-constrained autoencoder (VCAE) to enforce variance constraint on latent distribution.
result VCAE outperforms Wasserstein Autoencoder and Variational Autoencoder in quality.
Score matching fails to train VAEs robustly, revealing autoencoding loss insights.
problem Catastrophic failure of variational score matching on VAE models.
method Analysis of existing variational score matching objectives and their equivalence to autoencoding losses.
result Score matching methods fail to produce robust VAE models, predicting poor performance.
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.
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…
In this paper, we treat the image generation task using an autoencoder, a representative latent model. Unlike many studies regularizing the latent variable's distribution by assuming a manually specified prior, we approach the image generation task using an autoencoder by directly estimating the latent distribution. To…
The autoencoder is an effective unsupervised learning model which is widely used in deep learning. It is well known that an autoencoder with a single fully-connected hidden layer, a linear activation function and a squared error cost function trains weights that span the same subspace as the one spanned by the principa…
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.
Paired autoencoders solve inverse problems using latent space projections.
problem Solving inverse problems in scientific computing.
method Paired autoencoder framework that projects data and quantity of interest into a latent space.
result Paired autoencoders generate multiple reconstruction metrics and enable latent-space refinement for accurate data fitting.
Autoencoders improve feature extraction for aviation ML tasks.
problem Manual feature processing is labor-intensive, inefficient, and prone to loss.
method Unsupervised learning using autoencoders to extract features.
result Autoencoders can automatically extract effective features and reduce data cleaning workload.
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.
Unsupervised clustering is one of the most fundamental challenges in machine learning. A popular hypothesis is that data are generated from a union of low-dimensional nonlinear manifolds; thus an approach to clustering is identifying and separating these manifolds. In this paper, we present a novel approach to solve th…
A new method for conditional sampling using paired Wasserstein Autoencoders.
problem Conditional sampling from complex data distributions.
method Derive a novel loss function for Wasserstein Autoencoders to enable sampling from OT-type couplings.
result Learned cost-optimal transport maps and conditional sampling from an OT-type coupling.
Autoencoders and their variations provide unsupervised models for learning low-dimensional representations for downstream tasks. Without proper regularization, autoencoder models are susceptible to the overfitting problem and the so-called posterior collapse phenomenon. In this paper, we introduce a quantization-based …
Enhanced financial forecasting using supervised autoencoders with noise augmentation and triple labeling.
problem Improving investment strategy performance on noisy financial data.
method Supervised autoencoders with noise augmentation and triple barrier labeling.
result Supervised autoencoders with balanced noise augmentation and bottleneck size significantly boost strategy effectiveness.
We study the limits and methods of training two-layer autoencoders.
problem Understanding the limits and methods of training two-layer autoencoders.
method Focus on non-linear two-layer autoencoders trained in the proportional regime, using gradient methods.
result Gradient methods achieve the minimizers of the population risk and reveal the structure of the features.
Bayesian autoencoders discover physics from noisy data.
problem Challenges in identifying governing equations and coordinates from noisy, low-data real-world data.
method Bayesian SINDy autoencoders with hierarchical Bayesian sparsifying prior and adaptive empirical Bayesian method.
result Better physics discovery with lower data and fewer training epochs, along with valid uncertainty quantification.
Study on autoencoder denoising in high dimensions.
problem Denoising data from Gaussian mixtures.
method Two-layer non-linear autoencoder with skip connection in high-dimensional limit.
result Closed-form expressions for denoising mean-squared test error.
A standard Variational Autoencoder, with a Euclidean latent space, is structurally incapable of capturing topological properties of certain datasets. To remove topological obstructions, we introduce Diffusion Variational Autoencoders with arbitrary manifolds as a latent space. A Diffusion Variational Autoencoder uses t…
Autoencoding topologystat.ML
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 …
Novel method for model selection in Bayesian autoencoders.
problem Model selection for Bayesian autoencoders.
method Prior hyper-parameter optimization using distributional sliced-Wasserstein distance.
result State-of-the-art results in small-data regimes.
We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoencoder has a newly designed decoder which builds a completely symmetric autoencoder form. For the re…
Deep Kernelized Autoencodersstat.ML
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…