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.

168,878 papers · 148 categories

Trend · papers per month

3774111148 · Jun 202019922001200920172026
48 results for stacked denoising auto encoders

A deep learning method speeds up probabilistic optimal power flow calculations.

problem Efficiently solving large-scale nonlinear and nonconvex optimization problems in power systems.
method Developed a SDAE-based OPF using stacked denoising auto encoders to extract system correlations and calculate OPF solutions.
result The trained SDAE network can quickly compute OPF solutions for random system states without optimization.

CBC makes CNNs robust against adversarial attacks with minimal computational overhead.

problem Making CNNs robust against adversarial attacks without increasing computational complexity.
method CBC uses a stacked encoder-convolutional model where an auto-encoder encodes the input image, and the latent representation is used for classification.
result CBC is more robust to adversarial examples and has significantly lower computational complexity.

We propose a robust classifier to predict buying intentions based on user behaviour within a large e-commerce website. In this work we compare traditional machine learning techniques with the most advanced deep learning approaches. We show that both Deep Belief Networks and Stacked Denoising auto-Encoders achieved a su…

2015-11-19abs ↗pdf ↗

Generative models use DAE or DSM to estimate score, then Langevin sampling for sampling.

problem Estimating the score function of complex distributions for sampling.
method DAE or DSM for score estimation, Langevin sampling for sampling.
result Finite-sample bounds in Wasserstein distance for the sampling scheme.

The paper identifies saddlepoints in unsupervised auto-encoding neural nets.

problem The risk landscape of unsupervised least squares in auto-encoding neural nets.
method Established an equivalence between unsupervised least squares and principal manifolds, discussed regularization strategies for auto-encoders.
result All non-trivial critical points in auto-encoding are saddlepoints, which are degenerate in overcomplete auto-encoding.

Study proposes a new method for MRI image reconstruction using denoising autoencoders and undecimated wavelet transforms.

problem Efficient MRI image reconstruction using under-sampled data.
method Undecimated wavelet transform, denoising autoencoder, proximal gradient algorithm.
result The proposed method enhances MRI image reconstruction efficiency and robustness.

We present a novel architecture, the "stacked what-where auto-encoders" (SWWAE), which integrates discriminative and generative pathways and provides a unified approach to supervised, semi-supervised and unsupervised learning without relying on sampling during training. An instantiation of SWWAE uses a convolutional ne…

2015-06-08abs ↗pdf ↗

Convolutional auto-encoders learn natural exponential family distributions.

problem Learning latent variables for non-Gaussian data.
method Inspired by CDL, combines CNN and deep learning for natural exponential family data.
result Improved unsupervised and competitive supervised performance.

Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in graph-structured data, several graph auto-encoders have recently been proposed, but they neglect to reco…

2019-05-26abs ↗pdf ↗

Deep learning approach for efficient IoT task scheduling in MEC networks.

problem Minimizing task latency in IoT users with large-scale MEC systems.
method Stacked auto-encoder for data compression, adaptive simulated annealing, experience replay.
result Near-optimal performance with significantly reduced computational time.

In this paper, a multi-layer architecture (in a hierarchical fashion) by stacking various Kernel Ridge Regression (KRR) based Auto-Encoder for one-class classification is proposed and is referred as MKOC. MKOC has many layers of Auto-Encoders to project the input features into new feature space and the last layer was r…

2018-05-20abs ↗pdf ↗

This paper aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretical summarize the general properties of all algorithms that are based on traditional Auto-Encoders: 1) The reconstruction error of the input can not be lower than a lower bound, wh…

2017-10-08abs ↗pdf ↗

This paper introduces a novel generative encoder (GE) model for generative imaging and image processing with applications in compressed sensing and imaging, image compression, denoising, inpainting, deblurring, and super-resolution. The GE model consists of a pre-training phase and a solving phase. In the pre-training …

2019-05-23abs ↗pdf ↗

GAMLA learns manifold structures with auto-encoding for global insights.

problem Limited global insight and lack of interpretable analytical descriptions in manifold learning.
method Two-round auto-encoding process to derive character and complementary representations.
result GAMLA provides global and analytical descriptions of smooth manifolds.

A brain can detect outlier just by using only normal samples. Similarly, one-class classification (OCC) also uses only normal samples to train the model and trained model can be used for outlier detection. In this paper, a multi-layer architecture for OCC is proposed by stacking various Graph-Embedded Kernel Ridge Regr…

2019-04-13abs ↗pdf ↗

Unified product embeddings improve cross-task performance in e-commerce.

