-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsSampler.R
More file actions
138 lines (138 loc) · 6.32 KB
/
sSampler.R
File metadata and controls
138 lines (138 loc) · 6.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
sSampler <- nimbleFunction(
# name = 'sampler_RW',
contains = sampler_BASE,
setup = function(model, mvSaved, target, control) {
i <- control$i
xlim <- control$xlim
ylim <- control$ylim
## control list extraction
# logScale <- extractControlElement(control, 'log', FALSE)
# reflective <- extractControlElement(control, 'reflective', FALSE)
adaptive <- extractControlElement(control, 'adaptive', TRUE)
adaptInterval <- extractControlElement(control, 'adaptInterval', 200)
adaptFactorExponent <- extractControlElement(control, 'adaptFactorExponent', 0.8)
scale <- extractControlElement(control, 'scale', 1)
## node list generation
# targetAsScalar <- model$expandNodeNames(target, returnScalarComponents = TRUE)
calcNodes <- model$getDependencies(target)
s.nodes <- model$expandNodeNames(paste("s[",i,",1:2]"))
# calcNodesNoSelf <- model$getDependencies(target, self = FALSE)
# isStochCalcNodesNoSelf <- model$isStoch(calcNodesNoSelf) ## should be made faster
# calcNodesNoSelfDeterm <- calcNodesNoSelf[!isStochCalcNodesNoSelf]
# calcNodesNoSelfStoch <- calcNodesNoSelf[isStochCalcNodesNoSelf]
## numeric value generation
scaleOriginal <- scale
timesRan <- 0
timesAccepted <- 0
timesAdapted <- 0
scaleHistory <- c(0, 0) ## scaleHistory
acceptanceHistory <- c(0, 0) ## scaleHistory
if(nimbleOptions('MCMCsaveHistory')) {
saveMCMChistory <- TRUE
} else saveMCMChistory <- FALSE
optimalAR <- 0.44
gamma1 <- 0
## checks
# if(length(targetAsScalar) > 1) stop('cannot use RW sampler on more than one target; try RW_block sampler')
# if(model$isDiscrete(target)) stop('cannot use RW sampler on discrete-valued target; try slice sampler')
# if(logScale & reflective) stop('cannot use reflective RW sampler on a log scale (i.e. with options log=TRUE and reflective=TRUE')
if(adaptFactorExponent < 0) stop('cannot use RW sampler with adaptFactorExponent control parameter less than 0')
if(scale < 0) stop('cannot use RW sampler with scale control parameter less than 0')
},
run = function() {
z <- model$z[i]
if(z==0){#propose from prior. much faster to only compute s.nodes. no other nodes required when z=0
model$s[i, 1:2] <<- c(runif(1, xlim[1], xlim[2]), runif(1, ylim[1], ylim[2]))
model$calculate(s.nodes)
copy(from = model, to = mvSaved, row = 1, nodes = s.nodes, logProb = TRUE)
}else{#MH
s.cand=c(rnorm(1,model$s[i,1],scale), rnorm(1,model$s[i,2],scale))
inbox= s.cand[1]< xlim[2] & s.cand[1]> xlim[1] & s.cand[2] < ylim[2] & s.cand[2] > ylim[1]
if(inbox){
model_lp_initial <- model$getLogProb(calcNodes)
model$s[i, 1:2] <<- s.cand
model_lp_proposed <- model$calculate(calcNodes)
log_MH_ratio <- model_lp_proposed - model_lp_initial
accept <- decide(log_MH_ratio)
if(accept) {
copy(from = model, to = mvSaved, row = 1, nodes = calcNodes, logProb = TRUE)
} else {
copy(from = mvSaved, to = model, row = 1, nodes = calcNodes, logProb = TRUE)
}
if(adaptive){ #we only tune for z=0 proposals
adaptiveProcedure(accept)
}
}
}
},
methods = list(
adaptiveProcedure = function(jump = logical()) {
timesRan <<- timesRan + 1
if(jump) timesAccepted <<- timesAccepted + 1
if(timesRan %% adaptInterval == 0) {
acceptanceRate <- timesAccepted / timesRan
timesAdapted <<- timesAdapted + 1
if(saveMCMChistory) {
setSize(scaleHistory, timesAdapted) ## scaleHistory
scaleHistory[timesAdapted] <<- scale ## scaleHistory
setSize(acceptanceHistory, timesAdapted) ## scaleHistory
acceptanceHistory[timesAdapted] <<- acceptanceRate ## scaleHistory
}
gamma1 <<- 1/((timesAdapted + 3)^adaptFactorExponent)
gamma2 <- 10 * gamma1
adaptFactor <- exp(gamma2 * (acceptanceRate - optimalAR))
scale <<- scale * adaptFactor
## If there are upper and lower bounds, enforce a maximum scale of
## 0.5 * (upper-lower). This is arbitrary but reasonable.
## Otherwise, for a poorly-informed posterior,
## the scale could grow without bound to try to reduce
## acceptance probability. This creates enormous cost of
## reflections.
# if(reflective) {
# lower <- model$getBound(target, 'lower')
# upper <- model$getBound(target, 'upper')
# if(scale >= 0.5*(upper-lower)) {
# scale <<- 0.5*(upper-lower)
# }
# }
timesRan <<- 0
timesAccepted <<- 0
}
},
getScaleHistory = function() { ## scaleHistory
returnType(double(1))
if(saveMCMChistory) {
return(scaleHistory)
} else {
print("Please set 'nimbleOptions(MCMCsaveHistory = TRUE)' before building the MCMC")
return(numeric(1, 0))
}
},
getAcceptanceHistory = function() { ## scaleHistory
returnType(double(1))
if(saveMCMChistory) {
return(acceptanceHistory)
} else {
print("Please set 'nimbleOptions(MCMCsaveHistory = TRUE)' before building the MCMC")
return(numeric(1, 0))
}
},
##getScaleHistoryExpanded = function() { ## scaleHistory
## scaleHistoryExpanded <- numeric(timesAdapted*adaptInterval, init=FALSE) ## scaleHistory
## for(iTA in 1:timesAdapted) ## scaleHistory
## for(j in 1:adaptInterval) ## scaleHistory
## scaleHistoryExpanded[(iTA-1)*adaptInterval+j] <- scaleHistory[iTA] ## scaleHistory
## returnType(double(1)); return(scaleHistoryExpanded) }, ## scaleHistory
reset = function() {
scale <<- scaleOriginal
timesRan <<- 0
timesAccepted <<- 0
timesAdapted <<- 0
if(saveMCMChistory) {
scaleHistory <<- c(0, 0) ## scaleHistory
acceptanceHistory <<- c(0, 0)
}
gamma1 <<- 0
}
)
)