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

Trend · papers per month

10203040 · Jun 202019922001200920172026
48 results for Exemplar VAE

Exemplar VAEs link generative models with nearest neighbor retrieval and data augmentation.

problem Improving generative model performance and data augmentation effectiveness.
method Exemplar VAEs with Parzen window prior, retrieval augmented training, exemplar leave-one-out, and subsampling.
result Generative data augmentation reduces classification error on MNIST and Fashion MNIST.

EASE optimizes exemplar selection for ICL in LLMs efficiently.

problem Efficiently selecting exemplars for in-context learning (ICL) in large language models (LLMs).
method EASE uses neural bandit algorithms to optimize exemplar sets, considering both exemplar ordering and instruction.
result EASE outperforms existing methods in finding optimal exemplar sets for all test queries.

Efficiently preserves old class knowledge in memory-limited settings.

problem Catastrophic forgetting in class-incremental learning.
method Memory-efficient exemplar preserving scheme and domain-compatible feature extractors.
result Low-fidelity exemplar samples can replace high-fidelity ones with less memory cost.

This paper introduces a novel approach to in-painting where the identity of the object to remove or change is preserved and accounted for at inference time: Exemplar GANs (ExGANs). ExGANs are a type of conditional GAN that utilize exemplar information to produce high-quality, personalized in painting results. We propos…

2017-12-11abs ↗pdf ↗

ADER addresses continual learning in session-based recommendation by periodically replaying exemplars with adaptive distillation.

problem Catastrophic forgetting in continual learning of session-based recommenders.
method Periodically replaying previous training samples (exemplars) with an adaptive distillation loss.
result ADER consistently outperforms other continual learning techniques and even all historical data at every update cycle.

Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they offer computational benefits over latent-mean models and can handle arbitrary pairwise similarity measures between data points. However, when…

2012-06-13abs ↗pdf ↗

We present a generative framework for generalized zero-shot learning where the training and test classes are not necessarily disjoint. Built upon a variational autoencoder based architecture, consisting of a probabilistic encoder and a probabilistic conditional decoder, our model can generate novel exemplars from seen/…

2017-12-11abs ↗pdf ↗

In this paper, we consider the problem of selecting representatives from a data set for arbitrary supervised/unsupervised learning tasks. We identify a subset SS of a data set AA such that 1) the size of SS is much smaller than AA and 2) SS efficiently describes the entire data set, in a way formalized via convex …

2018-11-06abs ↗pdf ↗

Metric learning methods for dimensionality reduction in combination with k-Nearest Neighbors (kNN) have been extensively deployed in many classification, data embedding, and information retrieval applications. However, most of these approaches involve pairwise training data comparisons, and thus have quadratic computat…

2017-02-21abs ↗pdf ↗

With the growing interest on Network Analysis, Relational Data Mining is becoming an emphasized domain of Data Mining. This paper addresses the problem of extracting representative elements from a relational dataset. After defining the notion of degree of representativeness, computed using the Borda aggregation procedu…

2012-07-03abs ↗pdf ↗

For a certain class of distributions, we prove that the linear programming relaxation of kk-medoids clustering---a variant of kk-means clustering where means are replaced by exemplars from within the dataset---distinguishes points drawn from nonoverlapping balls with high probability once the number of points drawn a…

2013-09-12abs ↗pdf ↗

This article examines five common misunderstandings about case-study research: (1) Theoretical knowledge is more valuable than practical knowledge; (2) One cannot generalize from a single case, therefore the single case study cannot contribute to scientific development; (3) The case study is most useful for generating …

2013-04-02abs ↗pdf ↗

In this paper, we integrate VAEs and flow-based generative models successfully and get f-VAEs. Compared with VAEs, f-VAEs generate more vivid images, solved the blurred-image problem of VAEs. Compared with flow-based models such as Glow, f-VAE is more lightweight and converges faster, achieving the same performance und…

2018-09-16abs ↗pdf ↗

Neural network models that are not conditioned on class identities were shown to facilitate knowledge transfer between classes and to be well-suited for one-shot learning tasks. Following this motivation, we further explore and establish such models and present a novel neural network architecture for the task of weakly…

2018-01-10abs ↗pdf ↗

People belong to multiple communities, words belong to multiple topics, and books cover multiple genres; overlapping clusters are commonplace. Many existing overlapping clustering methods model each person (or word, or book) as a non-negative weighted combination of "exemplars" who belong solely to one community, with …

2018-06-18abs ↗pdf ↗

