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

Trend · papers per month

2645287911,055 · Jun 202019922001200920172026
48 results for Generative Encoder

Enhanced Bayesian target encoding uses sampling techniques to improve model performance.

problem Improving target encoding for better model performance in machine learning.
method Using sampling techniques in Bayesian target encoding to extract intra-category distribution information.
result Improves generalization and reduces target leakage in machine learning models.

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 ↗

New definition reveals encoding explanations that retain predictive power.

problem Challenges in evaluating and identifying encoding explanations.
method Developed a definition of encoding based on conditional dependence.
result Existing evaluation scores do not rank non-encoding explanations correctly, but STRIPE-X does.

Randomized positional encodings boost transformer performance on longer sequences.

problem Transformers struggle with generalizing to sequences of arbitrary length.
method Introduced randomized positional encodings that simulate longer sequences and randomly select positions.
result Randomized positional encodings increase test accuracy by 12.0% on average for sequences of unseen length.

Transformer struggles with arithmetic length but improves with explicit structure encoding.

problem Transformers fail to generalize length in arithmetic tasks.
method Explicitly encoding structural symmetries via modified number formatting and custom positional encodings.
result Transformer can generalize up to 50-digit numbers without additional data.

Generative adversarial networks (GANs) are capable of producing high quality image samples. However, unlike variational autoencoders (VAEs), GANs lack encoders that provide the inverse mapping for the generators, i.e., encode images back to the latent space. In this work, we consider adversarially learned generative mo…

2018-12-19abs ↗pdf ↗

New bounds for quantum circuits depend on how data is encoded.

problem Lack of explicit dependence on data encoding in generalization bounds for PQCs.
method Derived generalization bounds that depend on data encoding strategies using Rademacher complexity and metric entropy.
result Optimal data-encoding strategies can be selected via structural risk minimization.

Proposes DC3-GAN for diverse unsupervised conditional generation.

problem Low diversity in unsupervised conditional generation.
method Integrates encoder-generator pair with generator-encoder pair to enhance diversity.
result Improves clustering performance and disentanglement of latent variables.

Encoder-decoder GANs architectures (e.g., BiGAN and ALI) seek to add an inference mechanism to the GANs setup, consisting of a small encoder deep net that maps data-points to their succinct encodings. The intuition is that being forced to train an encoder alongside the usual generator forces the system to learn meaning…

2017-11-07abs ↗pdf ↗

New insights into how encoder-decoder networks generate attention matrices.

problem Understanding how encoder-decoder networks use attention matrices.
method Decomposing hidden states into temporal and input-driven components.
result Attention matrices are formed based on task requirements, not architecture type.

New method enforces encoder sparsity in HPF for more interpretable feature selection.

problem Lack of encoder sparsity in HPF leads to lack of column-clustering property.
method Enforces encoder sparsity using a generalized additive model (GAM).
result Gains ability to perform feature selection and relates each representation to original features.

For statistical learning, categorical variables in a table are usually considered as discrete entities and encoded separately to feature vectors, e.g., with one-hot encoding. "Dirty" non-curated data gives rise to categorical variables with a very high cardinality but redundancy: several categories reflect the same ent…

2018-06-04abs ↗pdf ↗

Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…

2019-04-09abs ↗pdf ↗

EncGAN learns multi-manifold structure and abstract features using an encoder.

problem Learning multi-manifold structure and abstract features in data.
method Uses an encoder to model manifold structure and invert it for generation, with a single latent space for shared abstract features.
result Successfully learns multi-manifold structure and abstract features on MNIST, 3D-chair, and UT-Zap50k datasets.

The paper explores how invertibility affects the complexity of encoder models in VAEs.

problem The complexity of the encoder model in VAEs when the generative map is invertible.
method Formalizes the concept of strong invertibility and analyzes the complexity of the encoder model.
result Strongly invertible generative maps allow for simpler encoder models, while non-invertible maps require exponentially larger encoders.

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 ↗

Encoding a sequence of observations is an essential task with many applications. The encoding can become highly efficient when the observations are generated by a dynamical system. A dynamical system imposes regularities on the observations that can be leveraged to achieve a more efficient code. We propose a method to …

2018-05-27abs ↗pdf ↗

Study efficient neural operator learning using variation spaces.

problem Operator learning using encoder-decoder neural networks.
method Introduce variation space for nonlinear operators, establish approximation bounds.
result Algebraic approximation and learning rates for polynomially decaying input and output encoding errors.

HyperVAE encodes distributions of distributions using variational inference.

problem Modeling distributions of distributions efficiently and preserving information.
method Variational inference with Gaussian mixture models and matrix-network decoders.
result HyperVAE encodes parameters of a VAE in a low-dimensional Gaussian distribution, preserving more information.

A new method uses persistent homology to assess auto-encoders' latent manifold quality.

problem Chaos in auto-encoders' latent manifold and failure of current distance measures.
method Persistent Homology for Wasserstein Auto-Encoders (PHom-WAE).
result PHom-WAE improves auto-encoders' performance in credit card transaction data.

Paper proposes a new method for learning deep generative models using annealed importance sampling.

problem Learning deep generative models efficiently and accurately.
method Proposes annealed importance sampling as a bridge between variational inference and Markov chain Monte Carlo.
result Demonstrates improved density models and better trade-off between computation and model accuracy.

Graph attention auto-encoder reconstructs graph structure and attributes.

problem Lack of methods to reconstruct graph structure and node attributes in graph auto-encoders.
method Stacked encoder/decoder layers with self-attention mechanisms, regularized node representations to reconstruct graph structure.
result Competitive performance on node classification benchmarks, including inductive learning.

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.

In this paper, we propose an auto-encoder based generative neural network model whose encoder compresses the inputs into vectors in the tangent space of a special Lie group manifold: upper triangular positive definite affine transform matrices (UTDATs). UTDATs are representations of Gaussian distributions and can strai…

2019-01-28abs ↗pdf ↗

Derives formulae for general permutation equivariant layers and presents a second order graph variational encoder.

problem Tackles the limitation of previous equivariant neural networks by considering permutations of matrices.
method Derives formulae for general permutation equivariant layers, including matrix permutations. Presents a second order graph variational encoder.
result Latent distribution of equivariant generative models must be exchangeable.

Transformer adapts to graphs with adaptive attention and auto-regressive decoding.

problem Transformers struggle with graph data due to non-sequential nature.
method Proposes GRAT, a Transformer variant with adaptive attention and auto-regressive decoding.
result GRAT achieves state-of-the-art performance on molecule property predictions and generation tasks.

Generative Adversarial Nets (GANs) and Variational Auto-Encoders (VAEs) provide impressive image generations from Gaussian white noise, but the underlying mathematics are not well understood. We compute deep convolutional network generators by inverting a fixed embedding operator. Therefore, they do not require to be o…

2018-05-17abs ↗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.

DCM uses diffusion models to answer causal queries from observational data.

problem Answering causal queries from observational data alone.
method Diffusion models to learn causal mechanisms and generate latent encodings.
result Significant improvements over existing methods for causal query answering.

Improves latent space structure for better data representation.

problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.

Conditional Generative Adversarial Networks (cGANs) are generative models that can produce data samples (xx) conditioned on both latent variables (zz) and known auxiliary information (cc). We propose the Bidirectional cGAN (BiCoGAN), which effectively disentangles zz and cc in the generation process and provides a…

2017-11-20abs ↗pdf ↗