Mario Díaz

Orcid: 0000-0002-9321-9815

According to our database1, Mario Díaz authored at least 27 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
$\mathrm{E}_{\gamma}$-Mixing Time.
Proceedings of the IEEE International Symposium on Information Theory, 2024

On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Privacy Loss of Noisy Stochastic Gradient Descent Might Converge Even for Non-Convex Losses.
CoRR, 2023

On the Inevitability of the Rashomon Effect.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalization.
IEEE Trans. Inf. Theory, 2022

2021
To Split or not to Split: The Impact of Disparate Treatment in Classification.
IEEE Trans. Inf. Theory, 2021

Lower Bounds for the Minimum Mean-Square Error via Neural Network-based Estimation.
CoRR, 2021

Neural Network-based Estimation of the MMSE.
Proceedings of the IEEE International Symposium on Information Theory, 2021

The Impact of Split Classifiers on Group Fairness.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
On the Robustness of Information-Theoretic Privacy Measures and Mechanisms.
IEEE Trans. Inf. Theory, 2020

Privacy Analysis of Online Learning Algorithms via Contraction Coefficients.
CoRR, 2020

On the alpha-loss Landscape in the Logistic Model.
CoRR, 2020

On the α-loss Landscape in the Logistic Model.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Privacy Amplification of Iterative Algorithms via Contraction Coefficients.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Estimation Efficiency Under Privacy Constraints.
IEEE Trans. Inf. Theory, 2019

Theoretical Guarantees for Model Auditing with Finite Adversaries.
CoRR, 2019

A Tunable Loss Function for Classification.
CoRR, 2019

An Information-Theoretic View of Generalization via Wasserstein Distance.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Tunable Loss Function for Binary Classification.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On the Contractivity of Privacy Mechanisms.
CoRR, 2018

On the Noise-Information Separation of a Private Principal Component Analysis Scheme.
CoRR, 2018

The Utility Cost of Robust Privacy Guarantees.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
On the Capacity of Block Multiantenna Channels.
IEEE Trans. Inf. Theory, 2017

Privacy-aware guessing efficiency.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Information Extraction Under Privacy Constraints.
Inf., 2016

On the symmetries and the capacity achieving input covariance matrices of multiantenna channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2014
On the Asymptotic Ergodic Capacity of Correlated Multiantenna Channels using Finite Dimensional Statistics.
CoRR, 2014


  Loading...