zeph-experiments 0.21.2

Experiment engine for adaptive agent behavior testing and hyperparameter tuning
Documentation
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
// SPDX-FileCopyrightText: 2026 Andrei G <bug-ops>
// SPDX-License-Identifier: MIT OR Apache-2.0

//! Search space definition for parameter variation experiments.

use serde::{Deserialize, Serialize};

use super::error::EvalError;
use super::types::ParameterKind;

/// A continuous or discrete range for a single tunable parameter.
///
/// When `step` is `Some`, the parameter is treated as discrete: values are
/// quantized to the nearest grid point anchored at `min`. When `step` is `None`
/// the parameter is treated as continuous and generators fall back to an internal
/// default step count (typically 20 divisions).
///
/// Invariants enforced by [`ParameterRange::new`]:
/// - `min < max` (both must be finite)
/// - `min <= default <= max` (`default` must be finite)
/// - `step`, when `Some`, must be finite and positive
///
/// # Examples
///
/// ```rust
/// use zeph_experiments::{ParameterRange, ParameterKind};
///
/// let range = ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, Some(0.1), 0.7).unwrap();
///
/// assert_eq!(range.step_count(), Some(11));
/// assert!((range.clamp(2.0) - 1.0).abs() < f64::EPSILON);
/// assert!((range.quantize(0.73) - 0.7).abs() < 1e-10);
/// ```
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ParameterRange {
    kind: ParameterKind,
    min: f64,
    max: f64,
    step: Option<f64>,
    default: f64,
}

impl ParameterRange {
    /// Construct a validated `ParameterRange`.
    ///
    /// # Errors
    ///
    /// Returns [`EvalError::InvalidRange`] if `min >= max` or either bound is non-finite.
    /// Returns [`EvalError::DefaultOutOfRange`] if `default` is outside `[min, max]`.
    ///
    /// `step` is not validated by this constructor; non-positive or non-finite values
    /// are treated as `None` by [`step_count`] and [`quantize`].
    ///
    /// [`step_count`]: Self::step_count
    /// [`quantize`]: Self::quantize
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::{ParameterRange, ParameterKind, EvalError};
    ///
    /// let r = ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, Some(0.1), 0.7).unwrap();
    /// assert!((r.min() - 0.0).abs() < f64::EPSILON);
    /// assert!((r.max() - 1.0).abs() < f64::EPSILON);
    /// assert!((r.default_value() - 0.7).abs() < f64::EPSILON);
    ///
    /// assert!(matches!(
    ///     ParameterRange::new(ParameterKind::Temperature, 1.0, 0.0, None, 0.5),
    ///     Err(EvalError::InvalidRange { .. })
    /// ));
    /// assert!(matches!(
    ///     ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, None, 2.0),
    ///     Err(EvalError::DefaultOutOfRange { .. })
    /// ));
    /// ```
    pub fn new(
        kind: ParameterKind,
        min: f64,
        max: f64,
        step: Option<f64>,
        default: f64,
    ) -> Result<Self, EvalError> {
        if !min.is_finite() || !max.is_finite() || min >= max {
            return Err(EvalError::InvalidRange { min, max });
        }
        if !default.is_finite() || default < min || default > max {
            return Err(EvalError::DefaultOutOfRange { default, min, max });
        }
        Ok(Self {
            kind,
            min,
            max,
            step,
            default,
        })
    }

    /// Return the [`ParameterKind`] this range applies to.
    #[must_use]
    pub fn kind(&self) -> ParameterKind {
        self.kind
    }

    /// Return the minimum value (inclusive).
    #[must_use]
    pub fn min(&self) -> f64 {
        self.min
    }

    /// Return the maximum value (inclusive).
    #[must_use]
    pub fn max(&self) -> f64 {
        self.max
    }

    /// Return the discrete step size, or `None` for a continuous range.
    #[must_use]
    pub fn step(&self) -> Option<f64> {
        self.step
    }

    /// Return the default (baseline) value.
    ///
    /// Named `default_value` to avoid shadowing the `Default` trait keyword.
    #[must_use]
    pub fn default_value(&self) -> f64 {
        self.default
    }

    /// Number of discrete grid points in this range, or `None` if `step` is not set or ≤ 0.
    ///
    /// The count is `floor((max - min) / step) + 1`.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::{ParameterRange, ParameterKind};
    ///
    /// let r = ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, Some(0.5), 0.5).unwrap();
    /// assert_eq!(r.step_count(), Some(3)); // 0.0, 0.5, 1.0
    ///
    /// let r_continuous = ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, None, 0.5).unwrap();
    /// assert_eq!(r_continuous.step_count(), None);
    /// ```
    #[must_use]
    pub fn step_count(&self) -> Option<usize> {
        let step = self.step?;
        if step <= 0.0 {
            return None;
        }
        #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
        Some(((self.max - self.min) / step).floor() as usize + 1)
    }

