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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for unsupervised generative modeling

Proposes a new model for unsupervised clustering with latent variables.

problem The challenge of unsupervised clustering in machine learning.
method Clustered Generator Model with continuous and discrete latent variables.
result Achieves competitive unsupervised clustering accuracy and disentangled latent representations.

A new method generates meta-tasks using generative models for unsupervised learning.

problem Creating synthetic meta-tasks for unsupervised learning.
method Generative models with latent space interpolation for sampling.
result The method outperforms or is competitive with baselines on few-shot classification tasks.

Unsupervised pre-training improves model generalization, but lacks theoretical understanding.

problem Lack of theoretical understanding of unsupervised pre-training's impact on model generalization.
method Introduces a novel theoretical framework to analyze and enhance generalization.
result Enhances understanding of unsupervised pre-training and fine-tuning, proposing a new regularization method.

Diffusion models enhance speech without supervision.

problem Challenges in generalizing supervised speech enhancement methods to unseen conditions.
method Unsupervised speech enhancement using diffusion-based generative models.
result Demonstrates promising results compared to supervised and unsupervised baselines.

CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.

problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.

TGLS generates text by optimizing search results and learning from them.

problem Unsupervised text generation without explicit training data.
method TGLS uses simulated annealing to estimate sentence quality, then a conditional generative model learns from search results.
result TGLS outperforms unsupervised baselines and matches state-of-the-art supervised methods in paraphrase generation.

This paper proves the theoretical advantage of unsupervised pretraining for machine learning tasks.

problem Understanding why unsupervised pretraining helps in machine learning tasks.
method A generic framework using Maximum Likelihood Estimation (MLE) for unsupervised pretraining and Empirical Risk Minimization (ERM) for downstream tasks.
result Proves an excess risk of ildeO(CΦ/m+CΨ/n) ilde{\mathcal{O}}(\sqrt{\mathcal{C}_Φ/m} + \sqrt{\mathcal{C}_Ψ/n}) for downstream tasks under mild conditions.

This research shows unsupervised GANs can perform object segmentation without labels.

problem Performing object segmentation without pixel or image-level labels.
method Used large-scale unsupervised GAN models to differentiate foreground from background.
result Demonstrated high-quality saliency masks and new state-of-the-art performance.

BigBiGAN improves unsupervised representation learning using image generation quality.

problem Improving unsupervised representation learning methods.
method Extending BigGAN to include an encoder and modifying the discriminator for representation learning.
result BigBiGAN models achieve state-of-the-art performance in unsupervised representation learning and unconditional image generation.

Recently, multilayer bootstrap network (MBN) has demonstrated promising performance in unsupervised dimensionality reduction. It can learn compact representations in standard data sets, i.e. MNIST and RCV1. However, as a bootstrap method, the prediction complexity of MBN is high. In this paper, we propose an unsupervis…

2015-03-22abs ↗pdf ↗

This paper develops a federated EM algorithm for unsupervised learning of mixture models.

problem Theoretical foundations of unsupervised federated learning are lacking.
method Introduces a federated gradient EM algorithm (FedGrEM) for unsupervised learning of mixture models.
result Theoretical analysis shows FedGrEM outperforms local single-task learning.

A major goal of unsupervised learning is to discover data representations that are useful for subsequent tasks, without access to supervised labels during training. Typically, this involves minimizing a surrogate objective, such as the negative log likelihood of a generative model, with the hope that representations us…

2018-03-31abs ↗pdf ↗

For better classification generative models are used to initialize the model and model features before training a classifier. Typically it is needed to solve separate unsupervised and supervised learning problems. Generative restricted Boltzmann machines and deep belief networks are widely used for unsupervised learnin…

2018-04-25abs ↗pdf ↗

A new method combines generative and feature-based approaches for unsupervised anomaly detection.

problem Identifying subtle anomalies in test samples compared to a normative distribution.
method A generative cold-diffusion pipeline trained to restore synthetically-corrupted images, combined with a novel synthetic anomaly generation procedure and ensembling restorations.
result Surpasses prior state-of-the-art for unsupervised anomaly detection in three Brain MRI datasets.

