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…
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,694 papers · 148 categories
Trend · papers per month
48 results for “unsupervised 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…
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.
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.
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.
Meta-learning algorithms use past experience to learn to quickly solve new tasks. In the context of reinforcement learning, meta-learning algorithms acquire reinforcement learning procedures to solve new problems more efficiently by utilizing experience from prior tasks. The performance of meta-learning algorithms depe…
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 unsupervised transfer learning method for spatiotemporal tasks.
problem Transfer knowledge from unsupervised models to new predictive tasks.
method Differentiable framework with Transferable Memory Unit (TMU).
result Significant improvements on spatiotemporal prediction benchmarks.
Unsupervised anomaly detection from high dimensional data like mobility networks is a challenging task. Study of different approaches of feature engineering from such high dimensional data have been a focus of research in this field. This study aims to investigate the transferability of features learned by network clas…
Improves model calibration and selection in unsupervised domain adaptation.
problem Distribution shifts in unsupervised domain adaptation.
method Developed a novel importance weighted group accuracy estimator.
result Improves state-of-the-art performances by 22% in model calibration and 14% in model selection.
Study improves GMM learning performance through multi-task and transfer learning.
problem Improving GMM learning performance through similar task structures.
method Proposes a multi-task GMM learning procedure based on EM algorithm, robust to outliers.
result Achieves minimax optimal rate of convergence for parameter estimation and mis-clustering.
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.
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.
DCASE 2021 ASD task tackles domain-shifted anomalous sound detection.
problem Detecting unknown anomalous sounds under domain-shifted conditions.
method Ensemble of outlier exposure and inlier modeling detectors, feature learning from machine identification.
result Two types of remarkable approaches were adopted by top teams.
Unsupervised embedding learning aims to extract good representation from data without the need for any manual labels, which has been a critical challenge in many supervised learning tasks. This paper proposes a new unsupervised embedding approach, called Super-AND, which extends the current state-of-the-art model. Supe…
Study shows double and triple descent in unsupervised autoencoders, improving performance in various tasks.
problem Exploring the phenomenon of double descent in unsupervised learning.
method Analytical demonstration and extensive experiments on synthetic and real datasets.
result Over-parameterized unsupervised autoencoders exhibit double and triple descent, enhancing performance in downstream tasks.
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…
Unified framework for unsupervised concept extraction simplifies guarantees.
problem Establishing guarantees for unsupervised concept extraction.
method Unified theoretical framework, meta-theorem for identifiability.
result Simplifies the task of proving guarantees for concept extraction.
Continual learning aims to improve the ability of modern learning systems to deal with non-stationary distributions, typically by attempting to learn a series of tasks sequentially. Prior art in the field has largely considered supervised or reinforcement learning tasks, and often assumes full knowledge of task labels …
We show how a deep denoising autoencoder with lateral connections can be used as an auxiliary unsupervised learning task to support supervised learning. The proposed model is trained to minimize simultaneously the sum of supervised and unsupervised cost functions by back-propagation, avoiding the need for layer-wise pr…
The goal of unsupervised representation learning is to extract a new representation of data, such that solving many different tasks becomes easier. Existing methods typically focus on vectorized data and offer little support for relational data, which additionally describe relationships among instances. In this work we…
We study how to leverage off-the-shelf visual and linguistic data to cope with out-of-vocabulary answers in visual question answering task. Existing large-scale visual datasets with annotations such as image class labels, bounding boxes and region descriptions are good sources for learning rich and diverse visual conce…
Semi-supervised learning of hierarchical representations of molecules using neural message passingstat.ML
With the rapid increase of compound databases available in medicinal and material science, there is a growing need for learning representations of molecules in a semi-supervised manner. In this paper, we propose an unsupervised hierarchical feature extraction algorithm for molecules (or more generally, graph-structured…
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.
Unsupervised ranking faces one critical challenge in evaluation applications, that is, no ground truth is available. When PageRank and its variants show a good solution in related subjects, they are applicable only for ranking from link-structure data. In this work, we focus on unsupervised ranking from multi-attribute…
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.
Disentangled representations have recently been shown to improve fairness, data efficiency and generalisation in simple supervised and reinforcement learning tasks. To extend the benefits of disentangled representations to more complex domains and practical applications, it is important to enable hyperparameter tuning …
Paper presents unsupervised calibration for split conformal classification.
problem Inconvenient requirement of labeled calibration samples.
method Uses unsupervised calibration samples alongside supervised training samples.
result Achieves comparable performance to supervised calibration methods.
A new framework uses information theory to detect anomalies in images without labeled data.
problem Detect anomalies in images without labeled data.
method A direct objective function using information theory to maximize the distance between normal and anomalous data.
result The proposed framework significantly outperforms state-of-the-arts on multiple benchmark datasets.
The increasing amount of data in astronomy provides great challenges for machine learning research. Previously, supervised learning methods achieved satisfactory recognition accuracy for the star-galaxy classification task, based on manually labeled data set. In this work, we propose a novel unsupervised approach for t…
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.
Data representations that contain all the information about target variables but are invariant to nuisance factors benefit supervised learning algorithms by preventing them from learning associations between these factors and the targets, thus reducing overfitting. We present a novel unsupervised invariance induction f…
We present a new flavor of Variational Autoencoder (VAE) that interpolates seamlessly between unsupervised, semi-supervised and fully supervised learning domains. We show that unlabeled datapoints not only boost unsupervised tasks, but also the classification performance. Vice versa, every label not only improves class…
This paper presents a novel yet intuitive approach to unsupervised feature learning. Inspired by the human visual system, we explore whether low-level motion-based grouping cues can be used to learn an effective visual representation. Specifically, we use unsupervised motion-based segmentation on videos to obtain segme…
Simple framework decouples word alignment and multilingual embedding mapping.
problem Learning multilingual embeddings without supervision.
method Two-stage approach: 1) unsupervised word alignment, 2) mapping embeddings to shared space.
result Robust performance across various multilingual tasks, including distant languages.
Karate Club simplifies graph mining for unsupervised learning.
problem Efficient unsupervised learning on graphs.
method API-oriented Python framework combining 30+ algorithms.
result Karate Club outperforms in learning performance and speed.
In this work, we perform unsupervised learning of representations by maximizing mutual information between an input and the output of a deep neural network encoder. Importantly, we show that structure matters: incorporating knowledge about locality of the input to the objective can greatly influence a representation's …
Detects anomalies in autonomous mobile robots using vision.
problem Anomaly detection for autonomous mobile robots.
method Unsupervised deep learning methods and a novel dataset.
result State-of-the-art approach tested on a new dataset.
Training a model to perform a task typically requires a large amount of data from the domains in which the task will be applied. However, it is often the case that data are abundant in some domains but scarce in others. Domain adaptation deals with the challenge of adapting a model trained from a data-rich source domai…
CUDC collects diverse data for offline RL by predicting future states.
problem Challenges in collecting task-agnostic data for offline RL.
method Adaptive temporal distances for curiosity-driven data collection.
result CUDC outperforms existing unsupervised methods in offline RL tasks.
Recent advancements in language representation models such as BERT have led to a rapid improvement in numerous natural language processing tasks. However, language models usually consist of a few hundred million trainable parameters with embedding space distributed across multiple layers, thus making them challenging t…
Recently, kernelized locality sensitive hashcodes have been successfully employed as representations of natural language text, especially showing high relevance to biomedical relation extraction tasks. In this paper, we propose to optimize the hashcode representations in a nearly unsupervised manner, in which we only u…
POUF fine-tunes large models without labeled data.
problem Lack of labeled data for fine-tuning large pre-trained models.
method Prompt-oriented unsupervised fine-tuning.
result Consistent improvements across various tasks.
DGC clusters data with side-information for better prediction.
problem Improving clustering strategies through better prediction performance.
method Deep Goal-Oriented Clustering (DGC) framework that clusters data using supervision and unsupervised modeling.
result Achieves prediction accuracies comparable to state-of-the-art, while learning congruent clustering strategies.
High-dimensional data in many areas such as computer vision and machine learning tasks brings in computational and analytical difficulty. Feature selection which selects a subset from observed features is a widely used approach for improving performance and effectiveness of machine learning models with high-dimensional…
Pretraining method enhances dialogue representation learning across various tasks.
problem Scarce labeled data for specific dialogue tasks.
method Multi-task unsupervised pretraining with natural training objectives.
result Significant improvement in downstream tasks without encoder discrimination.
We investigate the non-identifiability issues associated with bidirectional adversarial training for joint distribution matching. Within a framework of conditional entropy, we propose both adversarial and non-adversarial approaches to learn desirable matched joint distributions for unsupervised and supervised tasks. We…
Improved unsupervised probing for ranking tasks using Contrast-Consistent Ranking.
problem Improving self-consistency in language model rankings.
method Adapting Contrast-Consistent Search (CCS) to Contrast-Consistent Ranking (CCR) for ranking tasks.
result CCR probing outperforms prompting techniques across different models and datasets.