Struct PbtReport 

pub struct PbtReport {
    pub members: Vec<Member>,
    pub best_number: u64,
    pub best_progress: f64,
    pub best_lr: f64,
    pub forks: usize,
    pub max_depth: u32,
    pub discovered_schedule: Vec<f64>,
}

The result of a PBT run over the schedule problem.

Fields

members: Vec<Member>

Every trial, in trial-number order.

best_number: u64

The best trial’s number (highest accumulated reward).

best_progress: f64

The best accumulated reward reached — PBT’s headline result.

best_lr: f64

The best trial’s learning rate.

forks: usize

How many trials were forks (exploit-and-explore children).

max_depth: u32

The deepest lineage reached (in segments).

discovered_schedule: Vec<f64>

The learning-rate schedule PBT discovered: the lr each ancestor of the winning trial used, root segment first. Its length is the winner’s depth.

Implementations

impl PbtReport

pub fn winning_chain(&self) -> Vec<u64>

The winning lineage’s chain of trial numbers, root first.

Trait Implementations

impl Clone for PbtReport

fn clone(&self) -> PbtReport

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PbtReport

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for PbtReport

fn eq(&self, other: &PbtReport) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for PbtReport