New model combines ICA and HMM for unsupervised learning of nonstationary time series.

problem Manual segmentation of non-stationary data is computationally expensive and inaccurate.
method Combines Hidden Markov Model with nonlinear ICA for unsupervised learning.
result Proves identifiability of the model for general mixing nonlinearity.

LCBM model improves image classification without human supervision.

problem Improving interpretability and generalization of unsupervised concept-based models.
method LCBM models concepts as random variables in a Bernoulli latent space, reducing the number of concepts without sacrificing performance.
result LCBM outperforms existing models in generalization and interpretability.

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.

Develops a new unsupervised clustering method using Variational Information Bottleneck and Gaussian Mixture Model.

problem Unsupervised clustering of unlabeled data.
method Combines Variational Information Bottleneck and Gaussian Mixture Model in a deep neural network framework.
result Derives a new bound on the cost function and provides an algorithm for efficient computation.

Improved disentanglement of data factors using recursive training.

problem Current unsupervised disentanglement methods are inconsistent and fail to achieve levels of disentanglement seen in supervised approaches.
method Introduced PBT for VAEs, used UDR for heuristic scoring, and developed recursive rPU-VAE approach.
result Recursive training leads to robust disentanglement of data factors across multiple datasets.

Score calibration enables automatic speaker recognizers to make cost-effective accept / reject decisions. Traditional calibration requires supervised data, which is an expensive resource. We propose a 2-component GMM for unsupervised calibration and demonstrate good performance relative to a supervised baseline on NIST…

2013-11-04abs ↗pdf ↗

SUOD accelerates unsupervised outlier detection for large datasets.

problem Scalability issues in unsupervised outlier detection for high-dimensional datasets.
method Three-module acceleration framework: Random Projection, Balanced Parallel Scheduling, Pseudo-supervised Approximation.
result SUOD significantly improves efficiency and scalability in outlier detection.

Study finds unsupervised imputation before cross-validation can reduce computational costs without significantly degrading model performance.

problem High computational costs in pipeline modeling algorithms with imputation steps.
method Empirical assessment of unsupervised imputation before vs during cross-validation.
result Reduced variance of imputation before cross-validation leads to lower overall root mean squared error.

Proposes RN for unsupervised attention in neural networks.

problem Limited, imbalanced, and non-stationary input distributions in various tasks.
method Inspired by neuronal adaptation, RN uses MDL principle and universal code length for incremental layer-wise computation.
result Outperforms existing normalization methods across diverse tasks.

Generative models predict page quality without training, useful for low-resource settings.

problem Detecting low-quality content in web articles.
method Human evaluation and analysis of 500 million web articles.
result Generative models can predict page quality without training, useful for low-resource settings.

Unsupervised learning models can be indistinguishable without identifiability, leading to unreliable representations.

problem Unsupervised learning models may be indistinguishable without identifiability, making it impossible to recover a ground truth generative model.
method Construction based on nonlinear independent component analysis theory to illustrate potential failure cases.
result Counterexamples show that identifiability is crucial for reliable unsupervised representation learning.

Novel unsupervised random forests improve density estimation and data synthesis.

problem Density estimation and data synthesis for complex tabular data.
method Recursive unsupervised random forests with alternating generation and discrimination rounds.
result Provable consistency and smooth densities with fast execution.

This work addresses encoding biases in neural networks by tailoring models with unsupervised losses.

problem Improving neural network representations and reducing the generalization gap.
method Inspired by transductive learning, the authors propose tailoring and meta-tailoring to optimize unsupervised losses during prediction time.
result Models trained with tailoring and meta-tailoring perform better on the task objective after adapting to unsupervised losses.

Few-shot unsupervised image-to-image translation model learns from a few examples.

problem Current unsupervised image-to-image translation methods require many images at training time.
method Coupling adversarial training with a novel network design for few-shot learning.
result Model achieves effective few-shot image-to-image translation.