Linearly scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction

DOI10.2140/CAMCOS.2024.19.87MaRDI QIDQ6644161

Lukáš Pospíšil, Illia Horenko

Publication date: 27 November 2024

Published in: Communications in Applied Mathematics and Computational Science (Search for Journal in Brave)

zbMATH Keywords

entropyregularizationpermutationunsupervised learningeconomical data

Mathematics Subject Classification ID

Computational learning theory (68Q32) Artificial intelligence (68T99) General topics in artificial intelligence (68T01)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification
• Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• Introduction to algorithms
• On convex relaxation of graph isomorphism
• On Markov state models for metastable processes
• Lectures on Polytopes
• eSPA+: Scalable Entropy-Optimal Machine Learning Classification for Small Data Problems
• On a Scalable Entropic Breaching of the Overfitting Barrier for Small Data Problems in Machine Learning

This page was built for publication: Linearly scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644161)