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…
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,742 papers · 148 categories
Trend · papers per month
48 results for “unsupervised”
Unsupervised learning models can produce accurate but misleading predictions.
problem Widespread misleading predictions in unsupervised learning models.
method Developed Explainable AI techniques to detect misleading predictions.
result Widespread Clever Hans effects in unsupervised learning models.
A novel unsupervised outlier detection method using Randomized PCA Forest.
problem Unsupervised outlier detection in datasets.
method Randomized Principal Component Analysis (RPCA) Forest for deriving an outlier score.
result Superior performance compared to classical and state-of-the-art methods.
Unsupervised machine translation---i.e., not assuming any cross-lingual supervision signal, whether a dictionary, translations, or comparable corpora---seems impossible, but nevertheless, Lample et al. (2018) recently proposed a fully unsupervised machine translation (MT) model. The model relies heavily on an adversari…
Paper proposes BTuD for unsupervised feature selection.
problem Feature selection in unsupervised learning.
method Bayesian Tucker decomposition (BTuD) with Gaussian residual.
result Successfully applied to various datasets.
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.
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.
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…
The authors advocate for more rigorous unsupervised cross-lingual learning methods.
problem Lack of parallel data for many languages.
method Review of unsupervised cross-lingual learning approaches and methodological issues.
result A scenario without parallel data and abundant monolingual data is unrealistic.
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.
Improved unsupervised anomaly detection using Random Forest.
problem Enhancing unsupervised anomaly detection accuracy.
method Training Random Forest to distinguish real and synthetic data, then applying transformed distances.
result Significant improvement in anomaly detection accuracy compared to other methods.
End-to-end training solves deep unsupervised contrastive learning problems.
problem Theoretical analysis of unsupervised contrastive learning.
method End-to-end training of deep neural networks.
result Approximate stationary solutions found for non-convex contrastive loss.
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.
Minimal variations guide unsupervised learning for better downstream tasks.
problem Efficiently describing raw data for various future tasks.
method Minimal variations as a guiding principle for unsupervised representation learning.
result Unveiling minimal variations as a principle behind unsupervised learning.
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…
Study proposes using auxiliary classification to improve unsupervised anomaly detection.
problem Challenging anomaly detection in high-dimensional data.
method Use of an auxiliary classification task to extract features from unlabelled data by supervised learning.
result Our feature learning approach yields best anomaly detection performance.
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.
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 for downstream tasks under mild conditions.
New framework uses unsupervised learning for efficient exploration in RL.
problem Efficient exploration in reinforcement learning with rich observations.
method Combines unsupervised learning and no-regret RL algorithms.
result Proves sample complexity for finding near-optimal policies.
New unsupervised feature selection method for imbalanced datasets.
problem Feature selection challenges in imbalanced multi-class datasets.
method Distance Rank Score using Spearman's Rank Correlation.
result Outperforms existing methods on clustering problems.
Enhanced BCPNN learns hidden representations without labels.
problem Unsupervised learning of hierarchical representations in neural networks.
method Extended BCPNN architecture with local Hebbian learning mechanisms.
result Demonstrated capability for unsupervised learning of salient hidden representations.
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…
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.
The paper identifies saddlepoints in unsupervised auto-encoding neural nets.
problem The risk landscape of unsupervised least squares in auto-encoding neural nets.
method Established an equivalence between unsupervised least squares and principal manifolds, discussed regularization strategies for auto-encoders.
result All non-trivial critical points in auto-encoding are saddlepoints, which are degenerate in overcomplete auto-encoding.
Ensemble unsupervised anomaly detection using IRT for hidden ground truth.
problem Challenges in constructing an ensemble from unsupervised anomaly detection methods.
method Use Item Response Theory to compute latent traits and construct an ensemble that downplays noisy methods.
result Demonstrated effectiveness of IRT ensemble on extensive data repository.
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…
Ensemble learning, the machine learning paradigm where multiple algorithms are combined, has exhibited promising perfomance in a variety of tasks. The present work focuses on unsupervised ensemble classification. The term unsupervised refers to the ensemble combiner who has no knowledge of the ground-truth labels that …
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.
Super-AND improves unsupervised embedding learning with 89.2% accuracy on CIFAR-10.
problem Extracting good representations from data without labels.
method Super-AND uses unique losses to gather similar samples and maintain features.
result Super-AND achieves 89.2% accuracy on CIFAR-10 image classification.
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.
Unsupervised clustering can reproduce categorization systems if features and metrics are correctly selected.
problem Reproducing expert-provided categorization systems using unsupervised clustering.
method Investigated using toy datasets and real-world fund categorization. Used appropriate feature selection and a supervised Random Forest-based distance metric.
result Unsupervised clustering can reproduce ground truth classes if features and metrics are correctly selected.
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.
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.
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.
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…
XGBOD combines unsupervised and supervised methods for better outlier detection.
problem Enhanced outlier detection from normal observations in various datasets.
method Hybrid approach using unsupervised representation learning to improve a supervised classifier.
result XGBOD outperforms competing methods across seven datasets.
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.
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.
UDA learns target domain from unlabeled data via source knowledge transfer.
problem Learning unlabeled target domain data.
method Transferring both source knowledge and target-relatedness.
result Improves UDA performance by simultaneous knowledge transfer.
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…
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.
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.
Inference of gene regulatory network from expression data is a challenging task. Many methods have been developed to this purpose but a comprehensive evaluation that covers unsupervised, semi-supervised and supervised methods, and provides guidelines for their practical application, is lacking. We performed an extensiv…
Paper tackles medical image diagnosis with unsupervised domain adaptation.
problem Limited labeled samples and label noise in medical images.
method Collaborative Unsupervised Domain Adaptation (UDA) algorithm.
result Empirical results show superiority of the proposed method.
Many important classification problems, such as object classification, speech recognition, and machine translation, have been tackled by the supervised learning paradigm in the past, where training corpora of parallel input-output pairs are required with high cost. To remove the need for the parallel training corpora h…
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.
Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.
problem Learning a tree end-to-end for clustering without labels is an open challenge.
method Greedy maximization of the kernel KMeans objective without centroids.
result Kauri often outperforms existing unsupervised clustering methods, especially with non-linear kernels.