    /// Clamp `value` to `[min, max]`.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::{ParameterRange, ParameterKind};
    ///
    /// let r = ParameterRange::new(ParameterKind::TopP, 0.1, 1.0, Some(0.1), 0.9).unwrap();
    /// assert!((r.clamp(2.0) - 1.0).abs() < f64::EPSILON);
    /// assert!((r.clamp(-1.0) - 0.1).abs() < f64::EPSILON);
    /// ```
    #[must_use]
    pub fn clamp(&self, value: f64) -> f64 {
        value.clamp(self.min, self.max)
    }

    /// Return `true` if `value` lies within `[min, max]` (inclusive).
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::{ParameterRange, ParameterKind};
    ///
    /// let r = ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, Some(0.1), 0.7).unwrap();
    /// assert!(r.contains(0.5));
    /// assert!(!r.contains(1.1));
    /// ```
    #[must_use]
    pub fn contains(&self, value: f64) -> bool {
        (self.min..=self.max).contains(&value)
    }

    /// Quantize `value` to the nearest grid step anchored at `min`.
    ///
    /// Formula: `min + ((value - min) / step).round() * step`, then clamped to `[min, max]`.
    /// Anchoring at `min` ensures grid points align to `{min, min+step, min+2*step, ...}`.
    #[must_use]
    pub fn quantize(&self, value: f64) -> f64 {
        if let Some(step) = self.step
            && step > 0.0
        {
            let quantized = self.min + ((value - self.min) / step).round() * step;
            return self.clamp((quantized * 100.0).round() / 100.0);
        }
        value
    }
}

/// The set of parameter ranges that define the experiment search space.
///
/// The default search space covers five parameters: `temperature`, `top_p`, `top_k`,
/// `frequency_penalty`, and `presence_penalty`. Custom spaces can be constructed
/// by providing any subset of [`ParameterRange`] values.
///
/// When deserialized from config with `[serde(default)]`, missing fields are filled
/// from [`Default::default`].
///
/// # Examples
///
/// ```rust
/// use zeph_experiments::{SearchSpace, ParameterKind};
///
/// let space = SearchSpace::default();
/// assert!(space.is_valid());
/// assert!(space.grid_size() > 0);
/// assert!(space.range_for(ParameterKind::Temperature).is_some());
/// ```
#[derive(Debug, Clone, Serialize, Deserialize)]
#[serde(default)]
pub struct SearchSpace {
    /// The parameter ranges in this search space.
    pub parameters: Vec<ParameterRange>,
}

impl Default for SearchSpace {
    fn default() -> Self {
        Self {
            parameters: vec![
                ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, Some(0.1), 0.7)
                    .expect("default Temperature range is valid"),
                ParameterRange::new(ParameterKind::TopP, 0.1, 1.0, Some(0.05), 0.9)
                    .expect("default TopP range is valid"),
                ParameterRange::new(ParameterKind::TopK, 1.0, 100.0, Some(5.0), 40.0)
                    .expect("default TopK range is valid"),
                ParameterRange::new(ParameterKind::FrequencyPenalty, -2.0, 2.0, Some(0.2), 0.0)
                    .expect("default FrequencyPenalty range is valid"),
                ParameterRange::new(ParameterKind::PresencePenalty, -2.0, 2.0, Some(0.2), 0.0)
                    .expect("default PresencePenalty range is valid"),
            ],
        }
    }
}

impl SearchSpace {
    /// Find the range for a given [`ParameterKind`], if present.
    ///
    /// Returns `None` if the search space does not include the requested kind.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::{SearchSpace, ParameterKind};
    ///
    /// let space = SearchSpace::default();
    /// let temp = space.range_for(ParameterKind::Temperature).unwrap();
    /// assert!((temp.default_value() - 0.7).abs() < f64::EPSILON);
    ///
    /// // RetrievalTopK is not in the default space
    /// assert!(space.range_for(ParameterKind::RetrievalTopK).is_none());
    /// ```
    #[must_use]
    pub fn range_for(&self, kind: ParameterKind) -> Option<&ParameterRange> {
        self.parameters.iter().find(|r| r.kind() == kind)
    }

