Robust learning of data anomalies with analytically-solvable entropic outlier sparsification
Not on the map. Why?
Abstract (arXiv)
Entropic Outlier Sparsification (EOS) is proposed as a robust computational strategy for the detection of data anomalies in a broad class of learning methods, including the unsupervised problems (like detection of non-Gaussian outliers in mostly-Gaussian data) and in the supervised learning with mislabeled data. EOS dwells on the derived analytic closed-form solution of the (weighted) expected error minimization problem subject to the Shannon entropy regularization. In contrast to common regularization strategies requiring computational costs that scale polynomial with the data dimension, identified closed-form solution is proven to impose additional iteration costs that depend linearly on statistics size and are independent of data dimension. Obtained analytic results also explain why the mixtures of spherically-symmetric Gaussians - used heuristically in many popular data analysis algorithms - represent an optimal choice for the non-parametric probability distributions when working with squared Euclidean distances, combining expected error minimality, maximal entropy/unbiasedness, and a linear cost scaling. The performance of EOS is compared to a range of commonly-used tools on synthetic problems and on partially-mislabeled supervised classification problems from biomedicine.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 0 of its 21 references that are in the map. First posted on arXiv 22 Dec 2021.
Builds on
0 of 21 references.
No references here yet.
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 3.
5 papers.
- 2025Learning dynamical systems with hit-and-run random feature mapscited by 8
- 2025Applications of Entropy in Data Analysis and Machine Learning: A Reviewcited by 3
- 2023On existence, uniqueness and scalability of adversarial robustness measures for AI classifierscited by 1
- 2025Fast, close, non-singular and property-preserving approximations of entropic measurescited by 1
- 2023Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reductioncited by 0
- 2025Fast, close, non-singular and property-preserving approximations of entropic measures20 May 2025
- 2025Applications of Entropy in Data Analysis and Machine Learning: A Review4 Mar 2025
- 2025Learning dynamical systems with hit-and-run random feature maps11 Jan 2025
- 2023On existence, uniqueness and scalability of adversarial robustness measures for AI classifiers19 Oct 2023
- 2023Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction17 Jun 2023