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,742 papers · 148 categories

Trend · papers per month

16.7%33.3%50.0%66.7% · Jan 199319922001200920172026
48 results for Transformer autoencoder

Enhances autoencoders to represent transformations explicitly.

problem Lack of explicit representation of transformations in autoencoders.
method Extended variational autoencoders to include latent transformations, using hierarchical graphical models.
result Inferred latent transformations reflect interpretable properties in the observation space.

Noting the importance of the latent variables in inference and learning, we propose a novel framework for autoencoders based on the homeomorphic transformation of latent variables, which could reduce the distance between vectors in the transformed space, while preserving the topological properties of the original space…

2019-01-24abs ↗pdf ↗

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…

2018-12-16abs ↗pdf ↗

Autoencoders help transform data representations for improved learning tasks.

problem Improving data representations for better machine learning performance.
method Demonstrates how autoencoders can be tailored for various learning tasks.
result Autoencoders can be used to achieve desired learning behaviors in diverse tasks.

GT-PCA improves PCA for image and time series data.

problem Lack of robustness to transformations in PCA.
method GT-PCA is a neural network that estimates components invariant to specific transformations.
result GT-PCA outperforms alternative methods in synthetic and real data experiments.

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.

Few-shot domain adaptation improves autoencoder performance in changing wireless channels.

problem Frequent retraining of autoencoder for low decoding error rate in changing channel conditions is impractical.
method Uses Gaussian mixture density network and class and component-conditional affine transformations for few-shot adaptation.
result Effective adaptation using very small number of target domain samples, improving performance in real mmWave setups.

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.

UT module refines VAE latent space, improving disentanglement and interpretability.

problem Irregular latent distributions cause posterior collapse and misalignment in VAEs.
method UT module uses G-KDE clustering, GM modeling, and PIT to transform latent space into uniform distribution.
result UT module enhances disentanglement and interpretability of latent representations.

Adaptive framework predicts stock prices better during volatile periods.

problem Inability of standard prediction models to handle regime-dependent stock market behavior.
method Autoencoder-Gated Dual Node Transformers with Reinforcement Learning Control.
result 0.59% MAPE with adaptive system, compared to 0.80% for baseline.

Variational autoencoder is a powerful deep generative model with variational inference. The practice of modeling latent variables in the VAE's original formulation as normal distributions with a diagonal covariance matrix limits the flexibility to match the true posterior distribution. We propose a new transformation, …

2019-01-30abs ↗pdf ↗

FF layers in transformers are nearly as interpretable as sparse autoencoders.

problem Comparing interpretability of feature vectors in FF layers vs. sparse autoencoders.
method Revisited interpretability of FF layers as key-value memories using modern benchmarks.
result FF and SAE feature vectors are similarly interpretable, but FFs can be better in some aspects.

A new method generates synthetic data with realistic marginal distributions.

problem Generating synthetic data with bimodal and skewed marginal distributions.
method Pre-transformation variational autoencoders (PTVAEs) with separate parameter optimization for each variable.
result PTVAEs outperform other methods in generating synthetic data with bimodal and skewed distributions.

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.

This paper clarifies VAE's property through geometric and information-theoretic interpretations.

problem The transparency of VAE model is an underlying issue.
method Quantitative understanding of VAE through differential geometry and information theory.
result VAE can be mapped to an implicit isometric embedding with a scale factor derived from the posterior parameter.

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.

The autoencoder is an artificial neural network model that learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar…

2017-11-21abs ↗pdf ↗

Automates galaxy morphology classification with less human labelling.

problem Insufficient human-labeled galaxy images for accurate classification.
method Developed a VAE with equivariant transformer layers and a classifier network.
result Improves accuracy with fewer labels and unlabelled data.

Dimension Estimation (DE) and Dimension Reduction (DR) are two closely related topics, but with quite different goals. In DE, one attempts to estimate the intrinsic dimensionality or number of latent variables in a set of measurements of a random vector. However, in DR, one attempts to project a random vector, either l…

2019-09-24abs ↗pdf ↗

We develop a flexible framework for low-rank matrix estimation that allows us to transform noise models into regularization schemes via a simple bootstrap algorithm. Effectively, our procedure seeks an autoencoding basis for the observed matrix that is stable with respect to the specified noise model; we call the resul…

2014-10-30abs ↗pdf ↗

Proposes a new latent variable model for hyperspherical latent spaces.

problem Efficiently modeling heavy-tailed distributions in hyperspherical latent spaces.
method Introduces spherical Cauchy (spCauchy) latent variables and applies Möbius transformations.
result Shows spCauchy recovers vMF geometry in high-concentration limits and avoids complex evaluations.

Paper proposes a novel approach to improve temporal clustering of time series data.

problem Challenges in clustering temporal data with varying sampling rates and high dimensionality.
method Transform time series into Euclidean space using similarity measures, then use CNN-GRU autoencoder for latent representation.
result Approach outperforms existing methods by up to 32% on various time series datasets.

We introduce the vine copula autoencoder (VCAE), a flexible generative model for high-dimensional distributions built in a straightforward three-step procedure. First, an autoencoder (AE) compresses the data into a lower dimensional representation. Second, the multivariate distribution of the encoded data is estimated …

2019-06-12abs ↗pdf ↗

Motion sensors such as accelerometers and gyroscopes measure the instant acceleration and rotation of a device, in three dimensions. Raw data streams from motion sensors embedded in portable and wearable devices may reveal private information about users without their awareness. For example, motion data might disclose …

2018-10-26abs ↗pdf ↗

The paper provides convergence guarantees for ODE-based generative models using transformers.

problem Theoretical guarantees for ODE-based generative models.
method A pre-trained autoencoder maps inputs to a latent space, and a transformer predicts the velocity field.
result The distribution of samples generated via estimated ODE flow converges to the target distribution in Wasserstein-2 distance.

Theoretical analysis of vision transformers' performance with MAE and CL objectives.

problem Understanding the distinct representations learned by vision transformers with MAE and CL objectives.
method Modeling visual data distribution and analyzing ViTs training dynamics with gradient descent.
result ViTs trained with MAE objectives learn both global and local features, while CL-trained ViTs favor global features.

Boltzmann machines are powerful distributions that have been shown to be an effective prior over binary latent variables in variational autoencoders (VAEs). However, previous methods for training discrete VAEs have used the evidence lower bound and not the tighter importance-weighted bound. We propose two approaches fo…

2018-05-18abs ↗pdf ↗

Variational inference methods often focus on the problem of efficient model optimization, with little emphasis on the choice of the approximating posterior. In this paper, we review and implement the various methods that enable us to develop a rich family of approximating posteriors. We show that one particular method …

2017-07-09abs ↗pdf ↗

A deep learning model organizes RNA graphs to reveal folding patterns and properties.

problem Organizing and understanding the complex folding patterns of RNA secondary structures.
method Geometric scattering autoencoder (GSAE) network for learning graph embeddings.
result GSAE accurately reflects bistable RNA structures and can sample new folding trajectories.

Proves identifiability of deep latent variable models without auxiliary information.

problem Identify deep generative models without side information.
method Analyzes a broad class of deep latent variable models with universal approximation capabilities.
result Identifiability of generative models without side information uu.

WAEs offer a statistical understanding of density estimation and error bounds.

problem Concurrent density estimation with neural network-induced transformations.
method Statistical analysis of WAEs focusing on upper bounds and error propagation.
result Established deterministic upper bounds on WAE errors and explored their resilience.

Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for learning features relevant to discriminative tasks. Autoencoders, in particular, have proven to be an effective way to learn latent codes th…

2011-02-08abs ↗pdf ↗