Many natural signals exhibit a sparse representation, whenever a suitable describing model is given. Here, a linear generative model is considered, where many sparsity-based signal processing techniques rely on such a simplified model. As this model is often unknown for many classes of the signals, we need to select su…

2012-12-12abs ↗pdf ↗

This work tackles posterior collapse in conditional and hierarchical VAEs.

problem Posterior collapse in VAEs leads to poor latent variable representations.
method Theoretical analysis of linear conditional and hierarchical VAEs, empirical validation.
result Theoretical and empirical evidence of posterior collapse causes in conditional and hierarchical VAEs.

BayesAdapter turns pre-trained NNs into reliable BNNs with minimal overhead.

problem Scalability, accessibility, and reliability of Bayesian neural networks.
method Bayesian fine-tuning of pre-trained deterministic NNs to variational BNNs.
result BayesAdapter produces more reliable posteriors with less training overhead.

New system for i-vector speaker recognition based on variational autoencoder (VAE) is investigated. VAE is a promising approach for developing accurate deep nonlinear generative models of complex data. Experiments show that VAE provides speaker embedding and can be effectively trained in an unsupervised manner. LLR est…

2017-05-25abs ↗pdf ↗

The paper provides convergence guarantees for VAEs using SGD and Adam.

problem Understanding theoretical convergence guarantees for VAEs.
method Derives non-asymptotic convergence rates for VAEs trained with SGD and Adam.
result Convergence rate of \(\mathcal{O}(\log n / \sqrt{n})\) with explicit hyperparameter dependencies.

PRI-VAE learns disentangled representations by optimizing principle-of-relevant-information.

problem Learning disentangled representations under VAE framework remains unknown.
method Proposes PRI-VAE, a novel learning objective to optimize disentanglement.
result Demonstrates effectiveness of PRI-VAE on four benchmark datasets.

C2^2VAE learns disentangled and coupled representations without prior knowledge.

problem Learning disentangled and coupled representations in latent space.
method Introduces C2^2VAE, a self-supervised VAE that factorizes posterior and uses Gaussian copula for dependencies.
result Demonstrates strong effect in enhancing disentangled representation learning.

The variational autoencoder (VAE) framework remains a popular option for training unsupervised generative models, especially for discrete data where generative adversarial networks (GANs) require workaround to create gradient for the generator. In our work modeling US postal addresses, we show that our discrete VAE wit…

2019-04-23abs ↗pdf ↗

q-VAE extracts disentangled latent spaces for robot control and dynamic systems.

problem Disentangled representation learning for latent spaces in robotics.
method Proposes q-VAE based on Tsallis statistics, improving disentanglement and latent dynamics.
result Improves disentangled representation while maintaining data reconstruction accuracy.

Single training run learns optimal VAE parameters for various β values.

problem Training VAEs with varying β values for optimal trade-off between distortion and rate.
method Introduced Multi-Rate VAE (MR-VAE) using hypernetworks to map β to optimal parameters.
result MR-VAEs can construct the full rate-distortion curve without additional training.

VAEs analyzed using harmonic analysis, showing how variance controls frequency content and robustness.

problem Understanding and optimizing VAEs for robustness and frequency control.
method Viewing VAE latent space as Gaussian space, deriving results on variance and frequency content, and demonstrating soft Lipschitz constraints.
result Increasing encoder variance reduces high frequency content and improves adversarial robustness.

High-dimensional VAEs inevitably collapse to prior, requiring large datasets for good performance.

problem Posterior collapse in VAEs leads to poor representation learning quality.
method Analyzed a minimal VAE in a high-dimensional limit, evaluating conditions for posterior collapse with respect to beta and dataset size.
result VAEs face 'inevitable posterior collapse' beyond a certain beta threshold, regardless of dataset size.

While enormous progress has been made to Variational Autoencoder (VAE) in recent years, similar to other deep networks, VAE with deep networks suffers from the problem of degeneration, which seriously weakens the correlation between the input and the corresponding latent codes, deviating from the goal of the representa…

2018-02-19abs ↗pdf ↗

As a general-purpose generative model architecture, VAE has been widely used in the field of image and natural language processing. VAE maps high dimensional sample data into continuous latent variables with unsupervised learning. Sampling in the latent variable space of the feature, VAE can construct new image or text…

2019-08-17abs ↗pdf ↗

HL-VAE extends VAE for heterogeneous temporal and longitudinal data.

problem Handling heterogeneous data in temporal and longitudinal datasets.
method Proposes HL-VAE, an extension of existing VAEs for temporal and longitudinal data, incorporating likelihood models for various data types.
result HL-VAE achieves competitive performance in missing value imputation and predictive accuracy.