Efficient quantisation and weak covering of high dimensional cubes

DOI10.1007/s00454-022-00396-7zbMath1493.11105arXiv2005.07938OpenAlexW4281916910MaRDI QIDQ2167316

Anatoly A. Zhigljavsky, Jack Noonan

Publication date: 25 August 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

coveringfacility locationcomputer experimentshigh dimensionspace-fillingquantisationVoronoi set

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)

Related Items

Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms

Cites Work

• Design of computer experiments: space filling and beyond
• The design and analysis of computer experiments.
• Foundations of quantization for probability distributions
• Covering of high-dimensional cubes and quantization
• Kernel techniques: From machine learning to meshless methods
• Bayesian Quadrature, Energy Minimization, and Space-Filling Design
• Bayesian and High-Dimensional Global Optimization
• Non-lattice Covering and Quantization of High Dimensional Sets
• Scattered Data Approximation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item