Optimize / importance sample a stan or ctStan model.
stanoptimis(
standata,
sm,
init = "random",
initsd = 0.01,
sampleinit = NA,
deoptim = FALSE,
estonly = FALSE,
tol = 1e-12,
decontrol = list(),
stochastic = TRUE,
nopriors = FALSE,
carefulfit = TRUE,
subsamplesize = 0.5,
finitediff = FALSE,
parsteps = c(),
plot = FALSE,
is = FALSE,
isloopsize = 1000,
finishsamples = 1000,
tdf = 10,
chancethreshold = 100,
finishmultiply = 5,
verbose = 0,
cores = 2
)list object conforming to rstan data standards.
compiled stan model object.
vector of unconstrained parameter values, or character string 'random' to initialise with random values very close to zero.
positive numeric specifying sd of normal distribution governing random sample of init parameters, if init='random' .
either NA, or an niterations * nparams matrix of samples to initialise importance sampling.
Do first pass optimization using differential evolution? Slower, but better for cases with multiple minima / difficult optimization.
if TRUE,just return point estimates under $rawest subobject.
objective tolerance.
List of control parameters for differential evolution step, to pass to DEoptim.control.
Logical. Use stochastic gradient descent instead of mize (bfgs) optimizer. Still experimental, worth trying for either robustness checks or problematic, high dimensional, nonlinear, problems.
logical. If TRUE, a nopriors integer is set to 1 (TRUE) in the standata object -- only has an effect if the stan model uses this value.
Logical. If TRUE, priors are always used for a rough first pass to obtain starting values when nopriors=TRUE.
value between 0 and 1 representing proportion of subjects to include in first pass fit.
Either 'ask', TRUE, or FALSE. Whether to use the slow finite difference calculations for the Hessian (used for confidence intervals) if other approaches do not give a positive definite result.
ordered list of vectors of integers denoting which parameters should begin fixed at zero, and freed sequentially (by list order). Useful for complex models, e.g. keep all cross couplings fixed to zero as a first step, free them in second step.
Logical. If TRUE, plot iteration details. Probably slower.
Logical. Use importance sampling, or just return map estimates?
Number of samples of approximating distribution per iteration of importance sampling.
Number of samples to draw (either from hessian based covariance or posterior distribution) for final results computation.
degrees of freedom of multivariate t distribution. Higher (more normal) generally gives more efficent importance sampling, at risk of truncating tails.
drop iterations of importance sampling where any samples are chancethreshold times more likely to be drawn than expected.
Importance sampling stops once available samples reach finishsamples * finishmultiply , then the final samples are drawn
without replacement from this set.
Integer from 0 to 2. Higher values print more information during model fit -- for debugging.
Number of cpu cores to use, should be at least 2.
list containing fit elementsF