    /// Return `true` if all parameter ranges in this space passed construction-time validation.
    ///
    /// Because [`ParameterRange::new`] enforces invariants at construction time, ranges stored
    /// in a `SearchSpace` built programmatically are always valid. This method is retained for
    /// spaces deserialized from untrusted config where struct-update syntax could bypass `new`.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::SearchSpace;
    ///
    /// assert!(SearchSpace::default().is_valid());
    /// assert!(SearchSpace { parameters: vec![] }.is_valid()); // empty is valid
    /// ```
    #[must_use]
    pub fn is_valid(&self) -> bool {
        self.parameters.iter().all(|r| {
            r.min().is_finite()
                && r.max().is_finite()
                && r.default_value().is_finite()
                && r.min() < r.max()
                && r.step().is_none_or(|s| s.is_finite() && s > 0.0)
        })
    }

    /// Total number of discrete grid points across all parameters that have a step.
    ///
    /// This equals the number of distinct variations a [`GridStep`] generator will
    /// produce before returning `None`. Parameters without a `step` are not counted.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use zeph_experiments::SearchSpace;
    ///
    /// let size = SearchSpace::default().grid_size();
    /// assert!(size > 0);
    ///
    /// assert_eq!(SearchSpace { parameters: vec![] }.grid_size(), 0);
    /// ```
    ///
    /// [`GridStep`]: crate::GridStep
    #[must_use]
    pub fn grid_size(&self) -> usize {
        self.parameters
            .iter()
            .filter_map(ParameterRange::step_count)
            .sum()
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    fn make_range(
        kind: ParameterKind,
        min: f64,
        max: f64,
        step: Option<f64>,
        default: f64,
    ) -> ParameterRange {
        ParameterRange::new(kind, min, max, step, default).unwrap()
    }

    #[test]
    fn new_valid_range() {
        let r = make_range(ParameterKind::Temperature, 0.0, 1.0, Some(0.5), 0.5);
        assert_eq!(r.kind(), ParameterKind::Temperature);
        assert!((r.min() - 0.0).abs() < f64::EPSILON);
        assert!((r.max() - 1.0).abs() < f64::EPSILON);
        assert!((r.default_value() - 0.5).abs() < f64::EPSILON);
        assert_eq!(r.step(), Some(0.5));
    }

    #[test]
    fn new_invalid_range_min_ge_max() {
        assert!(matches!(
            ParameterRange::new(ParameterKind::Temperature, 1.0, 0.0, None, 0.5),
            Err(EvalError::InvalidRange { .. })
        ));
        // equal bounds also invalid
        assert!(matches!(
            ParameterRange::new(ParameterKind::Temperature, 0.5, 0.5, None, 0.5),
            Err(EvalError::InvalidRange { .. })
        ));
    }

    #[test]
    fn new_invalid_range_nonfinite_bounds() {
        assert!(matches!(
            ParameterRange::new(ParameterKind::Temperature, f64::NAN, 1.0, None, 0.5),
            Err(EvalError::InvalidRange { .. })
        ));
        assert!(matches!(
            ParameterRange::new(ParameterKind::Temperature, 0.0, f64::INFINITY, None, 0.5),
            Err(EvalError::InvalidRange { .. })
        ));
    }

    #[test]
    fn new_invalid_default_out_of_range() {
        assert!(matches!(
            ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, None, 2.0),
            Err(EvalError::DefaultOutOfRange { .. })
        ));
        assert!(matches!(
            ParameterRange::new(ParameterKind::Temperature, 0.0, 1.0, None, -0.1),
            Err(EvalError::DefaultOutOfRange { .. })
        ));
    }

    #[test]
    fn step_count_with_step() {
        let r = make_range(ParameterKind::Temperature, 0.0, 1.0, Some(0.5), 0.5);
        assert_eq!(r.step_count(), Some(3)); // 0.0, 0.5, 1.0
    }

    #[test]
    fn step_count_no_step() {
        let r = make_range(ParameterKind::Temperature, 0.0, 1.0, None, 0.5);
        assert_eq!(r.step_count(), None);
    }

    #[test]
    fn step_count_zero_step() {
        // step=Some(0.0) passes construction (step not validated), but step_count returns None
        let mut r = make_range(ParameterKind::Temperature, 0.0, 1.0, None, 0.5);
        r.step = Some(0.0);
        assert_eq!(r.step_count(), None);
    }

    #[test]
    fn clamp_below_min() {
        let r = make_range(ParameterKind::TopP, 0.1, 1.0, Some(0.1), 0.9);
        assert!((r.clamp(-1.0) - 0.1).abs() < f64::EPSILON);
    }

    #[test]
    fn clamp_above_max() {
        let r = make_range(ParameterKind::TopP, 0.1, 1.0, Some(0.1), 0.9);
        assert!((r.clamp(2.0) - 1.0).abs() < f64::EPSILON);
    }

