On the Sample Complexity of Learning Sum-Product Networks. - Ishaq Aden-Ali; Hassan Ashtiani (AISTATS, 2020)

On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians. - Ishaq Aden-Ali; Hassan Ashtiani; Gautam Kamath 001 (ALT, 2021)

Privately Learning Mixtures of Axis-Aligned Gaussians. - Ishaq Aden-Ali; Hassan Ashtiani; Christopher Liaw (NeurIPS, 2021)

The One-Inclusion Graph Algorithm is not Always Optimal. - Ishaq Aden-Ali; Yeshwanth Cherapanamjeri; Abhishek Shetty; Nikita Zhivotovskiy (COLT, 2023)

Optimal PAC Bounds without Uniform Convergence. - Ishaq Aden-Ali; Yeshwanth Cherapanamjeri; Abhishek Shetty; Nikita Zhivotovskiy (FOCS, 2023)

On the Amortized Complexity of Approximate Counting. - Ishaq Aden-Ali; Yanjun Han; Jelani Nelson; Huacheng Yu (APPROX/RANDOM, 2024)

Majority-of-Three: The Simplest Optimal Learner? - Ishaq Aden-Ali; Mikael Møller Høandgsgaard; Kasper Green Larsen; Nikita Zhivotovskiy (COLT, 2024)

Majority-of-Three: The Simplest Optimal Learner? - Ishaq Aden-Ali; Mikael Møller Høgsgaard; Kasper Green Larsen; Nikita Zhivotovskiy (CoRR, 2024)

On the Injective Norm of Sums of Random Tensors and the Moments of Gaussian Chaoses. - Ishaq Aden-Ali (CoRR, 2025)