-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathall-phd-thesis_bib.html
2663 lines (2428 loc) · 93.6 KB
/
all-phd-thesis_bib.html
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
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<title>all-phd-thesis.bib</title>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
<meta name="generator" content="bibtex2html">
</head>
<body>
<h1>all-phd-thesis.bib</h1><a name="Agrawal95"></a><pre>
@article{<a href="all-phd-thesis.html#Agrawal95">Agrawal95</a>,
author = {R. Agrawal},
journal = {{Advances in Applied Probability}},
number = {4},
pages = {1054--1078},
publisher = {{Cambridge University Press}},
title = {{Sample mean based index policies by $\mathcal{O}(\log n)$ regret for the Multi-Armed Bandit problem}},
volume = {27},
year = {1995}
}
</pre>
<a name="AlaturLevyKrause19"></a><pre>
@article{<a href="all-phd-thesis.html#AlaturLevyKrause19">AlaturLevyKrause19</a>,
author = {P. Alatur and K. Y. Levy and A. Krause},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1902.08036}{arXiv:1902.08036}}},
title = {{Multi-Player Bandits: The Adversarial Case}},
url = {https://arxiv.org/abs/1902.08036},
year = {2019}
}
</pre>
<a name="Allesiardo17"></a><pre>
@article{<a href="all-phd-thesis.html#Allesiardo17">Allesiardo17</a>,
author = {R. Allesiardo and R. F{\'e}raud and O.-A. Maillard},
journal = {{International Journal of Data Science and Analytics}},
number = {4},
pages = {267--283},
publisher = {Springer},
title = {{The Non-Stationary Stochastic Multi-Armed Bandit Problem}},
volume = {3},
year = {2017}
}
</pre>
<a name="Anandkumar11"></a><pre>
@article{<a href="all-phd-thesis.html#Anandkumar11">Anandkumar11</a>,
author = {A. Anandkumar and N. Michael and A. K. Tang and S. Agrawal},
journal = {Journal on Selected Areas in Communications},
number = {4},
pages = {731--745},
publisher = {IEEE},
title = {{Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret}},
volume = {29},
year = {2011}
}
</pre>
<a name="Anantharam87a"></a><pre>
@article{<a href="all-phd-thesis.html#Anantharam87a">Anantharam87a</a>,
author = {V. Anantharam and P. Varaiya and J. Walrand},
journal = {{Transactions on Automatic Control}},
number = {11},
pages = {968--976},
publisher = {IEEE},
title = {{Asymptotically efficient allocation rules for the Multi-Armed Bandit problem with multiple plays - Part I: IID rewards}},
volume = {32},
year = {1987}
}
</pre>
<a name="Anantharam87b"></a><pre>
@article{<a href="all-phd-thesis.html#Anantharam87b">Anantharam87b</a>,
author = {V. Anantharam and P. Varaiya and J. Walrand},
journal = {{Transactions on Automatic Control}},
number = {11},
pages = {977--982},
publisher = {IEEE},
title = {{Asymptotically efficient allocation rules for the Multi-Armed Bandit problem with multiple plays - Part II: Markovian rewards}},
volume = {32},
year = {1987}
}
</pre>
<a name="Arora2012multiplicative"></a><pre>
@article{<a href="all-phd-thesis.html#Arora2012multiplicative">Arora2012multiplicative</a>,
author = {S. Arora and E. Hazan and S. Kale},
journal = {Theory of Computing},
number = {1},
pages = {121--164},
publisher = {Theory of Computing Exchange},
title = {The Multiplicative Weights Update Method: a Meta-Algorithm and Applications},
volume = {8},
year = {2012}
}
</pre>
<a name="ArrowEnthoven61"></a><pre>
@article{<a href="all-phd-thesis.html#ArrowEnthoven61">ArrowEnthoven61</a>,
author = {K. J. Arrow and A. C. Enthoven},
journal = {Econometrica},
number = {4},
pages = {779--800},
publisher = {Wiley, Econometric Society},
title = {{Quasi-Concave Programming}},
volume = {29},
year = {1961}
}
</pre>
<a name="Auer02"></a><pre>
@article{<a href="all-phd-thesis.html#Auer02">Auer02</a>,
author = {P. Auer and N. Cesa-Bianchi and P. Fischer},
doi = {10.1023/A:1013689704352},
journal = {Machine Learning},
number = {2},
pages = {235--256},
title = {{Finite-time Analysis of the Multi-armed Bandit Problem}},
volume = {47},
year = {2002}
}
</pre>
<a name="Auer02NonStochastic"></a><pre>
@article{<a href="all-phd-thesis.html#Auer02NonStochastic">Auer02NonStochastic</a>,
author = {P. Auer and N. Cesa-Bianchi and Y. Freund and R. Schapire},
journal = {SIAM journal on computing},
number = {1},
pages = {48--77},
publisher = {SIAM},
title = {{The Non-Stochastic Multi-Armed Bandit Problem}},
volume = {32},
year = {2002}
}
</pre>
<a name="Auer10"></a><pre>
@article{<a href="all-phd-thesis.html#Auer10">Auer10</a>,
author = {P. Auer and R. Ortner},
journal = {Periodica Mathematica Hungarica},
number = {1-2},
pages = {55--65},
publisher = {Akad{\'e}miai Kiad{\'o}},
title = {{UCB Revisited: Improved Regret Bounds For The Stochastic Multi-Armed Bandit Problem}},
volume = {61},
year = {2010}
}
</pre>
<a name="AuerGajaneOrtner18"></a><pre>
@article{<a href="all-phd-thesis.html#AuerGajaneOrtner18">AuerGajaneOrtner18</a>,
author = {P. Auer and P. Gajane and R. Ortner},
journal = {European Workshop on Reinforcement Learning},
title = {{Adaptively Tracking the Best Arm with an Unknown Number of Distribution Changes}},
url = {https://ewrl.files.wordpress.com/2018/09/ewrl_14_2018_paper_28.pdf},
year = {2018}
}
</pre>
<a name="Avner15"></a><pre>
@article{<a href="all-phd-thesis.html#Avner15">Avner15</a>,
author = {O. Avner and S. Mannor},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1504.08167}{arXiv:1504.08167}}},
title = {{Learning to Coordinate Without Communication in Multi-User Multi-Armed Bandit Problems}},
url = {https://arxiv.org/abs/1504.08167},
year = {2015}
}
</pre>
<a name="AvnerMannor18"></a><pre>
@article{<a href="all-phd-thesis.html#AvnerMannor18">AvnerMannor18</a>,
author = {O. Avner and S. Mannor},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1808.04875}{arXiv:1808.04875}}},
title = {{Multi-User Communication Networks: A Coordinated Multi-Armed Bandit Approach}},
url = {https://arxiv.org/abs/1808.04875},
year = {2018}
}
</pre>
<a name="Baransi2014"></a><pre>
@article{<a href="all-phd-thesis.html#Baransi2014">Baransi2014</a>,
author = {A. Baransi and O.-A. Maillard and S. Mannor},
journal = {{Proceedings of the European Conference on Machine Learning}},
title = {{Sub-sampling for Multi-armed Bandits}},
url = {https://hal.archives-ouvertes.fr/hal-01025651},
year = {2014}
}
</pre>
<a name="Besson2019Gretsi"></a><pre>
@article{<a href="all-phd-thesis.html#Besson2019Gretsi">Besson2019Gretsi</a>,
author = {L. Besson and E. Kaufmann},
howpublished = {Online at: \texttt{\url{https://hal.archives-ouvertes.fr/hal-02152243}}. Code at: \texttt{\url{https://SMPyBandits.GitHub.io/NonStationary.html}}},
journal = {GRETSI},
month = {August},
note = {\texttt{\url{https://hal.archives-ouvertes.fr/hal-02152243}}},
pdf = {https://perso.crans.org/besson/articles/BK__GRETSI_2019.pdf},
title = {{Analyse non asymptotique d'un test séquentiel de détection de ruptures et application aux bandits non stationnaires}},
url = {https://hal.archives-ouvertes.fr/hal-02152243},
year = {2019}
}
</pre>
<a name="Bonnefoi18"></a><pre>
@article{<a href="all-phd-thesis.html#Bonnefoi18">Bonnefoi18</a>,
author = {R. Bonnefoi and C. Moy and J. Palicot},
doi = {10.1186/s13638-018-1044-2},
journal = {EURASIP Journal on Wireless Communications and Networking},
number = {1},
pages = {34},
title = {{Improvement of the LPWAN AMI backhaul's latency thanks to reinforcement learning algorithms}},
volume = {2018},
year = {2018}
}
</pre>
<a name="BoursierPerchet18"></a><pre>
@article{<a href="all-phd-thesis.html#BoursierPerchet18">BoursierPerchet18</a>,
author = {E. Boursier and V. Perchet},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1809.08151}{arXiv:1809.08151}}},
title = {{SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits}},
url = {https://arxiv.org/abs/1809.08151},
year = {2018}
}
</pre>
<a name="Bubeck12"></a><pre>
@article{<a href="all-phd-thesis.html#Bubeck12">Bubeck12</a>,
author = {S. Bubeck and N. Cesa-Bianchi},
journal = {{Foundations and Trends{\textregistered} in Machine Learning}},
number = {1},
pages = {1--122},
publisher = {Now Publishers, Inc.},
title = {{Regret Analysis of Stochastic and Non-Stochastic Multi-Armed Bandit Problems}},
volume = {5},
year = {2012}
}
</pre>
<a name="Burnetas96"></a><pre>
@article{<a href="all-phd-thesis.html#Burnetas96">Burnetas96</a>,
author = {A. N. Burnetas and M. N. Katehakis},
journal = {Advances in Applied Mathematics},
number = {2},
pages = {122--142},
publisher = {Elsevier},
title = {{Optimal Adaptive Policies for Sequential Allocation Problems}},
volume = {17},
year = {1996}
}
</pre>
<a name="Centenaro16"></a><pre>
@article{<a href="all-phd-thesis.html#Centenaro16">Centenaro16</a>,
author = {M. Centenaro and L. Vangelista and A. Zanella and M. Zorzi},
doi = {10.1109/MWC.2016.7721743},
journal = {Wireless Communications},
number = {5},
pages = {60--67},
publisher = {IEEE},
title = {Long-range communications in unlicensed bands: the rising stars in the {IoT} and smart city scenarios},
volume = {23},
year = {2016}
}
</pre>
<a name="Chapelleetal14Ad"></a><pre>
@article{<a href="all-phd-thesis.html#Chapelleetal14Ad">Chapelleetal14Ad</a>,
author = {O. Chapelle and E. Manavoglu and R. Rosales},
journal = {Transactions on Intelligent Systems and Technology},
title = {{Simple and Scalable Response Prediction For Display Advertising}},
year = {2014}
}
</pre>
<a name="Darak16"></a><pre>
@article{<a href="all-phd-thesis.html#Darak16">Darak16</a>,
author = {S. J. Darak and C. Moy and J. Palicot},
journal = {{EAI Endorsed Transactions on Cognitive Communications}},
pages = {1--10},
title = {{Proof-of-Concept System for Opportunistic Spectrum Access in Multi-user Decentralized Networks}},
volume = {2},
year = {2016}
}
</pre>
<a name="DarakHanawal18"></a><pre>
@article{<a href="all-phd-thesis.html#DarakHanawal18">DarakHanawal18</a>,
author = {S. J. Darak and M. K. Hanawal},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1812.11651}{arXiv:1812.11651}}},
title = {{Distributed Learning and Stable Orthogonalization in Ad-Hoc Networks with Heterogeneous Channels}},
url = {https://arxiv.org/abs/1812.11651},
year = {2018}
}
</pre>
<a name="GaBaVa18"></a><pre>
@article{<a href="all-phd-thesis.html#GaBaVa18">GaBaVa18</a>,
author = {G. Gautier and R. Bardenet and M. Valko},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1809.07258}{arXiv:1809.07258}}},
keywords = {Computer Science - Machine Learning, Computer Science - Mathematical Software, Statistics - Machine Learning},
note = {Code at \texttt{\url{https://github.com/guilgautier/DPPy}}. Documentation at \texttt{\url{https://dppy.readthedocs.io}}},
title = {{DPPy: Sampling Determinantal Point Processes with Python}},
url = {https://arxiv.org/abs/1809.07258},
year = {2018}
}
</pre>
<a name="Garivier16TrueShape"></a><pre>
@article{<a href="all-phd-thesis.html#Garivier16TrueShape">Garivier16TrueShape</a>,
author = {A. Garivier and P. M{\'e}nard and G. Stoltz},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1602.07182}{arXiv:1602.07182}}},
title = {{Explore First, Exploit Next: The True Shape of Regret in Bandit Problems}},
url = {https://arxiv.org/abs/1602.07182},
year = {2016}
}
</pre>
<a name="GarivierHadiji2018"></a><pre>
@article{<a href="all-phd-thesis.html#GarivierHadiji2018">GarivierHadiji2018</a>,
author = {A. Garivier and H. Hadiji and P. Menard and G. Stoltz},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1805.05071}{arXiv:1805.05071}}},
title = {{KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints}},
url = {https://arxiv.org/abs/1805.05071},
year = {2018}
}
</pre>
<a name="Haykin05"></a><pre>
@article{<a href="all-phd-thesis.html#Haykin05">Haykin05</a>,
author = {S. Haykin},
journal = {Journal on Selected Areas in Communications},
number = {2},
pages = {201--220},
publisher = {IEEE},
title = {{Cognitive Radio: Brain-Empowered Wireless Communications}},
volume = {23},
year = {2005}
}
</pre>
<a name="Hazan2016introduction"></a><pre>
@article{<a href="all-phd-thesis.html#Hazan2016introduction">Hazan2016introduction</a>,
author = {E. Hazan and others},
journal = {Foundations and Trends{\textregistered} in Optimization},
number = {3-4},
pages = {157--325},
publisher = {Now Publishers, Inc.},
title = {{Introduction to online convex optimization}},
volume = {2},
year = {2016}
}
</pre>
<a name="Honda2019"></a><pre>
@article{<a href="all-phd-thesis.html#Honda2019">Honda2019</a>,
author = {J. Honda},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1903.07839}{arXiv:1903.07839}}},
title = {{A Note on KL-UCB+ Policy for the Stochastic Bandit}},
url = {https://arxiv.org/abs/1903.07839},
year = {2019}
}
</pre>
<a name="Jouini12"></a><pre>
@article{<a href="all-phd-thesis.html#Jouini12">Jouini12</a>,
author = {W. Jouini and C. Moy and J. Palicot},
journal = {{EURASIP Journal on Wireless Communications and Networking}},
number = {1},
publisher = {Springer},
title = {{Decision Making for Cognitive Radio Equipment: Analysis of the First 10 Years of Exploration}},
volume = {2012},
year = {2012}
}
</pre>
<a name="KK18Martingales"></a><pre>
@article{<a href="all-phd-thesis.html#KK18Martingales">KK18Martingales</a>,
author = {E. Kaufmann and W. M. Koolen},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1811.11419}{arXiv:1811.11419}}},
title = {{Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals}},
url = {https://arXiv.org/abs/1811.11419},
year = {2018}
}
</pre>
<a name="KLUCBJournal"></a><pre>
@article{<a href="all-phd-thesis.html#KLUCBJournal">KLUCBJournal</a>,
author = {O. Capp{\'e} and A. Garivier and O.-A. Maillard and R. Munos and G. Stoltz},
journal = {Annals of Statistics},
pages = {1516--1541},
title = {{Kullback-Leibler Upper Confidence Bounds For Optimal Sequential Allocation}},
volume = {41(3)},
year = {2013}
}
</pre>
<a name="Kaufmann17"></a><pre>
@article{<a href="all-phd-thesis.html#Kaufmann17">Kaufmann17</a>,
author = {E. Kaufmann and A. Garivier},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1702.00001}{arXiv:1702.00001}}},
title = {{Learning The Distribution With Largest Mean: Two Bandit Frameworks}},
url = {https://arxiv.org/abs/1702.00001},
year = {2017}
}
</pre>
<a name="KaufmannAbbas19"></a><pre>
@article{<a href="all-phd-thesis.html#KaufmannAbbas19">KaufmannAbbas19</a>,
author = {E. Kaufmann and A. Mehrabian},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1902.01239}{arXiv:1902.01239}}},
title = {{New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players}},
url = {https://arxiv.org/abs/1902.01239},
year = {2019}
}
</pre>
<a name="Keriven2018"></a><pre>
@article{<a href="all-phd-thesis.html#Keriven2018">Keriven2018</a>,
author = {N. Keriven and G. Damien and P. Iacopo},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1805.08061}{arXiv:1805.08061}}},
note = {Code at \texttt{\url{https://github.com/lightonai/newma}}},
title = {{NEWMA: a new method for scalable model-free online change-point detection}},
url = {https://arxiv.org/abs/1805.08061},
year = {2018}
}
</pre>
<a name="KimTewari2019"></a><pre>
@article{<a href="all-phd-thesis.html#KimTewari2019">KimTewari2019</a>,
author = {B. Kim and A. Tewari},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1902.00610}{arXiv:1902.00610}}},
title = {{On the Optimality of Perturbations in Stochastic and Adversarial Multi-Armed Bandit Problems}},
url = {https://arxiv.org/abs/1902.00610},
year = {2019}
}
</pre>
<a name="KullbackLeibler51"></a><pre>
@article{<a href="all-phd-thesis.html#KullbackLeibler51">KullbackLeibler51</a>,
author = {S. Kullback and R.A. Leibler},
journal = {The Annals of Mathematical Statistics},
number = {1},
pages = {79--86},
publisher = {JSTOR},
title = {{On Information and Sufficiency}},
volume = {22},
year = {1951}
}
</pre>
<a name="KumarDarak2019"></a><pre>
@article{<a href="all-phd-thesis.html#KumarDarak2019">KumarDarak2019</a>,
author = {R. Kumar and S. J. Darak and M. K. Hanawal and A. K. Sharma and R. K. Tripathi},
doi = {10.1109/LCOMM.2018.2890226},
issn = {1089-7798},
journal = {IEEE Communications Letters},
number = {2},
pages = {362--365},
title = {{Distributed Algorithm for Learning to Coordinate in Infrastructure-Less Network}},
volume = {23},
year = {2019}
}
</pre>
<a name="LaiRobbins85"></a><pre>
@article{<a href="all-phd-thesis.html#LaiRobbins85">LaiRobbins85</a>,
author = {T. L. Lai and H. Robbins},
journal = {{Advances in Applied Mathematics}},
number = {1},
pages = {4--22},
title = {{Asymptotically Efficient Adaptive Allocation Rules}},
volume = {6},
year = {1985}
}
</pre>
<a name="LaiXing10"></a><pre>
@article{<a href="all-phd-thesis.html#LaiXing10">LaiXing10</a>,
author = {T. L. Lai and H. Xing},
journal = {Sequential Analysis},
number = {2},
pages = {162--175},
title = {{Sequential change-point detection when the pre-and post-change parameters are unknown}},
volume = {29},
year = {2010}
}
</pre>
<a name="Lattimore16b"></a><pre>
@article{<a href="all-phd-thesis.html#Lattimore16b">Lattimore16b</a>,
author = {T. Lattimore},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1603.08661}{arXiv:1603.08661}}},
title = {{Regret Analysis of the Anytime Optimally Confident UCB Algorithm}},
url = {https://arxiv.org/abs/1603.08661},
year = {2016}
}
</pre>
<a name="Lattimore2018refining"></a><pre>
@article{<a href="all-phd-thesis.html#Lattimore2018refining">Lattimore2018refining</a>,
author = {T. Lattimore},
journal = {The Journal of Machine Learning Research},
number = {1},
pages = {765--796},
publisher = {JMLR. org},
title = {{Refining the confidence level for optimistic bandit strategies}},
volume = {19},
year = {2018}
}
</pre>
<a name="LiJamieson2018"></a><pre>
@article{<a href="all-phd-thesis.html#LiJamieson2018">LiJamieson2018</a>,
author = {L. Li and K. Jamieson},
journal = {Journal of Machine Learning Research},
pages = {1--52},
title = {{Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization}},
url = {https://arxiv.org/abs/1603.06560},
volume = {18},
year = {2018}
}
</pre>
<a name="Luedtke16"></a><pre>
@article{<a href="all-phd-thesis.html#Luedtke16">Luedtke16</a>,
arxiv = {{arXiv preprint \href{https://arXiv.org/abs/1606.09388}{arXiv:1606.09388}}},
author = {A. Luedtke and E. Kaufmann and A. Chambaz},
journal = {Machine Learning},
oldtitle = {{Asymptotically Optimal Algorithms for Multiple Play Bandits with Partial Feedback}},
pages = {1--31},
publisher = {Springer},
title = {{Asymptotically Optimal Algorithms for Budgeted Multiple Play Bandits}},
url = {https://arxiv.org/abs/1606.09388},
year = {2017}
}
</pre>
<a name="Luenberger68"></a><pre>
@article{<a href="all-phd-thesis.html#Luenberger68">Luenberger68</a>,
author = {D. G. Luenberger},
journal = {SIAM Journal on Applied Mathematics},
number = {5},
pages = {1090--1095},
publisher = {SIAM},
title = {{Quasi-Convex Programming}},
volume = {16},
year = {1968}
}
</pre>
<a name="LugosiMehrabian18"></a><pre>
@article{<a href="all-phd-thesis.html#LugosiMehrabian18">LugosiMehrabian18</a>,
author = {G. Lugosi and A. Mehrabian},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1808.08416}{arXiv:1808.08416}}},
title = {Multiplayer Bandits Without Observing Collision Information},
url = {https://arxiv.org/abs/1808.08416},
year = {2018}
}
</pre>
<a name="Maghsudi16"></a><pre>
@article{<a href="all-phd-thesis.html#Maghsudi16">Maghsudi16</a>,
author = {S. Maghsudi and E. Hossain},
doi = {10.1109/MWC.2016.7498076},
journal = {Wireless Communications},
number = {3},
pages = {64--73},
publisher = {IEEE},
title = {{Multi-Armed Bandits with application to 5G small cells}},
volume = {23},
year = {2016}
}
</pre>
<a name="Melian15"></a><pre>
@article{<a href="all-phd-thesis.html#Melian15">Melian15</a>,
author = {L. Meli{\'a}n-Guti{\'e}rrez and N. Modi and C. Moy and F. Bader and I. P{\'e}rez-{\'A}lvarez and S. Zazo},
journal = {IEEE Transactions on Cognitive Communications and Networking},
number = {3},
pages = {347--358},
publisher = {IEEE},
title = {{Hybrid UCB-HMM: A Machine Learning Strategy for Cognitive Radio in HF Band}},
volume = {1},
year = {2015}
}
</pre>
<a name="Mitola99"></a><pre>
@article{<a href="all-phd-thesis.html#Mitola99">Mitola99</a>,
author = {J. Mitola and G. Q. Maguire},
journal = {{Personal Communications}},
number = {4},
pages = {13--18},
publisher = {IEEE},
title = {{Cognitive Radio: making software radios more personal}},
volume = {6},
year = {1999}
}
</pre>
<a name="Modi17QoS"></a><pre>
@article{<a href="all-phd-thesis.html#Modi17QoS">Modi17QoS</a>,
author = {N. Modi and P. Mary and C. Moy},
journal = {{Transactions on Cognitive Communications and Networking}},
number = {1},
pages = {49--66},
publisher = {IEEE},
title = {{QoS driven Channel Selection Algorithm for Cognitive Radio Network: Multi-User Multi-Armed Bandit Approach}},
volume = {3},
year = {2017}
}
</pre>
<a name="Nielsen11"></a><pre>
@article{<a href="all-phd-thesis.html#Nielsen11">Nielsen11</a>,
author = {F. Nielsen},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1102.2684}{arXiv:1102.2684}}},
title = {{Chernoff Information of Exponential Families}},
url = {https://arxiv.org/abs/1102.2684},
year = {2011}
}
</pre>
<a name="Patil2019stochastic"></a><pre>
@article{<a href="all-phd-thesis.html#Patil2019stochastic">Patil2019stochastic</a>,
author = {V. Patil and G. Ghalme and V. Nair and Y. Narahari},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1905.11260}{arXiv:1905.11260}}},
title = {{Stochastic Multi-Armed Bandits with Arm-specific Fairness Guarantees}},
url = {https://arxiv.org/abs/1905.11260},
year = {2019}
}
</pre>
<a name="Raza17"></a><pre>
@article{<a href="all-phd-thesis.html#Raza17">Raza17</a>,
author = {U. Raza and P. Kulkarni and M. Sooriyabandara},
doi = {10.1109/COMST.2017.2652320},
journal = {Communications Surveys Tutorials},
number = {2},
pages = {855--873},
publisher = {IEEE},
title = {{Low Power Wide Area Networks (LPWAN): An Overview}},
volume = {19},
year = {2017}
}
</pre>
<a name="Robbins52"></a><pre>
@article{<a href="all-phd-thesis.html#Robbins52">Robbins52</a>,
author = {H. Robbins},
journal = {{Bulletin of the American Mathematical Society}},
number = {5},
pages = {527--535},
title = {{Some Aspects of the Sequential Design of Experiments}},
volume = {58},
year = {1952}
}
</pre>
<a name="Roberts75"></a><pre>
@article{<a href="all-phd-thesis.html#Roberts75">Roberts75</a>,
author = {L. G. Roberts},
journal = {SIGCOMM Computer Communication Review},
number = {2},
pages = {28--42},
publisher = {ACM},
title = {{ALOHA Packet System With and Without Slots and Capture}},
volume = {5},
year = {1975}
}
</pre>
<a name="Seznec2018"></a><pre>
@article{<a href="all-phd-thesis.html#Seznec2018">Seznec2018</a>,
adress = {Naha, Japan},
author = {J. Seznec and A. Locatelli and A. Carpentier and A. Lazaric and M. Valko},
journal = {International Conference on Artificial Intelligence and Statistics},
title = {{Rotting Bandits Are No Harder Than Stochastic Ones}},
url = {https://arxiv.org/abs/1811.11043},
year = {2019}
}
</pre>
<a name="Singla17"></a><pre>
@article{<a href="all-phd-thesis.html#Singla17">Singla17</a>,
author = {S. Adish and H. Hassani and A. Krause},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1702.04825}{arXiv:1702.04825}}},
title = {{Learning to Use Learners' Advice}},
url = {https://arxiv.org/abs/1702.04825},
year = {2017}
}
</pre>
<a name="Slivkins2019"></a><pre>
@article{<a href="all-phd-thesis.html#Slivkins2019">Slivkins2019</a>,
author = {A. Slivkins},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1904.07272v3}{arXiv:1904.07272v3}}},
month = {June},
title = {{Introduction to Multi-Armed Bandits}},
url = {https://arxiv.org/abs/1904.07272v3},
year = {2019}
}
</pre>
<a name="Thompson33"></a><pre>
@article{<a href="all-phd-thesis.html#Thompson33">Thompson33</a>,
author = {W. R. Thompson},
journal = {{Biometrika}},
title = {{On the Likelihood that One Unknown Probability Exceeds Another in View of the Evidence of Two Samples}},
volume = {25},
year = {1933}
}
</pre>
<a name="TianWangWangSong2019"></a><pre>
@article{<a href="all-phd-thesis.html#TianWangWangSong2019">TianWangWangSong2019</a>,
author = {{Z. Tian and J. Wang and J. Wang and J. Song}},
doi = {10.1109/LWC.2019.2908371},
issn = {2162-2337},
journal = {{IEEE Wireless Communications Letters}},
number = {},
pages = {1--4},
title = {{Distributed NOMA-Based Multi-Armed Bandit Approach for Channel Access in Cognitive Radio Networks}},
volume = {},
year = {2019}
}
</pre>
<a name="Truzzi13"></a><pre>
@article{<a href="all-phd-thesis.html#Truzzi13">Truzzi13</a>,
author = {F. S. Truzzi and V. F. da Silva and A. H. Reali Costa and F. Gagliardi Cozman},
journal = {{ENIAC}},
number = {1},
title = {{AdBandit: a New Algorithm for Multi-Armed Bandits}},
volume = {2013},
year = {2013}
}
</pre>
<a name="Wald45"></a><pre>
@article{<a href="all-phd-thesis.html#Wald45">Wald45</a>,
author = {A. Wald},
journal = {The Annals of Mathematical Statistics},
number = {3},
pages = {287--293},
publisher = {Institute of Mathematical Statistics},
title = {{Some Generalizations of the Theory of Cumulative Sums of Random Variables}},
volume = {16},
year = {1945}
}
</pre>
<a name="Whittle1988"></a><pre>
@article{<a href="all-phd-thesis.html#Whittle1988">Whittle1988</a>,
author = {P. Whittle},
journal = {Journal of Applied Probability},
number = {A},
pages = {287--298},
publisher = {Cambridge University Press},
title = {{Restless bandits: Activity allocation in a changing world}},
volume = {25},
year = {1988}
}
</pre>
<a name="Wilhelmi19collaborative"></a><pre>
@article{<a href="all-phd-thesis.html#Wilhelmi19collaborative">Wilhelmi19collaborative</a>,
author = {F. Wilhelmi and C. Cano and G. Neu and B. Bellalta and A. Jonsson and S. Barrachina-Mu{\~n}oz},
journal = {Ad Hoc Networks},
publisher = {Elsevier},
title = {Collaborative Spatial Reuse In Wireless Networks Via Selfish Multi-Armed Bandits},
year = {2019}
}
</pre>
<a name="Wilhelmi19potential"></a><pre>
@article{<a href="all-phd-thesis.html#Wilhelmi19potential">Wilhelmi19potential</a>,
author = {F. Wilhelmi and S. Barrachina-Mu{\~n}oz and B. Bellalta and C. Cano and A. Jonsson and G. Neu},
journal = {Journal of Network and Computer Applications},
pages = {26--42},
publisher = {Elsevier},
title = {Potential and Pitfalls of Multi-Armed Bandits for Decentralized Spatial Reuse in WLANs},
volume = {127},
year = {2019}
}
</pre>
<a name="Wilks1938"></a><pre>
@article{<a href="all-phd-thesis.html#Wilks1938">Wilks1938</a>,
author = {S. S. Wilks},
journal = {The Annals of Mathematical Statistics},
number = {1},
pages = {60--62},
publisher = {JSTOR},
title = {{The large-sample distribution of the likelihood ratio for testing composite hypotheses}},
volume = {9},
year = {1938}
}
</pre>
<a name="Yaari77"></a><pre>
@article{<a href="all-phd-thesis.html#Yaari77">Yaari77</a>,
author = {M. E. Yaari},
journal = {Econometrica},
number = {5},
pages = {1183--1186},
publisher = {Wiley, Econometric Society},
title = {{A Note on Separability and Quasiconcavity}},
volume = {45},
year = {1977}
}
</pre>
<a name="Zhao07"></a><pre>
@article{<a href="all-phd-thesis.html#Zhao07">Zhao07</a>,
author = {Q. Zhao and B. M. Sadler},
journal = {{Signal Processing magazine}},
number = {3},
pages = {79--89},
publisher = {IEEE},
title = {{A Survey of Dynamic Spectrum Access}},
volume = {24},
year = {2007}
}
</pre>
<a name="Zhao10"></a><pre>
@article{<a href="all-phd-thesis.html#Zhao10">Zhao10</a>,
author = {K. Liu and Q. Zhao},
journal = {Transaction on Signal Processing},
number = {11},
pages = {5667--5681},
publisher = {IEEE},
title = {{Distributed Learning in Multi-Armed Bandit with Multiple Players}},
volume = {58},
year = {2010}
}
</pre>
<a name="akyildiz2006next"></a><pre>
@article{<a href="all-phd-thesis.html#akyildiz2006next">akyildiz2006next</a>,
author = {I. F. Akyildiz and W.-Y. Lee and M. C. Vuran and S. Mohanty},
journal = {Computer Networks},
number = {13},
pages = {2127--2159},
publisher = {Elsevier},
title = {{NeXt Generation, Dynamic Spectrum Access, Cognitive Radio Wireless Networks: A Survey}},
volume = {50},
year = {2006}
}
</pre>
<a name="audibert2010minimax"></a><pre>
@article{<a href="all-phd-thesis.html#audibert2010minimax">audibert2010minimax</a>,
author = {J.-Y. Audibert and S. Bubeck},
journal = {{Journal of Machine Learning Research}},
pages = {2785--2836},
title = {{Regret Bounds And Minimax Policies Under Partial Monitoring}},
volume = {11},
year = {2010}
}
</pre>
<a name="barnard1959control"></a><pre>
@article{<a href="all-phd-thesis.html#barnard1959control">barnard1959control</a>,
author = {G.A. Barnard},
journal = {Journal of the Royal Statistical Society. Series B (Methodological)},
pages = {239--271},
publisher = {JSTOR},
title = {{Control charts and stochastic processes}},
year = {1959}
}
</pre>
<a name="bouneffouf2019survey"></a><pre>
@article{<a href="all-phd-thesis.html#bouneffouf2019survey">bouneffouf2019survey</a>,
author = {D. Bouneffouf and I. Rish},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1904.10040}{arXiv:1904.10040}, under review by IJCAI 2019 Survey}},
title = {{A Survey on Practical Applications of Multi-Armed and Contextual Bandits}},
url = {https://arxiv.org/abs/1904.10040},
year = {2019}
}
</pre>
<a name="chernoff1952measure"></a><pre>
@article{<a href="all-phd-thesis.html#chernoff1952measure">chernoff1952measure</a>,
author = {H. Chernoff and others},
journal = {The Annals of Mathematical Statistics},
number = {4},
pages = {493--507},
publisher = {Institute of Mathematical Statistics},
title = {A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on The Sum of Observations},
volume = {23},
year = {1952}
}
</pre>
<a name="chernoff1981note"></a><pre>
@article{<a href="all-phd-thesis.html#chernoff1981note">chernoff1981note</a>,
author = {H. Chernoff},
journal = {The Annals of Probability},
pages = {533--535},
publisher = {JSTOR},
title = {A Note on an Inequality Involving the Normal Distribution},
year = {1981}
}
</pre>
<a name="gao2019batched"></a><pre>
@article{<a href="all-phd-thesis.html#gao2019batched">gao2019batched</a>,
author = {Z. Gao and Y. Han and Z. Ren and Z. Zhou},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1904.01763}{arXiv:1904.01763}}},
title = {{Batched Multi-armed Bandits Problem}},
url = {https://arxiv.org/abs/1904.01763},
year = {2019}
}
</pre>
<a name="garhwal2012survey"></a><pre>
@article{<a href="all-phd-thesis.html#garhwal2012survey">garhwal2012survey</a>,
arxiv = {{arXiv preprint \href{https://arXiv.org/abs/1201.1964}{arXiv:1201.1964}}},
author = {A. Garhwal and P. P. Bhattacharya},
doi = {10.5121/ijngn.2011.3402},
journal = {{International Journal of Next-Generation Networks (IJNGN)}},
number = {4},
title = {{A Survey on Dynamic Spectrum Access Techniques for Cognitive Radio}},
url = {https://arxiv.org/abs/1201.1964},
volume = {3},
year = {2012}
}
</pre>
<a name="hagerup1990guided"></a><pre>
@article{<a href="all-phd-thesis.html#hagerup1990guided">hagerup1990guided</a>,
author = {T. Hagerup and C. R{\"u}b},
journal = {Information processing letters},
number = {6},
pages = {305--308},
publisher = {Elsevier},
title = {{A Guided Tour of Chernoff Bounds}},
volume = {33},
year = {1990}
}
</pre>
<a name="hoeffding1963probability"></a><pre>
@article{<a href="all-phd-thesis.html#hoeffding1963probability">hoeffding1963probability</a>,
author = {W. Hoeffding},
journal = {Journal of the American statistical association},
number = {301},
pages = {13--30},
publisher = {Taylor \& Francis Group},
title = {Probability Inequalities for Sums of Bounded Random Variables},
volume = {58},
year = {1963}
}
</pre>
<a name="ipython"></a><pre>
@article{<a href="all-phd-thesis.html#ipython">ipython</a>,
author = {F. P\'erez and B. E. Granger},
howpublished = {Online at: \texttt{\url{https://ipython.org}}},
journal = {Computing in Science and Engineering},
month = {May},
number = {3},
pages = {21--29},
publisher = {IEEE Computer Society},
title = {{IPython: a System for Interactive Scientific Computing}},
url = {https://ipython.org},
volume = {9},
year = {2007}
}
</pre>
<a name="kolnogorov2019multi"></a><pre>
@article{<a href="all-phd-thesis.html#kolnogorov2019multi">kolnogorov2019multi</a>,
author = {A. Kolnogorov and S. Garbar},
journal = {{arXiv preprint \href{https://arXiv.org/abs/1902.00214}{arXiv:1902.00214}}},
title = {{Multi-Armed Bandit Problem and Batch UCB Rule}},
url = {https://arxiv.org/abs/1902.00214},
year = {2019}
}
</pre>
<a name="kumar2016two"></a><pre>
@article{<a href="all-phd-thesis.html#kumar2016two">kumar2016two</a>,
author = {R. Kumar and S. J. Darak and A. Yadav and A. K. Sharma and R. K. Tripathi},
journal = {Wireless Networks},
pages = {1--15},
publisher = {Springer},
title = {{Two-stage Decision Making Policy for Opportunistic Spectrum Access and Validation on USRP Testbed}},
year = {2016}
}
</pre>
<a name="kumar2017channel"></a><pre>
@article{<a href="all-phd-thesis.html#kumar2017channel">kumar2017channel</a>,