Struct Pliv 

pub struct Pliv { /* private fields */ }

PLIV estimator with the partialling-out score ψ = (Y − ℓ(X) − θ(D − r(X)))·(Z − m(X)).

ml_l learns E[Y | X], ml_m learns E[Z | X], ml_r learns E[D | X].

Implementations

impl Pliv

pub fn new( ml_l: impl Regressor + 'static, ml_m: impl Regressor + 'static, ml_r: impl Regressor + 'static, ) -> Self

pub fn from_boxed( ml_l: Box<dyn Regressor>, ml_m: Box<dyn Regressor>, ml_r: Box<dyn Regressor>, ) -> Self

pub fn n_folds(self, n_folds: usize) -> Self

Number of cross-fitting folds (default 5).

pub fn n_rep(self, n_rep: usize) -> Self

Number of independent sample splits (default 1). Estimates are aggregated across repetitions by the median, as in DoubleML.

pub fn seed(self, seed: u64) -> Self

Seed for the sample splits (default 0).

pub fn fit(&self, data: &DmlData) -> Result<DmlFit>

Draw seeded sample splits and fit.

pub fn fit_with_folds( &self, data: &DmlData, splits: &[Vec<Fold>], ) -> Result<DmlFit>

Fit with caller-supplied splits, one Vec<Fold> per repetition (e.g. to reproduce another implementation exactly).

Trait Implementations

impl LinearScoreModel for Pliv

fn name(&self) -> String

Label for summaries, e.g. "PLR (partialling out)".

fn validate(&self, data: &DmlData) -> Result<()>

Reject data the model cannot handle (called once before fitting).

fn estimate_score( &self, input: &ScoreInput<'_>, folds: &[Fold], ) -> Result<ScoreEstimate>

Cross-fit the nuisances on folds and return the score elements.