Description Usage Arguments Value See Also
This is a fixed-point iteration for the SUCCOTASH EM algorithm. This updates the estimate of the prior and the estimate of the hidden covariates.
1 2  | succotash_unif_fixed(pi_Z, lambda, alpha, Y, a_seq, b_seq, sig_diag,
  print_ziter = FALSE, newt_itermax = 4, tol = 10^-4, var_scale = TRUE)
 | 
pi_Z | 
 A vector. The first   | 
lambda | 
 A vector. This is a length   | 
alpha | 
 A matrix. This is of dimension   | 
Y | 
 A matrix of dimension   | 
a_seq | 
 A vector of negative numerics containing the left endpoints of the mixing uniforms.  | 
b_seq | 
 A vector of positiv numerics containing the right endpoints of the mixing uniforms.  | 
sig_diag | 
 A vector of length   | 
print_ziter | 
 A logical. Should we we print each iteration of the Z optimization?  | 
newt_itermax | 
 A positive integer. The maximum number of Newton steps to perform in updating Z.  | 
tol | 
 A positive numeric. The stopping criterion for Newton's method in updating Z.  | 
var_scale | 
 A logical. Should we update the scaling on the
variances (  | 
pi_new A vector of length M. The update for
the mixing components.
Z_new A vector of length k. The update for the
confounder covariates.
uniform_succ_given_alpha
succotash_llike_unif
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.