1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
// SPDX-License-Identifier: AGPL-3.0-or-later
//! Sparsity-based iterative surrogate sampling
//!
//! Implements the `SparsitySampler` algorithm from Diaw et al. (2024):
//! an iterative workflow that alternates between optimization (evaluation gathering)
//! and surrogate model training to achieve both exploitation and exploration.
//!
//! # Algorithm
//!
//! ```text
//! 1. Generate initial samples via maximin LHS
//! 2. Evaluate objective at initial samples
//! 3. LOOP until budget exhausted:
//! a. Train RBF surrogate on ALL evaluations
//! b. Use surrogate to identify promising regions (minimize predicted value)
//! c. Run multi-start NM on the SURROGATE to find candidate points
//! d. Evaluate TRUE objective at candidate points
//! e. Add evaluations to cache
//! ```
//!
//! # Hybrid Evaluation Strategy
//!
//! For large datasets (n > 100), the distance matrix computation uses GPU
//! acceleration via `cdist.wgsl`. Enable with `SparsitySamplerConfig::with_gpu(device)`.
//!
//! # References
//!
//! - Diaw, A. et al. (2024). "Efficient learning of accurate surrogates for
//! simulations of complex systems." Nature Machine Intelligence.
pub use ;
pub use ;
pub use sparsity_sampler;
pub use sparsity_sampler_gpu;