On the sample complexity of privately learning unbounded high-dimensional gaussians I Aden-Ali, H Ashtiani, G Kamath Algorithmic Learning Theory, 185-216, 2021 | 45 | 2021 |
Time-resolved diffuse optical tomography system using an accelerated inverse problem solver M Alayed, MA Naser, I Aden-Ali, MJ Deen Optics Express 26 (2), 963-979, 2018 | 20 | 2018 |
Privately learning mixtures of axis-aligned gaussians I Aden-Ali, H Ashtiani, C Liaw Advances in Neural Information Processing Systems 34, 3925-3938, 2021 | 17 | 2021 |
Optimal PAC Bounds Without Uniform Convergence I Aden-Ali, Y Cherapanamjeri, A Shetty, N Zhivotovskiy arXiv preprint arXiv:2304.09167, 2023 | 11 | 2023 |
The One-Inclusion Graph Algorithm is not Always Optimal I Aden-Ali, Y Cherapanamjeri, A Shetty, N Zhivotovskiy arXiv preprint arXiv:2212.09270, 2022 | 7 | 2022 |
On the amortized complexity of approximate counting I Aden-Ali, Y Han, J Nelson, H Yu arXiv preprint arXiv:2211.03917, 2022 | 4 | 2022 |
On the sample complexity of learning sum-product networks I Aden-Ali, H Ashtiani International Conference on Artificial Intelligence and Statistics, 4508-4518, 2020 | 3 | 2020 |
Majority-of-Three: The Simplest Optimal Learner? I Aden-Ali, MM Høgsgaard, KG Larsen, N Zhivotovskiy arXiv preprint arXiv:2403.08831, 2024 | | 2024 |
On the Sample Complexity of Privately Learning Gaussians and their Mixtures I Aden-Ali | | 2021 |
Novel experimentally calibrated multiphase TCAD model for cobalt germanide growth MA Rabie, I Aden-Ali, YM Haddara 2017 International Conference on Simulation of Semiconductor Processes and …, 2017 | | 2017 |