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

82163245326 · Jun 202019922001200920182026
48 results for autoencoder architectures

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…

2018-06-02abs ↗pdf ↗

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.

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.

We propose a new approach to the problem of optimizing autoencoders for lossy image compression. New media formats, changing hardware technology, as well as diverse requirements and content types create a need for compression algorithms which are more flexible than existing codecs. Autoencoders have the potential to ad…

2017-03-01abs ↗pdf ↗

Paper proposes a new Autoencoder for robustly encoding white matter streamlines.

problem Limited Autoencoder architectures ignore global streamline geometry and lack interpretability.
method Introduces Differentiable Vector Quantized Variational Autoencoder (D-VQ-VAE) for entire streamline bundles.
result Demonstrates superior performance in encoding and synthesis compared to state-of-the-art Autoencoders.

DECAF-GAD improves fairness in autoencoder-based GAD models without sacrificing performance.

problem Fairness in autoencoder-based GAD models for node-level anomaly detection.
method DECAF-GAD uses a structural causal model to disentangle sensitive attributes from learned representations, along with a fairness-guided loss function.
result DECAF-GAD significantly enhances fairness metrics while maintaining anomaly detection performance.

Improved SINDy autoencoder for identifying noisy dynamical systems.

problem Robust identification of noisy dynamical systems from data.
method Incorporates noise-separating neural network structures into SINDy autoencoder architecture.
result Accurately recovers latent dynamics and estimates measurement noise from noisy observations.

daep learns from irregular, multimodal astronomical data.

problem Learning from irregular, multimodal astronomical sequences.
method Diffusion Autoencoder with Perceivers (daep) tokenizes, compresses, and reconstructs data.
result daep outperforms VAE and maep baselines in reconstruction and fine-scale structure preservation.

New autoencoder learns structured representations without regularization.

problem Learning structured representations without relying on regularization.
method Proposes a novel autoencoder architecture that learns a hierarchy of latent variables.
result Improves results in generation, disentanglement, and extrapolation tasks.

We examine two fundamental tasks associated with graph representation learning: link prediction and semi-supervised node classification. We present a novel autoencoder architecture capable of learning a joint representation of both local graph structure and available node features for the multi-task learning of link pr…

2018-02-23abs ↗pdf ↗

A graph VAE framework optimizes neural architectures in a continuous space.

problem Discovering efficient neural architectures in a discrete space.
method Graph VAE framework with VAE and GNN components, joint learning of predictors and decoders.
result The framework discovers powerful neural architectures with both excellent performance and high computational efficiency.

This study analyzes VAEs using ID and II, revealing a transition in behaviour and distinct training phases.

problem Understanding the hidden representations and training phases of VAEs.
method Analysis using Intrinsic Dimension (ID) and Information Imbalance (II).
result VAEs exhibit a transition in behaviour and distinct training phases when the bottleneck size exceeds the Intrinsic Dimension of the data.

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.

D-VAE generates valid DAGs for neural architecture search and Bayesian network learning.

problem Generating valid DAGs for machine learning models.
method Proposes a novel DAG variational autoencoder (D-VAE) using graph neural networks and asynchronous message passing.
result Demonstrates the effectiveness of D-VAE through neural architecture search and Bayesian network structure learning.

GD-VAEs learn dynamics from observations using geometric and topological information.

problem Learning parsimonious representations of nonlinear dynamics from observations.
method Develops data-driven methods incorporating geometric and topological information using Variational Autoencoders (VAEs).
result GD-VAEs provide methods for learning reduced dimensional representations of nonlinear dynamics.

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.

MoCA uses a novel autoencoder to analyze multi-modal health data.

problem Challenges in analyzing continuous multi-modal health data from wearable devices.
method Proposes MoCA, a self-supervised learning framework combining transformer and masked autoencoder methods.
result Demonstrates strong performance boosts across reconstruction and classification tasks.

Study shows double and triple descent in unsupervised autoencoders, improving performance in various tasks.

problem Exploring the phenomenon of double descent in unsupervised learning.
method Analytical demonstration and extensive experiments on synthetic and real datasets.
result Over-parameterized unsupervised autoencoders exhibit double and triple descent, enhancing performance in downstream tasks.

Wasserstein Autoencoders improve model efficiency and interpretability for low-dimensional data.

problem Limited statistical guarantees for WAEs in low-dimensional data.
method Proper network architecture selection and analysis of expected excess risk convergence rates.
result WAEs can learn data distributions efficiently when intrinsic dimension is considered.

Novel variational autoencoder for generative and classification tasks.

problem Developing a robust generative model for various tasks.
method A novel variational autoencoder with specific latent variables and ordinality enforcement.
result Comparable performance in generative and classification tasks compared to baselines.

Proposes a symmetric graph autoencoder for unsupervised learning.

problem Graph representation learning without labeled data.
method Symmetric graph convolutional autoencoder with Laplacian sharpening and signed graphs.
result Outperforms state-of-the-art algorithms in clustering, link prediction, and visualization tasks.

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 n2d+2log4nn^{-\frac{2}{d+2}}\log^4 n under proper network architectures.

A new architecture improves VAE disentanglement without explicit supervision.

problem Learning disentangled representations in VAEs.
method Spatial Broadcast Decoder: tiling latent vector, concatenating coordinates, fully convolutional network.
result Improves disentangling, reconstruction accuracy, and generalization.

We investigate the problem of learning representations that are invariant to certain nuisance or sensitive factors of variation in the data while retaining as much of the remaining information as possible. Our model is based on a variational autoencoding architecture with priors that encourage independence between sens…

2015-11-03abs ↗pdf ↗

Adversarial autoencoders improve anomaly detection in images.

problem Anomaly detection in images is challenging when training data contains outliers.
method Adversarial autoencoders enforce a prior distribution on latent representations to identify and reject potential anomalies during training.
result Adversarial autoencoders significantly improve robustness to outliers during training.

Improves stability in hyperbolic neural networks for complex data generation.

problem Numerical instability in hyperbolic neural networks hinders complex architecture development.
method Proposes a novel hyperbolic AE-GAN architecture with stable layers.
result Demonstrates state-of-the-art performance in generating complex data.

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.