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

Trend · papers per month

14.8%29.7%44.5%59.4% · Jun 202019922001200920172026
48 results for Unsupervised Learning

Unsupervised classification methods learn a discriminative classifier from unlabeled data, which has been proven to be an effective way of simultaneously clustering the data and training a classifier from the data. Various unsupervised classification methods obtain appealing results by the classifiers learned in an uns…

2012-10-02abs ↗pdf ↗

Paper presents a workflow for reliable unsupervised learning in science.

problem Lack of standardization in unsupervised learning workflows for reproducible scientific discoveries.
method Structured workflow including data preparation, modeling, validation, and communication.
result Illustrates the importance of validation in unsupervised learning.

We introduce a framework to leverage knowledge acquired from a repository of (heterogeneous) supervised datasets to new unsupervised datasets. Our perspective avoids the subjectivity inherent in unsupervised learning by reducing it to supervised learning, and provides a principled way to evaluate unsupervised algorithm…

2017-09-14abs ↗pdf ↗

Paper summarizes unsupervised learning challenges for disentangled representations.

problem Unsupervised learning of disentangled representations without inductive biases.
method Theoretical and practical analysis of existing approaches.
result Unsupervised disentanglement is fundamentally impossible without inductive biases.

A central goal of unsupervised learning is to acquire representations from unlabeled data or experience that can be used for more effective learning of downstream tasks from modest amounts of labeled data. Many prior unsupervised learning works aim to do so by developing proxy objectives based on reconstruction, disent…

2018-10-04abs ↗pdf ↗

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.

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 ↗

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.

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 ↗

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

An unsupervised deep learning method solves PIDEs for option pricing.

problem Solving partial integro-differential equations for financial option pricing.
method Employing unsupervised deep learning to directly solve PIDEs without requiring labeled data.
result An unsupervised neural network accurately solves PIDEs and calculates derivatives and integrals.

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.

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.

New method embeds phylogenetic trees for clustering, recovering evolutionary relationships.

problem Lack of a meaningful way to embed phylogenetic trees into a vector space.
method Split-weight embedding to fit clustering algorithms to phylogenetic trees.
result Split-weight embedding recovers meaningful evolutionary relationships in simulated and real data.

Study examines the training process of an unsupervised learning model for detecting gravitational-wave transient noise.

problem Transient noise in gravitational-wave detector data causes instability and signal overlap.
method Unsupervised deep learning with variational autoencoder and invariant information clustering applied to the Gravity Spy dataset.
result Training process of the unsupervised learning architecture is examined and reported.

Learning by children and animals occurs effortlessly and largely without obvious supervision. Successes in automating supervised learning have not translated to the more ambiguous realm of unsupervised learning where goals and labels are not provided. Barlow (1961) suggested that the signal that brains leverage for uns…

2017-06-27abs ↗pdf ↗

Paper proposes a novel unsupervised feature selection method using K-means and ADMM.

problem Finding a subset of features for high-dimensional unsupervised learning problems.
method Developed K-means Derived Unsupervised Feature Selection (K-means UFS) using ADMM to solve NP-hard optimization.
result K-means UFS outperforms baselines in feature selection for clustering.

The paper shows how integrating categorical semantics can enhance unsupervised domain translation.

problem Improving unsupervised domain translation between perceptually different domains.
method Learning invariant categorical semantic features in an unsupervised manner and conditioning them on the style encoder.
result Conditioning the style encoder on learned categorical semantics improves translation and stylization.

The paper introduces metrics for robust unsupervised learning of vehicle interactions.

problem Robust representation learning of temporal dynamic interactions in robotics.
method Geometric approach using Procrustes distance and optimal transport for comparing interaction distributions.
result Metrics for assessing stability and comparing interaction learning algorithms.

New method shows supervised learning can mimic unsupervised learning effectively.

problem The fundamental difference between supervised and unsupervised learning.
method A two-stage procedure where unsupervised model selection is followed by adding outputs without changing parameters.
result Asymptotic out-of-sample risk bounds for various models trained without access to labels.

