default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Díaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Shahab Asoodeh, Mario Díaz:
On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent. ISIT 2024: 380-385- [c11]Behnoosh Zamanlooy, Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
$\mathrm{E}_{\gamma}$-Mixing Time. ISIT 2024: 3474-3479 - [i20]Behnoosh Zamanlooy, Mario Díaz, Shahab Asoodeh:
Locally Private Sampling with Public Data. CoRR abs/2411.08791 (2024) - 2023
- [c10]Lucas Monteiro Paes, Rodrigo Cruz, Flávio P. Calmon, Mario Díaz:
On the Inevitability of the Rashomon Effect. ISIT 2023: 549-554 - [i19]Shahab Asoodeh, Mario Díaz:
Privacy Loss of Noisy Stochastic Gradient Descent Might Converge Even for Non-Convex Losses. CoRR abs/2305.09903 (2023) - 2022
- [j6]Tyler Sypherd
, Mario Díaz, John Kevin Cava, Gautam Dasarathy, Peter Kairouz, Lalitha Sankar:
A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalization. IEEE Trans. Inf. Theory 68(9): 6021-6051 (2022) - 2021
- [j5]Hao Wang, Hsiang Hsu, Mario Díaz, Flávio P. Calmon:
To Split or not to Split: The Impact of Disparate Treatment in Classification. IEEE Trans. Inf. Theory 67(10): 6733-6757 (2021) - [c9]Mario Díaz, Peter Kairouz, Jiachun Liao, Lalitha Sankar:
Neural Network-based Estimation of the MMSE. ISIT 2021: 1023-1028 - [c8]Hao Wang, Hsiang Hsu, Mario Díaz, Flávio P. Calmon:
The Impact of Split Classifiers on Group Fairness. ISIT 2021: 3179-3184 - [i18]Mario Díaz, Peter Kairouz, Lalitha Sankar:
Lower Bounds for the Minimum Mean-Square Error via Neural Network-based Estimation. CoRR abs/2108.12851 (2021) - 2020
- [j4]Mario Díaz, Hao Wang, Flávio P. Calmon, Lalitha Sankar:
On the Robustness of Information-Theoretic Privacy Measures and Mechanisms. IEEE Trans. Inf. Theory 66(4): 1949-1978 (2020) - [c7]Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
Privacy Amplification of Iterative Algorithms via Contraction Coefficients. ISIT 2020: 896-901 - [c6]Tyler Sypherd, Mario Díaz, Lalitha Sankar, Gautam Dasarathy:
On the α-loss Landscape in the Logistic Model. ISIT 2020: 2700-2705 - [i17]Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
Privacy Amplification of Iterative Algorithms via Contraction Coefficients. CoRR abs/2001.06546 (2020) - [i16]Hao Wang, Hsiang Hsu, Mario Díaz, Flávio P. Calmon:
To Split or Not to Split: The Impact of Disparate Treatment in Classification. CoRR abs/2002.04788 (2020) - [i15]Tyler Sypherd, Mario Díaz, Lalitha Sankar, Gautam Dasarathy:
On the alpha-loss Landscape in the Logistic Model. CoRR abs/2006.12406 (2020) - [i14]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
- [j3]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Estimation Efficiency Under Privacy Constraints. IEEE Trans. Inf. Theory 65(3): 1512-1534 (2019) - [c5]Hao Wang, Mario Díaz, José Cândido Silveira Santos Filho, Flávio P. Calmon:
An Information-Theoretic View of Generalization via Wasserstein Distance. ISIT 2019: 577-581 - [c4]Tyler Sypherd, Mario Díaz, Lalitha Sankar, Peter Kairouz:
A Tunable Loss Function for Binary Classification. ISIT 2019: 2479-2483 - [i13]Tyler Sypherd, Mario Díaz, Lalitha Sankar, Peter Kairouz:
A Tunable Loss Function for Binary Classification. CoRR abs/1902.04639 (2019) - [i12]Tyler Sypherd, Mario Díaz, Harshit Laddha, Lalitha Sankar, Peter Kairouz, Gautam Dasarathy:
A Tunable Loss Function for Classification. CoRR abs/1906.02314 (2019) - [i11]Mario Díaz, Peter Kairouz, Jiachun Liao, Lalitha Sankar:
Theoretical Guarantees for Model Auditing with Finite Adversaries. CoRR abs/1911.03405 (2019) - 2018
- [c3]Hao Wang, Mario Díaz, Flávio P. Calmon, Lalitha Sankar:
The Utility Cost of Robust Privacy Guarantees. ISIT 2018: 706-710 - [i10]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) - [i9]Hao Wang, Mario Díaz, Flávio P. Calmon, Lalitha Sankar:
The Utility Cost of Robust Privacy Guarantees. CoRR abs/1801.05926 (2018) - [i8]Mario Díaz, Lalitha Sankar, Peter Kairouz:
On the Contractivity of Privacy Mechanisms. CoRR abs/1801.06255 (2018) - [i7]Mario Díaz, Hao Wang, Flávio P. Calmon, Lalitha Sankar:
On the Robustness of Information-Theoretic Privacy Measures and Mechanisms. CoRR abs/1811.06057 (2018) - 2017
- [j2]Mario Díaz, Víctor Pérez-Abreu:
On the Capacity of Block Multiantenna Channels. IEEE Trans. Inf. Theory 63(8): 5286-5298 (2017) - [c2]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Privacy-aware guessing efficiency. ISIT 2017: 754-758 - [i6]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Privacy-Aware Guessing Efficiency. CoRR abs/1704.03606 (2017) - [i5]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) - [c1]Mario Díaz:
On the symmetries and the capacity achieving input covariance matrices of multiantenna channels. ISIT 2016: 1073-1077 - [i4]Mario Díaz:
On the Symmetries and the Capacity Achieving Input Covariance Matrices of Multiantenna Channels. CoRR abs/1602.00043 (2016) - 2015
- [i3]Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Information Extraction Under Privacy Constraints. CoRR abs/1511.02381 (2015) - [i2]Mario Díaz, Víctor Pérez-Abreu:
On the Capacity of Block Multiantenna Channels. CoRR abs/1511.03686 (2015) - 2014
- [i1]Mario Díaz, Víctor Pérez-Abreu:
On the Asymptotic Ergodic Capacity of Correlated Multiantenna Channels using Finite Dimensional Statistics. CoRR abs/1404.4420 (2014)
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-21 00:00 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:
