A characterization of multiclass learnability

N Brukhim, D Carmon, I Dinur, S Moran… - 2022 IEEE 63rd …, 2022 - ieeexplore.ieee.org
A seminal result in learning theory characterizes the PAC learnability of binary classes
through the Vapnik-Chervonenkis dimension. Extending this characterization to the general …

The sample complexity of ERMs in stochastic convex optimization

D Carmon, A Yehudayoff… - … Conference on Artificial …, 2024 - proceedings.mlr.press
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 …

Proximity gaps for Reed–Solomon codes

E Ben-Sasson, D Carmon, Y Ishai, S Kopparty… - Journal of the …, 2023 - dl.acm.org
A collection of sets displays a proximity gap with respect to some property if for every set in
the collection, either (i) all members are δ-close to the property in relative Hamming distance …

Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves: (ECFFT Part II)

E Ben–Sasson, D Carmon, S Kopparty… - Theory of Cryptography …, 2022 - Springer
Concretely efficient interactive oracle proofs (IOPs) are of interest due to their applications to
scaling blockchains, their minimal security assumptions, and their potential future-proof …

[PDF][PDF] The autocorrelation of the Mobius function and Chowla's conjecture for the rational function field

D Carmon, Z Rudnick - arXiv preprint arXiv:1205.1599, 2012 - arxiv.org
We prove a function field version of Chowla's conjecture on the autocorrelation of the
Mobius function in the limit of a large finite field.

The autocorrelation of the Möbius function and Chowla's conjecture for the rational function field in characteristic 2

D Carmon - … Transactions of the Royal Society A …, 2015 - royalsocietypublishing.org
Dan Carmon Dan Carmon … In Carmon & Rudnick [1], an upper bound on |C(α 1 ,…,α r ;n)|
was established for fields of odd characteristic, demonstrating that Inline Formula holds for …

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields

E Ben-Sasson, D Carmon, S Kopparty, D Levit - Proceedings of the 2023 …, 2023 - SIAM
Given disjoint sets S, S'⊆ 𝔽 q of size n and a function f: S→ 𝔽 q, where 𝔽 q is a finite field,
the low-degree extension (LDE) of f to S'is the function f': S'→ 𝔽 q obtained by restricting the …

Elliptic curve fast fourier transform (ECFFT) part I: fast polynomial algorithms over all finite fields

E Ben-Sasson, D Carmon, S Kopparty… - arXiv preprint arXiv …, 2021 - arxiv.org
For smooth finite fields $F_q$ (ie, when $q-1$ factors into small primes) the Fast Fourier
Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial …

Option attachment: When deliberating makes choosing feel like losing

Z Carmon, K Wertenbroch… - Journal of Consumer …, 2003 - academic.oup.com
Common sense suggests that consumers make more satisfying decisions as they consider
their options more closely. Yet we argue that such close consideration can have undesirable …

Automated search for conjectures on mathematical constants using analysis of integer sequences

…, Y Harris, S Gottlieb, D Carmon… - International …, 2023 - proceedings.mlr.press
The discovery of formulas involving mathematical constants such as $\pi $ and $ e $ had a
great impact on various fields of science and mathematics. However, such discoveries have …