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

6.7%13.3%20.0%26.7% · Feb 199519922001200920172026
48 results for Vector Quantized-Variational AutoEncoders

A new model trains prior and encoder/decoder networks simultaneously for efficient generation.

problem Complex autoregressive prior in VQ-VAE models leads to slow generation.
method Builds a diffusion bridge between continuous and non-informative prior distributions.
result Model is competitive and efficient in optimization and sampling.

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.

In this paper, we provide an information-theoretic interpretation of the Vector Quantized-Variational Autoencoder (VQ-VAE). We show that the loss function of the original VQ-VAE can be derived from the variational deterministic information bottleneck (VDIB) principle. On the other hand, the VQ-VAE trained by the Expect…

2018-08-02abs ↗pdf ↗

A new method learns discrete representations for images and videos, improving upon previous models.

problem Learning discrete representations for images and videos to improve performance.
method Depthwise application of Vector Quantized Variational Autoencoders (VQVAE) to feature axis.
result 33% improvement in performance compared to previous discrete models.

Unsupervised deep learning detects and localizes crop leaf diseases.

problem Automated detection and localization of crop diseases.
method Three types of autoencoders (CAE, CVAE, VQ-VAE) applied to an open-source dataset.
result VQ-VAE autoencoder outperforms in image reconstruction, anomaly removal, detection, and localization.

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 …

2019-05-27abs ↗pdf ↗

Improved vector quantization using Gaussian mixtures for better codebook utilization.

problem Training instability and information loss in discrete vector quantization.
method Generalized vector quantization with Gaussian mixture model and aggregated categorical posterior evidence lower bound.
result GM-VQ improves codebook utilization and reduces information loss without heuristics.

The paper proposes a method to learn structured representations from unlabeled data using mutual information maximization.

problem Learning structured representations from unlabeled data.
method Adversarial maximization of mutual information between a structured latent variable and a target variable.
result The proposed method outperforms current baselines in document hashing and yields highly compressed interpretable representations.

Quantized Variational Inference improves ELBO optimization with fast convergence.

problem Maximizing Evidence Lower Bound (ELBO) for variational inference.
method Optimal Voronoi Tesselation for variance-free gradients, Richardson extrapolation for asymptotic improvement.
result Quantized Variational Inference leads to fast convergence with comparable computational cost.

We explore the use of Vector Quantized Variational AutoEncoder (VQ-VAE) models for large scale image generation. To this end, we scale and enhance the autoregressive priors used in VQ-VAE to generate synthetic samples of much higher coherence and fidelity than possible before. We use simple feed-forward encoder and dec…

2019-06-02abs ↗pdf ↗

In a noisy environment, a lossy speech signal can be automatically restored by a listener if he/she knows the language well. That is, with the built-in knowledge of a "language model", a listener may effectively suppress noise interference and retrieve the target speech signals. Accordingly, we argue that familiarity w…

2019-04-30abs ↗pdf ↗

A new algorithm for compressing latent representations in deep models.

problem Compressing continuous latent representations in deep models.
method Separates model design and training from quantization; uses adaptive quantization based on posterior uncertainty.
result Image compression with the proposed algorithm outperforms JPEG over a wide range of bit rates.

Deep generative models (DGMs) of images are now sufficiently mature that they produce nearly photorealistic samples and obtain scores similar to the data distribution on heuristics such as Frechet Inception Distance (FID). These results, especially on large-scale datasets such as ImageNet, suggest that DGMs are learnin…

2019-05-26abs ↗pdf ↗

Enhances ocean floor mapping with adaptive uncertainty estimates.

problem Inaccurate bathymetric data for precise ocean modeling.
method Block-based conformal prediction with VQ-VAE architecture.
result Significant improvements in reconstruction quality and uncertainty estimation reliability.

Paraphrasing exemplifies the ability to abstract semantic content from surface forms. Recent work on automatic paraphrasing is dominated by methods leveraging Machine Translation (MT) as an intermediate step. This contrasts with humans, who can paraphrase without being bilingual. This work proposes to learn paraphrasin…

