Abbas Mehrabian
Abbas Mehrabian
Departments of Computer Science and Mathematics, McGill University
Verified email at - Homepage
Cited by
Cited by
Nearly-tight VC-dimension bounds for piecewise linear neural networks
N Harvey, C Liaw, A Mehrabian
Conference on Learning Theory, 1064-1068, 2017
A bounded budget network creation game
S Ehsani, SS Fadaee, MA Fazli, A Mehrabian, SS Sadeghabad, M Safari, ...
ACM Transactions on Algorithms (TALG) 11 (4), 1-25, 2015
The total variation distance between high-dimensional Gaussians
L Devroye, A Mehrabian, T Reddad
arXiv preprint arXiv:1810.08693, 2018
A simple tool for bounding the deviation of random matrices on geometric sets
C Liaw, A Mehrabian, Y Plan, R Vershynin
Geometric aspects of functional analysis, 277-299, 2017
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes
H Ashtiani, S Ben-David, NJA Harvey, C Liaw, A Mehrabian, Y Plan
Proceedings of the 32nd International Conference on Neural Information …, 2018
On the push&pull protocol for rumor spreading
H Acan, A Collevecchio, A Mehrabian, N Wormald
SIAM Journal on Discrete Mathematics 31 (2), 647-668, 2017
Zero-sum flows in regular graphs
S Akbari, A Daemi, O Hatami, A Javanmard, A Mehrabian
Graphs and combinatorics 26 (5), 603-615, 2010
The capture time of grids
A Mehrabian
Discrete Mathematics 311, 102--105, 2010
A practical algorithm for multiplayer bandits when arm means vary among players
A Mehrabian, E Boursier, E Kaufmann, V Perchet
International Conference on Artificial Intelligence and Statistics, 1211-1221, 2020
Multiplayer bandits without observing collision information
G Lugosi, A Mehrabian
arXiv preprint arXiv:1808.08416, 2018
On longest paths and diameter in random Apollonian networks
E Ebrahimzadeh, L Farczadi, P Gao, A Mehrabian, CM Sato, N Wormald, ...
Random structures & algorithms 45 (4), 703-725, 2014
On a generalization of Meyniel's conjecture on the cops and robbers game
N Alon, A Mehrabian
the electronic journal of combinatorics 18 (1), P19, 2011
Chasing a fast robber on planar graphs and random graphs
N Alon, A Mehrabian
Journal of Graph Theory 78 (2), 81-96, 2015
The minimax learning rates of normal and Ising undirected graphical models
L Devroye, A Mehrabian, T Reddad
Electronic Journal of Statistics 14 (1), 2338-2361, 2020
Lower bounds for the cop number when the robber is fast
A Mehrabian
Combinatorics, Probability and Computing 20 (4), 617-621, 2011
Sample-efficient learning of mixtures
H Ashtiani, S Ben-David, A Mehrabian
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
Randomized rumor spreading in poorly connected small‐world networks
A Mehrabian, A Pourmiri
Random Structures & Algorithms 49 (1), 185-208, 2016
Nearly-tight VC-dimension bounds for piecewise linear neural networks
PL Bartlett, N Harvey, C Liaw, A Mehrabian
Proceedings of the 22nd Annual Conference on Learning Theory (COLT 2017), 2017
Rumors spread slowly in a small-world spatial network
J Janssen, A Mehrabian
SIAM Journal on Discrete Mathematics 31 (4), 2414-2428, 2017
Batched Multi-Armed Bandits with Optimal Regret.
H Esfandiari, A Karbasi, A Mehrabian, VS Mirrokni
The system can't perform the operation now. Try again later.
Articles 1–20