Skip to content

Commit 89f1883

Browse files
fix json
1 parent 5cb1fd0 commit 89f1883

File tree

2 files changed

+21
-52
lines changed

2 files changed

+21
-52
lines changed

Chapter4_TheGreatestTheoremNeverTold/Ch4_LawOfLargeNumbers_PyMC2.ipynb

Lines changed: 20 additions & 51 deletions
Original file line numberDiff line numberDiff line change
@@ -71,9 +71,7 @@
7171
{
7272
"cell_type": "code",
7373
"execution_count": 6,
74-
"metadata": {
75-
"collapsed": false
76-
},
74+
"metadata": {},
7775
"outputs": [
7876
{
7977
"data": {
@@ -147,9 +145,7 @@
147145
{
148146
"cell_type": "code",
149147
"execution_count": 2,
150-
"metadata": {
151-
"collapsed": false
152-
},
148+
"metadata": {},
153149
"outputs": [
154150
{
155151
"data": {
@@ -237,9 +233,7 @@
237233
{
238234
"cell_type": "code",
239235
"execution_count": 3,
240-
"metadata": {
241-
"collapsed": false
242-
},
236+
"metadata": {},
243237
"outputs": [
244238
{
245239
"name": "stdout",
@@ -293,9 +287,7 @@
293287
{
294288
"cell_type": "code",
295289
"execution_count": 4,
296-
"metadata": {
297-
"collapsed": false
298-
},
290+
"metadata": {},
299291
"outputs": [
300292
{
301293
"data": {
@@ -359,9 +351,7 @@
359351
{
360352
"cell_type": "code",
361353
"execution_count": 5,
362-
"metadata": {
363-
"collapsed": false
364-
},
354+
"metadata": {},
365355
"outputs": [
366356
{
367357
"name": "stdout",
@@ -396,9 +386,7 @@
396386
{
397387
"cell_type": "code",
398388
"execution_count": 6,
399-
"metadata": {
400-
"collapsed": false
401-
},
389+
"metadata": {},
402390
"outputs": [
403391
{
404392
"data": {
@@ -492,9 +480,7 @@
492480
{
493481
"cell_type": "code",
494482
"execution_count": 1,
495-
"metadata": {
496-
"collapsed": false
497-
},
483+
"metadata": {},
498484
"outputs": [
499485
{
500486
"name": "stdout",
@@ -517,9 +503,7 @@
517503
{
518504
"cell_type": "code",
519505
"execution_count": 2,
520-
"metadata": {
521-
"collapsed": false
522-
},
506+
"metadata": {},
523507
"outputs": [
524508
{
525509
"name": "stdout",
@@ -565,9 +549,7 @@
565549
{
566550
"cell_type": "code",
567551
"execution_count": 4,
568-
"metadata": {
569-
"collapsed": false
570-
},
552+
"metadata": {},
571553
"outputs": [],
572554
"source": [
573555
"import pymc as pm\n",
@@ -598,9 +580,7 @@
598580
{
599581
"cell_type": "code",
600582
"execution_count": 5,
601-
"metadata": {
602-
"collapsed": false
603-
},
583+
"metadata": {},
604584
"outputs": [
605585
{
606586
"ename": "NameError",
@@ -648,9 +628,7 @@
648628
{
649629
"cell_type": "code",
650630
"execution_count": 40,
651-
"metadata": {
652-
"collapsed": false
653-
},
631+
"metadata": {},
654632
"outputs": [
655633
{
656634
"name": "stdout",
@@ -699,8 +677,7 @@
699677
"source": [
700678
"The best submissions, according to our procedure, are the submissions that are *most-likely* to score a high percentage of upvotes. Visually those are the submissions with the 95% least plausible value close to 1.\n",
701679
"\n",
702-
"
703-
Why is sorting based on this quantity a good idea? By ordering by the 95% least plausible value, we are being the most conservative with what we think is best. When using the lower-bound of the 95% credible interval, we believe with high certainty that the "true upvote ratio" is at the very least equal to this value (or greater), thereby ensuring that the best submissions are still on top. Under this ordering, we impose the following very natural properties:\n",
680+
"Why is sorting based on this quantity a good idea? By ordering by the 95% least plausible value, we are being the most conservative with what we think is best. When using the lower-bound of the 95% credible interval, we believe with high certainty that the 'true upvote ratio' is at the very least equal to this value (or greater), thereby ensuring that the best submissions are still on top. Under this ordering, we impose the following very natural properties:\n",
704681
"\n",
705682
"1. given two submissions with the same observed upvote ratio, we will assign the submission with more votes as better (since we are more confident it has a higher ratio).\n",
706683
"2. given two submissions with the same number of votes, we still assign the submission with more upvotes as *better*.\n",
@@ -723,9 +700,7 @@ Why is sorting based on this quantity a good idea? By ordering by the 95% least
723700
{
724701
"cell_type": "code",
725702
"execution_count": 41,
726-
"metadata": {
727-
"collapsed": false
728-
},
703+
"metadata": {},
729704
"outputs": [
730705
{
731706
"name": "stdout",
@@ -870,9 +845,7 @@ Why is sorting based on this quantity a good idea? By ordering by the 95% least
870845
{
871846
"cell_type": "code",
872847
"execution_count": 42,
873-
"metadata": {
874-
"collapsed": false
875-
},
848+
"metadata": {},
876849
"outputs": [
877850
{
878851
"data": {
@@ -986,9 +959,7 @@ Why is sorting based on this quantity a good idea? By ordering by the 95% least
986959
{
987960
"cell_type": "code",
988961
"execution_count": 43,
989-
"metadata": {
990-
"collapsed": false
991-
},
962+
"metadata": {},
992963
"outputs": [],
993964
"source": [
994965
"# Enter code here\n",
@@ -1066,9 +1037,7 @@ Why is sorting based on this quantity a good idea? By ordering by the 95% least
10661037
{
10671038
"cell_type": "code",
10681039
"execution_count": 1,
1069-
"metadata": {
1070-
"collapsed": false
1071-
},
1040+
"metadata": {},
10721041
"outputs": [
10731042
{
10741043
"data": {
@@ -1183,9 +1152,9 @@ Why is sorting based on this quantity a good idea? By ordering by the 95% least
11831152
"metadata": {
11841153
"anaconda-cloud": {},
11851154
"kernelspec": {
1186-
"display_name": "Python [conda env:bayes]",
1155+
"display_name": "Python 3",
11871156
"language": "python",
1188-
"name": "conda-env-bayes-py"
1157+
"name": "python3"
11891158
},
11901159
"language_info": {
11911160
"codemirror_mode": {
@@ -1197,9 +1166,9 @@ Why is sorting based on this quantity a good idea? By ordering by the 95% least
11971166
"name": "python",
11981167
"nbconvert_exporter": "python",
11991168
"pygments_lexer": "ipython3",
1200-
"version": "3.5.2"
1169+
"version": "3.6.2"
12011170
}
12021171
},
12031172
"nbformat": 4,
1204-
"nbformat_minor": 0
1173+
"nbformat_minor": 1
12051174
}

Chapter4_TheGreatestTheoremNeverTold/Ch4_LawOfLargeNumbers_PyMC3.ipynb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -712,7 +712,7 @@
712712
"source": [
713713
"The best submissions, according to our procedure, are the submissions that are *most-likely* to score a high percentage of upvotes. Visually those are the submissions with the 95% least plausible value close to 1.\n",
714714
"\n",
715-
"Why is sorting based on this quantity a good idea? By ordering by the 95% least plausible value, we are being the most conservative with what we think is best. When using the lower-bound of the 95% credible interval, we believe with high certainty that the "true upvote ratio" is at the very least equal to this value (or greater), thereby ensuring that the best submissions are still on top. Under this ordering, we impose the following very natural properties:\n",
715+
"Why is sorting based on this quantity a good idea? By ordering by the 95% least plausible value, we are being the most conservative with what we think is best. When using the lower-bound of the 95% credible interval, we believe with high certainty that the 'true upvote ratio' is at the very least equal to this value (or greater), thereby ensuring that the best submissions are still on top. Under this ordering, we impose the following very natural properties:\n",
716716
"\n",
717717
"1. given two submissions with the same observed upvote ratio, we will assign the submission with more votes as better (since we are more confident it has a higher ratio).\n",
718718
"2. given two submissions with the same number of votes, we still assign the submission with more upvotes as *better*.\n",

0 commit comments

Comments
 (0)