-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlsopt_tree.h
1563 lines (1053 loc) · 50.6 KB
/
lsopt_tree.h
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
/*
* lsopt_tree.h
* fast-opt
*
*
*/
/* The MIT License
Copyright (c) 2012 John C. Mu.
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#ifndef LSOPT_TREE_H
#define LSOPT_TREE_H
#include "stl.h"
#include "general_utils.h"
#include "opt_utils.h"
#include "gamma_table.h"
#include "opt_tree.h"
struct ls_tree_node_sparse{
float lphi; // this is also the density if MAP tree
float lphi_cut;
int count; // number of points in this region
int num_visits;
void init(){
num_visits = 0;
count = -1;
lphi = -c::inf;
lphi_cut = -c::inf;
}
ls_tree_node_sparse() {
init();
}
ls_tree_node_sparse(int a) {
init();
}
double get_lphi_unif(int depth){
if(count >= 0){
return (count * depth * c::l2) - c::l2;
}else{
return -c::inf;
}
}
double get_lphi2(int depth) {
if(!isinf(lphi))return lphi;
else return get_lphi_unif(depth)+c::l2;
}
double get_lphi3(int depth) {
if(!isinf(lphi))return lphi;
else return logsumexp(lphi_cut,get_lphi_unif(depth));
}
};
struct ls_working_unit_t{
vector<vector<double> > data;
current_region curr_reg;
opt_region working_reg;
uint32_t node_idx;
ls_working_unit_t(int num_children){
curr_reg.init(num_children);
working_reg.init(num_children);
node_idx = c::ra_null_val;
}
ls_working_unit_t(vector<vector<double> > &data, current_region &curr_reg
, opt_region &working_reg, uint32_t node_idx){
this->data = data;
this->curr_reg = curr_reg;
this->working_reg = working_reg;
this->node_idx = node_idx;
}
};
struct ls_pile_t{
vector<ls_working_unit_t> good_regions;
vector<uint32_t> map_nodes;
};
struct mouse_params_t{
int start_dimension;
int top_depth;
int num_children;
int count_lim;
int top_count_lim;
int max_depth;
int lookahead_max_depth;
ls_working_unit_t* wup;
opt_region_hash<uint32_t>* region_cache;
gamma_table *gt;
region_allocator<ls_tree_node_sparse> *ra;
int64_t *num_nodes;
int64_t *num_zero_nodes;
pthread_mutex_t* locker;
};
class lsopt_tree{
private:
region_allocator<ls_tree_node_sparse> ra;
uint32_t root;
int num_children;
double count_ratio;
double top_count_ratio;
int max_depth;
int lookahead_max_depth;
void init(int num_children, double count_ratio, double top_count_ratio, int lookahead_max_depth,int max_depth) {
this->num_children = num_children;
pair<uint32_t,ls_tree_node_sparse*> out = ra.create_node(num_children);
root = out.first;
this->count_ratio = count_ratio;
this->top_count_ratio = top_count_ratio;
this->max_depth = max_depth;
this->lookahead_max_depth = lookahead_max_depth;
}
public:
lsopt_tree(int num_children, double count_ratio,double top_count_ratio, int lookahead_max_depth, int max_depth) {
init(num_children, count_ratio, top_count_ratio, lookahead_max_depth, max_depth);
}
lsopt_tree(int num_children) {
init(num_children, 0.01, 0.001 , 10, 100);
}
void store_region(uint32_t map_node, opt_region_hash<uint32_t> &map_regions,
region_allocator<map_tree_node> *map_ra,opt_region &working_reg, int count, int depth){
map_regions.insert(working_reg, map_node);
(*map_ra)[map_node]->set_area(-depth);
(*map_ra)[map_node]->set_count(count);
}
static uint32_t get_child(opt_region working_reg, opt_region_hash<uint32_t> ®ion_cache,
int dim, int cut){
return get_child(working_reg, region_cache,dim, cut, false);
}
static uint32_t get_child(opt_region working_reg, opt_region_hash<uint32_t> ®ion_cache,
int dim, int cut, bool debug){
if(debug){
cerr << "before reg:";
working_reg.print_region();
cerr << '\n';
}
if(!working_reg.cut(dim,cut)){
cerr << "CANNOT CUT: ";
working_reg.print_region();
cerr << '\n';
exit(2);
}
if(debug){
cerr << "after reg:";
working_reg.print_region();
cerr << '\n';
}
pair<uint32_t,bool> out = region_cache.find(working_reg);
if(debug){
cerr << out.first << ',' << out.second << '\n';
}
if(out.second){
return out.first;
}else{
return c::ra_null_val;
}
}
static void compute_approx_lphi_cut(region_allocator<ls_tree_node_sparse> &ra,opt_region &working_reg,
opt_region_hash<uint32_t> ®ion_cache,
uint32_t curr_node, int depth, gamma_table >, int calling_loc,
vector<vector<double> > &data, current_region &curr_reg, int num_children){
//cerr << "compute_approx_lphi_cut(" << depth << ")["<< ra[curr_node]->count << "]: ";
//working_reg.print_region(cerr);
//cerr << '\n';
vector<double> lphi_list;
double max_val = -c::inf;
double ld = -log(num_children) - c::lpi - c::l2;
//cerr << "ld: " << ld << '\n';
for (int i = 0; i < num_children; i++) {
// get the child ids
uint32_t child_id[2];
child_id[0] = get_child(working_reg, region_cache,i,0);
child_id[1] = get_child(working_reg, region_cache,i,1);
// check for null
for (int f = 0; f < c::cuts; f++) {
if (child_id[f] == c::ra_null_val) {
cerr << "a(" << calling_loc << ")NULL child!!! " << f << "|" << i << ',' << depth << "|"
<< child_id[0] << "," << child_id[1] << '\n';
cerr << "curr_count: " << ra[curr_node]->count << '\n';
for (int j = 0; j < num_children; j++) {
cerr << "child(" << j << "): "
<< get_child(working_reg, region_cache, j, 0) << ","
<< get_child(working_reg, region_cache, j, 1) << "\n";
}
cerr << "reg: ";
working_reg.print_region(cerr);
cerr << '\n';
exit(2);
}
}
int child_1_count = ra[child_id[0]]->count;
int child_2_count = ra[child_id[1]]->count;
if (child_1_count < 0 || child_2_count < 0) {
cerr << "aneg count!!! " << i << ',' << depth << '\n';
exit(2);
}
//cerr << i << ":" << child_1_count << ',' << child_2_count << '\n';
double val = ld;
for (int x = 0; x < 2; x++) {
if (isinf(ra[child_id[x]]->lphi)) {
if (isinf(ra[child_id[x]]->lphi_cut)) {
//cerr << "unif: "<< ra[child_id[x]]->get_lphi_unif(depth+1) + c::l2 << "\n";
val += ra[child_id[x]]->get_lphi_unif(depth+1) + c::l2;
} else {
// this is approximate
//cerr << "cut: " << logsumexp(ra[child_id[x]]->lphi_cut
// , ra[child_id[x]]->get_lphi_unif(depth+1)) << "\n";
val += logsumexp(ra[child_id[x]]->lphi_cut
, ra[child_id[x]]->get_lphi_unif(depth+1));
}
} else {
//cerr << "found: " << ra[child_id[x]]->lphi <<"\n";
val += ra[child_id[x]]->lphi;
}
}
val += gt.compute_lD2(ra[curr_node]->count, child_1_count, child_2_count);
//cerr << "gt: " << gt.compute_lD2(ra[curr_node]->count, child_1_count, child_2_count) << '\n';
//cerr << "val: " << val << '\n';
lphi_list.push_back(val);
if (val > max_val) {
max_val = val;
}
}
double lphi_cut = max_val;
double sum = 0;
for (int i = 0; i < num_children; i++) {
sum += exp(lphi_list[i] - max_val);
}
if (sum > 0) lphi_cut += log(sum);
ra[curr_node]->lphi_cut = lphi_cut;
//cerr << "lphi_cut: " << lphi_cut << '\n';
}
static void compute_lphi(region_allocator<ls_tree_node_sparse> &ra,opt_region &working_reg,
opt_region_hash<uint32_t> ®ion_cache,
uint32_t curr_node, int depth, gamma_table >, int calling_loc,
vector<vector<double> > &data, current_region &curr_reg, int num_children) {
//cerr << "compute_lphi(" << depth << "): ";
//working_reg.print_region(cerr);
//cerr << '\n';
vector<double> lphi_list;
double max_val = (ra[curr_node]->count * depth * c::l2) - c::l2;
lphi_list.push_back(max_val);
//cerr << "max_val: " << max_val << '\n';
double ld = -log(num_children) - c::lpi - c::l2;
//cerr << "ld: " << ld << '\n';
for (int i = 0; i < num_children; i++) {
uint32_t child_id[2];
child_id[0] = get_child(working_reg, region_cache,i,0);
child_id[1] = get_child(working_reg, region_cache,i,1);
// check for null
for (int f = 0; f < c::cuts; f++) {
if (child_id[f] == c::ra_null_val) {
cerr << "(" << calling_loc << ")fully NULL child!!! " << f << "|" << i << ',' << depth << "|"
<< child_id[0] << "," << child_id[1] << '\n';
cerr << "curr_count: " << ra[curr_node]->count << '\n';
for (int j = 0; j < num_children; j++) {
cerr << "child(" << j << "): "
<< get_child(working_reg, region_cache, j, 0) << ","
<< get_child(working_reg, region_cache, j, 1) << "\n";
}
cerr << "reg: ";
working_reg.print_region(cerr);
cerr << '\n';
exit(2);
}
}
int child_1_count = ra[child_id[0]]->count;
int child_2_count = ra[child_id[1]]->count;
if (child_1_count < 0 || child_2_count < 0) {
cerr << "neg count!!! " << i << ',' << depth << '\n';
exit(2);
}
//cerr << i << ":" << child_1_count << ',' << child_2_count << '\n';
double val = ld;
val += ra[child_id[0]]->get_lphi2(depth + 1);
val += ra[child_id[1]]->get_lphi2(depth + 1);
val += gt.compute_lD2(ra[curr_node]->count, child_1_count, child_2_count);
//cerr << "val: " << val << '\n';
lphi_list.push_back(val);
if (val > max_val) {
max_val = val;
}
}
double lphi = max_val;
double sum = 0;
for (int i = 0; i < (num_children + 1); i++) {
sum += exp(lphi_list[i] - max_val);
}
if (sum > 0) lphi += log(sum);
ra[curr_node]->lphi = lphi;
//cerr << "lphi: " << lphi << '\n';
}
/*
void propagate_lphi(ls_working_unit_t &w,
opt_region_hash<uint32_t> ®ion_cache,gamma_table >, int start_depth, int N) {
vector<pile_t<uint32_t> > pile;
pile.push_back(pile_t<uint32_t>());
pile[0].data = vector<vector<double> >(); // should not need any data
pile[0].node = w.node_idx;
pile[0].dim = 0;
pile[0].cut = 0;
opt_region working_reg = w.working_reg;
current_region curr_reg = w.curr_reg;
int count_lim = (int)floor(N*count_ratio);
if(count_lim < 1) count_lim = 1;
int depth = 0;
bool done = false;
while (!done) {
if (pile.size() == 0) {
done = true;
continue;
}
#ifdef DEBUG3
// print the pile
cerr << "@@@---- dp:" << depth+start_depth << " , ps:" << pile.size() << " ---\n";
//cerr << "REG: ";
//working_reg.print_region(cerr);
cerr << '\n';
//for (int i = 0; i < (int) pile.size(); i++) {
//cerr << "Data size: " << pile[i].data.size() << '\n';
// cerr << "Dim: " << pile[i].dim << '\n';
// cerr << "Cut: " << pile[i].cut << '\n';
//if (ra[pile[i].node]->get_child(pile[i].dim, pile[i].cut) != c::ra_null_val) {
// cerr << "Child lphi: " << ra[ra[pile[i].node]->get_child(pile[i].dim, pile[i].cut)]->get_lphi3(depth+start_depth) << '\n';
//}
//if(pile[i].data.size()<20){
// print_data(pile[i].data);
//}
//}
#endif
int curr_dim = pile[depth].dim;
int curr_cut = pile[depth].cut;
uint32_t curr_node = pile[depth].node;
//cerr << "curr_dim: " << curr_dim << "| curr_cut: "<< curr_cut << '\n';
// work out what to count
bool back_up = false;
#ifdef DEBUG3
if (ra[curr_node]->get_child(curr_dim, curr_cut) != NULL) {
cerr << "@Child lphi: " << ra[curr_node]->get_child(curr_dim, curr_cut)->get_lphi() << '\n';
} else {
cerr << "@NULL node " << curr_dim << "," << curr_cut << " \n";
}
#endif
if(curr_dim >= num_children){
// reached the end of node
//cerr << "BACKUPEND\n";
back_up = true;
//cerr << "prev-lphicut: " << ra[curr_node]->lphi_cut << '\n';
compute_approx_lphi_cut(working_reg, region_cache,curr_node,
depth+start_depth,gt,0,pile[depth].data,curr_reg); // last two params are wrong
#ifdef DEBUG3
cerr << "LPHI---- " << depth+start_depth << " , " << pile.size() << " ---\n";
cerr << "REG: ";
working_reg.print_region(cerr);
cerr << '\n';
//cerr << num_nodes << " : " << num_zero_nodes << '\n';
cerr << "lphicut: " << ra[curr_node]->lphi_cut << '\n';
cerr << "lphi: " << ra[curr_node]->get_lphi3(depth+start_depth)
<< "," << ra[curr_node]->get_lphi_unif(depth+start_depth)<< '\n';
//for (int i = 0; i < (int) pile.size(); i++) {
// cerr << "Data size: " << pile[i].data.size() << '\n';
// cerr << "Dim: " << pile[i].dim << '\n';
// cerr << "Cut: " << pile[i].cut << '\n';
//if(pile[i].data.size()<20){
// print_data(pile[i].data);
//}
//}
cerr << "BACKUP CHILD\n";
#endif
}
// check if current node is leaf or at end
if (get_child(working_reg, region_cache,0, 0) == c::ra_null_val||
!isinf(ra[curr_node]->lphi) ||
ra[curr_node]->count <= count_lim || depth+start_depth >= max_depth) {
// back up
back_up = true;
#ifdef DEBUG3
cerr << "BACKUP ZERO\n";
#endif
}
if (back_up) {
depth--;
pile.pop_back();
if (depth < 0) continue;
//cerr << depth << " bUNCUT: " << curr_dim << '\n';
working_reg.uncut(pile[depth].dim);
if (pile[depth].cut < c::cuts - 1) {
pile[depth].cut++;
} else{
pile[depth].dim++;
pile[depth].cut = 0;
}
continue;
}
curr_dim = pile[depth].dim;
curr_cut = pile[depth].cut;
// do the counting
uint32_t new_node = get_child(working_reg, region_cache,curr_dim, curr_cut);
//cerr << "CUT: " << curr_dim << "," << curr_cut << '\n';
working_reg.cut(curr_dim, curr_cut);
//uint32_t working_hash = region_cache.hash(working_reg);
#ifdef DEBUG
cerr << "working_hash: " << working_hash << '\n';
#endif
#ifdef DEBUG3
cerr << "FOUND node: " << curr_dim << "," << curr_cut << '\n';
cerr << "new lphi: " << new_node->get_lphi() << '\n';
cerr << "new count: " << new_node->get_count() << '\n';
#endif
//uint32_t new_node = ra[curr_node]->get_child(curr_dim, curr_cut);
pile.push_back(pile_t<uint32_t > ());
depth++;
pile[depth].dim = 0;
pile[depth].cut = 0;
pile[depth].node = new_node;
}
}
*/
static void* iteration_thread(void* params) {
mouse_params_t* p = (mouse_params_t*)params;
int start_dimension = p->start_dimension;
int top_depth = p->top_depth;
int num_children = p->num_children;
int count_lim = p->count_lim;
int top_count_lim = p->top_count_lim;
int max_depth = p->max_depth;
int lookahead_max_depth = p->lookahead_max_depth;
ls_working_unit_t* wup = p->wup;
opt_region_hash<uint32_t>* region_cache = p->region_cache;
gamma_table *gt = p->gt;
region_allocator<ls_tree_node_sparse> *ra = p->ra;
int64_t *num_nodes = p->num_nodes;
int64_t *num_zero_nodes = p->num_zero_nodes;
pthread_mutex_t* locker = p->locker;
MT_random rand_gen;
vector<pile_t<uint32_t,vector<double> > > pile;
pile.push_back(pile_t<uint32_t,vector<double> > ());
pile[0].node = wup->node_idx;
pile[0].dim = start_dimension;
pile[0].cut = 0;
pile[0].data = wup->data;
bool first_cut = false; // we choose the first dimension to cut.
current_region curr_reg = wup->curr_reg;
opt_region working_reg = wup->working_reg;
vector<double> curr_dim_score(num_children, -1.0);
bool done = false;
int depth = 0;
// iterate with a binary tree until bottom
//cerr << "!!!----dimension" << start_d << "\n";
while (!done) {
if (pile.size() == 0) {
done = true;
continue;
}
int curr_dim = pile[depth].dim;
int curr_cut = pile[depth].cut;
uint32_t curr_node_idx = pile[depth].node;
pthread_mutex_lock(locker);
ls_tree_node_sparse curr_node = *((*ra)[curr_node_idx]);
pthread_mutex_unlock(locker);
bool backup = false;
//cerr << "----\nDEPTH: " << (depth + top_depth) << " count: "<< curr_node.count << '\n';
if (curr_node.count <= count_lim
|| (depth +top_depth) >= max_depth
|| depth >= lookahead_max_depth
|| working_reg.full()) {
//cerr << "BOTTOM BACKUP\n";
backup = true;
} else if (first_cut && curr_dim >= 0) {
if (curr_cut < c::cuts - 1) {
curr_cut++;
pile[depth].cut++;
} else {
//cerr << "CUTALL BACKUP\n";
backup = true;
}
}
if (!backup && !first_cut) {
for (int f = 0; f < 2; f++) {
pthread_mutex_lock(locker);
uint32_t child = get_child(working_reg, *(region_cache), start_dimension, f);
pthread_mutex_unlock(locker);
//uint32_t child = ra[curr_node]->get_child(d, f);
if (child == c::ra_null_val) {
// count it
working_reg.cut(start_dimension, f);
uint32_t working_hash = region_cache->hash(working_reg);
pthread_mutex_lock(locker);
pair<uint32_t, bool> new_node = region_cache->find(working_reg, working_hash);
pthread_mutex_unlock(locker);
//int curr_count = 0;
if (!new_node.second) {
int curr_count = count_region(pile[depth].data, start_dimension
, f, curr_reg.get_lim(start_dimension));
// MUTEX
pthread_mutex_lock(locker);
pair<uint32_t, ls_tree_node_sparse*> out = ra->create_node();
new_node.first = out.first;
out.second->count = curr_count;
(*num_nodes)++;
if (curr_count <= count_lim)(*num_zero_nodes)++;
region_cache->insert(working_reg, new_node.first, working_hash);
// END MUTEX
pthread_mutex_unlock(locker);
}
working_reg.uncut(start_dimension);
}
}
}
// work out which dimension to cut
if (!backup && curr_dim < 0) { // if we have not chosen a dimension yet.
bool any_good = false;
for (int d = 0; !backup && (d < num_children); d++) {
double child_lphi_unif[2] = {-1.0, -1.0};
double child_lphi_cut[2] = {-1.0, -1.0};
int child_lphi_count[2] = {-1, -1};
int child_visit_count[2] = {0, 0};
bool computed = true;
for (int f = 0; f < 2; f++) {
pthread_mutex_lock(locker);
uint32_t child = get_child(working_reg, *region_cache, d, f);
pthread_mutex_unlock(locker);
//uint32_t child = ra[curr_node]->get_child(d, f);
if (child == c::ra_null_val) {
// count it
working_reg.cut(d, f);
uint32_t working_hash = region_cache->hash(working_reg);
pthread_mutex_lock(locker);
pair<uint32_t, bool> new_node = region_cache->find(working_reg, working_hash);
pthread_mutex_unlock(locker);
ls_tree_node_sparse* childp;
int curr_count = 0;
if (!new_node.second) {
curr_count = count_region(pile[depth].data, d, f, curr_reg.get_lim(d));
//cerr << "curr_count: " << curr_count << '\n';
// MUTEX
pthread_mutex_lock(locker);
pair<uint32_t, ls_tree_node_sparse*> out = ra->create_node();
new_node.first = out.first;
out.second->count = curr_count;
computed = false;
(*num_nodes)++;
if (curr_count <= count_lim)(*num_zero_nodes)++;
region_cache->insert(working_reg, new_node.first, working_hash);
childp = out.second;
// END MUTEX
pthread_mutex_unlock(locker);
//cerr << "New ";
} else {
pthread_mutex_lock(locker);
childp = (*ra)[new_node.first];
pthread_mutex_unlock(locker);
//cerr << "Old ";
}
//cerr << "wr: ";
//working_reg.print_region(cerr);
//cerr << " = " << curr_count << ":" << ra[new_node.first]->count << '\n';
//ra[curr_node]->set_child(d, f, new_node.first);
curr_count = childp->count;
child_lphi_unif[f] = childp->get_lphi_unif((depth + top_depth) + 1);
if (isinf(childp->lphi_cut)) {
child_lphi_cut[f] = child_lphi_unif[f];
} else {
child_lphi_cut[f] = childp->lphi_cut;
}
child_lphi_count[f] = childp->count;
child_visit_count[f] = childp->num_visits;
// uncut for next loop
working_reg.uncut(d);
} else {
pthread_mutex_lock(locker);
ls_tree_node_sparse* childp = (*ra)[child];
pthread_mutex_unlock(locker);
if (isinf(childp->lphi)) {
if (childp->count > count_lim
&& (depth + top_depth) < max_depth
&& depth < lookahead_max_depth) {
computed = false;
}
}
child_lphi_unif[f] = childp->get_lphi_unif((depth + top_depth) + 1);
if (isinf(childp->lphi_cut)) {
child_lphi_cut[f] = child_lphi_unif[f];
} else {
child_lphi_cut[f] = childp->lphi_cut;
}
child_lphi_count[f] = childp->count;
child_visit_count[f] = childp->num_visits;
}
}
if (computed)curr_dim_score[d] = -c::inf; // already done
else {
//curr_dim_score[d] = gt.compute_lD2(curr_node->get_count(),child_count[0],child_count[1]);
curr_dim_score[d] =
gt->compute_lD2(curr_node.count, child_lphi_count[0], child_lphi_count[1])
+ logsumexp(child_lphi_cut[0], child_lphi_unif[0])
+ logsumexp(child_lphi_cut[1], child_lphi_unif[1])
- (min(child_visit_count[0]+child_visit_count[1],2)
*(1000.0 / ((depth + top_depth) + 1)));
//cerr << "curr_dim_score["<< curr_node.count
// <<" ]("<<child_lphi_count[0] << "/"<<child_lphi_count[1] << ") "
// <<"{" << child_visit_count[0] << "," << child_visit_count[1] << "}"
// << d << ": " << curr_dim_score[d] << '\n';
any_good = true;
}
//cerr << "?curr_dim_score " << d << ": " << curr_dim_score[d] << '\n';
}
if (!any_good) {
//done = true;
//continue;
//cerr << "ALLGOOD BACKUP\n";
backup = true;
} else {
double total = logsumexp(curr_dim_score);
//cerr << "total: " << total << '\n';
for (int d = 0; d < num_children; d++) {
//curr_dim_score[d] = 1 / (total - curr_dim_score[d]) + (1 / ((double) num_children * sqrt(i + 1)));
if (!isinf(curr_dim_score[d])){
curr_dim_score[d] = (1 / (1+log(total - curr_dim_score[d] + 1)))
+ (1 / ((double) num_children));
}else{
curr_dim_score[d] = 0;
}
//curr_dim_score[d] = (1 / (total - curr_dim_score[d])) + (1 / ((double) ((depth + start_depth)+1) * sqrt(i + 1)));
//cerr << "#curr_dim_score " << d << ": " << curr_dim_score[d] << '\n';
}
curr_dim = choose_dim(curr_dim_score, rand_gen);
pile[depth].dim = curr_dim;
//cerr << "choice " << curr_dim << "\n";
}
}
first_cut = true;
//cerr << "curr_dim: " << curr_dim << ", curr_cut" << curr_cut << '\n';
//cerr << "reg: ";
//working_reg.print_region(cerr);
//cerr << '\n';
bool is_diff = true;
if(!backup){
pile.push_back(pile_t<uint32_t,vector<double> > ());
depth++;
is_diff = cut_region(pile[depth - 1].data, pile[depth].data,
curr_dim, curr_cut, curr_reg.get_lim(curr_dim));
if(is_diff) {
curr_reg.cut(curr_dim, curr_cut);
working_reg.cut(curr_dim, curr_cut);
pile[depth].dim = -1;
pile[depth].cut = 0;
int curr_count = pile[depth].data.size();
uint32_t working_hash = region_cache->hash(working_reg);
pthread_mutex_lock(locker);
pair<uint32_t, bool> new_node = region_cache->find(working_reg, working_hash);
pthread_mutex_unlock(locker);
if (!new_node.second) {
//cerr << "not found: "<< curr_count <<"\n";
// MUTEX
pthread_mutex_lock(locker);
pair<uint32_t, ls_tree_node_sparse*> out = ra->create_node(num_children);
new_node.first = out.first;
out.second->count = curr_count;
region_cache->insert(working_reg, new_node.first, working_hash);
(*num_nodes)++;
if ((*ra)[new_node.first]->count <= count_lim)(*num_zero_nodes)++;
pile[depth].node = new_node.first;
// UNMUTEX
pthread_mutex_unlock(locker);
} else {
#ifdef DEBUG
cerr << "found node(" << (*ra)[new_node.first]->count << "): " << curr_dim << "," << curr_cut << '\n';
#endif
//ra[curr_node]->set_child(curr_dim, curr_cut, new_node.first);
pile[depth].node = new_node.first;
//cerr << "fUNCUT: " << curr_dim << '\n';
}
} else {
// all same
pile.pop_back();
depth--;
}
}