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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for unsupervised feature transformation

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.

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.

TokenCut detects and segments objects in images and videos without supervision.

problem Detecting and segmenting salient objects in images and videos without labeled data.
method Graph-based approach using self-supervised transformer features and Normalized Cut algorithm.
result Achieves state-of-the-art results on various detection and segmentation tasks.

A novel graph spectral method for mixed categorical and numerical data.

problem Feature learning for mixed data types (numerical and categorical).
method Graph spectral decomposition of the graph Laplacian to model probabilistic dependence structure.
result Increased separability and clusterability of observations in the transformed feature space.

IGT learns graph representations without supervision.

problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.

ExpCLR uses expert features to improve time-series representation learning.

problem Current representation learning approaches fail to ensure useful properties for time-series data.
method ExpCLR employs expert features to replace data transformations in contrastive learning, ensuring two useful properties for time-series representations.
result ExpCLR outperforms state-of-the-art methods on three real-world time-series datasets.

Learning invariant representations is an important problem in machine learning and pattern recognition. In this paper, we present a novel framework of transformation-invariant feature learning by incorporating linear transformations into the feature learning algorithms. For example, we present the transformation-invari…

2012-06-27abs ↗pdf ↗

We study the task of unsupervised domain adaptation, where no labeled data from the target domain is provided during training time. To deal with the potential discrepancy between the source and target distributions, both in features and labels, we exploit a copula-based regression framework. The benefits of this approa…

2017-09-29abs ↗pdf ↗

Improves document summarization by combining word embeddings and n-grams.

problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.

We present a signal representation framework called the sparse manifold transform that combines key ideas from sparse coding, manifold learning, and slow feature analysis. It turns non-linear transformations in the primary sensory signal space into linear interpolations in a representational embedding space while maint…

2018-06-23abs ↗pdf ↗

Paper proposes methods to improve graph domain adaptation by decorrelating node features.

problem Challenges in transferring knowledge from one graph to another.
method Proposes decorrelating node features using GCN and graph transformer layers.
result Significant performance enhancements and clear visualizations of learned representations.

Understanding how images of objects and scenes behave in response to specific ego-motions is a crucial aspect of proper visual development, yet existing visual learning methods are conspicuously disconnected from the physical source of their images. We propose to exploit proprioceptive motor signals to provide unsuperv…

2015-05-08abs ↗pdf ↗

GraphDINO learns neuronal morphologies from unlabeled data.

problem Unsupervised learning of neuronal morphologies from unlabeled data.
method Transformer-based approach with novel attention mechanism and data augmentation.
result GraphDINO yields morphological clusterings on par with expert classification.

Tactile information is important for gripping, stable grasp, and in-hand manipulation, yet the complexity of tactile data prevents widespread use of such sensors. We make use of an unsupervised learning algorithm that transforms the complex tactile data into a compact, latent representation without the need to record g…

2016-06-23abs ↗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.

Deep learning methods are successfully used in applications pertaining to ubiquitous computing, health, and well-being. Specifically, the area of human activity recognition (HAR) is primarily transformed by the convolutional and recurrent neural networks, thanks to their ability to learn semantic representations from r…

2019-07-27abs ↗pdf ↗

Transformers can learn spectral methods and perform unsupervised learning.

problem Learning spectral methods using unsupervised learning.
method Using multi-layered Transformers, pre-trained on a large set of instances, to learn and perform statistical estimation tasks.
result Proven that pre-trained Transformers can learn spectral methods and perform tasks like PCA and clustering.

Feature learning and deep learning have drawn great attention in recent years as a way of transforming input data into more effective representations using learning algorithms. Such interest has grown in the area of music information retrieval (MIR) as well, particularly in music audio classification tasks such as auto…

2015-08-20abs ↗pdf ↗

Dataset augmentation, the practice of applying a wide array of domain-specific transformations to synthetically expand a training set, is a standard tool in supervised learning. While effective in tasks such as visual recognition, the set of transformations must be carefully designed, implemented, and tested for every …

2017-02-17abs ↗pdf ↗

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.

Unsupervised dimension selection is an important problem that seeks to reduce dimensionality of data, while preserving the most useful characteristics. While dimensionality reduction is commonly utilized to construct low-dimensional embeddings, they produce feature spaces that are hard to interpret. Further, in applica…

2018-10-31abs ↗pdf ↗

Our goal is to extract meaningful transformations from raw images, such as varying the thickness of lines in handwriting or the lighting in a portrait. We propose an unsupervised approach to learn such transformations by attempting to reconstruct an image from a linear combination of transformations of its nearest neig…

2017-11-06abs ↗pdf ↗

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.

Domain adaptation is an important technique to alleviate performance degradation caused by domain shift, e.g., when training and test data come from different domains. Most existing deep adaptation methods focus on reducing domain shift by matching marginal feature distributions through deep transformations on the inpu…

2019-06-24abs ↗pdf ↗

RAEUFS selects features from data without labels, improving robustness to outliers.

problem Feature selection in high-dimensional data, especially in the presence of outliers.
method RAEUFS uses a deep autoencoder to learn nonlinear feature representations, improving robustness to outliers.
result RAEUFS outperforms state-of-the-art UFS methods in both clean and outlier-contaminated data settings.

Unsupervised method selects genes for tumor subtype discovery.

problem High-dimensional tumor gene expression data with noisy variables and heterogeneity.
method Autoencoders for latent space learning, Multiple Kernel Learning for feature selection, clustering.
result Lower redundancy and better clustering performance compared to benchmarks.

A new method for feature selection in high-dimensional data.

problem Dealing with noise and high-dimensional data in unsupervised feature selection.
method Sparse PCA via l2,pl_{2,p}-norm regularization, combined with an efficient optimization algorithm.
result The proposed method effectively selects features from real-world data sets.

Unsupervised domain adaptation methods aim to alleviate performance degradation caused by domain-shift by learning domain-invariant representations. Existing deep domain adaptation methods focus on holistic feature alignment by matching source and target holistic feature distributions, without considering local feature…

2018-11-12abs ↗pdf ↗

We investigate unsupervised pre-training of deep architectures as feature generators for "shallow" classifiers. Stacked Denoising Autoencoders (SdA), when used as feature pre-processing tools for SVM classification, can lead to significant improvements in accuracy - however, at the price of a substantial increase in co…

2011-05-05abs ↗pdf ↗

FCDD explains deep anomaly detection by mapping anomalies away and providing heatmap explanations.

problem Deep one-class classification's non-linear transformation makes it hard to interpret.
method FCDD learns a mapping that concentrates nominal samples, maps anomalies away, and provides heatmap explanations.
result FCDD sets a new state of the art in unsupervised anomaly detection on MVTec-AD.

A novel unsupervised feature selection method using subspace clustering and self-expressive model.

problem Feature selection for large datasets with minimal labeling effort.
method Subspace clustering with adaptive representation learning and regularized regression.
result The method effectively captures sample similarities and discriminative information.

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…

2017-10-23abs ↗pdf ↗