Non-lattice Covering and Quantization of High Dimensional Sets

DOI10.1007/978-3-030-66515-9_10MaRDI QIDQ5153507zbMATH OpenOpenAlexFDO

Authors Jack Noonan, A. Zhigljavsky

Publication date 30 September 2021

Published in Black Box Optimization, Machine Learning, and No-Free Lunch Theorems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient quantisation and weak covering of high dimensional cubes
• Covering of high-dimensional cubes and quantization
• Covering and packing problems in lattices associated with the \(n\)-cube
• scientific article; zbMATH DE number 3909232
• Partial covering arrays for data hiding and quantization

Cites work

• Covering of high-dimensional cubes and quantization
• Design of computer experiments: space filling and beyond
• scientific article; zbMATH DE number 3976091 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 3504209 (Why is no real title available?)
• scientific article; zbMATH DE number 480248 (Why is no real title available?)
• scientific article; zbMATH DE number 741240 (Why is no real title available?)
• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
• On the worst-case optimal multi-objective global optimization
• Optimal strategies of the search for an extremum

Cited in

(4)

• Efficient quantisation and weak covering of high dimensional cubes
• On Nikodym-type sets in high dimensions
• Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
• Non-lattice covering and quanitization of high dimensional sets

This page was built for publication: Non-lattice Covering and Quantization of High Dimensional Sets

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