( en | de | ru )

 

Disambiguation of "Mehrabian, Abbas"

Author of the publication

copydeleteadd this publication to your clipboard
Regret Bounds for Batched Bandits

, , , and . (2019)cite arxiv:1910.04959.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Abbas Abbas

Mohammed Jawad Abbas

Raya Abbas

Sami Abbas

Faisal Abbas

 

Other publications of authors with the same name

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes., , , , , and . NeurIPS, page 3416-3425. (2018)Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks, , , and . (2017)cite arxiv:1703.02930Comment: Extended abstract appeared in COLT 2017; the upper bound was presented at the 2016 ACM Conference on Data Science. This version includes all the proofs and a refinement of the upper bound, Theorem 6. 16 pages, 2 figures.The string of diamonds is nearly tight for rumour spreading., , and . Comb. Probab. Comput., 29 (2): 190-199 (2020)On the Longest Paths and the Diameter in Random Apollonian Networks., , , , , , and . Electron. Notes Discret. Math., (2013)Sample-Efficient Learning of Mixtures., , and . AAAI, page 2679-2686. AAAI Press, (2018)The capture time of grids.. Discret. Math., 311 (1): 102-105 (2011)Regret Bounds for Batched Bandits, , , and . (2019)cite arxiv:1910.04959.Rumours spread slowly in a small world spatial network., and . CoRR, (2016)Justifying the small-world phenomenon via random recursive trees.. Random Struct. Algorithms, 50 (2): 201-224 (2017)On a DAG Partitioning Problem., and . WAW, volume 7323 of Lecture Notes in Computer Science, page 17-28. Springer, (2012)