User profiles for Abbas Mehrabian
![]() | Abbas MehrabianGoogle DeepMind Verified email at deepmind.com Cited by 2231 |
The total variation distance between high-dimensional Gaussians with the same mean
L Devroye, A Mehrabian, T Reddad - arXiv preprint arXiv:1810.08693, 2018 - arxiv.org
… Luc Devroye McGill University Abbas Mehrabian† McGill University Tommy Reddad‡
McGill University … Email: abbas.mehrabian@gmail.com. ‡Supported by NSERC PGS D …
McGill University … Email: abbas.mehrabian@gmail.com. ‡Supported by NSERC PGS D …
A simple tool for bounding the deviation of random matrices on geometric sets
Let A be an isotropic, sub-gaussian m × n matrix. We prove that the process \documentclass[12pt]{minimal}
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \…
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \…
A practical algorithm for multiplayer bandits when arm means vary among players
A Mehrabian, E Boursier… - International …, 2020 - proceedings.mlr.press
We study a multiplayer stochastic multi-armed bandit problem in which players cannot
communicate, and if two or more players pull the same arm, a collision occurs and the involved …
communicate, and if two or more players pull the same arm, a collision occurs and the involved …
Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
We prove new upper and lower bounds on the VC-dimension of deep neural networks with
the ReLU activation function. These bounds are tight for almost the entire range of …
the ReLU activation function. These bounds are tight for almost the entire range of …
AlphaEvolve: A coding agent for scientific and algorithmic discovery
…, B Kozlovskii, FJR Ruiz, A Mehrabian… - arXiv preprint arXiv …, 2025 - arxiv.org
In this white paper, we present AlphaEvolve, an evolutionary coding agent that substantially
enhances capabilities of state-of-the-art LLMs on highly challenging tasks such as tackling …
enhances capabilities of state-of-the-art LLMs on highly challenging tasks such as tackling …
Sample-efficient learning of mixtures
We consider PAC learning of probability distributions (aka density estimation), where we
are given an iid sample generated from an unknown target distribution, and want to output a …
are given an iid sample generated from an unknown target distribution, and want to output a …
Regret bounds for batched bandits
We present simple algorithms for batched stochastic multi-armed bandit and batched
stochastic linear bandit problems. We prove bounds for their expected regrets that improve and …
stochastic linear bandit problems. We prove bounds for their expected regrets that improve and …
Nearly tight sample complexity bounds for learning mixtures of gaussians via sample compression schemes
We prove that ϴ (kd^ 2/ε^ 2) samples are necessary and sufficient for learning a mixture of k
Gaussians in R^ d, up to error ε in total variation distance. This improves both the known …
Gaussians in R^ d, up to error ε in total variation distance. This improves both the known …
Near-optimal sample complexity bounds for robust learning of gaussian mixtures via compression schemes
We introduce a novel technique for distribution learning based on a notion of sample
compression. Any class of distributions that allows such a compression scheme can be learned …
compression. Any class of distributions that allows such a compression scheme can be learned …
Multiplayer bandits without observing collision information
G Lugosi, A Mehrabian - Mathematics of Operations …, 2022 - pubsonline.informs.org
We study multiplayer stochastic multiarmed bandit problems in which the players cannot
communicate, and if two or more players pull the same arm, a collision occurs and the involved …
communicate, and if two or more players pull the same arm, a collision occurs and the involved …