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

Trend · papers per month

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for unsupervised evaluation

This research evaluates the quality of unsupervised embeddings using linear separability metrics.

problem Difficulty in evaluating unsupervised learning model performance in practice.
method Survey and introduction of three methods, including a novel one, to assess embedding quality.
result Metrics can robustly estimate embedding quality in an unsupervised way.

SKADA-bench evaluates unsupervised DA methods across diverse modalities.

problem Evaluating unsupervised DA methods on diverse modalities with realistic validation.
method Nested cross-validation and unsupervised model selection scores.
result Highlights the importance of realistic validation and provides practical guidance.

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 ↗

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.

Determining the quality of the results obtained by clustering techniques is a key issue in unsupervised machine learning. Many authors have discussed the desirable features of good clustering algorithms. However, Jon Kleinberg established an impossibility theorem for clustering. As a consequence, a wealth of studies ha…

2019-05-14abs ↗pdf ↗

Unsupervised anomaly detection aids doctors in evaluating X-ray images of hands.

problem Lack of labeled medical data and ambiguous symptoms in X-ray images.
method Adopting state-of-the-art unsupervised learning methods for anomaly detection and preprocessing.
result Without preprocessing, unsupervised methods perform randomly on X-ray images of hands.

This paper reviews and proposes a new approach for evaluating internal cluster validation indices.

problem Selecting the best-performing unsupervised classification algorithm without external information.
method Examines and proposes a new evaluation approach for internal validation indices.
result Suggests a new evaluation approach for internal validation indices.

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 ↗

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.

Study evaluates unsupervised disentanglement methods on a toy dataset.

problem Lack of clear disentanglement metrics capturing independent features.
method Empirical evaluation of six unsupervised disentanglement methods on MPI3D dataset.
result Beta-TCVAE outperforms other methods in metrics, but not in disentanglement quality.

We release a large ECG dataset for arrhythmia subtype discovery.

problem Discovering unknown subtypes of arrhythmia from continuous raw signals.
method Unsupervised representation learning task using semi-supervised evaluation.
result Qualitative evaluations show potential for representation learning in arrhythmia sub-type discovery.

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.

Unsupervised learning of probabilistic models is a central yet challenging problem in machine learning. Specifically, designing models with tractable learning, sampling, inference and evaluation is crucial in solving this task. We extend the space of such models using real-valued non-volume preserving (real NVP) transf…

2016-05-27abs ↗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.

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.

Unified benchmark for GLAD and GLOD methods across 35 datasets.

problem Gap between GLAD and GLOD research due to distinct evaluation setups.
method Comprehensive evaluation framework that unifies GLAD and GLOD.
result Multi-dimensional analyses of existing methods' strengths and limitations.

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.

Paper discusses ASD challenge for machine condition monitoring.

problem Detecting unknown anomalous sounds without labeled data.
method Design and evaluation of a large-scale ASD dataset, novel approaches.
result Several novel approaches developed, evaluation results analyzed.

Benchmark for UDA in time series classification.

problem Lack of benchmarks for unsupervised domain adaptation in time series.
method Introduces a comprehensive benchmark with new datasets and state-of-the-art neural network backbones.
result Insights into strengths and limitations of UDA methods for time series data.

Deep semi-supervised anomaly detection improves fraud detection in financial markets.

problem Detecting fraud in high-frequency financial data with limited labeled examples.
method Evaluation of Deep Semi-Supervised Anomaly Detection (Deep SAD) on proprietary limit order book data.
result Deep SAD significantly improves fraud detection accuracy with minimal labeled data.

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.

A popular tool for unsupervised modelling and mining multi-aspect data is tensor decomposition. In an exploratory setting, where and no labels or ground truth are available how can we automatically decide how many components to extract? How can we assess the quality of our results, so that a domain expert can factor th…

2015-03-11abs ↗pdf ↗

Method ranks generative models without needing latent factor supervision.

problem Challenges in selecting generative models for qualities like disentanglement.
method Ranking generative models based on training dynamics, without requiring labels for latent factors.
result Method correlates with supervised disentanglement metrics and can predict downstream performance.

New methods improve feature extraction and representation quality in supervised and unsupervised DR.

problem Statistical dependence, data diversity, contrast, and interpretability in conventional DR methods.
method Combines linear and nonlinear formulations for three new independence criteria.
result Significant improvements in contrast, accuracy, and interpretability over baselines.

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…

2019-09-09abs ↗pdf ↗

UDA improves ABI robustness but fails under certain prior misspecifications.

problem Robustness of ABI in noisy real-world data.
method Systematic evaluation of UDA across various misspecification scenarios.
result UDA aligns summary spaces but can fail under prior misspecifications.

Framework improves ML performance by identifying high-quality data.

problem Poor data quality hampers ML performance.
method Intelligent data-centric evaluation framework combining quality measurements and unsupervised learning.
result Framework improves ML system performance in real-world use case.

The paper deals with the adaptation of a new measure for the unsupervised feature selection problems. The proposed measure is based on space filling concept and is called the coverage measure. This measure was used for judging the quality of an experimental space filling design. In the present work, the coverage measur…

2017-06-27abs ↗pdf ↗

This work evaluates PDA methods without target labels, revealing significant accuracy drops.

problem Evaluating PDA methods without target labels and inconsistent experimental settings.
method Realistic evaluation of 7 PDA methods with 7 model selection strategies on 2 datasets.
result Accuracy drops up to 30 percentage points without target labels, only one method performs well.