problem Training product embeddings in isolation limits cross-task performance.
method Combining text, clickstream, and image data using denoising auto-encoders, BPR, and Siamese neural networks.
result Unified product embeddings uniformly outperform isolated embeddings across three e-commerce tasks.

Paper builds LETOR models for e-commerce, segmenting queries and optimizing search results.

problem Optimizing search results for e-commerce platforms.
method Segmenting queries into broad and narrow, using denoising auto-encoders and skip-gram embeddings, employing various feature types.
result Specialized models for broad and narrow queries outperform a combined model.

Two graph auto-encoders decouple feature propagation from graph convolution layers.

problem Designing efficient graph auto-encoders with fixed receptive fields.
method L-GAE and L-VGAE using linear matrix computation before auto-encoder input.
result Comparable performance to VGAEs with smaller, simpler networks.

DGA and DVGA learn disentangled graph representations to improve graph analysis.

problem Holistic graph auto-encoders fail to capture latent factors effectively.
method Design disentangled graph convolutional network and component-wise flow, impose independence constraints.
result Improved disentangled graph representations enhance graph analysis tasks.

We propose the Wasserstein Auto-Encoder (WAE)---a new algorithm for building a generative model of the data distribution. WAE minimizes a penalized form of the Wasserstein distance between the model distribution and the target distribution, which leads to a different regularizer than the one used by the Variational Aut…

2017-11-05abs ↗pdf ↗

A new triad decoder improves graph auto-encoders' performance.

problem Graph auto-encoders ignore edge interactions, leading to suboptimal predictions.
method Integrates triadic closure property to predict three edges in a local triad.
result Triad decoder leads to more accurate predictions, clustering, and graph characteristics preservation.

Study on Gaussian interpolation flows for generative modeling.

problem Theoretical properties and regularizing effect of Gaussian denoising in continuous normalizing flows.
method Unified framework of Gaussian interpolation flow, Lipschitz regularity, existence and uniqueness of flow, stability analysis.
result Established theoretical properties of Gaussian interpolation flows, including Lipschitz continuity and existence of flow.

In this paper, we propose a new deep feature selection method based on deep architecture. Our method uses stacked auto-encoders for feature representation in higher-level abstraction. We developed and applied a novel feature learning approach to a specific precision medicine problem, which focuses on assessing and prio…

2017-04-20abs ↗pdf ↗

We study the role of latent space dimensionality in Wasserstein auto-encoders (WAEs). Through experimentation on synthetic and real datasets, we argue that random encoders should be preferred over deterministic encoders. We highlight the potential of WAEs for representation learning with promising results on a benchmar…

2018-02-11abs ↗pdf ↗

Generative source separation methods such as non-negative matrix factorization (NMF) or auto-encoders, rely on the assumption of an output probability density. Generative Adversarial Networks (GANs) can learn data distributions without needing a parametric assumption on the output density. We show on a speech source se…

2017-10-30abs ↗pdf ↗

Paper proposes a novel auto-encoder for latent density estimation.

problem Challenges of learning generative probabilistic models due to curse of dimensionality.
method Joint dimensionality reduction and non-parametric density estimation framework using a novel estimator.
result Proposed model achieves promising results on various datasets.

Develops a new non-adversarial framework for better generative models.

problem Inaccurate approximation of target distribution in latent space.
method Tessellated Wasserstein Auto-Encoders (TWAE) using centroidal Voronoi tessellation (CVT) to tessellate latent space.
result Significantly enhances generative performance in terms of FID compared to existing models.

When using deep, multi-layered architectures to build generative models of data, it is difficult to train all layers at once. We propose a layer-wise training procedure admitting a performance guarantee compared to the global optimum. It is based on an optimistic proxy of future performance, the best latent marginal. W…

2012-12-07abs ↗pdf ↗

We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model us…

2016-11-21abs ↗pdf ↗

We propose a simple neural network model to deal with the domain adaptation problem in object recognition. Our model incorporates the Maximum Mean Discrepancy (MMD) measure as a regularization in the supervised learning to reduce the distribution mismatch between the source and target domains in the latent space. From …

2014-09-21abs ↗pdf ↗

Principal components analysis (PCA) is the optimal linear auto-encoder of data, and it is often used to construct features. Enforcing sparsity on the principal components can promote better generalization, while improving the interpretability of the features. We study the problem of constructing optimal sparse linear a…

2015-02-23abs ↗pdf ↗

Improved reliability of machine learning predictions using variational auto-encoders.

problem Individual unreliability of machine learning models.
method Modified variational auto-encoders to identify a low-dimensional space for reliable classification.
result Improved reliability of predictions and robust identification of adversarial samples.