paper-with-me

Papers

Enhancing variational generation through self-decomposition

2022-02-06 · Andrea Asperti, Laura Bugo, Daniele Filippini

In this article we introduce the notion of Split Variational Autoencoder (SVAE), whose output $\hat{x}$ is obtained as a weighted sum $\sigma \odot \hat{x_1} + (1-\sigma) \odot \hat{x_2}$ of two generated images $\hat{x_1},\hat{x_2}$, and $\sigma$ is a {\em learned} compositional map. The composing images $\hat{x_1},\hat{x_2}$, as well as the $\sigma$-map are automatically synthesized by the model. The network is trained as a usual Variational Autoencoder with a negative loglikelihood loss between training and reconstructed images. No additional loss is required for $\hat{x_1},\hat{x_2}$ or $\sigma$, neither any form of human tuning. The decomposition is nondeterministic, but follows two main schemes, that we may roughly categorize as either \say{syntactic} or \say{semantic}. In the first case, the map tends to exploit the strong correlation between adjacent pixels, splitting the image in two complementary high frequency sub-images. In the second case, the map typically focuses on the contours of objects, splitting the image in interesting variations of its content, with more marked and distinctive features. In this case, according to empirical observations, the Fr\'echet Inception Distance (FID) of $\hat{x_1}$ and $\hat{x_2}$ is usually lower (hence better) than that of $\hat{x}$, that clearly suffers from being the average of the former. In a sense, a SVAE forces the Variational Autoencoder to make choices, in contrast with its intrinsic tendency to {\em average} between alternatives with the aim to minimize the reconstruction loss towards a specific sample. According to the FID metric, our technique, tested on typical datasets such as Mnist, Cifar10 and CelebA, allows us to outperform all previous purely variational architectures (not relying on normalization flows).

📄 PDF Abstract BibTeX arXiv:2202.02738

Code (1)

asperti/split-vae 공식 구현 tf

Similar Papers 제목 키워드 기반

Variational decomposition autoencoding improves disentanglement of latent representations

2026-01-11 · Ioannis Ziogas, Aamna Al Shehhi, Ahsan H. Khandoker, Leontios J. Hadjileontiadis arxiv

Understanding the structure of complex, nonstationary, high-dimensional time-evolving signals is a central challenge in scientific data analysis. In many domains, such as speech and biomedical signal processing, the abil…

Representation LearningSpeech Recognition

Bayesian Matrix Decomposition and Applications

2023-02-18 · Jun Lu

The sole aim of this book is to give a self-contained introduction to concepts and mathematical tools in Bayesian matrix decomposition in order to seamlessly introduce matrix decomposition techniques and their applicatio…

Variational Inference

DeKeyNLU: Enhancing Natural Language to SQL Generation through Task Decomposition and Keyword Extraction

2025-09-18 · Jian Chen, Zhenyan Chen, Xuming Hu, Peilin Zhou 외 arxiv

Natural Language to SQL (NL2SQL) provides a new model-centric paradigm that simplifies database access for non-technical users by converting natural language queries into SQL commands. Recent advancements, particularly t…

Natural Language QueriesKeyword Extraction

Information bottleneck through variational glasses

2019-12-02 · Slava Voloshynovskiy, Mouad Kondah, Shideh Rezaeifar, Olga Taran 외

Information bottleneck (IB) principle [1] has become an important element in information-theoretic analysis of deep models. Many state-of-the-art generative models of both Variational Autoencoder (VAE) [2; 3] and Generat…

Novelty Detection

Reasoning in Trees: Improving Retrieval-Augmented Generation for Multi-Hop Question Answering

2026-01-16 · Yuling Shi, Maolin Sun, Zijun Liu, Mo Yang 외 arxiv

Retrieval-Augmented Generation (RAG) has demonstrated significant effectiveness in enhancing large language models (LLMs) for complex multi-hop question answering (QA). For multi-hop QA tasks, current iterative approache…

Multi-hop Question Answering