-
Notifications
You must be signed in to change notification settings - Fork 0
/
KLfunctions.jl
195 lines (165 loc) · 2.74 KB
/
KLfunctions.jl
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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
# KL divergence in exponential families
# compatible with version 0.7
# Bernoulli distributions
function dBernoulli(p,q)
res=0
if (p!=q)
if (p<=0) p = eps() end
if (p>=1) p = 1-eps() end
res=(p*log(p/q) + (1-p)*log((1-p)/(1-q)))
end
return(res)
end
function dupBernoulli(p,level)
# KL upper confidence bound:
# return qM>p such that d(p,qM)=level
lM = p
uM = min(min(1,p+sqrt(level/2)),1)
for j = 1:16
qM = (uM+lM)/2
if dBernoulli(p,qM) > level
uM= qM
else
lM=qM
end
end
return(uM)
end
function dlowBernoulli(p,level)
# KL lower confidence bound:
# return lM<p such that d(p,lM)=level
lM = max(min(1,p-sqrt(level/2)),0)
uM = p
for j = 1:16
qM = (uM+lM)/2;
if dBernoulli(p,qM) > level
lM= qM;
else
uM=qM;
end
end
return(lM)
end
function VBernoulli(mu)
return mu*(1-mu)
end
# Poisson distributions
function dPoisson(p,q)
if (p==0)
res=q
else
res=q-p + p*log(p/q)
end
return(res)
end
function dupPoisson(p,level)
# KL upper confidence bound: generic way
# return qM>p such that d(p,qM)=level
lM = p
# finding an upper bound
uM = max(2*p,1)
while (dPoisson(p,uM)<level)
uM=2*uM
end
for j = 1:16
qM = (uM+lM)/2
if dPoisson(p,qM) > level
uM= qM
else
lM=qM
end
end
return(uM)
end
function dlowPoisson(p,level)
# KL lower confidence bound: generic way
# return lM<p such that d(p,lM)=level
# finding a lower bound
lM=p/2
if p!=0
while (dPoisson(p,lM)<level)
lM=lM/2
end
end
uM = p
for j = 1:16
qM = (uM+lM)/2;
if dPoisson(p,qM) > level
lM= qM;
else
uM=qM;
end
end
return(lM)
end
function VPoisson(mu)
return mu
end
# Exponential distribution
function dExpo(p,q)
res=0
if (p!=q)
if (p<=0)|(q<=0)
res=Inf
else
res=p/q - 1 - log(p/q)
end
end
return(res)
end
function dupExpo(p,level)
# KL upper confidence bound: generic way
# return qM>p such that d(p,qM)=level
lM = p
# finding an upper bound
uM = max(2*p,1)
while (dExpo(p,uM)<level)
uM=2*uM
end
for j = 1:16
qM = (uM+lM)/2
if dExpo(p,qM) > level
uM= qM
else
lM=qM
end
end
return(uM)
end
function dlowExpo(p,level)
# KL lower confidence bound: generic way
# return lM<p such that d(p,lM)=level
# finding a lower bound
lM=p/2
if p!=0
while (dExpo(p,lM)<level)
lM=lM/2
end
end
uM = p
for j = 1:16
qM = (uM+lM)/2;
if dExpo(p,qM) > level
lM= qM;
else
uM=qM;
end
end
return(lM)
end
function VExpo(mu)
return mu*mu
end
# Gaussian distribution
function dGaussian(p,q)
(p-q)^2/(2*sigma^2)
end
function dupGaussian(p,level)
p+sigma*sqrt(2*level)
end
function dlowGaussian(p,level)
p-sigma*sqrt(2*level)
end
function VGaussian(mu)
return sigma^2
end