t_succotash_unif_fixed: A fixed point iteration in the mixture of uniforms EM and a...

Description Usage Arguments Value See Also

Description

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.

Usage

1
2
t_succotash_unif_fixed(pi_Z, lambda, alpha, Y, nu, a_seq, b_seq, sig_diag,
  print_ziter = TRUE, newt_itermax = 10, tol = 10^-4)

Arguments

pi_Z

A vector. The first M values are the current values of π. The last k values are the current values of Z.

lambda

A vector. This is a length M vector with the regularization parameters for the mixing proportions.

alpha

A matrix. This is of dimension p by k and are the coefficients to the confounding variables.

Y

A matrix of dimension p by 1. These are the observed regression coefficients of the observed variables.

nu

A positive numeric. The degrees of freedom of the t-distribution.

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 p containing the variances of the observations.

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.

Value

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.

See Also

t_uniform_succ_given_alpha t_succotash_llike_unif


dcgerard/succotashr documentation built on May 15, 2019, 1:25 a.m.