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

Trend · papers per month

295887116 · Jun 202019922001200920172026
48 results for compressive autoencoders

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 ↗

In this paper we present a a deep generative model for lossy video compression. We employ a model that consists of a 3D autoencoder with a discrete latent space and an autoregressive prior used for entropy coding. Both autoencoder and prior are trained jointly to minimize a rate-distortion loss, which is closely relate…

2019-08-14abs ↗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.

Autoencoders fail to capture sparse structure in 1-bit data compression.

problem Proving the performance of shallow autoencoders on sparse data compression.
method Gradient descent analysis and approximate message passing.
result Gradient descent minimizer for sparse data is the identity (up to permutation) above critical sparsity.

In this manuscript we propose two objective terms for neural image compression: a compression objective and a cycle loss. These terms are applied on the encoder output of an autoencoder and are used in combination with reconstruction losses. The compression objective encourages sparsity and low entropy in the activatio…

2019-05-24abs ↗pdf ↗

The Information Plane theory predicts autoencoders do not compress input information.

problem Understanding the training dynamics of hidden layers in autoencoders.
method Derive a theoretical convergence for the Information Plane of autoencoders using a Gram-matrix based mutual information estimator.
result Ideal autoencoders with a large bottleneck layer size do not compress input information, while a small size causes compression only in the encoder layers.

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.

A CAE improves DNN's outlier and adversary defense.

problem Improving DNN's robustness against outliers and adversaries.
method Proposes a classification-autoencoder (CAE) that compresses samples into disjoint spaces and uses a decoder to classify and defend against adversaries.
result The CAE achieves state-of-the-art outlier recognition and near-lossless classification of adversaries.

Compressed LLM embeddings improve noisy regression tasks without overfitting.

problem Noisy regression tasks with high signal-to-noise ratios.
method Comparison of embedding compression techniques using autoencoder hidden representations.
result Compression improves performance on noisy tasks like financial return prediction.

Motivated by the ever-increasing demands for limited communication bandwidth and low-power consumption, we propose a new methodology, named joint Variational Autoencoders with Bernoulli mixture models (VAB), for performing clustering in the compressed data domain. The idea is to reduce the data dimension by Variational…

2019-10-23abs ↗pdf ↗

In this work, we propose a new recurrent autoencoder architecture, termed Feedback Recurrent AutoEncoder (FRAE), for online compression of sequential data with temporal dependency. The recurrent structure of FRAE is designed to efficiently extract the redundancy along the time dimension and allows a compact discrete re…

2019-11-11abs ↗pdf ↗

Improved image compression with diffusion models outperforming state-of-the-art methods.

problem Difficulties in replicating text-to-image success in image compression.
method Two-stage approach combining autoencoder targeting MSE followed by score-based decoder.
result Significantly improved perceptual quality at a given bit-rate, measured by FID score.

Proposes using equivariant generative models for compressed sensing with unknown orientations.

problem Recovering signals with unknown orientations from underdetermined systems of linear measurements.
method Equivariant variational autoencoder as a generative prior for compressed sensing.
result Signals with unknown orientations can be recovered using iterative gradient descent on the latent space of equivariant models.

Despite progress in training neural networks for lossy image compression, current approaches fail to maintain both perceptual quality and abstract features at very low bitrates. Encouraged by recent success in learning discrete representations with Vector Quantized Variational Autoencoders (VQ-VAEs), we motivate the us…

2020-02-19abs ↗pdf ↗

Neuro-Evolution is a field of study that has recently gained significantly increased traction in the deep learning community. It combines deep neural networks and evolutionary algorithms to improve and/or automate the construction of neural networks. Recent Neuro-Evolution approaches have shown promising results, rival…

2019-01-02abs ↗pdf ↗

A novel deep learning method for real-time EEG signal compression.

problem Efficient processing of noisy EEG signals in real-time BCI systems.
method Deep convolutional autoencoders integrated with ROS-Neuro framework.
result Minimal jitter and preservation of original information in compressed EEG signals.

Improved neural image compression with refined latent representations.

problem Sub-optimal results from variational autoencoders due to imperfect optimization and capacity limitations.
method Stochastic Gumbel Annealing (SGA) and its extensions (SGA+), including three different methods.
result Significant improvement in compression performance, especially on the R-D trade-off.

ALF reduces network parameters and operations by 70% and 61%, respectively, on embedded hardware.

problem Efficient deployment of deep learning models on resource-constrained hardware.
method Autoencoder-based low-rank filter-sharing technique.
result ALF achieves significant compression with minimal accuracy loss.

Compression is at the heart of effective representation learning. However, lossy compression is typically achieved through simple parametric models like Gaussian noise to preserve analytic tractability, and the limitations this imposes on learning are largely unexplored. Further, the Gaussian prior assumptions in model…

2019-04-15abs ↗pdf ↗

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 ↗

The usage of deep generative models for image compression has led to impressive performance gains over classical codecs while neural video compression is still in its infancy. Here, we propose an end-to-end, deep generative modeling approach to compress temporal sequences with a focus on video. Our approach builds upon…

2018-10-05abs ↗pdf ↗

This study presents a new lossy image compression method that utilizes the multi-scale features of natural images. Our model consists of two networks: multi-scale lossy autoencoder and parallel multi-scale lossless coder. The multi-scale lossy autoencoder extracts the multi-scale image features to quantized variables a…

2018-05-16abs ↗pdf ↗

Parameterized mathematical models play a central role in understanding and design of complex information systems. However, they often cannot take into account the intricate interactions innate to such systems. On the contrary, purely data-driven approaches do not need explicit mathematical models for data generation an…

2019-12-10abs ↗pdf ↗

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.

A new method, REC, compresses images by encoding their latent representations efficiently.

problem Efficiently compressing single images with latent representations.
method Relative Entropy Coding (REC) that directly encodes latent representations with codelength close to relative entropy.
result REC is more efficient for single image compression compared to previous methods and is competitive for lossy compression.

We propose and study the problem of distribution-preserving lossy compression. Motivated by recent advances in extreme image compression which allow to maintain artifact-free reconstructions even at very low bitrates, we propose to optimize the rate-distortion tradeoff under the constraint that the reconstructed sample…

2018-05-28abs ↗pdf ↗

This paper introduces Associative Compression Networks (ACNs), a new framework for variational autoencoding with neural networks. The system differs from existing variational autoencoders (VAEs) in that the prior distribution used to model each code is conditioned on a similar code from the dataset. In compression term…

2018-04-06abs ↗pdf ↗

QGAA learns latent quantum states, reducing errors in quantum data generation.

problem Learning latent representations for quantum data generation.
method Quantum Generative Adversarial Autoencoder (QGAA) combining QAE and QGAN.
result Average errors in energies for H2 and LiH are 0.02 Ha and 0.06 Ha respectively, demonstrating QGAA's potential.

We propose a novel algorithm for quantizing continuous latent representations in trained models. Our approach applies to deep probabilistic models, such as variational autoencoders (VAEs), and enables both data and model compression. Unlike current end-to-end neural compression methods that cater the model to a fixed q…

2020-02-18abs ↗pdf ↗

Likelihood-based generative models are the backbones of lossless compression due to the guaranteed existence of codes with lengths close to negative log likelihood. However, there is no guaranteed existence of computationally efficient codes that achieve these lengths, and coding algorithms must be hand-tailored to spe…

2019-05-21abs ↗pdf ↗