Payam Delgosha

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Binary Classification Under ℓ0 Attacks for General Noise Distribution.

Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

IEEE Trans. Inf. Theory, February, 2024

Efficient and Robust Classification for Sparse Attacks.

Mark Beliaev, Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

IEEE J. Sel. Areas Inf. Theory, 2024

Generalization Properties of Adversarial Training for 𝓁₀-Bounded Adversarial Attacks.

Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

CoRR, 2024

2023

A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs.

Payam Delgosha, Venkat Anantharam

IEEE Trans. Inf. Theory, February, 2023

Generalization Properties of Adversarial Training for -ℓ0 Bounded Adversarial Attacks.

Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

Proceedings of the IEEE Information Theory Workshop, 2023

2022

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs.

Payam Delgosha, Venkat Anantharam

IEEE J. Sel. Areas Inf. Theory, December, 2022

Distributed Compression of Graphical Data.

Payam Delgosha, Venkat Anantharam

IEEE Trans. Inf. Theory, 2022

Robust Classification Under $\ell_0$ Attack for the Gaussian Mixture Model.

Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

SIAM J. Math. Data Sci., 2022

Binary Classification Under 𝓁₀ Attacks for General Noise Distribution.

Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

CoRR, 2022

MM-GATBT: Enriching Multimodal Representation Using Graph Attention Network.

Seung Byum Seo, Hyoungwook Nam, Payam Delgosha

Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: Student Research Workshop, 2022

2021

Robust Classification Under 𝓁₀ Attack for the Gaussian Mixture Model.

Payam Delgosha, Hamed Hassani, Ramtin Pedarsani

CoRR, 2021

2020

Universal Lossless Compression of Graphical Data.

Payam Delgosha, Venkat Anantharam

IEEE Trans. Inf. Theory, 2020

2019

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

Payam Delgosha, Venkat Anantharam

CoRR, 2019

Deep Switch Networks for Generating Discrete Data and Language.

Payam Delgosha, Naveen Goela

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2017

Information Theoretic Cutting of a Cake.

Payam Delgosha, Amin Gohari

IEEE Trans. Inf. Theory, 2017

High-Probability Guarantees in Repeated Games: Theory and Applications in Information Theory.

Payam Delgosha, Amin Aminzadeh Gohari, Mohammad Akbarpour

Proc. IEEE, 2017

Load balancing in hypergraphs.

Payam Delgosha, Venkat Anantharam

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2013

Impossibility of Local State Transformation via Hypercontractivity.

Payam Delgosha, Salman Beigi

CoRR, 2013

2011

Randomized Algorithms for Comparison-based Search.

Dominique Tschopp, Suhas N. Diggavi, Payam Delgosha, Soheil Mohajer

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.

Ali Mousavi, Pedram Pad, Payam Delgosha, Farokh Marvasti

Proceedings of the 18th International Conference on Telecommunications, 2011