A quasi-Monte Carlo data compression algorithm for machine learning

DOI10.1016/j.jco.2021.101587OpenAlexW3168668299MaRDI QIDQ2238850

Michael Feischl, Josef Dick

Publication date: 2 November 2021

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.02491

zbMATH Keywords

big datahigher-order methodsquasi-Monte Carlostatistical learning

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)

Related Items

Convergence Analysis of a Quasi-Monte CarloBased Deep Learning Algorithm for Solving Partial Differential Equations, Higher-Order Quasi-Monte Carlo Training of Deep Neural Networks

Uses Software

• ElemStatLearn
• sobol.cc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing Sobol Sequences with Better Two-Dimensional Projections
• Point sets and sequences with small discrepancy
• Support points
• Optimal subsampling for softmax regression
• Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
• Discrépance de suites associées à un système de numération (en dimension s)
• Optimal Subsampling for Large Sample Logistic Regression
• Statistical properties of sketching algorithms
• Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations with Random Field Inputs
• Sparse grids
• Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering