22 citations · 35 across the 10 of their papers we have counts for
10 papers
The Sample Complexity Of ERMs In Stochastic Convex Optimization
Daniel Carmon, Roi Livni, Amir Yehudayoff
Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained u…
Dual Systolic Graphs
Daniel Carmon, Amir Yehudayoff
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to cons…
Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences
Ofir Razon, Yoav Harris, Shahar Gottlieb +3
Formulas involving fundamental mathematical constants had a great impact on various fields of science and mathematics, for example aiding in proofs of irrationality of constants. H…
A Characterization of Multiclass Learnability
Nataly Brukhim, Daniel Carmon, Irit Dinur +2
A seminal result in learning theory characterizes the PAC learnability of binary classes through the Vapnik-Chervonenkis dimension. Extending this characterization to the general m…
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty +1
For smooth finite fields (i.e., when factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomi…
The Markoff Group of Transformations in Prime and Composite Moduli
Chen Meiri, Doron Puder, Dan Carmon
The Markoff group of transformations is a group of affine integral morphisms, which is known to act transitively on the set of all positive integer solutions to the equation $x…