Struct Irm 

pub struct Irm { /* private fields */ }

IRM estimator: ml_g learns E[Y | D = d, X] (fitted separately on the treated and control rows of each training fold), ml_m learns the propensity score P(D = 1 | X).

Implementations

impl Irm

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

pub fn from_boxed(ml_g: Box<dyn Regressor>, ml_m: Box<dyn Classifier>) -> Self

pub fn score(self, score: IrmScore) -> Self

pub fn clipping_threshold(self, t: f64) -> Self

Propensity scores are clipped to [t, 1 − t] (default t = 0.01).

pub fn normalize_ipw(self, normalize: bool) -> Self

Normalise the inverse-probability weights to mean one within each treatment arm (Hájek-style), as DoubleML’s normalize_ipw=True.

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 Irm

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.