Split.X.lh: Search for best split by lookahead Compare single best split...
In Team-Wang-Lab/T-RL: Tree-based Reinforcement Learning for estimating optimal DTR.
Description
Search for best split by lookahead
Compare single best split with further split to calculate the final cutoff.
Usage
1
Split.X.lh(X, A, H, mus.hat, minsplit = 20)
Arguments
X
Covariate matrix.
A
A vector of observed treatment options.
H
A matrix of covariates before assigning final treatment, excluding previous treatment variables.
mus.hat
Estimated conditional mean outcome.
minsplit
Minimal node size.
Team-Wang-Lab/T-RL documentation built on Jan. 3, 2020, 12:11 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
Search for best split by lookahead Compare single best split with further split to calculate the final cutoff.
Usage
1 | Split.X.lh(X, A, H, mus.hat, minsplit = 20)
|
Arguments
X |
Covariate matrix. |
A |
A vector of observed treatment options. |
H |
A matrix of covariates before assigning final treatment, excluding previous treatment variables. |
mus.hat |
Estimated conditional mean outcome. |
minsplit |
Minimal node size. |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.