BestDosePosterior

Struct BestDosePosterior 

Source
pub struct BestDosePosterior { /* private fields */ }
Expand description

The computed Bayesian posterior for a patient

This is the main public entry point for the two-stage BestDose API:

  1. Stage 1: Posterior computation (BestDosePosterior::compute())

    • NPAGFULL11: Bayesian filtering of prior support points
    • NPAGFULL: Local refinement of each filtered point
  2. Stage 2: Dose optimization (BestDosePosterior::optimize())

    • Dual optimization (posterior vs uniform weights)
    • Final predictions with optimal doses

The posterior can be reused across multiple optimize() calls with different targets, dose ranges, or bias weights.

§Example

use pmcore::bestdose::{BestDosePosterior, Target, DoseRange};

// Stage 1: Compute posterior (expensive, done once)
let posterior = BestDosePosterior::compute(
    &population_theta,
    &population_weights,
    Some(past),
    eq,
    settings,
)?;

// Stage 2: Optimize doses (can be called multiple times)
let result = posterior.optimize(
    target,
    None,                            // No time offset
    DoseRange::new(0.0, 1000.0),
    0.5,                             // bias_weight
    Target::Concentration,
)?;

Implementations§

Source§

impl BestDosePosterior

Source

pub fn theta(&self) -> &Theta

Get the refined posterior support points (Θ)

Source

pub fn posterior_weights(&self) -> &Weights

Get the posterior probability weights

Source

pub fn population_weights(&self) -> &Weights

Get the filtered population weights used for the bias term

Source

pub fn n_support_points(&self) -> usize

Get the number of support points in the posterior

Source§

impl BestDosePosterior

Source

pub fn compute( population_theta: &Theta, population_weights: &Weights, past_data: Option<Subject>, eq: ODE, settings: Settings, ) -> Result<Self>

Stage 1: Compute the Bayesian posterior density from population prior and patient data

This performs the expensive posterior calculation (NPAGFULL11 filtering + NPAGFULL refinement) and returns a reusable BestDosePosterior that can be optimized multiple times.

§Algorithm
Prior (N support points)
    ↓
NPAGFULL11: Bayesian filtering
    P(θᵢ|data) ∝ P(data|θᵢ) × P(θᵢ)
    ↓
Filtered posterior (M points)
    ↓
NPAGFULL: Local refinement (max_cycles iterations)
    ↓
Refined posterior (M points with updated weights)
§Arguments
  • population_theta - Population support points from NPAG
  • population_weights - Population probabilities
  • past_data - Patient history (None = use prior directly)
  • eq - Pharmacokinetic/pharmacodynamic model
  • settings - NPAG settings (includes error models and posterior refinement config)
§Example
let posterior = BestDosePosterior::compute(
    &theta, &weights,
    Some(past_subject),
    eq, settings,
)?;
println!("Posterior has {} support points", posterior.n_support_points());
Source

pub fn optimize( &self, target: Subject, time_offset: Option<f64>, dose_range: DoseRange, bias_weight: f64, target_type: Target, ) -> Result<BestDoseResult>

Stage 2: Optimize doses for target outcomes using the computed posterior

This runs the dual optimization (posterior weights vs uniform weights) and returns the best dosing regimen. Can be called multiple times on the same posterior with different parameters.

§Arguments
  • target - Future dosing template with target observations
  • time_offset - Optional gap (in hours) between the last past event and the start of the future target. 0 means the future starts immediately after the last past event. The effective absolute offset is max_past_time + time_offset.
  • dose_range - Allowable dose constraints
  • bias_weight - λ in [0,1]: 0=personalized, 1=population
  • target_type - Concentration or AUC targets
§Example
// Try different bias weights
for &bw in &[0.0, 0.25, 0.5, 0.75, 1.0] {
    let result = posterior.optimize(
        target.clone(),
        None,
        DoseRange::new(0.0, 300.0),
        bw,
        Target::Concentration,
    )?;
    println!("λ={}: dose={:.1}", bw, result.doses()[0]);
}

Trait Implementations§

Source§

impl Clone for BestDosePosterior

Source§

fn clone(&self) -> BestDosePosterior

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for BestDosePosterior

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> DistributionExt for T
where T: ?Sized,

§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

§

impl<T> SendAlias for T

§

impl<T> SyncAlias for T