4 citations · 4 across the 5 of their papers we have counts for
3 papers
cs.DS2023
Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory
Arun Jambulapati, Victor Reis, Kevin Tian
Discrepancy theory provides powerful tools for producing higher-quality objects which "beat the union bound" in fundamental settings throughout combinatorics and computer science.…
cs.LG2023
Testing Causality for High Dimensional Data
Arun Jambulapati, Hilaf Hasson, Youngsuk Park +1
Determining causal relationship between high dimensional observations are among the most important tasks in scientific discoveries. In this paper, we revisited the \emph{linear tra…
math.FA2022★ 4 cited
A Slightly Improved Bound for the KLS Constant
Arun Jambulapati, Yin Tat Lee, Santosh S. Vempala
We refine the recent breakthrough technique of Klartag and Lehec to obtain an improved polylogarithmic bound for the KLS constant.