-
Notifications
You must be signed in to change notification settings - Fork 229
/
Product.cs
2183 lines (2022 loc) · 114 KB
/
Product.cs
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
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
namespace Microsoft.ML.Probabilistic.Factors
{
using System;
using System.Collections.Generic;
using Distributions;
using Math;
using Attributes;
using Utilities;
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/doc/*'/>
public class GaussianProductOpBase
{
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="ProductAverageConditional(double, Gaussian)"]/*'/>
public static Gaussian ProductAverageConditional(double A, [SkipIfUniform] Gaussian B)
{
return GaussianProductVmpOp.ProductAverageLogarithm(A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="ProductAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian ProductAverageConditional([SkipIfUniform] Gaussian A, double B)
{
return ProductAverageConditional(B, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="ProductAverageConditional(double, double)"]/*'/>
public static Gaussian ProductAverageConditional(double a, double b)
{
return Gaussian.PointMass(a * b);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="AAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian AAverageConditional([SkipIfUniform] Gaussian Product, double B)
{
if (Product.IsPointMass)
return AAverageConditional(Product.Point, B);
if (Product.IsUniform())
return Product;
// (m - ab)^2/v = (a^2 b^2 - 2abm + m^2)/v
// This code works correctly even if B=0 or Product is uniform (and B is finite).
Gaussian result = new Gaussian();
result.Precision = Product.Precision * B * B;
result.MeanTimesPrecision = Product.MeanTimesPrecision * B;
return result;
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="AAverageConditional(double, double)"]/*'/>
public static Gaussian AAverageConditional(double Product, double B)
{
if (B == 0)
{
if (Product != 0)
throw new AllZeroException();
return Gaussian.Uniform();
}
else
return Gaussian.PointMass(Product / B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="BAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian BAverageConditional([SkipIfUniform] Gaussian Product, double A)
{
return AAverageConditional(Product, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="BAverageConditional(double, double)"]/*'/>
public static Gaussian BAverageConditional(double Product, double A)
{
return AAverageConditional(Product, A);
}
// TruncatedGaussian //////////////////////////////////////////////////////////////////////////////////////////////
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="ProductAverageConditional(double, TruncatedGaussian)"]/*'/>
public static TruncatedGaussian ProductAverageConditional(double A, [SkipIfUniform] TruncatedGaussian B)
{
return GaussianProductVmpOp.ProductAverageLogarithm(A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="ProductAverageConditional(TruncatedGaussian, double)"]/*'/>
public static TruncatedGaussian ProductAverageConditional([SkipIfUniform] TruncatedGaussian A, double B)
{
return ProductAverageConditional(B, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="AAverageConditional(TruncatedGaussian, double)"]/*'/>
public static TruncatedGaussian AAverageConditional([SkipIfUniform] TruncatedGaussian Product, double B)
{
if (Product.IsUniform()) return Product;
return new TruncatedGaussian(AAverageConditional(Product.Gaussian, B), ((B >= 0) ? Product.LowerBound : Product.UpperBound) / B, ((B >= 0) ? Product.UpperBound : Product.LowerBound) / B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpBase"]/message_doc[@name="BAverageConditional(TruncatedGaussian, double)"]/*'/>
public static TruncatedGaussian BAverageConditional([SkipIfUniform] TruncatedGaussian Product, double A)
{
return AAverageConditional(Product, A);
}
}
public class GaussianProductOpEvidenceBase : GaussianProductOpBase
{
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogAverageFactor(Gaussian, Gaussian, double, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor(Gaussian product, Gaussian a, double b, [Fresh] Gaussian to_product)
{
//Gaussian to_product = GaussianProductOp.ProductAverageConditional(a, b);
return to_product.GetLogAverageOf(product);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogAverageFactor(Gaussian, double, Gaussian, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor(Gaussian product, double a, Gaussian b, [Fresh] Gaussian to_product)
{
return LogAverageFactor(product, b, a, to_product);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogAverageFactor(double, Gaussian, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor(double product, Gaussian a, double b)
{
Gaussian to_product = GaussianProductOp.ProductAverageConditional(a, b);
return to_product.GetLogProb(product);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogAverageFactor(double, double, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor(double product, double a, Gaussian b)
{
return LogAverageFactor(product, b, a);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogAverageFactor(double, double, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor(double product, double a, double b)
{
return (product == Factor.Product(a, b)) ? 0.0 : Double.NegativeInfinity;
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogEvidenceRatio(double, double, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogEvidenceRatio(double product, double a, double b)
{
return LogAverageFactor(product, a, b);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogAverageFactor(Gaussian, double, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor(Gaussian product, double a, double b)
{
return product.GetLogProb(Factor.Product(a, b));
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogEvidenceRatio(Gaussian, Gaussian, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
[Skip]
public static double LogEvidenceRatio(Gaussian product, Gaussian a, double b)
{
return 0.0;
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogEvidenceRatio(Gaussian, double, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
[Skip]
public static double LogEvidenceRatio(Gaussian product, double a, Gaussian b)
{
return LogEvidenceRatio(product, b, a);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogEvidenceRatio(Gaussian, double, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
[Skip]
public static double LogEvidenceRatio(Gaussian product, double a, double b)
{
return 0.0;
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogEvidenceRatio(double, Gaussian, double)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogEvidenceRatio(double product, Gaussian a, double b)
{
return LogAverageFactor(product, a, b);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOpEvidenceBase"]/message_doc[@name="LogEvidenceRatio(double, double, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogEvidenceRatio(double product, double a, Gaussian b)
{
return LogEvidenceRatio(product, b, a);
}
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/doc/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double), Default = true)]
//[FactorMethod(new string[] { "A", "Product", "B" }, typeof(Factor), "Ratio", typeof(double), typeof(double), Default=true)]
[Quality(QualityBand.Mature)]
public class GaussianProductOp : GaussianProductOpEvidenceBase
{
/// <summary>
/// The number of quadrature nodes used to compute the messages.
/// Reduce this number to save time in exchange for less accuracy.
/// Must be an odd number.
/// </summary>
public static int QuadratureNodeCount = 1001; // must be odd to avoid A=0
/// <summary>
/// Force proper messages
/// </summary>
public static bool ForceProper = true;
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="ProductAverageConditionalInit(Gaussian, Gaussian)"]/*'/>
[Skip]
public static Gaussian ProductAverageConditionalInit(Gaussian A, Gaussian B)
{
return Gaussian.Uniform();
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="ProductAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian ProductAverageConditional([NoInit] Gaussian Product, [SkipIfUniform] Gaussian A, [SkipIfUniform] Gaussian B)
{
if (A.IsUniform() || B.IsUniform()) return Gaussian.Uniform();
if (A.IsPointMass)
return ProductAverageConditional(A.Point, B);
if (B.IsPointMass)
return ProductAverageConditional(A, B.Point);
if (Product.IsPointMass || Product.Precision > 10)
return GaussianProductOp_Slow.ProductAverageConditional(Product, A, B);
if (Product.Precision < 1e-100)
return GaussianProductVmpOp.ProductAverageLogarithm(A, B);
double mA, vA;
A.GetMeanAndVariance(out mA, out vA);
double mB, vB;
B.GetMeanAndVariance(out mB, out vB);
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
// algorithm: quadrature on A from -1 to 1, plus quadrature on 1/A from -1 to 1.
double z = 0, sumX = 0, sumX2 = 0;
for (int i = 0; i <= QuadratureNodeCount; i++)
{
double a = (2.0 * i) / QuadratureNodeCount - 1;
double logfA = Gaussian.GetLogProb(mProduct, a * mB, vProduct + a * a * vB) + Gaussian.GetLogProb(a, mA, vA);
double fA = Math.Exp(logfA);
z += fA;
double b = (mB * vProduct + a * mProduct * vB) / (vProduct + a * a * vB);
double b2 = b * b + (vProduct * vB) / (vProduct + a * a * vB);
double x = a * b;
double x2 = a * a * b2;
sumX += x * fA;
sumX2 += x2 * fA;
double invA = a;
a = 1.0 / invA;
double logfInvA = Gaussian.GetLogProb(mProduct * invA, mB, vProduct * invA * invA + vB) + Gaussian.GetLogProb(a, mA, vA) - Math.Log(Math.Abs(invA + Double.Epsilon));
double fInvA = Math.Exp(logfInvA);
z += fInvA;
b = (mB * vProduct + a * mProduct * vB) / (vProduct + a * a * vB);
b2 = b * b + (vProduct * vB) / (vProduct + a * a * vB);
x = a * b;
x2 = a * a * b2;
sumX += x * fInvA;
sumX2 += x2 * fInvA;
}
if (z < 1e-310)
{
return GaussianProductOp_Slow.ProductAverageConditional(Product, A, B);
//throw new Exception("quadrature found zero mass");
}
double mean = sumX / z;
double var = sumX2 / z - mean * mean;
Gaussian result = Gaussian.FromMeanAndVariance(mean, var);
result.SetToRatio(result, Product, ForceProper);
return result;
}
/// <summary>
/// Compute the derivatives of the logarithm of the marginalized factor.
/// </summary>
/// <param name="a">The point to evaluate the derivatives</param>
/// <param name="mB"></param>
/// <param name="vB"></param>
/// <param name="Product"></param>
/// <param name="dlogf"></param>
/// <param name="ddlogf"></param>
public static void ADerivatives(double a, double mB, double vB, Gaussian Product, out double dlogf, out double ddlogf)
{
// f(a) = int_b N(mp; ab, vp) p(b) db
// = N(mp; a*mb, vp + a^2*vb)
// log f(a) = -0.5*log(vp + a^2*vb) -0.5*(mp - a*mb)^2/(vp + a^2*vb)
// dlogf = -a*vb/(vp + a^2*vb) + mb*(mp - a*mb)/(vp + a^2*vb) + a*vb*(mp - a*mb)^2/(vp + a^2*vb)^2
// ddlogf = -vb/(vp + a^2*vb) + 2*a^2*vb^2/(vp + a^2*vb)^2 + mb*(- mb)/(vp + a^2*vb) - 2*a*vb*mb*(mp - a*mb)/(vp + a^2*vb)^2 +
// vb*(mp - a*mb)^2/(vp + a^2*vb)^2 - 2*a*vb*mb*(mp - a*mb)/(vp + a^2*vb)^2 - (2*a*vb)^2*(mp - a*mb)^2/(vp + a^2*vb)^3
// (-vb-mb^2)(vp+a^2*vb)/(vp+a^2*vb)^2 = ((-vb-mb^2)vp - a^2*vb^2 - a^2*vb*mb^2)/(vp+a^2*vb)^2
// (2*a^2*vb^2 - 4*a*vb*mb*(mp - a*mb) + vb*(mp - a*mb)^2)/(vp + a^2*vb)^2
// = (2*a^2*vb^2 - 4*a*vb*mb*mp + 4*a^2*vb*mb^2 + vb*mp^2 - 2*a*vb*mb*mp + vb*a^2*mb^2)/(vp + a^2*vb)^2
// = (2*a^2*vb^2 + 5*a^2*vb*mb^2 + vb*mp^2 - 6*a*vb*mb*mp)/(vp + a^2*vb)^2
// together = (a^2*vb^2 + 4*a^2*vb*mb^2 + vb*mp^2 - 6*a*vb*mb*mp - vp*(vb+mb^2))/(vp + a^2*vb)^2
if (double.IsInfinity(vB))
throw new ArgumentException("vB is infinite");
if (Product.IsPointMass)
throw new ArgumentException("Product is a point mass");
// v*Product.Precision
double v = 1 + a * a * vB * Product.Precision;
// diff*Product.Precision
double diff = Product.MeanTimesPrecision - a * mB * Product.Precision;
double diff2 = diff * diff;
double v2 = v * v;
double avb = a * vB;
double avbPrec = avb * Product.Precision;
dlogf = (mB * diff - avbPrec) / v + avb * diff2 / v2;
ddlogf = (-mB * mB - vB) * Product.Precision / v + (2 * avbPrec * (avbPrec - 2 * mB * diff) + vB * diff2) / v2 - (4 * avb * avbPrec * diff2) / (v2 * v);
//ddlogf = (avb*avb + 4*avb*a*mB*mB + vB*mProduct*mProduct - 6*avb*mB*mProduct - vProduct*(vB + mB*mB)) / denom2 - (4 * avb * avb * diff2) / (denom2 * denom);
bool check = false;
if (check)
{
double delta = 1e-6;
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
// logf1 =approx logf0 - delta*dlogf0 + 0.5*delta^2*ddlogf0 - 1/6*delta^3*dddlogf0
double logf1 = GaussianProductOp_Slow.LogLikelihood(a - delta, mProduct, vProduct, 0, 0, mB, vB);
// logf2 =approx logf0 + delta*dlogf0 + 0.5*delta^2*ddlogf0 + 1/6*delta^3*dddlogf0
double logf2 = GaussianProductOp_Slow.LogLikelihood(a + delta, mProduct, vProduct, 0, 0, mB, vB);
// error should be 1/3*delta^3*dddlogf0
double dlogf0 = (logf2 - logf1) / delta / 2;
double logf0 = GaussianProductOp_Slow.LogLikelihood(a, mProduct, vProduct, 0, 0, mB, vB);
double ddlogf0 = (logf2 + logf1 - 2 * logf0) / delta / delta;
double dlogfError = MMath.AbsDiff(dlogf, dlogf0, 1e-8);
double ddlogfError = MMath.AbsDiff(ddlogf, ddlogf0, 1e-8);
if (Math.Abs(ddlogf0 / dlogf0) < 1000)
{
//Console.WriteLine("{0} should be {1} (error {2})", dlogf, dlogf0, dlogfError);
//Console.WriteLine("{0} should be {1} (error {2})", ddlogf, ddlogf0, ddlogfError);
if (dlogfError > delta * 10 || ddlogfError > delta * 1000)
throw new Exception("wrong derivative");
}
}
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="AAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian AAverageConditional([SkipIfUniform] Gaussian Product, [NoInit] Gaussian A, [SkipIfUniform] Gaussian B)
{
if (B.IsPointMass)
return AAverageConditional(Product, B.Point);
if (Product.IsUniform() || B.IsUniform())
return Gaussian.Uniform();
double mA, vA;
A.GetMeanAndVariance(out mA, out vA);
double mB, vB;
B.GetMeanAndVariance(out mB, out vB);
if (A.IsPointMass)
{
ADerivatives(mA, mB, vB, Product, out double dlogf, out double ddlogf);
return Gaussian.FromDerivatives(mA, dlogf, ddlogf, ForceProper);
}
else
{
// algorithm: quadrature on A from -1 to 1, plus quadrature on 1/A from -1 to 1.
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
double z = 0, sumA = 0, sumA2 = 0;
for (int i = 0; i <= QuadratureNodeCount; i++)
{
double a = (2.0 * i) / QuadratureNodeCount - 1;
double logfA = Gaussian.GetLogProb(mProduct, a * mB, vProduct + a * a * vB) + Gaussian.GetLogProb(a, mA, vA);
double fA = Math.Exp(logfA);
z += fA;
sumA += a * fA;
sumA2 += a * a * fA;
double invA = a;
a = 1.0 / invA;
double logfInvA = Gaussian.GetLogProb(mProduct * invA, mB, vProduct * invA * invA + vB) + Gaussian.GetLogProb(a, mA, vA) -
Math.Log(Math.Abs(invA + Double.Epsilon));
double fInvA = Math.Exp(logfInvA);
z += fInvA;
sumA += a * fInvA;
sumA2 += a * a * fInvA;
}
double mean = sumA / z;
double variance = sumA2 / z - mean * mean;
if (z == 0 || variance <= 0 || variance >= vA)
{
return GaussianProductOp_Slow.AAverageConditional(Product, A, B);
//throw new Exception("quadrature failed");
}
Gaussian result = new Gaussian();
result.SetMeanAndVariance(mean, variance);
result.SetToRatio(result, A, ForceProper);
return result;
}
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="AAverageConditional(double, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian AAverageConditional(double Product, [NoInit] Gaussian A, [SkipIfUniform] Gaussian B)
{
return AAverageConditional(Gaussian.PointMass(Product), A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="BAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian BAverageConditional([SkipIfUniform] Gaussian Product, [SkipIfUniform] Gaussian A, [NoInit] Gaussian B)
{
return AAverageConditional(Product, B, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="BAverageConditional(double, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian BAverageConditional(double Product, [SkipIfUniform] Gaussian A, [NoInit] Gaussian B)
{
return AAverageConditional(Product, B, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="LogAverageFactor(Gaussian, Gaussian, Gaussian, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor([SkipIfUniform] Gaussian Product, Gaussian A, Gaussian B, Gaussian to_product)
{
if (A.IsPointMass)
return LogAverageFactor(Product, B, A.Point, to_product);
if (B.IsPointMass)
return LogAverageFactor(Product, A, B.Point, to_product);
if (Product.IsUniform())
return 0.0;
double mA, vA;
A.GetMeanAndVariance(out mA, out vA);
double mB, vB;
B.GetMeanAndVariance(out mB, out vB);
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
// algorithm: quadrature on A from -1 to 1, plus quadrature on 1/A from -1 to 1.
double z = 0;
for (int i = 0; i <= GaussianProductOp.QuadratureNodeCount; i++)
{
double a = (2.0 * i) / GaussianProductOp.QuadratureNodeCount - 1;
double logfA = Gaussian.GetLogProb(mProduct, a * mB, vProduct + a * a * vB) + Gaussian.GetLogProb(a, mA, vA);
double fA = Math.Exp(logfA);
z += fA;
double invA = a;
a = 1.0 / invA;
double logfInvA = Gaussian.GetLogProb(mProduct * invA, mB, vProduct * invA * invA + vB) + Gaussian.GetLogProb(a, mA, vA) - Math.Log(Math.Abs(invA + Double.Epsilon));
double fInvA = Math.Exp(logfInvA);
z += fInvA;
}
double inc = 2.0 / GaussianProductOp.QuadratureNodeCount;
return Math.Log(z * inc);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="LogEvidenceRatio(Gaussian, Gaussian, Gaussian, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogEvidenceRatio([SkipIfUniform] Gaussian Product, Gaussian A, Gaussian B, Gaussian to_product)
{
return LogAverageFactor(Product, A, B, to_product) - to_product.GetLogAverageOf(Product);
}
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/doc/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double), Default = true)]
//[FactorMethod(new string[] { "A", "Product", "B" }, typeof(Factor), "Ratio", typeof(double), typeof(double), Default = true)]
[Quality(QualityBand.Mature)]
public class GaussianProductOp_Slow : GaussianProductOpEvidenceBase
{
public static int QuadratureNodeCount = 20000;
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="ProductAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian ProductAverageConditional([NoInit] Gaussian Product, [SkipIfUniform] Gaussian A, [SkipIfUniform] Gaussian B)
{
if (A.IsPointMass)
return GaussianProductOp.ProductAverageConditional(A.Point, B);
if (B.IsPointMass)
return GaussianProductOp.ProductAverageConditional(A, B.Point);
if (Product.IsUniform() || Product.Precision < 1e-100 || A.IsUniform() || B.IsUniform())
return GaussianProductVmpOp.ProductAverageLogarithm(A, B);
double mA, vA;
A.GetMeanAndVariance(out mA, out vA);
double mB, vB;
B.GetMeanAndVariance(out mB, out vB);
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
bool oldMethod = false;
if (oldMethod)
{
// algorithm: quadrature on A from -1 to 1, plus quadrature on 1/A from -1 to 1.
double z = 0, sumX = 0, sumX2 = 0;
for (int i = 0; i <= QuadratureNodeCount; i++)
{
double a = (2.0 * i) / QuadratureNodeCount - 1;
double logfA = Gaussian.GetLogProb(mProduct, a * mB, vProduct + a * a * vB) + Gaussian.GetLogProb(a, mA, vA);
double fA = Math.Exp(logfA);
z += fA;
double b = (mB * vProduct + a * mProduct * vB) / (vProduct + a * a * vB);
double b2 = b * b + (vProduct * vB) / (vProduct + a * a * vB);
double x = a * b;
double x2 = a * a * b2;
sumX += x * fA;
sumX2 += x2 * fA;
double invA = a;
a = 1.0 / invA;
double logfInvA = Gaussian.GetLogProb(mProduct * invA, mB, vProduct * invA * invA + vB) + Gaussian.GetLogProb(a, mA, vA) - Math.Log(Math.Abs(invA + Double.Epsilon));
double fInvA = Math.Exp(logfInvA);
z += fInvA;
b = (mB * vProduct + a * mProduct * vB) / (vProduct + a * a * vB);
b2 = b * b + (vProduct * vB) / (vProduct + a * a * vB);
x = a * b;
x2 = a * a * b2;
sumX += x * fInvA;
sumX2 += x2 * fInvA;
}
double mean = sumX / z;
double var = sumX2 / z - mean * mean;
Gaussian result = Gaussian.FromMeanAndVariance(mean, var);
result.SetToRatio(result, Product, GaussianProductOp.ForceProper);
return result;
}
else
{
double pA = A.Precision;
double a0, amin, amax;
GetIntegrationBoundsForA(mProduct, vProduct, mA, pA, mB, vB, out a0, out amin, out amax);
if (amin == a0 || amax == a0)
return AAverageConditional(Product, Gaussian.PointMass(a0), B);
int n = QuadratureNodeCount;
double inc = (amax - amin) / (n - 1);
if (vProduct < 1)
{
// Compute the message directly
double Z = 0;
double sum1 = 0;
double sum2 = 0;
for (int i = 0; i < n; i++)
{
double a = amin + i * inc;
double logf = LogLikelihoodRatio(a, a0, mProduct, vProduct, mA, pA, mB, vB);
double v = vProduct + a * a * vB;
double diff = mProduct - a * mB;
double diffv = diff / v;
double diffv2 = diffv * diffv;
double dlogf = -diffv;
double ddlogf = diffv2 -1/v;
if ((i == 0 || i == n - 1) && (logf > -49))
throw new Exception("invalid integration bounds");
double f = Math.Exp(logf);
Z += f;
sum1 += dlogf * f;
sum2 += ddlogf * f;
}
if (double.IsPositiveInfinity(Z))
{
// this can happen if the likelihood is extremely sharp
//throw new Exception("overflow");
return ProductAverageConditional(Product, Gaussian.PointMass(a0), B);
}
double alpha = sum1 / Z;
double beta = alpha*alpha - sum2 / Z;
return GaussianOp.GaussianFromAlphaBeta(Product, alpha, beta, GaussianProductOp.ForceProper);
}
else
{
// Compute the marginal and then divide
double rmin = Math.Sign(amin) * Math.Pow(Math.Abs(amin), 1.0 / 3);
double rmax = Math.Sign(amax) * Math.Pow(Math.Abs(amax), 1.0 / 3);
double rinc = (rmax - rmin) / (n - 1);
bool useCube = 1000 * vB > vProduct;
MeanVarianceAccumulator mva = new MeanVarianceAccumulator();
for (int i = 0; i < n; i++)
{
double a, r = default;
if (useCube)
{
r = rmin + i * rinc;
a = Math.Pow(r, 3);
}
else
{
a = amin + i * inc;
}
double logfA = LogLikelihoodRatio(a, a0, mProduct, vProduct, mA, pA, mB, vB);
double fA = Math.Exp(logfA);
if (useCube)
{
fA *= 3 * r * r;
}
double avB = a * vB;
double v = vProduct + a * avB;
double mX = a * (mProduct * avB + vProduct * mB) / v;
double vX = a * avB * vProduct / v;
mva.Add(mX, vX, fA);
}
double mean = mva.Mean;
double variance = mva.Variance;
if (variance <= 0)
throw new Exception("quadrature failed");
Gaussian result = new Gaussian();
result.SetMeanAndVariance(mean, variance);
result.SetToRatio(result, Product, GaussianProductOp.ForceProper);
return result;
}
}
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="AAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian AAverageConditional([SkipIfUniform] Gaussian Product, [NoInit] Gaussian A, [SkipIfUniform] Gaussian B)
{
if (B.IsPointMass)
return GaussianProductOp.AAverageConditional(Product, B.Point);
if (Product.IsUniform() || B.IsUniform() || Product.Precision < 1e-100)
return Gaussian.Uniform();
if (A.IsPointMass)
{
return GaussianProductOp.AAverageConditional(Product, A, B);
}
else
{
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
double mA, vA;
A.GetMeanAndVariance(out mA, out vA);
double mB, vB;
B.GetMeanAndVariance(out mB, out vB);
double pA = A.Precision;
double a0, amin, amax;
GetIntegrationBoundsForA(mProduct, vProduct, mA, pA, mB, vB, out a0, out amin, out amax);
if (amin == a0 || amax == a0)
return AAverageConditional(Product, Gaussian.PointMass(a0), B);
int n = QuadratureNodeCount;
double inc = (amax - amin) / (n - 1);
if (vA < 1)
{
// Compute the message directly
// alpha = dlogZ/dmA = (1/Z) int f'(a) p(a) da = (1/Z) int dlogf(a) f(a) p(a) da
// beta = -dalpha/dmA = alpha^2 - (1/Z) int f''(a) p(a) da
// = alpha^2 - (1/Z) int (dlogf(a)^2 + ddlogf(a)) f(a) p(a) da
// if p(a) approaches a point mass, then alpha -> dlogf(a), beta -> -ddlogf(a)
// and these will be the derivatives of the message.
double Z = 0;
double sum1 = 0;
double sum2 = 0;
for (int i = 0; i < n; i++)
{
double a = amin + i * inc;
double logf = LogLikelihoodRatio(a, a0, mProduct, vProduct, mA, pA, mB, vB);
double dlogf, ddlogf;
GaussianProductOp.ADerivatives(a, mB, vB, Product, out dlogf, out ddlogf);
if ((i == 0 || i == n - 1) && (logf > -49))
throw new Exception("invalid integration bounds");
double f = Math.Exp(logf);
if (double.IsPositiveInfinity(f))
{
// this can happen if the likelihood is extremely sharp
//throw new Exception("overflow");
return AAverageConditional(Product, Gaussian.PointMass(a0), B);
}
Z += f;
sum1 += dlogf * f;
sum2 += (dlogf*dlogf + ddlogf) * f;
}
double alpha = sum1 / Z;
double beta = alpha * alpha - sum2 / Z;
return GaussianOp.GaussianFromAlphaBeta(A, alpha, beta, GaussianProductOp.ForceProper);
}
else
{
// Compute the marginal and then divide
MeanVarianceAccumulator mva = new MeanVarianceAccumulator();
for (int i = 0; i < n; i++)
{
double a = amin + i * inc;
double logfA = LogLikelihoodRatio(a, a0, mProduct, vProduct, mA, pA, mB, vB);
double fA = Math.Exp(logfA);
mva.Add(a, fA);
}
double mean = mva.Mean;
double variance = mva.Variance;
if (variance <= 0)
throw new Exception("quadrature failed");
Gaussian result = new Gaussian();
result.SetMeanAndVariance(mean, variance);
result.SetToRatio(result, A, GaussianProductOp.ForceProper);
return result;
}
}
}
public static void GetIntegrationBoundsForA(double mProduct, double vProduct, double mA, double pA,
double mB, double vB, out double amode, out double amin, out double amax)
{
if (double.IsInfinity(vProduct)) throw new ArgumentException("vProduct is infinity");
if (double.IsInfinity(vB)) throw new ArgumentException("vB is infinity");
// this code works even if vA = infinity
double mpA = mA*pA;
double vB2 = vB*vB;
double vProduct2 = vProduct*vProduct;
// coefficients of polynomial for derivative
double[] coeffs = { -pA*vB2, mpA*vB2, -pA*2*vProduct*vB-vB2, mpA*2*vProduct*vB -vB*mB*mProduct,
-pA*vProduct2+vB*mProduct*mProduct-vB*vProduct-vProduct*mB*mB, mpA*vProduct2+vProduct*mB*mProduct };
//double[] coeffs = { -pA*vB2, mpA*vB2, -pA*2*vProduct*vB, mpA*2*vProduct*vB,
// -pA*vProduct2, mpA*vProduct2 };
//Console.WriteLine(StringUtil.CollectionToString(coeffs, " "));
List<double> stationaryPoints;
GaussianOp_Slow.GetRealRoots(coeffs, out stationaryPoints);
// coefficients of polynomial for 2nd derivative
double[] coeffs2 = new double[7];
for (int i = 0; i < coeffs2.Length; i++)
{
double c = 0;
if (i >= 2)
{
c += vProduct * coeffs[i - 2] * (5 - (i - 2));
}
if (i <= 5)
{
c += vB * coeffs[i] * (5 - i - 4);
}
coeffs2[i] = c;
}
//Console.WriteLine(StringUtil.CollectionToString(coeffs2, " "));
List<double> inflectionPoints;
GaussianOp_Slow.GetRealRoots(coeffs2, out inflectionPoints);
double like(double a) => LogLikelihood(a, mProduct, vProduct, mA, pA, mB, vB);
var stationaryValues = stationaryPoints.ConvertAll(a => like(a));
double max = MMath.Max(stationaryValues);
double a0 = stationaryPoints[stationaryValues.IndexOf(max)];
amode = a0;
double func(double a)
{
return LogLikelihoodRatio(a, a0, mProduct, vProduct, mA, pA, mB, vB) + 50;
}
double deriv(double a)
{
if (double.IsInfinity(a))
return -a;
double v = vProduct + vB * a * a;
double diffv = (mProduct - a * mB) / v;
double diffa = a - mA;
return a * vB * (diffv * diffv - 1 / v) + mB * diffv - diffa * pA;
}
// find where the likelihood matches the bound value
List<double> zeroes = GaussianOp_Slow.FindZeroes(func, deriv, stationaryPoints, inflectionPoints);
amin = MMath.Min(zeroes);
amax = MMath.Max(zeroes);
Assert.IsTrue(amin <= amax);
//Console.WriteLine("amin = {0} amode = {1} amax = {2}", amin, amode, amax);
}
internal static double LogLikelihood(double a, double mProduct, double vProduct, double mA, double pA, double mB, double vB)
{
if (double.IsInfinity(a))
return double.NegativeInfinity;
double v = vProduct + vB * a * a;
double diff = mProduct - a * mB;
double diffa = a - mA;
return -0.5 * (Math.Log(v) + diff * diff / v + diffa * diffa * pA);
}
internal static double LogLikelihoodRatio(double a, double a0, double mProduct, double vProduct, double mA, double pA, double mB, double vB)
{
if (double.IsInfinity(a))
return double.NegativeInfinity;
double v = vProduct + vB * a * a;
double diff = mProduct - a * mB;
double diffa = a - mA;
double v0 = vProduct + vB * a0 * a0;
double diff0 = mProduct - a0 * mB;
double diffa0 = a0 - mA;
return -0.5 * (Math.Log(v / v0) + diff * diff / v + diffa * diffa * pA) + 0.5 * (diff0 * diff0 / v0 + diffa0 * diffa0 * pA);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="AAverageConditional(double, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian AAverageConditional(double Product, [NoInit] Gaussian A, [SkipIfUniform] Gaussian B)
{
return AAverageConditional(Gaussian.PointMass(Product), A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="BAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian BAverageConditional([SkipIfUniform] Gaussian Product, [SkipIfUniform] Gaussian A, [NoInit] Gaussian B)
{
return AAverageConditional(Product, B, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="BAverageConditional(double, Gaussian, Gaussian)"]/*'/>
[Quality(QualityBand.Experimental)]
public static Gaussian BAverageConditional(double Product, [SkipIfUniform] Gaussian A, [NoInit] Gaussian B)
{
return AAverageConditional(Product, B, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="LogAverageFactor(Gaussian, Gaussian, Gaussian, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogAverageFactor([SkipIfUniform] Gaussian Product, [Proper] Gaussian A, [Proper] Gaussian B, Gaussian to_product)
{
if (A.IsPointMass)
return LogAverageFactor(Product, B, A.Point, to_product);
if (B.IsPointMass)
return LogAverageFactor(Product, A, B.Point, to_product);
if (Product.IsUniform())
return 0.0;
double mA, vA;
A.GetMeanAndVariance(out mA, out vA);
double mB, vB;
B.GetMeanAndVariance(out mB, out vB);
double mProduct, vProduct;
Product.GetMeanAndVariance(out mProduct, out vProduct);
double pA = A.Precision;
double a0, amin, amax;
GaussianProductOp_Slow.GetIntegrationBoundsForA(mProduct, vProduct, mA, pA, mB, vB, out a0, out amin, out amax);
if (amin == a0 || amax == a0)
return LogAverageFactor(Product, B, a0, to_product);
int n = GaussianProductOp_Slow.QuadratureNodeCount;
double inc = (amax - amin) / (n - 1);
double logZ = GaussianProductOp_Slow.LogLikelihood(a0, mProduct, vProduct, mA, pA, mB, vB);
logZ += 0.5 * Math.Log(pA) - 2 * MMath.LnSqrt2PI;
double sum = 0;
for (int i = 0; i < n; i++)
{
double a = amin + i * inc;
double logfA = GaussianProductOp_Slow.LogLikelihoodRatio(a, a0, mProduct, vProduct, mA, pA, mB, vB);
double fA = Math.Exp(logfA);
sum += fA;
}
return logZ + Math.Log(sum * inc);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp"]/message_doc[@name="LogEvidenceRatio(Gaussian, Gaussian, Gaussian, Gaussian)"]/*'/>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
public static double LogEvidenceRatio([SkipIfUniform] Gaussian Product, [Proper] Gaussian A, [Proper] Gaussian B, Gaussian to_product)
{
return LogAverageFactor(Product, A, B, to_product) - to_product.GetLogAverageOf(Product);
}
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/doc/*'/>
/// <remarks>
/// This class allows EP to process the product factor as if running VMP, as required by Stern's algorithm.
/// The algorithm comes from "Matchbox: Large Scale Online Bayesian Recommendations" by David Stern, Ralf Herbrich, and Thore Graepel, WWW 2009.
/// </remarks>
[FactorMethod(typeof(Factor), "Product_SHG09", typeof(double), typeof(double))]
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
[Quality(QualityBand.Preview)]
public static class GaussianProductOp_SHG09
{
public static Gaussian ProductAverageConditional2(
Gaussian product, [SkipIfUniform] Gaussian A, [SkipIfUniform] Gaussian B, [NoInit] Gaussian to_A, [NoInit] Gaussian to_B)
{
// this version divides out the message from product, so the marginal for Product is correct and the factor is composable.
return GaussianProductVmpOp.ProductAverageLogarithm(A * to_A, B * to_B) / product;
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="ProductAverageConditional(Gaussian, Gaussian, Gaussian, Gaussian)"]/*'/>
public static Gaussian ProductAverageConditional([SkipIfUniform] Gaussian A, [SkipIfUniform] Gaussian B, [NoInit] Gaussian to_A, [NoInit] Gaussian to_B)
{
// note we are not dividing out the message from Product.
// this means that the marginal for Product will not be correct, and the factor is not composable.
return GaussianProductVmpOp.ProductAverageLogarithm(A * to_A, B * to_B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="AAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
public static Gaussian AAverageConditional([SkipIfUniform] Gaussian Product, [Proper /*, Fresh*/] Gaussian B, [NoInit] Gaussian to_B)
{
return GaussianProductVmpOp.AAverageLogarithm(Product, B * to_B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="BAverageConditional(Gaussian, Gaussian, Gaussian)"]/*'/>
public static Gaussian BAverageConditional([SkipIfUniform] Gaussian Product, [Proper /*, Fresh*/] Gaussian A, [NoInit] Gaussian to_A)
{
//return BAverageConditional(Product, A.GetMean());
return AAverageConditional(Product, A, to_A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="LogEvidenceRatio(Gaussian, Gaussian, Gaussian, Gaussian, Gaussian, Gaussian)"]/*'/>
public static double LogEvidenceRatio(
[SkipIfUniform] Gaussian Product, [SkipIfUniform] Gaussian A, [SkipIfUniform] Gaussian B, Gaussian to_A, Gaussian to_B, Gaussian to_product)
{
// The SHG paper did not define how to compute evidence.
// The formula below comes from matching the VMP evidence for a model with a single product factor.
Gaussian qA = A * to_A;
Gaussian qB = B * to_B;
Gaussian qProduct = to_product;
double aRatio = A.GetLogAverageOf(to_A) - qA.GetAverageLog(to_A);
double bRatio = B.GetLogAverageOf(to_B) - qB.GetAverageLog(to_B);
double productRatio = qProduct.GetAverageLog(Product) - to_product.GetLogAverageOf(Product);
return aRatio + bRatio + productRatio;
}
#if true
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="ProductAverageConditional(double, Gaussian, Gaussian)"]/*'/>
public static Gaussian ProductAverageConditional(double A, [SkipIfUniform] Gaussian B, [NoInit] Gaussian to_B)
{
return GaussianProductVmpOp.ProductAverageLogarithm(A, B * to_B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="ProductAverageConditional(Gaussian, double, Gaussian)"]/*'/>
public static Gaussian ProductAverageConditional([SkipIfUniform] Gaussian A, double B, [NoInit] Gaussian to_A)
{
return GaussianProductVmpOp.ProductAverageLogarithm(A * to_A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="AAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian AAverageConditional([SkipIfUniform] Gaussian Product, double B)
{
return GaussianProductVmpOp.AAverageLogarithm(Product, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="BAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian BAverageConditional([SkipIfUniform] Gaussian Product, double A)
{
return AAverageConditional(Product, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="LogEvidenceRatio(Gaussian, Gaussian, double, Gaussian, Gaussian)"]/*'/>
public static double LogEvidenceRatio([SkipIfUniform] Gaussian Product, [SkipIfUniform] Gaussian A, double B, Gaussian to_A, Gaussian to_product)
{
// The SHG paper did not define how to compute evidence.
// The formula below comes from matching the VMP evidence for a model with a single product factor.
Gaussian qA = A * to_A;
Gaussian qProduct = to_product;
double aRatio = A.GetLogAverageOf(to_A) - qA.GetAverageLog(to_A);
double productRatio = qProduct.GetAverageLog(Product) - to_product.GetLogAverageOf(Product);
return aRatio + productRatio;
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="LogEvidenceRatio(Gaussian, double, Gaussian, Gaussian, Gaussian)"]/*'/>
public static double LogEvidenceRatio([SkipIfUniform] Gaussian Product, double A, [SkipIfUniform] Gaussian B, Gaussian to_B, Gaussian to_product)
{
// The SHG paper did not define how to compute evidence.
// The formula below comes from matching the VMP evidence for a model with a single product factor.
Gaussian qB = B * to_B;
Gaussian qProduct = to_product;
double bRatio = B.GetLogAverageOf(to_B) - qB.GetAverageLog(to_B);
double productRatio = qProduct.GetAverageLog(Product) - to_product.GetLogAverageOf(Product);
return bRatio + productRatio;
}
#else
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="ProductAverageConditional(double, Gaussian)"]/*'/>
public static Gaussian ProductAverageConditional(double A, [SkipIfUniform] Gaussian B)
{
return GaussianProductOp.ProductAverageConditional(A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="ProductAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian ProductAverageConditional([SkipIfUniform] Gaussian A, double B)
{
return GaussianProductOp.ProductAverageConditional(A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="AAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian AAverageConditional([SkipIfUniform] Gaussian Product, double B)
{
return GaussianProductOp.AAverageConditional(Product, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="BAverageConditional(Gaussian, double)"]/*'/>
public static Gaussian BAverageConditional([SkipIfUniform] Gaussian Product, double A)
{
return GaussianProductOp.BAverageConditional(Product, A);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="LogEvidenceRatio(Gaussian, Gaussian, double)"]/*'/>
public static double LogEvidenceRatio([SkipIfUniform] Gaussian Product, [SkipIfUniform] Gaussian A, double B)
{
return GaussianProductEvidenceOp.LogEvidenceRatio(Product, A, B);
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_SHG09"]/message_doc[@name="LogEvidenceRatio(Gaussian, double, Gaussian)"]/*'/>
public static double LogEvidenceRatio([SkipIfUniform] Gaussian Product, double A, [SkipIfUniform] Gaussian B)
{
return GaussianProductEvidenceOp.LogEvidenceRatio(Product, A, B);
}
#endif
}
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_LaplaceProp"]/doc/*'/>
/// <remarks>
/// This class allows EP to process the product factor using Laplace Propagation with other variables marginalized out.
/// </remarks>
[FactorMethod(typeof(Factor), "Product", typeof(double), typeof(double))]
//[FactorMethod(new string[] { "A", "Product", "B" }, typeof(Factor), "Ratio", typeof(double), typeof(double), Default = true)]
[Quality(QualityBand.Experimental)]
public class GaussianProductOp_LaplaceProp : GaussianProductOpEvidenceBase
{
/// <include file='FactorDocs.xml' path='factor_docs/message_op_class[@name="GaussianProductOp_LaplaceProp"]/message_doc[@name="ProductAverageConditional(Gaussian, Gaussian)"]/*'/>
public static Gaussian ProductAverageConditional(Gaussian A, Gaussian B)
{
return GaussianProductVmpOp.ProductAverageLogarithm(A, B);
}
public static Gaussian ProductAverageConditional2(Gaussian Product, Gaussian A, Gaussian B, Gaussian to_A)
{
if (Product.IsUniform())
return GaussianProductVmpOp.ProductAverageLogarithm(A, B);
double mx, vx;