Talagrand’s Convolution Conjecture
- Ronen Eldan | MSR
Tools from James Lee’s July 28 talk will be employed to prove the following: Any non-negative function f on Gaussian space that is not too log-concave has tails strictly better than those given by Markov’s inequality: P(f > c) < E[f]/(c (log c)1/6) where E[f] denotes the (Gaussian) expectation of f. An immediate consequence is a positive answer to Talagrand’s (1989) question about regularization of L1 functions under convolution. (Joint work with James Lee).
Speaker Details
Ronen Eldan received his Ph.D from Tel Aviv University, under the supervision of Prof. V. Milman and Prof. B. Klartag, specializing in probability, high dimensional convex geometry and computational geometry. Later, he was a Post-Doctoral fellow at the Weizmann Institute of Science and is currently a visiting researcher at MSR. In the fall he will be a postdoc at UW and next year he will be a Clay Research fellow at NYU.
-
-
Jeff Running
-
Series: Microsoft Research Talks
-
Decoding the Human Brain – A Neurosurgeon’s Experience
- Dr. Pascal O. Zinn
-
-
-
-
-
-
Challenges in Evolving a Successful Database Product (SQL Server) to a Cloud Service (SQL Azure)
- Hanuma Kodavalla,
- Phil Bernstein
-
Improving text prediction accuracy using neurophysiology
- Sophia Mehdizadeh
-
Tongue-Gesture Recognition in Head-Mounted Displays
- Tan Gemicioglu
-
DIABLo: a Deep Individual-Agnostic Binaural Localizer
- Shoken Kaneko
-
-
-
-
Audio-based Toxic Language Detection
- Midia Yousefi
-
-
From SqueezeNet to SqueezeBERT: Developing Efficient Deep Neural Networks
- Forrest Iandola,
- Sujeeth Bharadwaj
-
Hope Speech and Help Speech: Surfacing Positivity Amidst Hate
- Ashique Khudabukhsh
-
-
-
Towards Mainstream Brain-Computer Interfaces (BCIs)
- Brendan Allison
-
-
-
-
Learning Structured Models for Safe Robot Control
- Subramanian Ramamoorthy
-