pub struct SyntheticControl {
pub max_iter: usize,
pub tol: f64,
}Expand description
Synthetic Control Method (Abadie-Diamond-Hainmueller, 2010).
Finds a weighted combination of donor units that best matches the treated unit’s pre-treatment trajectory. The weights are constrained to be non-negative and sum to one; they are found by projected-gradient descent.
Fields§
§max_iter: usizeMaximum number of optimization iterations
tol: f64Convergence tolerance
Implementations§
Source§impl SyntheticControl
impl SyntheticControl
Sourcepub fn fit_weights(
&self,
y_treated: &ArrayView1<'_, f64>,
y_donors: &ArrayView2<'_, f64>,
) -> StatsResult<Array1<f64>>
pub fn fit_weights( &self, y_treated: &ArrayView1<'_, f64>, y_donors: &ArrayView2<'_, f64>, ) -> StatsResult<Array1<f64>>
Sourcepub fn treatment_effects(
&self,
y_treated_post: &ArrayView1<'_, f64>,
y_donors_post: &ArrayView2<'_, f64>,
weights: &ArrayView1<'_, f64>,
) -> StatsResult<Array1<f64>>
pub fn treatment_effects( &self, y_treated_post: &ArrayView1<'_, f64>, y_donors_post: &ArrayView2<'_, f64>, weights: &ArrayView1<'_, f64>, ) -> StatsResult<Array1<f64>>
Estimate treatment effect for each post-treatment period.
§Arguments
y_treated_post– post outcomes for treated unit (T_post,)y_donors_post– post outcomes for donor units (T_post × n_donors)weights– fitted weights fromfit_weights
Trait Implementations§
Auto Trait Implementations§
impl Freeze for SyntheticControl
impl RefUnwindSafe for SyntheticControl
impl Send for SyntheticControl
impl Sync for SyntheticControl
impl Unpin for SyntheticControl
impl UnsafeUnpin for SyntheticControl
impl UnwindSafe for SyntheticControl
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.