Shahab Asoodeh

According to our database1, Shahab Asoodeh authored at least 35 papers between 2007 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Beyond Adult and COMPAS: Fairness in Multi-Class Prediction.
CoRR, 2022

Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the Large-Composition Regime.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Distribution Simulation Under Local Differential Privacy.
Proceedings of the 17th Canadian Workshop on Information Theory, 2022

2021
Three Variants of Differential Privacy: Lossless Conversion and Applications.
IEEE J. Sel. Areas Inf. Theory, 2021

Local Differential Privacy Is Equivalent to Contraction of E<sub>γ</sub>-Divergence.
CoRR, 2021

Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2021

Differentially Private Federated Learning: An Information-Theoretic Perspective.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Local Differential Privacy Is Equivalent to Contraction of an $f$-Divergence.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Bottleneck Problems: An Information and Estimation-Theoretic View.
Entropy, 2020

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

Bottleneck Problems: Information and Estimation-Theoretic View.
CoRR, 2020

Differentially Private Mechanisms for Count Queries.
CoRR, 2020

A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences.
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

Model Projection: Theory and Applications to Fair Machine Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Obfuscation via Information Density Estimation.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

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

Information-Theoretic Privacy Watchdogs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

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

Generalizing Bottleneck Problems.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Tamper-Free Semi-Universal Communication System for Deletion Channels.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

Curvature of Hypergraphs via Multi-Marginal Optimal Transport.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

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

2016
Information Extraction Under Privacy Constraints.
Inf., 2016

Privacy-aware MMSE estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Almost Perfect Privacy for Additive Gaussian Privacy Filters.
Proceedings of the Information Theoretic Security - 9th International Conference, 2016

2015
On maximal correlation, mutual information and data privacy.
Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

Lossless secure source coding: Yamamoto's setting.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Notes on information-theoretic privacy.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
An achievability proof for the lossy coding of Markov sources with feed-forward.
Proceedings of the 13th Canadian Workshop on Information Theory, 2013

2010
It takes half the energy of a photon to send one bit reliably on the Poisson channel with feedback
CoRR, 2010

New stopping criterion for turbo code in the presence of SNR mismatch.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2010

2007
A novel algorithm for CFO estimation in OFDM-based systems.
Proceedings of the Sixth IASTED International Conference on Communications, 2007

On power control in cellular communication using ANFIS.
Proceedings of the Sixth IASTED International Conference on Communications, 2007


  Loading...