default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHilal Asi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Daogao Liu, Hilal Asi:
User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates. AISTATS 2024: 4240-4248- [c16]Hilal Asi, John C. Duchi, Saminul Haque, Zewei Li, Feng Ruan:
Universally Instance-Optimal Mechanisms for Private Statistical Estimation. COLT 2024: 221-259 - [c15]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar, Samson Zhou:
Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages. ICML 2024 - [i21]Aadirupa Saha, Hilal Asi:
DP-Dueling: Learning from Preference Feedback without Compromising User Privacy. CoRR abs/2403.15045 (2024) - [i20]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar, Samson Zhou:
Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages. CoRR abs/2404.10201 (2024) - [i19]Hilal Asi, Daogao Liu, Kevin Tian:
Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions. CoRR abs/2406.02789 (2024) - [i18]Hilal Asi, Tomer Koren, Daogao Liu, Kunal Talwar:
Private Online Learning via Lazy Algorithms. CoRR abs/2406.03620 (2024) - [i17]Hilal Asi, Fabian Boemer, Nicholas Genise, Muhammad Haris Mughees, Tabitha Ogilvie, Rehan Rishi, Guy N. Rothblum, Kunal Talwar, Karl Tarbe, Ruiyu Zhu, Marco Zuliani:
Scalable Private Search with Wally. CoRR abs/2406.06761 (2024) - 2023
- [c14]Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar:
Private Online Prediction from Experts: Separations and Faster Rates. COLT 2023: 674-699 - [c13]Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar:
Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime. ICML 2023: 1107-1120 - [c12]Hilal Asi, Jonathan R. Ullman, Lydia Zakynthinou
:
From Robustness to Privacy and Back. ICML 2023: 1121-1146 - [c11]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar:
Fast Optimal Locally Private Mean Estimation via Random Projections. NeurIPS 2023 - [i16]Hilal Asi, Jonathan R. Ullman, Lydia Zakynthinou:
From Robustness to Privacy and Back. CoRR abs/2302.01855 (2023) - [i15]Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar:
Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime. CoRR abs/2302.14154 (2023) - [i14]Hilal Asi, Vitaly Feldman, Jelani Nelson, Huy L. Nguyen, Kunal Talwar:
Fast Optimal Locally Private Mean Estimation via Random Projections. CoRR abs/2306.04444 (2023) - [i13]Hilal Asi, Daogao Liu:
User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates. CoRR abs/2311.03797 (2023) - 2022
- [c10]Hilal Asi, Karan N. Chadha, Gary Cheng, John C. Duchi:
Private optimization in the interpolation regime: faster rates and hardness results. ICML 2022: 1025-1045 - [c9]Hilal Asi, Vitaly Feldman, Kunal Talwar:
Optimal Algorithms for Mean Estimation under Local Differential Privacy. ICML 2022: 1046-1056 - [i12]Hilal Asi, Vitaly Feldman, Kunal Talwar:
Optimal Algorithms for Mean Estimation under Local Differential Privacy. CoRR abs/2205.02466 (2022) - [i11]Chen Cheng, Hilal Asi, John C. Duchi:
How many labelers do you have? A closer look at gold-standard labels. CoRR abs/2206.12041 (2022) - [i10]Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar:
Private Online Prediction from Experts: Separations and Faster Rates. CoRR abs/2210.13537 (2022) - [i9]Hilal Asi, Karan N. Chadha, Gary Cheng, John C. Duchi:
Private optimization in the interpolation regime: faster rates and hardness results. CoRR abs/2210.17070 (2022) - 2021
- [c8]Hilal Asi, John C. Duchi, Alireza Fallah, Omid Javidbakht, Kunal Talwar:
Private Adaptive Gradient Methods for Convex Optimization. ICML 2021: 383-392 - [c7]Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar:
Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry. ICML 2021: 393-403 - [c6]Hilal Asi, Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Stochastic Bias-Reduced Gradient Methods. NeurIPS 2021: 10810-10822 - [c5]Hilal Asi, Daniel Levy, John C. Duchi:
Adapting to function difficulty and growth conditions in private optimization. NeurIPS 2021: 19069-19081 - [i8]Hilal Asi, Vitaly Feldman, Tomer Koren, Kunal Talwar:
Private Stochastic Convex Optimization: Optimal Rates in 𝓁1 Geometry. CoRR abs/2103.01516 (2021) - [i7]Hilal Asi, Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford:
Stochastic Bias-Reduced Gradient Methods. CoRR abs/2106.09481 (2021) - [i6]Hilal Asi, John C. Duchi, Alireza Fallah, Omid Javidbakht, Kunal Talwar:
Private Adaptive Gradient Methods for Convex Optimization. CoRR abs/2106.13756 (2021) - [i5]Hilal Asi, Daniel Levy, John C. Duchi:
Adapting to Function Difficulty and Growth Conditions in Private Optimization. CoRR abs/2108.02391 (2021) - 2020
- [c4]Hilal Asi, Karan N. Chadha, Gary Cheng, John C. Duchi:
Minibatch Stochastic Approximate Proximal Point Methods. NeurIPS 2020 - [c3]Hilal Asi, John C. Duchi:
Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. NeurIPS 2020 - [i4]Jay Mardia, Hilal Asi, Kabir Aladin Chandrasekher:
Finding Planted Cliques in Sublinear Time. CoRR abs/2004.12002 (2020) - [i3]Hilal Asi, John C. Duchi:
Near Instance-Optimality in Differential Privacy. CoRR abs/2005.10630 (2020)
2010 – 2019
- 2019
- [j2]Hilal Asi, John C. Duchi:
Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity. SIAM J. Optim. 29(3): 2257-2290 (2019) - [j1]Hilal Asi, Eitan Yaakobi:
Nearly Optimal Constructions of PIR and Batch Codes. IEEE Trans. Inf. Theory 65(2): 947-964 (2019) - [c2]Hilal Asi, John C. Duchi:
Modeling simple structures and geometry for better stochastic optimization algorithms. AISTATS 2019: 2425-2434 - [i2]Hilal Asi, John C. Duchi, Omid Javidbakht:
Element Level Differential Privacy: The Right Granularity of Privacy. CoRR abs/1912.04042 (2019) - 2017
- [c1]Hilal Asi, Eitan Yaakobi:
Nearly optimal constructions of PIR and batch codes. ISIT 2017: 151-155 - [i1]Hilal Asi, Eitan Yaakobi:
Nearly Optimal Constructions of PIR and Batch Codes. CoRR abs/1701.07206 (2017)
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 2024-09-04 01:23 CEST 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:
