Payam Delgosha

Orcid: 0000-0003-0266-9237

According to our database1, Payam Delgosha authored at least 20 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Binary Classification Under ℓ0 Attacks for General Noise Distribution.
IEEE Trans. Inf. Theory, February, 2024

Generalization Properties of Adversarial Training for 𝓁<sub>0</sub>-Bounded Adversarial Attacks.
CoRR, 2024

2023
A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs.
IEEE Trans. Inf. Theory, February, 2023

Generalization Properties of Adversarial Training for -ℓ0 Bounded Adversarial Attacks.
Proceedings of the IEEE Information Theory Workshop, 2023

2022
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs.
IEEE J. Sel. Areas Inf. Theory, December, 2022

Distributed Compression of Graphical Data.
IEEE Trans. Inf. Theory, 2022

Robust Classification Under $\ell_0$ Attack for the Gaussian Mixture Model.
SIAM J. Math. Data Sci., 2022

Binary Classification Under 𝓁<sub>0</sub> Attacks for General Noise Distribution.
CoRR, 2022

MM-GATBT: Enriching Multimodal Representation Using Graph Attention Network.
Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Student Research Workshop, 2022

Efficient and Robust Classification for Sparse Attacks.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Robust Classification Under 𝓁<sub>0</sub> Attack for the Gaussian Mixture Model.
CoRR, 2021

2020
Universal Lossless Compression of Graphical Data.
IEEE Trans. Inf. Theory, 2020

2019
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs.
CoRR, 2019

Deep Switch Networks for Generating Discrete Data and Language.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2017
Information Theoretic Cutting of a Cake.
IEEE Trans. Inf. Theory, 2017

High-Probability Guarantees in Repeated Games: Theory and Applications in Information Theory.
Proc. IEEE, 2017

Load balancing in hypergraphs.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2013
Impossibility of Local State Transformation via Hypercontractivity.
CoRR, 2013

2011
Randomized Algorithms for Comparison-based Search.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

A new decoding scheme for errorless codes for overloaded CDMA with active user detection.
Proceedings of the 18th International Conference on Telecommunications, 2011


  Loading...