Approximately optimal subset selection for statistical design and modelling

DOI10.1080/00949655.2021.1900182OpenAlexW3139526846MaRDI QIDQ3389636

James V. Zidek, Yu Wang, Nhu D. Le

Publication date: 23 March 2022

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationgenetic algorithmsdeterminantal point processes\(D\)-optimal designmaximum entropy samplingparallelizable search algorithm

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• R
• EnviroStat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal monitoring network designs
• Determinantal processes and independence
• Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
• A linear integer programming bound for maximum-entropy sampling
• Distributions on partitions, point processes, and the hypergeometric kernel
• Eynard-Mehta theorem, Schur process, and their Pfaffian analogs
• Statistical analysis of environmental space-time processes.
• Determinantal Point Processes for Machine Learning
• Handbook of Environmental and Ecological Statistics
• Computer Construction of "D-Optimal" First-Order Designs
• The coincidence approach to stochastic point processes
• Continuous relaxations for Constrained Maximum-Entropy Sampling
• An Exact Algorithm for Maximum Entropy Sampling
• Efficient Solution of Maximum-Entropy Sampling Problems
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Approximately optimal subset selection for statistical design and modelling