    #[test]
    fn clamp_within_range() {
        let r = make_range(ParameterKind::Temperature, 0.0, 2.0, Some(0.1), 0.7);
        assert!((r.clamp(1.0) - 1.0).abs() < f64::EPSILON);
    }

    #[test]
    fn contains_within_range() {
        let r = make_range(ParameterKind::Temperature, 0.0, 2.0, Some(0.1), 0.7);
        assert!(r.contains(1.0));
        assert!(r.contains(0.0));
        assert!(r.contains(2.0));
        assert!(!r.contains(-0.1));
        assert!(!r.contains(2.1));
    }

    #[test]
    fn quantize_snaps_to_nearest_step() {
        let r = make_range(ParameterKind::Temperature, 0.0, 2.0, Some(0.1), 0.7);
        let q = r.quantize(0.73);
        assert!((q - 0.7).abs() < 1e-10, "expected 0.7, got {q}");
    }

    #[test]
    fn quantize_no_step_returns_value_unchanged() {
        let r = make_range(ParameterKind::Temperature, 0.0, 2.0, None, 0.7);
        assert!((r.quantize(1.234) - 1.234).abs() < f64::EPSILON);
    }

    #[test]
    fn quantize_clamps_result() {
        let r = make_range(ParameterKind::Temperature, 0.0, 1.0, Some(0.1), 0.5);
        let q = r.quantize(100.0);
        assert!(q <= 1.0, "quantize must clamp to max");
    }

    #[test]
    fn quantize_avoids_fp_accumulation() {
        let r = make_range(ParameterKind::Temperature, 0.0, 2.0, Some(0.1), 0.7);
        let accumulated = 0.1_f64 * 7.0;
        let q = r.quantize(accumulated);
        assert!(
            (q - 0.7).abs() < 1e-10,
            "expected 0.7, got {q} (accumulated={accumulated})"
        );
    }

    #[test]
    fn default_search_space_has_five_parameters() {
        let space = SearchSpace::default();
        assert_eq!(space.parameters.len(), 5);
    }

    #[test]
    fn default_grid_size_is_reasonable() {
        let space = SearchSpace::default();
        let size = space.grid_size();
        // Temperature: 11, TopP: 19, TopK: 20, Freq: 21, Pres: 21 = 92
        assert!(size > 0);
        assert!(size < 200);
    }

    #[test]
    fn range_for_finds_temperature() {
        let space = SearchSpace::default();
        let range = space.range_for(ParameterKind::Temperature);
        assert!(range.is_some());
        assert!((range.unwrap().default_value() - 0.7).abs() < f64::EPSILON);
    }

    #[test]
    fn range_for_missing_returns_none() {
        let space = SearchSpace::default();
        let range = space.range_for(ParameterKind::RetrievalTopK);
        assert!(range.is_none());
    }

    #[test]
    fn grid_size_empty_space_is_zero() {
        let space = SearchSpace { parameters: vec![] };
        assert_eq!(space.grid_size(), 0);
    }

    #[test]
    fn quantize_with_nonzero_min_anchors_to_min() {
        let r = make_range(ParameterKind::TopK, 1.0, 100.0, Some(5.0), 40.0);
        let q = r.quantize(6.0);
        assert!(
            (q - 6.0).abs() < 1e-10,
            "expected 6.0 (min-anchored grid), got {q}"
        );
        let q2 = r.quantize(3.0);
        assert!((q2 - 1.0).abs() < 1e-10, "expected 1.0, got {q2}");
    }

    #[test]
    fn quantize_negative_step_returns_unchanged() {
        let mut r = make_range(ParameterKind::Temperature, 0.0, 2.0, None, 0.7);
        r.step = Some(-0.1);
        assert!((r.quantize(0.75) - 0.75).abs() < f64::EPSILON);
    }

    #[test]
    fn parameter_range_is_valid_for_default() {
        for r in &SearchSpace::default().parameters {
            // All ranges constructed via new() are valid by invariant
            assert!(
                r.min() < r.max(),
                "default range {:?} has min >= max",
                r.kind()
            );
        }
    }

    #[test]
    fn search_space_is_valid_for_default() {
        assert!(SearchSpace::default().is_valid());
    }

    #[test]
    fn search_space_invalid_when_range_inverted() {
        // Construct an invalid range by bypassing new() via serde deserialization isn't easy;
        // instead, test is_valid() directly on a SearchSpace with a mutated range.
        let mut space = SearchSpace::default();
        // Directly mutate to simulate a deserialized-but-invalid range
        space.parameters[0].min = 2.0;
        space.parameters[0].max = 0.0;
        assert!(!space.is_valid());
    }
}