-
Notifications
You must be signed in to change notification settings - Fork 1
/
all-phd-thesis.html
3740 lines (3034 loc) · 114 KB
/
all-phd-thesis.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</title>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
<meta name="generator" content="bibtex2html">
</head>
<body>
<!-- This document was automatically generated with bibtex2html 1.99
(see http://www.lri.fr/~filliatr/bibtex2html/),
with the following command:
bibtex2html -s mybibstyle.bst -u -charset utf-8 -linebreak all-phd-thesis.bib -->
<table>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Agrawal95">Agr95</a>]
</td>
<td class="bibtexitem">
R. Agrawal (1995).
<em>Sample mean based index policies by <em>O</em>(log<em>n</em>)
regret for the Multi-Armed Bandit problem</em>.
<em>Advances in Applied Probability</em>, 27(4):1054--1078.<br />
[ <a href="all-phd-thesis_bib.html#Agrawal95">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="AlaturLevyKrause19">ALK19</a>]
</td>
<td class="bibtexitem">
P. Alatur, K. Y. Levy, and A. Krause (2019).
<em>Multi-Player Bandits: The Adversarial Case</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1902.08036">arXiv:1902.08036</a></em>.
<a href="https://arxiv.org/abs/1902.08036">https://arxiv.org/abs/1902.08036</a>.<br />
[ <a href="all-phd-thesis_bib.html#AlaturLevyKrause19">bib</a> |
<a href="https://arxiv.org/abs/1902.08036">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Allesiardo17">AFM17</a>]
</td>
<td class="bibtexitem">
R. Allesiardo, R. Féraud, and O.-A. Maillard (2017).
<em>The Non-Stationary Stochastic Multi-Armed Bandit Problem</em>.
<em>International Journal of Data Science and Analytics</em>,
3(4):267--283.<br />
[ <a href="all-phd-thesis_bib.html#Allesiardo17">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Anandkumar11">AMTA11</a>]
</td>
<td class="bibtexitem">
A. Anandkumar, N. Michael, A. K. Tang, and S. Agrawal (2011).
<em>Distributed Algorithms for Learning and Cognitive Medium
Access with Logarithmic Regret</em>.
<em>Journal on Selected Areas in Communications</em>, 29(4):731--745.<br />
[ <a href="all-phd-thesis_bib.html#Anandkumar11">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Anantharam87a">AVW87a</a>]
</td>
<td class="bibtexitem">
V. Anantharam, P. Varaiya, and J. Walrand (1987).
<em>Asymptotically efficient allocation rules for the Multi-Armed
Bandit problem with multiple plays - Part I: IID rewards</em>.
<em>Transactions on Automatic Control</em>, 32(11):968--976.<br />
[ <a href="all-phd-thesis_bib.html#Anantharam87a">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Anantharam87b">AVW87b</a>]
</td>
<td class="bibtexitem">
V. Anantharam, P. Varaiya, and J. Walrand (1987).
<em>Asymptotically efficient allocation rules for the Multi-Armed
Bandit problem with multiple plays - Part II: Markovian rewards</em>.
<em>Transactions on Automatic Control</em>, 32(11):977--982.<br />
[ <a href="all-phd-thesis_bib.html#Anantharam87b">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Arora2012multiplicative">AHK12</a>]
</td>
<td class="bibtexitem">
S. Arora, E. Hazan, and S. Kale (2012).
<em>The Multiplicative Weights Update Method: a Meta-Algorithm and
Applications</em>.
<em>Theory of Computing</em>, 8(1):121--164.<br />
[ <a href="all-phd-thesis_bib.html#Arora2012multiplicative">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="ArrowEnthoven61">AE61</a>]
</td>
<td class="bibtexitem">
K. J. Arrow and A. C. Enthoven (1961).
<em>Quasi-Concave Programming</em>.
<em>Econometrica</em>, 29(4):779--800.<br />
[ <a href="all-phd-thesis_bib.html#ArrowEnthoven61">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Auer02">ACBF02</a>]
</td>
<td class="bibtexitem">
P. Auer, N. Cesa-Bianchi, and P. Fischer (2002).
<em>Finite-time Analysis of the Multi-armed Bandit Problem</em>.
<em>Machine Learning</em>, 47(2):235--256.<br />
[ <a href="all-phd-thesis_bib.html#Auer02">bib</a> |
<a href="http://dx.doi.org/10.1023/A:1013689704352">DOI</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Auer02NonStochastic">ACBFS02</a>]
</td>
<td class="bibtexitem">
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. Schapire (2002).
<em>The Non-Stochastic Multi-Armed Bandit Problem</em>.
<em>SIAM journal on computing</em>, 32(1):48--77.<br />
[ <a href="all-phd-thesis_bib.html#Auer02NonStochastic">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Auer10">AO10</a>]
</td>
<td class="bibtexitem">
P. Auer and R. Ortner (2010).
<em>UCB Revisited: Improved Regret Bounds For The Stochastic
Multi-Armed Bandit Problem</em>.
<em>Periodica Mathematica Hungarica</em>, 61(1-2):55--65.<br />
[ <a href="all-phd-thesis_bib.html#Auer10">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="AuerGajaneOrtner18">AGO18</a>]
</td>
<td class="bibtexitem">
P. Auer, P. Gajane, and R. Ortner (2018).
<em>Adaptively Tracking the Best Arm with an Unknown Number of
Distribution Changes</em>.
<em>European Workshop on Reinforcement Learning</em>.
<a href="https://ewrl.files.wordpress.com/2018/09/ewrl_14_2018_paper_28.pdf">https://ewrl.files.wordpress.com/2018/09/ewrl_14_2018_paper_28.pdf</a>.<br />
[ <a href="all-phd-thesis_bib.html#AuerGajaneOrtner18">bib</a> |
<a href="https://ewrl.files.wordpress.com/2018/09/ewrl_14_2018_paper_28.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Avner15">AM15</a>]
</td>
<td class="bibtexitem">
O. Avner and S. Mannor (2015).
<em>Learning to Coordinate Without Communication in Multi-User
Multi-Armed Bandit Problems</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1504.08167">arXiv:1504.08167</a></em>.
<a href="https://arxiv.org/abs/1504.08167">https://arxiv.org/abs/1504.08167</a>.<br />
[ <a href="all-phd-thesis_bib.html#Avner15">bib</a> |
<a href="https://arxiv.org/abs/1504.08167">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="AvnerMannor18">AM18</a>]
</td>
<td class="bibtexitem">
O. Avner and S. Mannor (2018).
<em>Multi-User Communication Networks: A Coordinated Multi-Armed
Bandit Approach</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1808.04875">arXiv:1808.04875</a></em>.
<a href="https://arxiv.org/abs/1808.04875">https://arxiv.org/abs/1808.04875</a>.<br />
[ <a href="all-phd-thesis_bib.html#AvnerMannor18">bib</a> |
<a href="https://arxiv.org/abs/1808.04875">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Baransi2014">BMM14</a>]
</td>
<td class="bibtexitem">
A. Baransi, O.-A. Maillard, and S. Mannor (2014).
<em>Sub-sampling for Multi-armed Bandits</em>.
<em>Proceedings of the European Conference on Machine Learning</em>.
<a href="https://hal.archives-ouvertes.fr/hal-01025651">https://hal.archives-ouvertes.fr/hal-01025651</a>.<br />
[ <a href="all-phd-thesis_bib.html#Baransi2014">bib</a> |
<a href="https://hal.archives-ouvertes.fr/hal-01025651">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Besson2019Gretsi">BK19a</a>]
</td>
<td class="bibtexitem">
L. Besson and E. Kaufmann (August 2019).
<em>Analyse non asymptotique d'un test séquentiel de détection
de ruptures et application aux bandits non stationnaires</em>.
<em>GRETSI</em>.
<a href="https://hal.archives-ouvertes.fr/hal-02152243">https://hal.archives-ouvertes.fr/hal-02152243</a>,
<tt><a href="https://hal.archives-ouvertes.fr/hal-02152243">https://hal.archives-ouvertes.fr/hal-02152243</a></tt>.<br />
[ <a href="all-phd-thesis_bib.html#Besson2019Gretsi">bib</a> |
<a href="https://hal.archives-ouvertes.fr/hal-02152243">http</a> |
<a href="https://perso.crans.org/besson/articles/BK__GRETSI_2019.pdf">.pdf</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Bonnefoi18">BMP18</a>]
</td>
<td class="bibtexitem">
R. Bonnefoi, C. Moy, and J. Palicot (2018).
<em>Improvement of the LPWAN AMI backhaul's latency thanks to
reinforcement learning algorithms</em>.
<em>EURASIP Journal on Wireless Communications and Networking</em>,
2018(1):34.<br />
[ <a href="all-phd-thesis_bib.html#Bonnefoi18">bib</a> |
<a href="http://dx.doi.org/10.1186/s13638-018-1044-2">DOI</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="BoursierPerchet18">BP18</a>]
</td>
<td class="bibtexitem">
E. Boursier and V. Perchet (2018).
<em>SIC-MMAB: Synchronisation Involves Communication in
Multiplayer Multi-Armed Bandits</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1809.08151">arXiv:1809.08151</a></em>.
<a href="https://arxiv.org/abs/1809.08151">https://arxiv.org/abs/1809.08151</a>.<br />
[ <a href="all-phd-thesis_bib.html#BoursierPerchet18">bib</a> |
<a href="https://arxiv.org/abs/1809.08151">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Bubeck12">BCB12</a>]
</td>
<td class="bibtexitem">
S. Bubeck and N. Cesa-Bianchi (2012).
<em>Regret Analysis of Stochastic and Non-Stochastic Multi-Armed
Bandit Problems</em>.
<em>Foundations and Trends in Machine Learning</em>,
5(1):1--122.<br />
[ <a href="all-phd-thesis_bib.html#Bubeck12">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Burnetas96">BK96</a>]
</td>
<td class="bibtexitem">
A. N. Burnetas and M. N. Katehakis (1996).
<em>Optimal Adaptive Policies for Sequential Allocation
Problems</em>.
<em>Advances in Applied Mathematics</em>, 17(2):122--142.<br />
[ <a href="all-phd-thesis_bib.html#Burnetas96">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Centenaro16">CVZZ16</a>]
</td>
<td class="bibtexitem">
M. Centenaro, L. Vangelista, A. Zanella, and M. Zorzi (2016).
<em>Long-range communications in unlicensed bands: the rising stars
in the IoT and smart city scenarios</em>.
<em>Wireless Communications</em>, 23(5):60--67.<br />
[ <a href="all-phd-thesis_bib.html#Centenaro16">bib</a> |
<a href="http://dx.doi.org/10.1109/MWC.2016.7721743">DOI</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Chapelleetal14Ad">CMR14</a>]
</td>
<td class="bibtexitem">
O. Chapelle, E. Manavoglu, and R. Rosales (2014).
<em>Simple and Scalable Response Prediction For Display
Advertising</em>.
<em>Transactions on Intelligent Systems and Technology</em>.<br />
[ <a href="all-phd-thesis_bib.html#Chapelleetal14Ad">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Darak16">DMP16</a>]
</td>
<td class="bibtexitem">
S. J. Darak, C. Moy, and J. Palicot (2016).
<em>Proof-of-Concept System for Opportunistic Spectrum Access in
Multi-user Decentralized Networks</em>.
<em>EAI Endorsed Transactions on Cognitive Communications</em>,
2:1--10.<br />
[ <a href="all-phd-thesis_bib.html#Darak16">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="DarakHanawal18">DH18</a>]
</td>
<td class="bibtexitem">
S. J. Darak and M. K. Hanawal (2018).
<em>Distributed Learning and Stable Orthogonalization in Ad-Hoc
Networks with Heterogeneous Channels</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1812.11651">arXiv:1812.11651</a></em>.
<a href="https://arxiv.org/abs/1812.11651">https://arxiv.org/abs/1812.11651</a>.<br />
[ <a href="all-phd-thesis_bib.html#DarakHanawal18">bib</a> |
<a href="https://arxiv.org/abs/1812.11651">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="GaBaVa18">GBV18</a>]
</td>
<td class="bibtexitem">
G. Gautier, R. Bardenet, and M. Valko (2018).
<em>DPPy: Sampling Determinantal Point Processes with Python</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1809.07258">arXiv:1809.07258</a></em>.
<a href="https://arxiv.org/abs/1809.07258">https://arxiv.org/abs/1809.07258</a>, code at
<tt><a href="https://github.com/guilgautier/DPPy">https://github.com/guilgautier/DPPy</a></tt>. Documentation at
<tt><a href="https://dppy.readthedocs.io">https://dppy.readthedocs.io</a></tt>.<br />
[ <a href="all-phd-thesis_bib.html#GaBaVa18">bib</a> |
<a href="https://arxiv.org/abs/1809.07258">http</a> ]
<blockquote><font size="-1">
Keywords: Computer Science - Machine Learning, Computer Science - Mathematical Software, Statistics - Machine Learning
</font></blockquote>
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Garivier16TrueShape">GMS16</a>]
</td>
<td class="bibtexitem">
A. Garivier, P. Ménard, and G. Stoltz (2016).
<em>Explore First, Exploit Next: The True Shape of Regret in
Bandit Problems</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1602.07182">arXiv:1602.07182</a></em>.
<a href="https://arxiv.org/abs/1602.07182">https://arxiv.org/abs/1602.07182</a>.<br />
[ <a href="all-phd-thesis_bib.html#Garivier16TrueShape">bib</a> |
<a href="https://arxiv.org/abs/1602.07182">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="GarivierHadiji2018">GHMS18</a>]
</td>
<td class="bibtexitem">
A. Garivier, H. Hadiji, P. Menard, and G. Stoltz (2018).
<em>KL-UCB-switch: optimal regret bounds for stochastic bandits
from both a distribution-dependent and a distribution-free viewpoints</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1805.05071">arXiv:1805.05071</a></em>.
<a href="https://arxiv.org/abs/1805.05071">https://arxiv.org/abs/1805.05071</a>.<br />
[ <a href="all-phd-thesis_bib.html#GarivierHadiji2018">bib</a> |
<a href="https://arxiv.org/abs/1805.05071">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Haykin05">Hay05</a>]
</td>
<td class="bibtexitem">
S. Haykin (2005).
<em>Cognitive Radio: Brain-Empowered Wireless Communications</em>.
<em>Journal on Selected Areas in Communications</em>, 23(2):201--220.<br />
[ <a href="all-phd-thesis_bib.html#Haykin05">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Hazan2016introduction">H<sup>+</sup>16</a>]
</td>
<td class="bibtexitem">
E. Hazan <em>et al.</em> (2016).
<em>Introduction to online convex optimization</em>.
<em>Foundations and Trends in Optimization</em>,
2(3-4):157--325.<br />
[ <a href="all-phd-thesis_bib.html#Hazan2016introduction">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Honda2019">Hon19</a>]
</td>
<td class="bibtexitem">
J. Honda (2019).
<em>A Note on KL-UCB+ Policy for the Stochastic Bandit</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1903.07839">arXiv:1903.07839</a></em>.
<a href="https://arxiv.org/abs/1903.07839">https://arxiv.org/abs/1903.07839</a>.<br />
[ <a href="all-phd-thesis_bib.html#Honda2019">bib</a> |
<a href="https://arxiv.org/abs/1903.07839">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Jouini12">JMP12</a>]
</td>
<td class="bibtexitem">
W. Jouini, C. Moy, and J. Palicot (2012).
<em>Decision Making for Cognitive Radio Equipment: Analysis of the
First 10 Years of Exploration</em>.
<em>EURASIP Journal on Wireless Communications and Networking</em>,
2012(1).<br />
[ <a href="all-phd-thesis_bib.html#Jouini12">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="KK18Martingales">KK18</a>]
</td>
<td class="bibtexitem">
E. Kaufmann and W. M. Koolen (2018).
<em>Mixture Martingales Revisited with Applications to Sequential
Tests and Confidence Intervals</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1811.11419">arXiv:1811.11419</a></em>.
<a href="https://arXiv.org/abs/1811.11419">https://arXiv.org/abs/1811.11419</a>.<br />
[ <a href="all-phd-thesis_bib.html#KK18Martingales">bib</a> |
<a href="https://arXiv.org/abs/1811.11419">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="KLUCBJournal">CGM<sup>+</sup>13</a>]
</td>
<td class="bibtexitem">
O. Cappé, A. Garivier, O.-A. Maillard, R. Munos, and G. Stoltz (2013).
<em>Kullback-Leibler Upper Confidence Bounds For Optimal
Sequential Allocation</em>.
<em>Annals of Statistics</em>, 41(3):1516--1541.<br />
[ <a href="all-phd-thesis_bib.html#KLUCBJournal">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Kaufmann17">KG17</a>]
</td>
<td class="bibtexitem">
E. Kaufmann and A. Garivier (2017).
<em>Learning The Distribution With Largest Mean: Two Bandit
Frameworks</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1702.00001">arXiv:1702.00001</a></em>.
<a href="https://arxiv.org/abs/1702.00001">https://arxiv.org/abs/1702.00001</a>.<br />
[ <a href="all-phd-thesis_bib.html#Kaufmann17">bib</a> |
<a href="https://arxiv.org/abs/1702.00001">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="KaufmannAbbas19">KM19</a>]
</td>
<td class="bibtexitem">
E. Kaufmann and A. Mehrabian (2019).
<em>New Algorithms for Multiplayer Bandits when Arm Means Vary
Among Players</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1902.01239">arXiv:1902.01239</a></em>.
<a href="https://arxiv.org/abs/1902.01239">https://arxiv.org/abs/1902.01239</a>.<br />
[ <a href="all-phd-thesis_bib.html#KaufmannAbbas19">bib</a> |
<a href="https://arxiv.org/abs/1902.01239">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Keriven2018">KDI18</a>]
</td>
<td class="bibtexitem">
N. Keriven, G. Damien, and P. Iacopo (2018).
<em>NEWMA: a new method for scalable model-free online
change-point detection</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1805.08061">arXiv:1805.08061</a></em>.
<a href="https://arxiv.org/abs/1805.08061">https://arxiv.org/abs/1805.08061</a>, code at
<tt><a href="https://github.com/lightonai/newma">https://github.com/lightonai/newma</a></tt>.<br />
[ <a href="all-phd-thesis_bib.html#Keriven2018">bib</a> |
<a href="https://arxiv.org/abs/1805.08061">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="KimTewari2019">KT19</a>]
</td>
<td class="bibtexitem">
B. Kim and A. Tewari (2019).
<em>On the Optimality of Perturbations in Stochastic and
Adversarial Multi-Armed Bandit Problems</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1902.00610">arXiv:1902.00610</a></em>.
<a href="https://arxiv.org/abs/1902.00610">https://arxiv.org/abs/1902.00610</a>.<br />
[ <a href="all-phd-thesis_bib.html#KimTewari2019">bib</a> |
<a href="https://arxiv.org/abs/1902.00610">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="KullbackLeibler51">KL51</a>]
</td>
<td class="bibtexitem">
S. Kullback and R.A. Leibler (1951).
<em>On Information and Sufficiency</em>.
<em>The Annals of Mathematical Statistics</em>, 22(1):79--86.<br />
[ <a href="all-phd-thesis_bib.html#KullbackLeibler51">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="KumarDarak2019">KDH<sup>+</sup>19</a>]
</td>
<td class="bibtexitem">
R. Kumar, S. J. Darak, M. K. Hanawal, A. K. Sharma, and R. K. Tripathi (2019).
<em>Distributed Algorithm for Learning to Coordinate in
Infrastructure-Less Network</em>.
<em>IEEE Communications Letters</em>, 23(2):362--365.
ISSN 1089-7798.<br />
[ <a href="all-phd-thesis_bib.html#KumarDarak2019">bib</a> |
<a href="http://dx.doi.org/10.1109/LCOMM.2018.2890226">DOI</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="LaiRobbins85">LR85</a>]
</td>
<td class="bibtexitem">
T. L. Lai and H. Robbins (1985).
<em>Asymptotically Efficient Adaptive Allocation Rules</em>.
<em>Advances in Applied Mathematics</em>, 6(1):4--22.<br />
[ <a href="all-phd-thesis_bib.html#LaiRobbins85">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="LaiXing10">LX10</a>]
</td>
<td class="bibtexitem">
T. L. Lai and H. Xing (2010).
<em>Sequential change-point detection when the pre-and post-change
parameters are unknown</em>.
<em>Sequential Analysis</em>, 29(2):162--175.<br />
[ <a href="all-phd-thesis_bib.html#LaiXing10">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Lattimore16b">Lat16b</a>]
</td>
<td class="bibtexitem">
T. Lattimore (2016).
<em>Regret Analysis of the Anytime Optimally Confident UCB
Algorithm</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1603.08661">arXiv:1603.08661</a></em>.
<a href="https://arxiv.org/abs/1603.08661">https://arxiv.org/abs/1603.08661</a>.<br />
[ <a href="all-phd-thesis_bib.html#Lattimore16b">bib</a> |
<a href="https://arxiv.org/abs/1603.08661">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Lattimore2018refining">Lat18</a>]
</td>
<td class="bibtexitem">
T. Lattimore (2018).
<em>Refining the confidence level for optimistic bandit
strategies</em>.
<em>The Journal of Machine Learning Research</em>, 19(1):765--796.<br />
[ <a href="all-phd-thesis_bib.html#Lattimore2018refining">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="LiJamieson2018">LJ18</a>]
</td>
<td class="bibtexitem">
L. Li and K. Jamieson (2018).
<em>Hyperband: A Novel Bandit-Based Approach to Hyperparameter
Optimization</em>.
<em>Journal of Machine Learning Research</em>, 18:1--52.
<a href="https://arxiv.org/abs/1603.06560">https://arxiv.org/abs/1603.06560</a>.<br />
[ <a href="all-phd-thesis_bib.html#LiJamieson2018">bib</a> |
<a href="https://arxiv.org/abs/1603.06560">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Luedtke16">LKC17</a>]
</td>
<td class="bibtexitem">
A. Luedtke, E. Kaufmann, and A. Chambaz (2017).
<em>Asymptotically Optimal Algorithms for Budgeted Multiple Play
Bandits</em>.
<em>Machine Learning</em>, pages 1--31.
<a href="https://arxiv.org/abs/1606.09388">https://arxiv.org/abs/1606.09388</a>.<br />
[ <a href="all-phd-thesis_bib.html#Luedtke16">bib</a> |
<a href="https://arxiv.org/abs/1606.09388">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Luenberger68">Lue68</a>]
</td>
<td class="bibtexitem">
D. G. Luenberger (1968).
<em>Quasi-Convex Programming</em>.
<em>SIAM Journal on Applied Mathematics</em>, 16(5):1090--1095.<br />
[ <a href="all-phd-thesis_bib.html#Luenberger68">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="LugosiMehrabian18">LM18</a>]
</td>
<td class="bibtexitem">
G. Lugosi and A. Mehrabian (2018).
<em>Multiplayer Bandits Without Observing Collision Information</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1808.08416">arXiv:1808.08416</a></em>.
<a href="https://arxiv.org/abs/1808.08416">https://arxiv.org/abs/1808.08416</a>.<br />
[ <a href="all-phd-thesis_bib.html#LugosiMehrabian18">bib</a> |
<a href="https://arxiv.org/abs/1808.08416">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Maghsudi16">MH16</a>]
</td>
<td class="bibtexitem">
S. Maghsudi and E. Hossain (2016).
<em>Multi-Armed Bandits with application to 5G small cells</em>.
<em>Wireless Communications</em>, 23(3):64--73.<br />
[ <a href="all-phd-thesis_bib.html#Maghsudi16">bib</a> |
<a href="http://dx.doi.org/10.1109/MWC.2016.7498076">DOI</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Melian15">MGMM<sup>+</sup>15</a>]
</td>
<td class="bibtexitem">
L. Melián-Gutiérrez, N. Modi, C. Moy, F. Bader,
I. Pérez-Álvarez, and S. Zazo (2015).
<em>Hybrid UCB-HMM: A Machine Learning Strategy for Cognitive
Radio in HF Band</em>.
<em>IEEE Transactions on Cognitive Communications and Networking</em>,
1(3):347--358.<br />
[ <a href="all-phd-thesis_bib.html#Melian15">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Mitola99">MM99</a>]
</td>
<td class="bibtexitem">
J. Mitola and G. Q. Maguire (1999).
<em>Cognitive Radio: making software radios more personal</em>.
<em>Personal Communications</em>, 6(4):13--18.<br />
[ <a href="all-phd-thesis_bib.html#Mitola99">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Modi17QoS">MMM17</a>]
</td>
<td class="bibtexitem">
N. Modi, P. Mary, and C. Moy (2017).
<em>QoS driven Channel Selection Algorithm for Cognitive Radio
Network: Multi-User Multi-Armed Bandit Approach</em>.
<em>Transactions on Cognitive Communications and Networking</em>,
3(1):49--66.<br />
[ <a href="all-phd-thesis_bib.html#Modi17QoS">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Nielsen11">Nie11</a>]
</td>
<td class="bibtexitem">
F. Nielsen (2011).
<em>Chernoff Information of Exponential Families</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1102.2684">arXiv:1102.2684</a></em>.
<a href="https://arxiv.org/abs/1102.2684">https://arxiv.org/abs/1102.2684</a>.<br />
[ <a href="all-phd-thesis_bib.html#Nielsen11">bib</a> |
<a href="https://arxiv.org/abs/1102.2684">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Patil2019stochastic">PGNN19</a>]
</td>
<td class="bibtexitem">
V. Patil, G. Ghalme, V. Nair, and Y. Narahari (2019).
<em>Stochastic Multi-Armed Bandits with Arm-specific Fairness
Guarantees</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1905.11260">arXiv:1905.11260</a></em>.
<a href="https://arxiv.org/abs/1905.11260">https://arxiv.org/abs/1905.11260</a>.<br />
[ <a href="all-phd-thesis_bib.html#Patil2019stochastic">bib</a> |
<a href="https://arxiv.org/abs/1905.11260">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Raza17">RKS17</a>]
</td>
<td class="bibtexitem">
U. Raza, P. Kulkarni, and M. Sooriyabandara (2017).
<em>Low Power Wide Area Networks (LPWAN): An Overview</em>.
<em>Communications Surveys Tutorials</em>, 19(2):855--873.<br />
[ <a href="all-phd-thesis_bib.html#Raza17">bib</a> |
<a href="http://dx.doi.org/10.1109/COMST.2017.2652320">DOI</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Robbins52">Rob52</a>]
</td>
<td class="bibtexitem">
H. Robbins (1952).
<em>Some Aspects of the Sequential Design of Experiments</em>.
<em>Bulletin of the American Mathematical Society</em>,
58(5):527--535.<br />
[ <a href="all-phd-thesis_bib.html#Robbins52">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Roberts75">Rob75</a>]
</td>
<td class="bibtexitem">
L. G. Roberts (1975).
<em>ALOHA Packet System With and Without Slots and Capture</em>.
<em>SIGCOMM Computer Communication Review</em>, 5(2):28--42.<br />
[ <a href="all-phd-thesis_bib.html#Roberts75">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Seznec2018">SLC<sup>+</sup>19</a>]
</td>
<td class="bibtexitem">
J. Seznec, A. Locatelli, A. Carpentier, A. Lazaric, and M. Valko (2019).
<em>Rotting Bandits Are No Harder Than Stochastic Ones</em>.
<em>International Conference on Artificial Intelligence and
Statistics</em>.
<a href="https://arxiv.org/abs/1811.11043">https://arxiv.org/abs/1811.11043</a>.<br />
[ <a href="all-phd-thesis_bib.html#Seznec2018">bib</a> |
<a href="https://arxiv.org/abs/1811.11043">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Singla17">AHK17</a>]
</td>
<td class="bibtexitem">
S. Adish, H. Hassani, and A. Krause (2017).
<em>Learning to Use Learners' Advice</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1702.04825">arXiv:1702.04825</a></em>.
<a href="https://arxiv.org/abs/1702.04825">https://arxiv.org/abs/1702.04825</a>.<br />
[ <a href="all-phd-thesis_bib.html#Singla17">bib</a> |
<a href="https://arxiv.org/abs/1702.04825">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Slivkins2019">Sli19</a>]
</td>
<td class="bibtexitem">
A. Slivkins (June 2019).
<em>Introduction to Multi-Armed Bandits</em>.
<em>arXiv preprint
<a href="https://arXiv.org/abs/1904.07272v3">arXiv:1904.07272v3</a></em>.
<a href="https://arxiv.org/abs/1904.07272v3">https://arxiv.org/abs/1904.07272v3</a>.<br />
[ <a href="all-phd-thesis_bib.html#Slivkins2019">bib</a> |
<a href="https://arxiv.org/abs/1904.07272v3">http</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="Thompson33">Tho33</a>]
</td>
<td class="bibtexitem">
W. R. Thompson (1933).
<em>On the Likelihood that One Unknown Probability Exceeds Another
in View of the Evidence of Two Samples</em>.
<em>Biometrika</em>, 25.<br />
[ <a href="all-phd-thesis_bib.html#Thompson33">bib</a> ]
</td>
</tr>
<tr valign="top">
<td align="right" class="bibtexnumber">
[<a name="TianWangWangSong2019">Z. 19</a>]
</td>