/
core.py
895 lines (695 loc) · 35.7 KB
/
core.py
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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
# Copyright(c) 2016-2017, The slalom developers (Florian Buettner, Oliver Stegle)
#
#Licensed under the Apache License, Version 2.0 (the "License");
#you may not use this file except in compliance with the License.
#You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
#Unless required by applicable law or agreed to in writing, software
#distributed under the License is distributed on an "AS IS" BASIS,
#WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#See the License for the specific language governing permissions and
#limitations under the License.
# slalom
# factorial single cell latent variable model
# this class implements a variational inference procedure for a sparse model with different observation noise models.
from .bayesnet.vbfa import *
import scipy as SP
from sklearn import metrics
from sklearn.linear_model import LinearRegression
import re
from sklearn.decomposition import PCA
import scipy.special as special
class CNodeAlphasparse(AGammaNode):
def __init__(self,net,prior=[1E-3,1E-3]):
AGammaNode.__init__(self,dim=[net.components],prior=prior)
def update(self,net):
pass
class CNodeEpsSparse(CNodeEps):
"""Extensions of CNodeEps that can handle fixed prior expectaitons"""
def __init__(self,net,prior=S.array([100,1])):
CNodeEps.__init__(self,net,prior)
def update(self,net):
pass
class CNodeSsparse(AVGaussNode):
def __init__(self,net,prec=1):
# CNodeS.__init__(self,net,prec=1)
AVGaussNode.__init__(self,dim=[net._N,net.components],cdim=1)
self.diagSigmaS = SP.ones((net._N,net.components))
def update(self,net=None):
pass
class CNodeWsparse(CNodeW):
"""Abstract CnodeWsparse basclass"""
def __init__(self,net,**kwargin):
#call base class initialisation
#CNodeW.__init__(self,net,**kwargin)
self.C = zeros([net.Pi.E1.shape[0],net.Pi.E1.shape[1],2])
self.C[:,:,0] =net.Pi.E1.copy()
self.C[:,:,1] = 1.-net.Pi.E1
self.Ilabel = SP.arange(net.components)
def update(self,net=None):
pass
class CNodePi(ABetaNode):
"""Abstract CnodePi basclass"""
def __init__(self,net,prior=[[1,1],[40,2],[2,40],[1,1]], E1=None):
ABetaNode.__init__(self,dim=[net.nKnown,net.nLatent,net.nLatentSparse,net.nAnno],
K=net._D,prior=prior, E1=E1)
def update(self,net):
pass
class CNodeWsparseVEM(CNodeWsparse):
def __init__(self,net,prec=1.):
CNodeWsparse.__init__(self,net,prec=prec)
#variable initialisation in CNodeWsparse
self.sigma2 = (1.0/prec)*SP.ones((net._D, net.components))
self.E1 = SP.randn(net._D, net.components)
self.E2diag = SP.zeros((net._D, net.components))
# for d in range(net._D):
# self.E2diag[d,:] = SP.diag(self.E2[d,:,:])
def update(self,net=None):
pass
class CSparseFA(AExpressionModule):
'''Variational Bayesian Factor analysis module. `AExpressionModule` is definded in bayesnet.expressionnet'''
def getDefaultParameters(self):
"""return a hash with default parameter value for this model"""
dp = AExpressionModule.getDefaultParameters(self)
return dp
def getName(self,base_name='slalom'):
"""return a name summarising the main parameters"""
name = "%s_unannotated_%s_unannotated-sparse_%s_it_%s" % (base_name,self.nLatent,self.nLatentSparse, self.iterationCount)
return name
def getF(self):
"""Get imputed expression values
"""
if self.noise=='gauss':
print("Returning reconstructed gene expression Y = Q(X)*Q(W)^TQ(Z)^T")
F = SP.dot(self.S.E1,(self.W.E1*self.W.C[:,:,0]).T)
else:
print("Returning imputed expression values")
isExpressed = (self.Z.E1>0)*1.
F = self.Z.E1.copy()
epsK = self.Eps.E1.copy()
epsK[self.Eps>1/4.]=1/4.
Xi = SP.dot(self.S.E1,(self.W.C[:,:,0]*self.W.E1).transpose())
F[isExpressed==0] = (Xi - (1./(1.+SP.exp(-Xi)))/epsK)[isExpressed==0]
return F
def getRelevance(self):
"""Get posterior relevance (inverse of ARD score) :math:`1/Q(\textbf{\alpha)}`
"""
return 1./self.Alpha.E1
def getTerms(self,annotated=True,unannotated=True,unannotated_sparse=True):
"""Get terms
"""
terms = list()
if unannotated_sparse==True:
terms.extend(self.terms[self.iLatentSparse])
if unannotated==True:
terms.extend(self.terms[self.iLatent])
if annotated==True:
terms.extend(self.terms[SP.setxor1d(SP.hstack([SP.where(self.terms=='bias')[0],self.iLatentSparse, self.iLatent]), SP.arange(len(self.terms)))])
return terms
def getTermIndex(self,terms):
"""get term index. Creates an index list based on a list of named terms
Args:
terms (list): list with terms
"""
index=SP.array([list(self.terms).index(id_i) for id_i in terms])
return index
def getAnnotations(self, terms=None):
"""Get annotations.
Args:
term (str): optional list of terms for which annotations are returned. Default None=all terms.
"""
if terms is None:
return (self.Pi.E1>.5)
else:
#subset terms
term_index = self.getTermIndex(terms)
return (self.Pi.E1[:,term_index]>.5)
def getW(self,terms=None):
"""Get weights (continous part of spike-and-slab prior) :math:`Q(\widetilde{W})`
Args:
term (str): optional list of terms for which weights are returned. Default None=all terms.
"""
if terms is None:
return self.W.E1
else:
#subset terms
term_index = self.getTermIndex(terms)
return self.W.E1[:,term_index]
def getZ(self,terms=None):
"""Get posterior of Z (Bernourlli part part of spike-and-slab prior) :math:`Q(Z)`
Args:
term (str): optional list of terms for which weights are returned. Default None=all terms.
"""
if terms is None:
return self.W.C[:,:,0]
else:
term_index = self.getTermIndex(terms)
return self.W.C[:,term_index,0]
def getPi(self,terms=None):
"""Get prior on Z (Bernourlli part part of spike-and-slab prior)
Args:
term (str): optional list of terms for which weights are returned. Default None=all terms.
"""
if terms is None:
return self.Pi.E1
else:
term_index = self.getTermIndex(terms)
return self.Pi.E1[:,term_index]
def getZchanged(self,terms=None, threshold=0.5):
"""get matrix indicating whether the posterior distribution has changed for individual terms/genes
Args:
terms (str): optional list of terms for which weights are returned. Default None=all terms.
Rv:
matrix [0,-1,1]: 0: no change, -1: loss, +1: gain
"""
Z = self.getZ(terms)
Pi = self.getPi(terms)
I = SP.zeros([Z.shape[0],Z.shape[1]],dtype='int8')
Igain = (Z>threshold) & (Pi<threshold)
Iloss = (Z<threshold) & (Pi>threshold)
I[Igain] = 1
I[Iloss] = -1
return I
def getX(self, terms=None):
"""Get factors
Args:
terms (str): optional list of terms for which weights are returned. Default None=all terms.
"""
if terms==None or terms=='all':
#idxAnno = SP.setxor1d(SP.arange(len(self.terms)), SP.hstack([self.iLatent, self.iLatentSparse]))
return self.S.E1#[:,idxAnno]
else:
idx=self.getTermIndex(terms)
return self.S.E1[:,idx]
def regressOut(self,idx=None, terms=None,use_latent=False, use_lm = False, Yraw = None):
"""Regress out unwanted variation
Args:
idx (vector_like): Indices of factors to be regressed out
use_latent (bool): Boolean varoable indicating whether to regress out
the unwanted variation on the low-dimensional latent
space or the high-dimensional gene expression space.
use_lm (bool): Regress out the factors by fitting a linear model for each gene
Yraw (array_like): Optionally a gene expression array can be passed from which the facotrs are regressed out
Returns:
A matrix containing the corrected expression values.
"""
#if (idx is None) and (terms is None):
# raise Exception('Provide either indices or terms to regress out')
if terms is None:
idx = SP.array(idx)
else:
idx = self.getTermIndex(terms)
if use_lm==False and (Yraw is None):
isOn = (self.W.C[:,:,0]>.5)*1.0
if use_latent==False:
Ycorr = self.Z.E1-SP.dot(self.S.E1[:,idx], (isOn[:,idx]*self.W.E1[:,idx]).T)
else:
idx_use = SP.setxor1d(SP.arange(self.S.E1.shape[1]),idx)
Ycorr = SP.dot(self.S.E1[:,idx_use], (isOn[:,idx_use]*self.W.E1[:,idx_use]).T)
else:
if Yraw is None:
Y = self.Z.E1.shape
else:
Y = Yraw.copy()
Ycorr = SP.zeros(Y.shape)
if terms is None:
X = self.S.E1[:,idx]
else:
X = self.getX(terms=terms)
for ig in SP.arange(Y.shape[1]):
lm = LinearRegression()
lm.fit(X, Y[:,ig])
Ycorr[:,ig] = Y[:,ig]-lm.predict(X)
return Ycorr
def train(self, nIterations=None, forceIterations=False, tolerance=1e-8, minIterations=700):
"""Iterate updates of weights (with spike-and-slab prior), ARD parameters, factors, annd noise parameters.
Args:
nIternation (int): Number of iterations.
forceIterations (bool): Force the model to update `nIteration` times.
tolerance (float): Tolerance to monitor convergence of reconstruction error
minIterations (int): Minimum number of iterations the model should perform.
"""
if tolerance is None: tolerance = self.tolerance
if nIterations is None: nIterations = self.nIterations
if forceIterations is None: forceIterations = self.forceIterations
Ion = (self.W.C[:,:,0]>.5)*1.
Zr = S.dot(self.S.E1,(self.W.E1.T*Ion.T))
Zd = self.Z.E1-Zr
error = (abs(Zd)).mean()
#Fold = self.calcBound()
for iter in range(nIterations):
#t = time.time();
self.update()
self.iterationCount+=1
#Fnew = self.calcBound()
#print(Fnew-Fold)
#Fold = Fnew
if SP.mod(iter,100)==0:
error_old = error.copy()
Zr = S.dot(self.S.E1,self.W.E1.T*self.W.C[:, :,0].T)
Zd = self.Z.E1-Zr
error = (abs(Zd)).mean()
print("iteration %i" % iter)
if (abs(error_old - error) < tolerance) and not forceIterations and iter>minIterations:
print('Converged after %i iterations' % (iter))
break
pass
def updateS(self,m):
M = self.components
if m>=self.nKnown:
if self.noise=='gauss':
YmeanX = self.Z.E1
elif self.noise=='hurdle' or self.noise=='poisson':
YmeanX = self.meanX
setMinus = SP.int_(SP.hstack([list(range(M))[0:m],list(range(M))[m+1::]]))
#only account for actors that haven't been switched off already
setMinus = setMinus[self.doUpdate[setMinus]==1]
#update S
SW_sigma = (self.W.C[:, m,0]*self.W.E1[:, m])*self.Eps.E1
SW2_sigma = (self.W.C[:, m,0]*(self.W.E2diag[:, m]))*self.Eps.E1
setMinus = SP.int_(SP.hstack([list(range(M))[0:m],list(range(M))[m+1::]]))
b0 = SP.dot(self.S.E1[:,setMinus],(self.W.C[:, setMinus,0]*self.W.E1[:, setMinus]).transpose())
b=SP.dot(b0,SW_sigma)
alphaSm = SP.sum(SW2_sigma, 0);
barmuS = SP.dot(YmeanX,SW_sigma) - b
self.S.diagSigmaS[:,m] = 1./(1 + alphaSm)
self.S.E1[:,m] = barmuS/(1. + alphaSm)
#keep diagSigmaS
self.Eps.diagSigmaS[m] = SP.sum(self.S.diagSigmaS[:,m])
else:
SW2_sigma = (self.W.C[:, m,0]*(self.W.E2diag[:, m]))*self.Eps.E1
alphaSm = SP.sum(SW2_sigma, 0)
self.S.diagSigmaS[:,m] = 1./(1 + alphaSm)
def updateW(self,m):
M = self.components
Muse = self.doUpdate.sum()
if self.noise=='gauss':
YmeanX = self.Z.E1
elif self.noise=='hurdle' or self.noise=='poisson':
YmeanX = self.meanX
if (m<self.nKnown) or (m in self.iLatentSparse) or (m in self.iLatent):
with SP.errstate(divide='ignore'):
logPi = SP.log(self.Pi.E1[:,m]/(1-self.Pi.E1[:,m]))
#logPi = (self.Pi.lnE1 - (special.digamma(self.Pi.b) - special.digamma(self.Pi.a+self.Pi.b)))[:,m]
elif self.nScale>0 and self.nScale<YmeanX.shape[0]:
with SP.errstate(divide='ignore'):
logPi = SP.log(self.Pi.E1[:,m]/(1-self.Pi.E1[:,m]))
#logPi = self.Pi.lnE1 - (special.digamma(self.Pi.b) - special.digamma(self.Pi.a+self.Pi.b))
isOFF_ = self.Pi.E1[:,m]<.5
logPi[isOFF_] = (YmeanX.shape[0]/self.nScale)*SP.log(self.Pi.E1[isOFF_,m]/(1-self.Pi.E1[isOFF_,m]))
isON_ = self.Pi.E1[:,m]>.5
if self.onF>1.:
logPi[isON_] = self.onF*SP.log(self.Pi.E1[isON_,m]/(1-self.Pi.E1[isON_,m]))
else:
onF = 1.
logPi = SP.log(self.Pi.E1[:,m]/(1-self.Pi.E1[:,m]))
sigma2Sigmaw = (1.0/self.Eps.E1)*self.Alpha.E1[m]
setMinus = SP.int_(SP.hstack([list(range(M))[0:m],list(range(M))[m+1::]]))
setMinus = setMinus[self.doUpdate[setMinus]==1]
SmTSk = SP.sum( SP.tile(self.S.E1[:,m:m+1],(1, Muse-1))*self.S.E1[:,setMinus], 0)
SmTSm = SP.dot(self.S.E1[:,m].transpose(),self.S.E1[:,m]) + self.S.diagSigmaS[:,m].sum()
b = SP.dot((self.W.C[:, setMinus,0]*self.W.E1[:, setMinus]),(SmTSk.transpose()))
diff = SP.dot(self.S.E1[:,m].transpose(),YmeanX) - b
SmTSmSig = SmTSm + sigma2Sigmaw
#update C and W
u_qm = logPi + 0.5*SP.log(sigma2Sigmaw) - 0.5*SP.log(SmTSmSig) + (0.5*self.Eps.E1)*((diff**2)/SmTSmSig)
with SP.errstate(over='ignore'):
self.W.C[:, m,0] = 1./(1+SP.exp(-u_qm))
self.W.C[:,m,1] = 1-self.W.C[:,m,0]
self.W.E1[:, m] = (diff/SmTSmSig) #q(w_qm | s_qm=1), q=1,...,Q
self.W.sigma2[:, m] = (1./self.Eps.E1)/SmTSmSig
self.W.E2diag[:,m] = self.W.E1[:,m]**2 + self.W.sigma2[:,m]
def updateAlpha(self,m):
#update Alpha
Ewdwd = SP.sum(self.W.C[:,m,0]*self.W.E2diag[:,m])
self.Alpha.a[m] = self.Alpha.pa + 0.5*Ewdwd
self.Alpha.b[m] = self.Alpha.pb + SP.sum(self.W.C[:,m,0])/2.0
self.Alpha.E1[m] = self.Alpha.b[m]/self.Alpha.a[m]
def updateAlphaW(self,m):
#update Alpha
Ewdwd = SP.sum(self.W.C[:,m,0]*self.W.E2diag[:,m])
self.Alpha.b[m] = self.Alpha.pb + 0.5*(Ewdwd+ SP.sum((1-self.W.C[:,m,0])*(1/self.Alpha.E1[m])))
self.Alpha.a[m] = self.Alpha.pa + self.W.E1.shape[0]/2.0
self.Alpha.E1[m] = self.Alpha.a[m]/self.Alpha.b[m]
def updateEps(self):
#update Eps (vertorised)
#SW_sigma = self.W.C[:,:,0]*self.W.E1
#SW2_sigma = self.W.C[:,:,0]*self.W.E2diag
SW_sigma = self.W.C[:,self.doUpdate==1,0]*self.W.E1[:,self.doUpdate==1]
SW2_sigma = self.W.C[:,self.doUpdate==1,0]*self.W.E2diag[:,self.doUpdate==1]
# muSTmuS = SP.dot(self.S.E1.transpose(),self.S.E1)
muSTmuS = SP.dot(self.S.E1[:,self.doUpdate==1].transpose(),self.S.E1[:,self.doUpdate==1])
muSTmuS0 = muSTmuS - SP.diag(SP.diag(muSTmuS))
t1 = SP.sum(SW_sigma*SP.dot(self.Z.E1.transpose(),self.S.E1[:,self.doUpdate==1]), 1)
t2 = SP.sum(SW2_sigma*SP.tile(SP.diag(muSTmuS).T + self.Eps.diagSigmaS[self.doUpdate==1],(self._D,1)), 1)
t3 = SP.sum( SP.dot(SW_sigma,muSTmuS0)*SW_sigma, 1)
#self.Eps.E1 = 1./((self.Eps.pb+0.5*(self.ZZ + (-2*t1 + t2 + t3)))/(0.5*self._N+self.Eps.pa))
self.Eps.E1 = 1./((0.5*(self.ZZ + (-2*t1 + t2 + t3)))/(0.5*self._N))
#pdb.set_trace()
self.Eps.a = SP.repeat(0.5*self._N+self.Eps.pa,self._D)
self.Eps.b = self.Eps.pb+0.5*(self.ZZ + (-2*t1 + t2 + t3))
self.Eps.E1[self.Eps.E1>1E6]=1E6
def updateEpsDrop(self):
#only consider expressed genes
#SW_sigma = self.W.C[:,:,0]*self.W.E1
#SW2_sigma = self.W.C[:,:,0]*self.W.E2diag
#muSTmuS = self.S.E1*self.S.E1 + self.S.diagSigmaS
SW_sigma = self.W.C[:,self.doUpdate==1,0]*self.W.E1[:,self.doUpdate==1]
SW2_sigma = self.W.C[:,self.doUpdate==1,0]*self.W.E2diag[:,self.doUpdate==1]
muSTmuS = SP.dot(self.S.E1[:,self.doUpdate==1].transpose(),self.S.E1[:,self.doUpdate==1])
muSTmuS = SP.dot(muSTmuS.transpose(),self.isExpressed)
t1 = SP.sum(SW_sigma*SP.dot(self.Z.E1.transpose(),self.S.E1), 1)
t2 = SP.sum(SW2_sigma.transpose()* muSTmuS,0)
t3 = SP.zeros((self._D,))
mRangeUse = SP.where(self.doUpdate>=0)[0] # list(range(SW_sigma.shape[1]))
for m in range(len(mRangeUse)):
for m1 in mRangeUse[m+1:]:
tt = ( (self.W.C[:, m1,0]*self.W.E1[:, m1])*SW_sigma[:, m])
t3 = t3 + tt*SP.dot((self.S.E1[:,m1]*self.S.E1[:,mRangeUse[m]]).transpose(),self.isExpressed)
self.Eps.E1 = 1./((self.ZZ + (-2*t1 + t2 + 2*t3))/self.numExpressed)
self.Eps.E1[self.Eps.E1>1/4.]=1/4.#Bernoulli limit
self.Eps.E1[self.Eps.E1>1e5]=1e5
def updatePi(self,m):
self.Pi.a[:,m] = self.Pi.pa[:,m] + SP.sum(self.W.C[:,m,0])
self.Pi.b[:,m] = self.Pi.pa[:,m] + self._D - SP.sum(self.W.C[:,m,0])
self.Pi.E1[:,m] = self.Pi.a[:,m]/(self.Pi.a[:,m]+self.Pi.b[:,m])
# self.Pi.lnE1 = special.digamma(self.Pi.a) - special.digamma(self.Pi.a+self.Pi.b)
def update(self):
""" Perform update of weights (with spike-and-slab prior), ARD parameters, factors, annd noise parameters. Called by `iterate` method.
"""
M = self.components
self.Eps.diagSigmaS = SP.zeros((M,))
mRange = list(range(M))
if self.shuffle==True and self.iterationCount>0:
mRange[self.nKnown:] = SP.random.permutation(mRange[self.nKnown:])
mRange[self.nKnown:] = SP.random.permutation(mRange[self.nKnown:])
for m in mRange:
if self.doUpdate[m]==1:
if self.dropFactors==False or self.iterationCount <10 or (self.Alpha.E1[m]/self.S.E1[:,m].var())<1e10:
self.updateW(m)
if self.learnPi==True:
if m in self.iLatentSparse:#SP.hstack([self.iLatentSparse, self.iLatent]):
self.updatePi(m)
self.updateAlpha(m)
self.updateS(m)
else:
self.doUpdate[m]=0
print('Switched off factor', self.terms[m])
if self.noise=='gauss':
self.updateEps()
elif self.noise=='hurdle':
self.updateEpsDrop()
if self.noise=='hurdle' or self.noise=='poisson':
epsK = self.Eps.E1.copy()#[self.Eps.E1>1/4.]=1/4
epsK[self.Eps.E1>1/4.]=1/4.
Xi = SP.dot(self.S.E1,(self.W.C[:, :,0]*self.W.E1).transpose())
self.meanX[self.isExpressed==0] = (Xi - (1./(1.+SP.exp(-Xi)))/epsK)[self.isExpressed==0]
elif self.noise=='poisson':
Xi = SP.dot(self.S.E1,(self.W.C[:, :,0]*self.W.E1).transpose())
self.meanX = Xi - self.fprime(Xi, self.Z.E1)/SP.repeat(self.kappa[:,SP.newaxis],self._N,1).T
def getNchanged(self):
""" Return number of annotations changed by the model (sum of included and exluded genes )
"""
i_use = SP.setxor1d(SP.arange(self.Pi.E1.shape[1]), SP.hstack([self.iLatentSparse,
self.iLatent, SP.arange(self.nKnown)]))
nChanged = SP.sum((self.Pi.E1>.5)!=(self.W.C[:,:,0]>.5), 0)[i_use]*1.0
nChangedRel = nChanged/SP.sum((self.Pi.E1>.5), 0)[i_use]
return (nChanged, nChangedRel)
def printDiagnostics(self):
""" Print diagnostics of the model. If more than 100% of gene annotations are for at least one factor, the model should be re-fitted with sparse unannotated facotrs.
"""
(nChanged, nChangedRel) = self.getNchanged()
if nChangedRel.max()<1:
print('Maximally ', '%d%% Genes per factor changed.' % float(nChangedRel.max()*100.))
else:
print('Maximally ', '%d%% Genes per factor changed. Re-run with sparse annotated factors.' % float(nChangedRel.max()*100.))
def __init__(self,init_data=None,**parameters):
"""create the object"""
#handle setting of parameters via Bayesnet constructor
ABayesNet.__init__(self,parameters=parameters)
#priors for the various components:
if not hasattr(self, 'priors') or self.priors is None:
self.priors = {}
if('Alpha' not in self.priors): self.priors['Alpha']={'priors': [1E-3,1E-3]}
if('Eps' not in self.priors): self.priors['Eps']={'priors': [1E-3,1E-3]}
if('PiSparse' not in self.priors): self.priors['PiSparse']={'priors': [2,40]}
if('PiDense' not in self.priors): self.priors['PiDense']={'priors': [40,2]}
self.dataNode=None
if init_data is not None:
self.init(init_data)
def init(self,init_data,Pi=None,terms=None, noise='gauss', init_factors=None,
unannotated_id = "hidden", covariates=None, dropFactors=True):
#initialize the model instance"""
#AGAussNode is defined in ExpresisonNet
#expr Y ~ N(\mu= expr, \sigma = 0)
pattern_hidden = re.compile(unannotated_id+'\d')
pattern_hiddenSparse = re.compile(unannotated_id+"\D*parse"+"\d")
Ihidden = SP.array([pattern_hidden.match(term) is not None for term in terms])
IhiddenSparse = SP.array([pattern_hiddenSparse.match(term) is not None for term in terms])
self.terms=terms
if not isinstance(init_data,AGaussNode):
raise Exception("initialization is only possible from a GaussNode")
self.Z = CNodeZ(node=init_data)
#datanode hold the data
self.dataNode = self.Z
if self.noise=='poisson':
self.kappa = 1./4.0 + 0.17*self.Z.E1.max(0)
if self.noise=='hurdle':
self.meanX = self.Z.E1.copy()
self.isExpressed = (self.Z.E1>0)*1.
self.numExpressed = SP.sum(self.Z.E1>0,0)
self.doUpdate = SP.ones((Pi.shape[1],)).astype("int")
self.dropFactors = dropFactors
#known covariates
if init_factors!=None and 'Known' in init_factors:
self.nKnown = init_factors['Known'].shape[1]
self.Known = init_factors['Known']
assert self.Known.shape[0] == self.Z.E1.shape[0]
self.nHidden = self.components-self.nKnown
if 'Intr' in init_factors:
self.nKnown = init_factors['Known'].shape[1]
self.Known = init_factors['Known']
assert self.Known.shape[0] == self._N
self.nHidden = self.components-self.nKnown
elif not (covariates is None):
self.nKnown = covariates.shape[1]
#self.iKnown = SP.arange(covariates.shape[1])
self.Known = covariates
assert self.Known.shape[0] == self.Z.E1.shape[0]
self.nHidden = self.components-self.nKnown
#mean term/'bias'
if terms[0]=='bias':
self.Known = SP.hstack(SP.ones((self.Z.E1.shape[0],1), self.Known))
self.nKnown += 1
self.nHidden = self.nHidden-1
#mean term/'bias'
elif terms[0]=='bias':
self.Known =SP.ones((self.Z.E1.shape[0],1))#make sure this was correct?
self.nKnown = 1
self.nHidden = self.components-self.nKnown
else:
self.nHidden = self.components
self.nKnown = 0
#set some attributes that we need frequently for the updates, inculuding
#number and idx of hidden and sparse hidden terms
if init_factors is not None and 'iLatent' in init_factors:
self.iLatent = init_factors['iLatent']
self.nLatent = len(init_factors['iLatent'])
else:
self.iLatent = SP.where(Ihidden==True)[0]
self.nLatent = len(self.iLatent)
if init_factors is not None and 'iLatentSparse' in init_factors:
self.iLatentSparse = init_factors['iLatentSparse']
self.nLatentSparse= len(init_factors['iLatentSparse'])
else:
self.iLatentSparse = SP.where(IhiddenSparse==True)[0]
self.nLatentSparse = len(self.iLatentSparse)
if init_factors!=None and 'onF' in init_factors:
self.onF = init_factors['onF']
else:
self.onF = self.Z.E1.shape[0]/10000.#self.nScale
if init_factors!=None and 'initZ' in init_factors:
self.initZ = init_factors['initZ']
else:
self.initZ = Pi.copy()
self.initZ[self.initZ<.2] = 0.01
self.nAnno = self.nHidden-self.nLatentSparse-self.nLatent
#pdb.set_trace()
#Pi is likelihood of link for genes x factors
#self.Pi = Pi
# set dimensionality of the data
[self._N, self._D] = self.Z.E1.shape
self.ZZ = SP.zeros((self._D,))
for d in range(self._D):
self.ZZ[d] = SP.sum(self.Z.E1[:,d]*self.Z.E1[:,d], 0)
PiPriors= [[1.,1.],self.priors['PiDense']['priors'],self.priors['PiSparse']['priors'],[1.,1.]]
self.Pi = CNodePi(self,PiPriors, Pi)
self.piInit = Pi.copy()
self.nodes = {'S':CNodeSsparse(self),
'Pi':self.Pi,
'W':CNodeWsparseVEM(self),
'Alpha':CNodeAlphasparse(self,self.priors['Alpha']['priors']),
'Eps':CNodeEpsSparse(self,self.priors['Eps']['priors'])}
for n in list(self.nodes.keys()): setattr(self,n,self.nodes[n])
self.Non = (self.Pi.E1>.5).sum(0)
if self.Pi is not None:
assert self.Pi.E1.shape == (self._D,self.components)
#pca initialisation
Ion = None
if self.initType == 'pca':
Ion = random.rand(self.Pi.E1.shape[0],self.Pi.E1.shape[1])<self.Pi.E1
self.W.C[:,:,0] = self.Pi.E1.copy()
#self.W.C[:,:,0][self.W.C[:,:,0]<=.2] = .1
#self.W.C[:,:,0][self.W.C[:,:,0]>=.8] = .9
for k in range(self.components):
sv = linalg.svd(self.Z.E1[:,Ion[:,k]], full_matrices = 0);
[s0,w0] = [sv[0][:,0:1], S.dot(S.diag(sv[1]),sv[2]).T[:,0:1]]
v = s0.std(axis=0)
s0 /= v;
w0 *= v;
self.S.E1[:,k] = s0.ravel()
self.W.E1[Ion[:,k],k] = w0.ravel()
self.W.E1[~Ion[:,k],k]*=self.sigmaOff
self.S.diagSigmaS[:,k] = 1./2
if self.initType == 'pcaRand':
random.seed(222)
if self.noise == 'hurdle':
Zstd = self.Z.E1.copy()
self.meanZ = Zstd.mean(0)
Zstd-=Zstd.mean(0)
elif self.noise == 'poisson':
Zstd = SP.log2(self.Z.E1.astype('float64')+1)
Zstd -= Zstd.mean(0)
else:
Zstd = self.Z.E1
#Zstd -= Zstd.mean(0)
Ion = random.rand(self.Pi.E1.shape[0],self.Pi.E1.shape[1])<self.initZ
self.W.C[:,:,0] = self.initZ
self.W.C[:,:,0][self.W.C[:,:,0]<=.1] = .1
self.W.C[:,:,0][self.W.C[:,:,0]>=.9] = .9
self.W.C[:,:,1] = 1.-self.W.C[:,:,0]
for k in range(self.nHidden):
k+=self.nKnown
if Ion[:,k].sum()>5:
#pdb.set_trace()
if self.S.E1.shape[0]<500:
pca = PCA(n_components=1)
else:
pca = PCA(n_components=1, iterated_power=2, svd_solver='randomized')
s0 = pca.fit_transform(Zstd[:,Ion[:,k]])
self.S.E1[:,k] =(s0[:,0])
self.S.E1[:,k] = self.S.E1[:,k]/self.S.E1[:,k].std()
else:
self.S.E1[:,k] = random.randn(self._N,)
self.W.E1[:,k] = SP.sqrt(1./self.components)*SP.randn(self._D)
self.S.diagSigmaS[:,k] = 1./2
if self.nKnown>0:
for k in SP.arange(self.nKnown):
self.W.E1[:,k] = SP.sqrt(1./self.components)*SP.randn(self._D)
self.S.diagSigmaS[:,k] = 1./2
self.S.E1[:,SP.arange(self.nKnown)] = self.Known
if self.nLatent>0:
for iL in self.iLatent:
self.S.E1[:,iL] = random.randn(self._N,)
# if self.nLatentSparse>0:
# for iL in self.iLatentSparse:
# #self.S.E1[:,iL] = random.randn(self._N,)
# pca = RandomizedPCA(n_components=iL-self.nLatent+1)
# s0 = pca.fit_transform(Zstd[:,Ion[:,iL]])
# self.S.E1[:,iL] =(s0[:,iL-self.nLatent])
# self.S.E1[:,iL] = self.S.E1[:,iL]/self.S.E1[:,iL].std()
if self.saveInit==True:
self.initS = self.S.E1.copy()
elif self.initType == 'greedy':
self.S.E1 = random.randn(self._N,self.components)
self.W.E1 = random.randn(self._D,self.components)
Ion = (self.Pi.E1>0.5)
self.W.E1[~Ion]*= self.sigmaOff
for k in range(Ion.shape[1]):
self.W.E1[Ion[:,k]]*=self.sigmaOn[k]
elif self.initType == 'prior':
Ion = random.rand(self.Pi.E1.shape[0],self.Pi.E1.shape[1])<self.Pi.E1
self.W.E1[~Ion]*=self.sigmaOff
for k in range(Ion.shape[1]):
self.W.E1[Ion[:,k],k]*=self.sigmaOn[k]
elif self.initType == 'on':
for k in range(Ion.shape[1]):
self.W.E1[:,k]*=self.sigmaOn[k]
elif self.initType == 'random':
for k in range(self.Pi.E1.shape[1]):
self.S.diagSigmaS[:,k] = 1./2
self.S.E1[:,k] = SP.randn(self._N)
self.W.E1 = SP.randn(self._D, self.Pi.E1.shape[1])
self.W.C[:,:,0] = self.Pi.E1
self.W.C[:,:,0][self.W.C[:,:,0]<=.2] = .1
self.W.C[:,:,0][self.W.C[:,:,0]>=.8] = .9
if self.nKnown>0:
for k in SP.arange(self.nKnown):
self.W.E1[:,k] = SP.sqrt(1./self.components)*SP.randn(self._D)
self.S.diagSigmaS[:,k] = 1./2
self.S.E1[:,SP.arange(self.nKnown)] = self.Known
if self.saveInit==True:
self.initS = self.S.E1.copy()
elif self.initType == 'data':
assert ('S' in list(init_factors.keys()))
assert ('W' in list(init_factors.keys()))
# Ion = init_factors['Ion']
Sinit = init_factors['S']
Winit = init_factors['W']
self.W.C[:,:,0] = self.Pi.E1
self.W.C[:,:,0][self.W.C[:,:,0]<=.2] = .1
self.W.C[:,:,0][self.W.C[:,:,0]>=.8] = .9
for k in range(self.components):
self.S.E1[:,k] = Sinit[:,k]
self.W.E1[:,k] = Winit[:,k]
self.S.diagSigmaS[:,k] = 1./2
#calculate the variational bound:
def calcBound(self):
#TODO: debug!! DO NOT USE
F1 = -self._D*self._N/2*SP.log(2*pi) - self._N/2 * SP.sum(SP.log(1/self.Eps.E1)) - \
0.5*SP.sum(self.ZZ*self.Eps.E1)
SW_tau = (self.W.C[:, :,0]*self.W.E1)*SP.tile(self.Eps.E1,(self.W.E1.shape[1],1)).T
SW2_tau = (self.W.C[:, :,0]*(self.W.E2diag))*SP.tile(self.Eps.E1, (self.W.E1.shape[1],1)).T
SS = SP.sum(self.S.E1*self.S.E1,0)
SmTSm = SP.zeros(self.W.E1.shape[1])
F2 = SP.sum(SW_tau*SP.dot(self.Z.E1.T,self.S.E1))
F3 = 0.
F4 = 0.
F7PlusE3 = 0.5*(self.nHidden*self._N)#don't use knowns in entropy
for m in SP.arange(self.W.E1.shape[1]):
#F3
SigmaSm = 1./(1+SP.sum(self.S.diagSigmaS[:,m]))
SmTSm[m] = SS[m]+self._N*SigmaSm
F3 += SP.sum(SW2_tau[:, m], 0) * SmTSm[m]
#F4
rS = SP.zeros(self._N)
for m1 in SP.arange(m+1,self.W.E1.shape[1]):
tmp = (self.W.C[:, m1,0]*self.W.E1[:, m1])*SW_tau[:, m]
rS = rS + SP.sum(tmp,0)*self.S.E1[:,m1]
F4 = F4 + SP.dot(rS,self.S.E1[:,m:m+1])
#F7
alphaSm= SP.sum(SW2_tau[:,m])
F7PlusE3 = F7PlusE3 - 0.5*self._N*SP.log(1+alphaSm) - (0.5*self._N)/(1+alphaSm) \
- 0.5*SP.dot(self.S.E1[:,m].T, self.S.E1[:,m])
F5 = -(0.5*self.components*self._D)*SP.log(2.*pi) - (0.5*self.components)*sum(SP.log(1./self.Alpha.E1)) - \
0.5* SP.sum(1-self.W.C[:,:,0]) + SP.sum(SP.sum(self.W.C[:,:,0]*self.W.E2diag,0)*self.Alpha.E1)
F6 = SP.sum(SP.log(self.Pi.E1)*self.W.C[:,:,0]) + SP.sum(SP.log(1.-self.Pi.E1)*(1-self.W.C[:,:,0]))
EpslnE = special.digamma(self.Eps.a) - SP.log(self.Eps.b)
F8 = (self.Eps.pa-1)*SP.sum(EpslnE) - self.Eps.pb*SP.sum(self.Eps.E1)
AlphalnE = special.digamma(self.Alpha.a) - SP.log(self.Alpha.b)
F9 = (self.Alpha.pa-1)*SP.sum(AlphalnE) - self.Alpha.pb*SP.sum(self.Alpha.E1)
E1 = (0.5*self.components*self._D)*SP.log(2*pi) + (0.5*self.components)*SP.sum(SP.log(1./self.Alpha.E1)) + \
0.5*(self.components*self._D) - 0.5*SP.sum(SP.log(1./self.Alpha.E1)*(SP.sum(self.W.C[:,:,0],0))) \
+ 0.5*SP.sum( self.W.C[:,:,0]*SP.log(self.W.sigma2))
E2 = - SP.sum( self.W.C[:,:,0]*SP.log(self.W.C[:,:,0]+(self.W.C[:,:,0]==0)) + \
(1-self.W.C[:,:,0])*log(1-self.W.C[:,:,0]+(self.W.C[:,:,0]==1)))
E4 = SP.sum(self.Eps.a*SP.log(self.Eps.b)) + SP.sum((self.Eps.a-1)*EpslnE) -\
SP.sum(self.Eps.b*self.Eps.E1) - SP.sum(special.gammaln(self.Eps.a))
E5 = SP.sum(self.Alpha.a*SP.log(self.Alpha.b)) + SP.sum((self.Alpha.a-1)*AlphalnE) -\
SP.sum(self.Alpha.b*self.Alpha.E1) - SP.sum(special.gammaln(self.Alpha.a))
#pdb.set_trace()
#F = F1 + F2 - 0.5*F3 - F4 + F5 + F6 + E1 + E2 + F7PlusE3 + F8 - E4 +F9 - E5
F = F1 + F2 - 0.5*F3 - F4 + F5 + F6 + E1 + E2 + F7PlusE3 #+ F8 - E4 #+F9 - E5
return F