Paper explores unsupervised learning for ultrasound image artifact removal.

problem Improving visual quality of ultrasound images from various artifacts.
method Inspired by optimal transport cycleGAN, unsupervised deep learning for artifact removal.
result Unsupervised learning method provides comparable results to supervised learning.

Unsupervised feature learning has shown impressive results for a wide range of input modalities, in particular for object classification tasks in computer vision. Using a large amount of unlabeled data, unsupervised feature learning methods are utilized to construct high-level representations that are discriminative en…

2013-01-14abs ↗pdf ↗

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.

This paper addresses the problem of unsupervised clustering which remains one of the most fundamental challenges in machine learning and artificial intelligence. We propose the clustered generator model for clustering which contains both continuous and discrete latent variables. Discrete latent variables model the clus…

2019-11-19abs ↗pdf ↗

A new deep learning framework selects representative samples for unsupervised learning.

problem Selecting representative samples for unsupervised learning in non-linear data.
method DUAL framework using an encoder-decoder architecture to learn nonlinear embeddings and a selection block to choose representative samples.
result DUAL outperforms state-of-the-art methods in selecting representative samples for unsupervised learning.

Unsupervised learning is a discipline of machine learning which aims at discovering patterns in big data sets or classifying the data into several categories without being trained explicitly. We show that unsupervised learning techniques can be readily used to identify phases and phases transitions of many body systems…

2016-06-01abs ↗pdf ↗

A novel algorithm for unsupervised graph representation learning combining coarsening and mutual information maximization.

problem Current limitations in unsupervised graph representation learning, especially in embedding new graphs and considering both micro- and macro-structures.
method Combines coarsening with mutual information maximization to produce high-quality embeddings.
result The algorithm produces high-quality embeddings that are competitive with state-of-the-art methods.

Unsupervised segmentation learns features without labels, improving accuracy.

problem Discover and localize semantically meaningful categories in images without annotations.
method Separates feature learning from cluster compactification; distills unsupervised features into discrete semantic labels using a contrastive loss function.
result Significant improvement over prior state of the art on semantic segmentation challenges.

Unsupervised learning representations generalize better than supervised learning under distribution shifts.

problem Robustness of unsupervised representations to distribution shift.
method Extensive evaluation on synthetic and realistic datasets, including controllable domain generalization datasets.
result Unsupervised representations learned from SSL and AE generalize better than supervised learning under various distribution shifts.

This paper proposes a new method for automatically selecting the optimal kernel bandwidth in density estimation.

problem The challenge of selecting the optimal kernel bandwidth in unsupervised density estimation.
method The approach uses a topology-based loss function for automated bandwidth selection.
result Demonstrates the potential of the topology-based approach across different dimensions.

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.

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.

Minimalistic unsupervised learning with sparse manifold transform achieves SOTA performance.

problem Achieving state-of-the-art unsupervised learning performance without complex engineering.
method Sparse manifold transform, leveraging sparse coding, manifold learning, and slow feature analysis.
result 99.3% KNN top-1 accuracy on MNIST, 81.1% on CIFAR-10, and 53.2% on CIFAR-100.

Paper addresses unsupervised learning from incomplete measurements in inverse problems.

problem Learning from incomplete measurements is challenging in inverse problems.
method Use multiple measurement operators to overcome nullspace issues; propose a novel unsupervised learning loss.
result Presented necessary and sufficient conditions for successful unsupervised learning.

This paper critically examines unsupervised disentangled representation learning, revealing challenges and limitations.

problem The difficulty of unsupervised learning of disentangled representations and the challenges in evaluation metrics.
method Theoretical analysis and a large-scale experimental study covering 8 datasets and 14000 models.
result Well-disentangled models cannot be identified without supervision, and different evaluation metrics disagree on what constitutes disentanglement.

Is all of machine learning supervised to some degree? The field of machine learning has traditionally been categorized pedagogically into supervised vs unsupervised learningsupervised~vs~unsupervised~learning; where supervised learning has typically referred to learning from labeled data, while unsupervised learning has typically referred to learning …

2019-04-05abs ↗pdf ↗