ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Unsupervised learning”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGRecentJun 3, 2026

BBOmix: A Tabular Benchmark for Hyperparameter Optimization of Unsupervised Biological Representation Learning

Luca Thale-Bombien, Jan Ewald, Ralf König, Aaron Klein

This paper introduces BBOmix, an open-source benchmark for unsupervised representation learning on real-world biological data.

View →
cs.LGEmpiricalRecentJul 1, 2026

Neural Certificate Pricing for Combinatorial Optimization Problems

Jingyi Chen, Xinyuan Zhang, Xinwu Qian

This paper introduces Neural Certificate Pricing (NCP), an unsupervised learning framework that exploits the asymmetry between certifiable discrete structures and structural feasibility in combinatori…

View →
cs.LGcs.AImath.OCRecentMay 29, 2026

Unlearning in Diffusion Models: A Unified Framework with KL Divergence and Likelihood Constraints

Shervin Khalafi, Alejandro Ribeiro, Dongsheng Ding

The paper proposes a unified, constrained optimization framework using KL divergence and likelihood constraints to achieve effective and principled unlearning in diffusion models.

View →
eess.AScs.CLEmpiricalRecentJun 9, 2026

Recovering the Zipfian Distribution in Unsupervised Term Discovery

Danel Slabbert, Simon Malan, Herman Kamper

The paper presents a graph-based clustering approach for unsupervised term discovery that outperforms centre-based methods in producing Zipf-like distributions.

View →
cs.MAcs.AIEmpiricalRecentJun 19, 2026

Cohort Organized Learning: Clustering Through Agreement

Finn Henry O'Shea, Maria Elena Monzani

This paper presents Cohort Organized Learning (CoOL), a method for clustering data without explicit distance or similarity computations.

View →
cs.ITTheoreticalRecentJun 19, 2026

Error Exponent Bounds for Optimal Short-Read Clustering

Yoav Chachamovitz, Nir Weinberger

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

View →
cs.CLEmpiricalRecentJul 7, 2026

On the feasibility of dependency parsing of non-human sequences without a gold standard. Is evaluation possible in other species?

Ramon Ferrer-i-Cancho, Catherine Hobaiter, Thore Bergman, Morgan Gustison

The paper applies network science to demonstrate the feasibility of unsupervised dependency parsing in non-human primates due to their sequence length distribution.

View →
cs.LGstat.MLPositionRecentOct 26, 2026

Risk-Aware Output Control Should be the Focus of Machine Unlearning

Yahya Alkhatib, Yuyang Xiao, Wee Peng Tay

This paper argues that machine unlearning should prioritize output-space control over parameter-space similarity.

View →
cs.LGmath.NAEmpiricalRecentJul 29, 2026

From Classification to Regression: Using a Fruitfly to Solve Equations

Shady E. Ahmed, Panos Stinis

The paper proposes a novel approach to regression tasks using classification inspired by fruitflies' environmental sensing, replacing complex global models with a library of local patterns for nonline…

View →
cs.LGcs.AIcs.CRApr 18, 2026

Channel-Level Semantic Perturbations: Unlearnable Examples for Diverse Training Paradigms

Bo Wang, Jia Ni, Mengnan Zhao, Zhan Qin +1 more

This paper systematically investigates unlearnable examples (UEs) across diverse training paradigms, finding that existing UEs fail under pretraining-finetuning (PF) settings, and proposes Shallow Sem…

View →
cs.LGcs.AIRecentMay 28, 2026

The Little Book of Generative AI Foundations: An Intuitive Mathematical Primer

Tianhua Chen

This book provides a compact, derivation-oriented mathematical primer that connects major families of generative AI models, showing their underlying structural relationships.

View →
stat.MLcs.LGEmpiricalRecentJun 28, 2026

Gradient boosting with vector-valued leafs

David Cortes

This paper extends gradient boosting to functions of vector inputs using a simple algorithm with histogram-based decision trees.

View →
q-bio.NCcs.LGRecentJun 1, 2026

How Optimality Structures Sparse Dictionaries: A Theory for Understanding SAE Representations

William Dorrell

The paper theoretically analyzes the properties that optimal sparse autoencoder (SAE) dictionaries must satisfy, deriving constraints that explain observed SAE behaviors like hierarchical splitting an…

View →
cs.CVcs.AIRecentMay 29, 2026

SUPREME: A Multi-GPU Framework for Reproducible Image Unlearning Method Evaluation

Petros Andreou, Jamie Lanyon, Axel Finke, Georgina Cosma

SUPREME is an open-source, multi-GPU framework designed to efficiently and reproducibly evaluate machine unlearning methods for image classification by distributing computationally intensive tasks acr…

View →
stat.MLcs.LGRecentJun 1, 2026

Doing well with less! On Sampling Techniques for Empirical Pairwise Loss Estimation/Minimization

Louise Davy, Stephan Clémençon, Charlotte Laclau

This paper introduces survey sampling techniques to estimate or minimize empirical pairwise loss functions, showing that targeting informative pairs significantly reduces computational cost while main…

View →
cs.LGcs.AIcs.CRMay 12, 2026

SoK: Unlearnability and Unlearning for Model Dememorization

Mengying Zhang, Derui Wang, Ruoxi Sun, Xiaoyu Xia +2 more

This paper provides the first integrated analysis of model dememorization, unifying unlearnability and unlearning methods, and offering theoretical guarantees on dememorization depth.

View →
stat.MLcs.LGmath.NATheoreticalRecentJun 20, 2026

Convergence Analysis of Nyström Subsampling in Covariate Shift Adaptation for Misspecified case

Hanna Myleiko, Sergei Solodky, Vasyl Semenov

This paper investigates convergence properties of regularized Nyström subsampling for unsupervised domain adaptation under covariate shift.

View →