default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahab Asoodeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Shahab Asoodeh
, Huanyu Zhang:
Contraction of Locally Differentially Private Mechanisms. IEEE J. Sel. Areas Inf. Theory 5: 385-395 (2024)- [c36]Alireza Fathollah Pour, Hassan Ashtiani, Shahab Asoodeh:
Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity. COLT 2024: 4240-4275 - [c35]Shahab Asoodeh, Mario Díaz:
On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent. ISIT 2024: 380-385 - [c34]Hrad Ghoukasian, Shahab Asoodeh:
Differentially Private Fair Binary Classifications. ISIT 2024: 611-616 - [c33]Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
Differential-Privacy Capacity. ISIT 2024: 3053-3058 - [c32]Behnoosh Zamanlooy, Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
$\mathrm{E}_{\gamma}$-Mixing Time. ISIT 2024: 3474-3479 - [c31]Hyun-Young Park, Shahab Asoodeh, Si-Hyeon Lee:
Exactly Minimax-Optimal Locally Differentially Private Sampling. NeurIPS 2024 - [i32]Hrad Ghoukasian, Shahab Asoodeh:
Differentially Private Fair Binary Classifications. CoRR abs/2402.15603 (2024) - [i31]Hyun-Young Park, Shahab Asoodeh, Si-Hyeon Lee:
Exactly Minimax-Optimal Locally Differentially Private Sampling. CoRR abs/2410.22699 (2024) - [i30]Behnoosh Zamanlooy, Mario Díaz, Shahab Asoodeh:
Locally Private Sampling with Public Data. CoRR abs/2411.08791 (2024) - 2023
- [c30]Wael Alghamdi, Juan Felipe Gómez, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
The Saddle-Point Method in Differential Privacy. ICML 2023: 508-528 - [c29]Etam Benger, Shahab Asoodeh, Jun Chen:
The Cardinality Bound on the Information Bottleneck Representations is Tight. ISIT 2023: 1478-1483 - [c28]Behnoosh Zamanlooy, Shahab Asoodeh:
Strong Data Processing Inequalities for Locally Differentially Private Mechanisms. ISIT 2023: 1794-1799 - [c27]Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar:
Optimal Multidimensional Differentially Private Mechanisms in the Large-Composition Regime. ISIT 2023: 2195-2200 - [c26]Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar:
Schrödinger Mechanisms: Optimal Differential Privacy Mechanisms for Small Sensitivity. ISIT 2023: 2201-2206 - [i29]Etam Benger, Shahab Asoodeh, Jun Chen:
The Cardinality Bound on the Information Bottleneck Representations is Tight. CoRR abs/2305.07000 (2023) - [i28]Shahab Asoodeh, Mario Díaz:
Privacy Loss of Noisy Stochastic Gradient Descent Might Converge Even for Non-Convex Losses. CoRR abs/2305.09903 (2023) - [i27]Alireza Fathollah Pour, Hassan Ashtiani, Shahab Asoodeh:
Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity. CoRR abs/2312.05645 (2023) - 2022
- [c25]Shahab Asoodeh:
Distribution Simulation Under Local Differential Privacy. CWIT 2022: 57-61 - [c24]Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar, Fei Wei:
Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the Large-Composition Regime. ISIT 2022: 1838-1843 - [c23]Wael Alghamdi, Hsiang Hsu, Haewon Jeong, Hao Wang, Peter Michalák, Shahab Asoodeh, Flávio P. Calmon:
Beyond Adult and COMPAS: Fair Multi-Class Prediction via Information Projection. NeurIPS 2022 - [i26]Wael Alghamdi, Hsiang Hsu, Haewon Jeong, Hao Wang, P. Winston Michalak, Shahab Asoodeh, Flávio P. Calmon:
Beyond Adult and COMPAS: Fairness in Multi-Class Prediction. CoRR abs/2206.07801 (2022) - [i25]Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar, Fei Wei:
Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the Large-Composition Regime. CoRR abs/2207.00420 (2022) - [i24]Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar, Fei Wei:
The Saddle-Point Accountant for Differential Privacy. CoRR abs/2208.09595 (2022) - [i23]Shahab Asoodeh, Huanyu Zhang:
Contraction of Locally Differentially Private Mechanisms. CoRR abs/2210.13386 (2022) - 2021
- [j4]Shahab Asoodeh, Jiachun Liao, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
Three Variants of Differential Privacy: Lossless Conversion and Applications. IEEE J. Sel. Areas Inf. Theory 2(1): 208-222 (2021) - [c22]Shahab Asoodeh, Wei-Ning Chen, Flávio P. Calmon, Ayfer Özgür:
Differentially Private Federated Learning: An Information-Theoretic Perspective. ISIT 2021: 344-349 - [c21]Shahab Asoodeh, Maryam Aliakbarpour, Flávio P. Calmon:
Local Differential Privacy Is Equivalent to Contraction of an $f$-Divergence. ISIT 2021: 545-550 - [c20]Naganand Yadati, Tingran Gao, Shahab Asoodeh, Partha P. Talukdar, Anand Louis:
Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs. PAKDD (1) 2021: 447-458 - [i22]Shahab Asoodeh, Maryam Aliakbarpour, Flávio P. Calmon:
Local Differential Privacy Is Equivalent to Contraction of Eγ-Divergence. CoRR abs/2102.01258 (2021) - 2020
- [j3]Shahab Asoodeh, Flávio P. Calmon:
Bottleneck Problems: An Information and Estimation-Theoretic View. Entropy 22(11): 1325 (2020) - [c19]Hsiang Hsu, Shahab Asoodeh, Flávio P. Calmon:
Obfuscation via Information Density Estimation. AISTATS 2020: 906-917 - [c18]Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
Privacy Amplification of Iterative Algorithms via Contraction Coefficients. ISIT 2020: 896-901 - [c17]Shahab Asoodeh, Jiachun Liao, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences. ISIT 2020: 920-925 - [c16]Wael Alghamdi, Shahab Asoodeh, Hao Wang, Flávio P. Calmon, Dennis Wei, Karthikeyan Natesan Ramamurthy:
Model Projection: Theory and Applications to Fair Machine Learning. ISIT 2020: 2711-2716 - [i21]Shahab Asoodeh, Jiachun Liao, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via $f$-Divergences. CoRR abs/2001.05990 (2020) - [i20]Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
Privacy Amplification of Iterative Algorithms via Contraction Coefficients. CoRR abs/2001.06546 (2020) - [i19]Parastoo Sadeghi, Shahab Asoodeh, Flávio du Pin Calmon:
Differentially Private Mechanisms for Count Queries. CoRR abs/2007.09374 (2020) - [i18]Shahab Asoodeh, Jiachun Liao, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
Three Variants of Differential Privacy: Lossless Conversion and Applications. CoRR abs/2008.06529 (2020) - [i17]Shahab Asoodeh, Flávio P. Calmon:
Bottleneck Problems: Information and Estimation-Theoretic View. CoRR abs/2011.06208 (2020) - [i16]Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
Privacy Analysis of Online Learning Algorithms via Contraction Coefficients. CoRR abs/2012.11035 (2020)
2010 – 2019
- 2019
- [j2]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Estimation Efficiency Under Privacy Constraints. IEEE Trans. Inf. Theory 65(3): 1512-1534 (2019) - [c15]Tingran Gao, Shahab Asoodeh, Yi Huang, James Evans:
Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds. AAAI 2019: 3630-3637 - [c14]Hsiang Hsu, Shahab Asoodeh, Flávio P. Calmon:
Information-Theoretic Privacy Watchdogs. ISIT 2019: 552-556 - [i15]Hsiang Hsu, Shahab Asoodeh, Flávio du Pin Calmon:
Obfuscation via Information Density Estimation. CoRR abs/1910.08109 (2019) - 2018
- [c13]Shahab Asoodeh, Tingran Gao, James Evans:
Curvature of Hypergraphs via Multi-Marginal Optimal Transport. CDC 2018: 1180-1185 - [c12]Shahab Asoodeh, Yi Huang, Ishanu Chattopadhyay:
A Tamper-Free Semi-Universal Communication System for Deletion Channels. CDC 2018: 4181-4186 - [c11]Hsiang Hsu, Shahab Asoodeh, Salman Salamatian, Flávio P. Calmon:
Generalizing Bottleneck Problems. ISIT 2018: 531-535 - [i14]Mario Díaz, Shahab Asoodeh, Fady Alajaji, Tamás Linder, Serban Teodor Belinschi, James A. Mingo:
On the Noise-Information Separation of a Private Principal Component Analysis Scheme. CoRR abs/1801.03553 (2018) - [i13]Hsiang Hsu, Shahab Asoodeh, Salman Salamatian, Flávio P. Calmon:
Generalizing Bottleneck Problems. CoRR abs/1802.05861 (2018) - [i12]Shahab Asoodeh, Tingran Gao, James Evans:
Curvature of Hypergraphs via Multi-Marginal Optimal Transport. CoRR abs/1803.08584 (2018) - [i11]Shahab Asoodeh, Yi Huang, Ishanu Chattopadhyay:
A Tamper-Free Semi-Universal Communication System for Deletion Channels. CoRR abs/1804.03707 (2018) - [i10]Tingran Gao, Shahab Asoodeh, Yi Huang, James Evans:
Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds. CoRR abs/1809.01833 (2018) - 2017
- [c10]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Privacy-aware guessing efficiency. ISIT 2017: 754-758 - [i9]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Privacy-Aware Guessing Efficiency. CoRR abs/1704.03606 (2017) - [i8]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Estimation Efficiency Under Privacy Constraints. CoRR abs/1707.02409 (2017) - 2016
- [j1]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Information Extraction Under Privacy Constraints. Inf. 7(1): 15 (2016) - [c9]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Almost Perfect Privacy for Additive Gaussian Privacy Filters. ICITS 2016: 259-278 - [c8]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Privacy-aware MMSE estimation. ISIT 2016: 1989-1993 - [i7]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Privacy-Aware MMSE Estimation. CoRR abs/1601.07417 (2016) - [i6]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Almost Perfect Privacy for Additive Gaussian Privacy Filters. CoRR abs/1608.04001 (2016) - 2015
- [c7]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Lossless secure source coding: Yamamoto's setting. Allerton 2015: 1032-1037 - [c6]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
On maximal correlation, mutual information and data privacy. CWIT 2015: 27-31 - [i5]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Lossless Secure Source Coding: Yamamoto's Setting. CoRR abs/1510.01783 (2015) - [i4]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Notes on Information-Theoretic Privacy. CoRR abs/1510.02318 (2015) - [i3]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
On Maximal Correlation, Mutual Information and Data Privacy. CoRR abs/1510.02330 (2015) - [i2]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Information Extraction Under Privacy Constraints. CoRR abs/1511.02381 (2015) - 2014
- [c5]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Notes on information-theoretic privacy. Allerton 2014: 1272-1278 - 2013
- [c4]Shahab Asoodeh, Fady Alajaji, Tamás Linder:
An achievability proof for the lossy coding of Markov sources with feed-forward. CWIT 2013: 66-70 - 2010
- [c3]Shahab Asoodeh:
New stopping criterion for turbo code in the presence of SNR mismatch. ICUMT 2010: 182-186 - [i1]Shahab Asoodeh, Amos Lapidoth, Ligong Wang:
It takes half the energy of a photon to send one bit reliably on the Poisson channel with feedback. CoRR abs/1010.5382 (2010)
2000 – 2009
- 2007
- [c2]Shahab Asoodeh, Alireza Rezazade:
On power control in cellular communication using ANFIS. Communications, Internet, and Information Technology 2007: 49-54 - [c1]Shahab Asoodeh, Alireza Rezazade:
A novel algorithm for CFO estimation in OFDM-based systems. Communications, Internet, and Information Technology 2007: 55-60
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-02-15 01:15 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:
