activity
20022026
most citedLocal Rademacher complexities

373 citations · 909 across the 61 of their papers we have counts for

collaborators
Showing math.FAShow all

13 papers · 1 filter

math.FA2023

Optimal non-gaussian Dvoretzky-Milman embeddings

Daniel Bartl, Shahar Mendelson

We construct the first non-gaussian ensemble that yields the optimal estimate in the Dvoretzky-Milman Theorem: the ensemble exhibits almost Euclidean sections in arbitrary normed s…

math.FA2021

Random embeddings with an almost Gaussian distortion

Daniel Bartl, Shahar Mendelson

Let be a symmetric, isotropic random vector in and let be independent copies of . We show that under mild assumptions on (a suitable th…

math.FA2020

An isomorphic Dvoretzky-Milman Theorem using general random ensembles

Shahar Mendelson

We construct rather general random ensembles that yield the optimal (isomorphic) estimate in the Dvoretzky-Milman Theorem. This is the first construction of non gaussian/spherical…

math.FA2019

On the geometry of random polytopes

Shahar Mendelson

We present a simple proof to a fact recently established in [5]: let be a symmetric random variable that has variance , let be an random matrix who…

math.FA2016

Generalized Dual Sudakov Minoration via Dimension Reduction - A Program

Shahar Mendelson, Emanuel Milman, Grigoris Paouris

We propose a program for establishing a conjectural extension to the class of (origin-symmetric) log-concave probability measures , of the classical dual Sudakov Minoration on t…

math.FA2014

Dvoretzky type theorems for subgaussian coordinate projections

Shahar Mendelson

Given a class of functions on a probability space , we study the structure of a typical coordinate projection of the class, defined by ,…