default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIshaq Aden-Ali
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the Amortized Complexity of Approximate Counting. APPROX/RANDOM 2024: 33:1-33:17- [c6]Ishaq Aden-Ali, Mikael Møller Høandgsgaard, Kasper Green Larsen, Nikita Zhivotovskiy:
Majority-of-Three: The Simplest Optimal Learner? COLT 2024: 22-45 - [i7]Ishaq Aden-Ali, Mikael Møller Høgsgaard, Kasper Green Larsen, Nikita Zhivotovskiy:
Majority-of-Three: The Simplest Optimal Learner? CoRR abs/2403.08831 (2024) - 2023
- [c5]Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy:
The One-Inclusion Graph Algorithm is not Always Optimal. COLT 2023: 72-88 - [c4]Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy:
Optimal PAC Bounds without Uniform Convergence. FOCS 2023: 1203-1223 - [i6]Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy:
Optimal PAC Bounds Without Uniform Convergence. CoRR abs/2304.09167 (2023) - 2022
- [i5]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the amortized complexity of approximate counting. CoRR abs/2211.03917 (2022) - [i4]Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy:
The One-Inclusion Graph Algorithm is not Always Optimal. CoRR abs/2212.09270 (2022) - 2021
- [c3]Ishaq Aden-Ali, Hassan Ashtiani, Gautam Kamath:
On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians. ALT 2021: 185-216 - [c2]Ishaq Aden-Ali, Hassan Ashtiani, Christopher Liaw:
Privately Learning Mixtures of Axis-Aligned Gaussians. NeurIPS 2021: 3925-3938 - [i3]Ishaq Aden-Ali, Hassan Ashtiani, Christopher Liaw:
Privately Learning Mixtures of Axis-Aligned Gaussians. CoRR abs/2106.02162 (2021) - 2020
- [c1]Ishaq Aden-Ali, Hassan Ashtiani:
On the Sample Complexity of Learning Sum-Product Networks. AISTATS 2020: 4508-4518 - [i2]Ishaq Aden-Ali, Hassan Ashtiani, Gautam Kamath:
On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians. CoRR abs/2010.09929 (2020)
2010 – 2019
- 2019
- [i1]Ishaq Aden-Ali, Hassan Ashtiani:
On the Sample Complexity of Learning Sum-Product Networks. CoRR abs/1912.02765 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
