Abbas Mehrabian

Department of Combinatorics and Optimization|University of Waterloo

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers49 papers

Sort

By YearBy Citation

The string of diamonds is nearly tight for rumour spreading

Omer Angel,Abbas Mehrabian,Yuval Peres

Comb. Probab. Comput., no. 2 (2020): 190-199

EIBibtex

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes

Hassan Ashtiani,Shai Ben-David,Nicholas J. A. Harvey, Christopher Liaw,Abbas Mehrabian,Yaniv Plan

J. ACM, no. 6 (2020): 1-42

EIBibtex

The Minimax Learning Rate of Normal and Ising Undirected Graphical Models

Luc Devroye,Abbas Mehrabian, Tommy Reddad

Electronic Journal of Statistics, no. 1 (2020): 2338-2361

Bibtex

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players

Abbas Mehrabian, Etienne Boursier,Emilie Kaufmann,Vianney Perchet

AISTATS, pp.1211-1221, (2020)

EIBibtex

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players

Etienne Boursier,Emilie Kaufmann,Abbas Mehrabian, Vianney Perchet

international conference on artificial intelligence and statistics, (2020)

Bibtex

Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks

Peter L. Bartlett,Nicholas J. A. Harvey, Chris Liaw,Abbas Mehrabian

Journal of Machine Learning Research, (2019)

Cited by67EIBibtex

New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players

Emilie Kaufmann,Abbas Mehrabian

arXiv: Machine Learning, (2019)

EIBibtex

The string of diamonds is nearly tight for rumour spreading

Omer Angel,Abbas Mehrabian,Yuval Peres

arXiv: Probability, pp.1-10, (2019)

Bibtex

Notes on growing a tree in a graph

Luc Devroye,Vida Dujmovic,Alan M. Frieze,Abbas Mehrabian,Pat Morin,Bruce A. Reed

Random Structures and Algorithms, no. 2 (2019): 290-312

EIBibtex

The Minimax Learning Rate of Normal and Ising Undirected Graphical Models

Luc Devroye,Abbas Mehrabian, Tommy Reddad

arXiv: Statistics Theory, (2018)

Cited by3EIBibtex

Notes on growing a tree in a graph: DEVROYE et al

Luc Devroye,Vida Dujmović,Alan Frieze,Abbas Mehrabian,Pat Morin,Bruce Reed,Bruce Reed,Bruce Reed

Random Structures and Algorithms, (2018)

Bibtex

Sample-Efficient Learning of Mixtures

Hassan Ashtiani,Shai Ben-David,Abbas Mehrabian

national conference on artificial intelligence, (2018)

Cited by10EIBibtex

The total variation distance between high-dimensional Gaussians

Luc Devroye,Abbas Mehrabian, Tommy Reddad

arXiv: Statistics Theory, (2018)

Cited by2Bibtex

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes

Hassan Ashtiani,Shai Ben-David,Nick Harvey, Christopher Liaw,Abbas Mehrabian,Yaniv Plan

arXiv: Learning, (2018)

Bibtex

Some techniques in density estimation

Hassan Ashtiani,Abbas Mehrabian

arXiv: Statistics Theory, (2018)

EIBibtex

Multiplayer bandits without observing collision information

Gábor Lugosi,Abbas Mehrabian

arXiv: Learning, (2018)

Cited by4EIBibtex

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes

Hassan Ashtiani,Shai Ben-David,Nicholas J. A. Harvey, Christopher Liaw,Abbas Mehrabian,Yaniv Plan

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), (2018): 3416-3425

Cited by20EIBibtex

Nearly-tight VC-dimension bounds for piecewise linear neural networks

Nick Harvey, Christopher Liaw,Abbas Mehrabian

COLT, (2017): 1064-1068

Cited by64EIBibtex

A simple tool for bounding the deviation of random matrices on geometric sets

Christopher Liaw,Abbas Mehrabian,Yaniv Plan,Roman Vershynin

arXiv: Probability, (2017)

EIBibtex

Rumors Spread Slowly in a Small-World Spatial Network

Jeannette C. M. Janssen,Abbas Mehrabian

SIAM J. Discrete Math., no. 4 (2017): 2414-2428

Cited by5EIBibtex

View All

Base Info Papers Patents Projects

Abbas MehrabianBinding

Papers49 papers

Abbas Mehrabian