2019-05-29abs ↗pdf ↗

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.

Method separates data into class and style factors using semi-supervised learning.

problem Separating generative factors of data into class and style vectors.
method Independent Vector Variational Autoencoders with semi-supervised learning and independence term.
result Improves classification performance and generation controllability.

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.

We improve autoencoder image interpolation by shaping latent space.

problem Incongruities in autoencoder interpolation leading to artifacts or unrealistic results.
method Propose a regularization technique to shape latent space to follow a smooth, locally convex manifold consistent with training images.
result Faithful interpolation between data points achieved.

A new model designs molecular latent vectors for drug discovery.

problem Designing effective molecular descriptors from molecular structures.
method Proposes a denoising diffusion probabilistic model (DDPM) for variational autoencoding molecular graphs.
result Demonstrates superior prediction performance and robustness compared to existing approaches.

Enhances FAVAR models with autoencoder for better economic forecasting and interpretability.

problem Limitations of linear FAVAR models in forecasting and structural analysis.
method Introduces Grouped Sparse autoencoder with time-varying parameters.
result The Grouped Sparse autoencoder produces more interpretable factors and superior forecasting performance.

Recently, generative adversarial networks and adversarial autoencoders have gained a lot of attention in machine learning community due to their exceptional performance in tasks such as digit classification and face recognition. They map the autoencoder's bottleneck layer output (termed as code vectors) to different no…

2018-06-06abs ↗pdf ↗

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 ↗

This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the i…

2017-10-30abs ↗pdf ↗

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…

2017-12-21abs ↗pdf ↗

A new framework reduces data upload for image classification while protecting user privacy.

problem Data upload limitations and privacy concerns in cloud-based image classification.
method Unsupervised autoencoder training at edge devices, followed by latent vector transmission to server for classifier training.
result The framework reduces communications overhead and protects user data privacy.

Improved training for VQ-VAE models with robust codebook learning.

problem Challenges in training discrete latent variable models, especially VQ-VAEs.
method Increased learning rate and periodic re-initialization of codebook for robust training.
result More robust training and increased usage of latent codewords, even for large codebooks.

This paper investigates a novel algorithmic approach to data representation based on kernel methods. Assuming that the observations lie in a Hilbert space X, the introduced Kernel Autoencoder (KAE) is the composition of mappings from vector-valued Reproducing Kernel Hilbert Spaces (vv-RKHSs) that minimizes the expected…

2018-05-28abs ↗pdf ↗

Proposes a neural network autoencoder for smoothing and representation learning of functional data.

problem Lack of sufficient nonlinear representations in existing methods for functional data analysis.
method Develops a neural network autoencoder architecture to process functional data directly, learning both smoothing and representation.
result Outperforms traditional methods in prediction, classification, and computational efficiency.

Autoencoders are a deep learning model for representation learning. When trained to minimize the distance between the data and its reconstruction, linear autoencoders (LAEs) learn the subspace spanned by the top principal directions but cannot learn the principal directions themselves. In this paper, we prove that $L_2…

2019-01-23abs ↗pdf ↗

Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whereas Adversarial Autoencoder (AAE) [1] uses {\it generative adversarial networks} GAN [3]. GAN trade…

2018-07-19abs ↗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.

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 ↗

There has been a lot of recent interest in designing neural network models to estimate a distribution from a set of examples. We introduce a simple modification for autoencoder neural networks that yields powerful generative models. Our method masks the autoencoder's parameters to respect autoregressive constraints: ea…

2015-02-12abs ↗pdf ↗

Method generates natural ECGs with 25 interpretable features.

problem Lack of labeled ECGs for supervised learning and automatic diagnostics.
method Variational autoencoder for ECG generation and feature extraction.
result Low Maximum Mean Discrepancy (0.00383) indicates good ECG generation quality.