Using low-discrepancy points for data compression in machine learning: an experimental comparison

DOI10.1186/S13362-024-00166-5MaRDI QIDQ7017596zbMATH OpenFDO

Authors S. Göttlich, J. Heieck, A. Neuenkirch

Publication date 6 March 2025

Published in Journal of Mathematics in Industry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

data reductionquasi-Monte Carloneural networksdigital nets\(K\)-means algorithmlow-discrepancy points

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Artificial neural networks and deep learning (68T07) Algorithms for approximation of functions (65D15)

Cites work

• scientific article; zbMATH DE number 5797591 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• A quasi-Monte Carlo data compression algorithm for machine learning
• A statistical perspective on algorithmic leveraging
• Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation
• Enhancing Accuracy of Deep Learning Algorithms by Training with Low-Discrepancy Sequences
• Higher-order quasi-Monte Carlo training of deep neural networks
• Lectures on the nearest neighbor method
• NP-hardness of Euclidean sum-of-squares clustering
• Point sets and sequences with small discrepancy
• Supervised compression of big data
• Support points
• The Accuracy of Floating Point Summation
• The Elements of Statistical Learning

This page was built for publication: Using low-discrepancy points for data compression in machine learning: an experimental comparison

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