pith. sign in

hub

Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoders

15 Pith papers cite this work. Polarity classification is still indexing.

15 Pith papers citing it
abstract

We study a variant of the variational autoencoder model (VAE) with a Gaussian mixture as a prior distribution, with the goal of performing unsupervised clustering through deep generative models. We observe that the known problem of over-regularisation that has been shown to arise in regular VAEs also manifests itself in our model and leads to cluster degeneracy. We show that a heuristic called minimum information constraint that has been shown to mitigate this effect in VAEs can also be applied to improve unsupervised clustering performance with our model. Furthermore we analyse the effect of this heuristic and provide an intuition of the various processes with the help of visualizations. Finally, we demonstrate the performance of our model on synthetic data, MNIST and SVHN, showing that the obtained clusters are distinct, interpretable and result in achieving competitive performance on unsupervised clustering to the state-of-the-art results.

hub tools

citation-role summary

dataset 1

citation-polarity summary

years

2026 13 2025 2

roles

dataset 1

polarities

use dataset 1

clear filters

representative citing papers

Generative Robust Optimisation

cs.LG · 2026-06-21 · unverdicted · novelty 7.0

Generative Robust Optimisation defines uncertainty sets via neural network decoders over latent spaces and evaluates them with a five-point framework, validated on planning problems using Wasserstein autoencoders.

Implicit Neural Representations of Individual Behavior

cs.LG · 2026-06-10 · unverdicted · novelty 7.0

Behavioral INR adapts INRs to behavior by mapping states to actions with FiLM-modulated episode latents for self-supervised policy inference in unlabeled data, with new policy OOD definitions.

CLUBench: A Clustering Benchmark

cs.LG · 2026-05-28 · accept · novelty 7.0

CLUBench benchmark shows conventional clustering algorithms perform comparably to deep methods, pretrained embeddings boost image/text results, and low-rank performance matrices can approximate full evaluations.

Deep Image Prototype Learning with Geometric Heat-Kernel Priors

cs.CV · 2026-06-17 · unverdicted · novelty 6.0 · 2 refs

A manifold-anchored EM algorithm selects each prototype as the highest-diffusion-centrality medoid on a heat-kernel-weighted latent graph, plus a Dirichlet regularizer, yielding sharper and more stable prototypes than Euclidean GMM baselines on cardiac and brain MRI.

Knowledge Reutilization in Meta-Reinforcement Learning

cs.AI · 2026-06-16 · unverdicted · novelty 6.0

A meta-RL framework learns task-level knowledge on dynamics-simplified agents, organizes modes with Bayesian non-parametrics, and transfers via interfaces to heterogeneous agents, reporting 94.75-99.79% tracking error reduction with 23.8% of baseline data on locomotion tasks.

From Unsupervised to Guided Clustering: A Variational Implementation

stat.ME · 2026-04-07 · unverdicted · novelty 6.0

GCVAE is a variational autoencoder that structures its latent space as a Gaussian mixture and optimizes a variational objective to make the representation maximally informative about a user-chosen guiding variable, enabling context-specific clusters.

Risk-Aware Aerocapture Guidance Through a Probabilistic Indicator Function

eess.SY · 2025-07-07 · unverdicted · novelty 5.0

A new aerocapture guidance method uses a probabilistic indicator function to estimate and mitigate failure risks, saving 71.43% to 100% of recoverable cases in high-uncertainty simulations across varied initial conditions and atmosphere models.

citing papers explorer

Showing 14 of 14 citing papers after filters.