default search action
Payam Delgosha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j9]Mark Beliaev
, Payam Delgosha
Efficient and Robust Classification for Sparse Attacks. IEEE J. Sel. Areas Inf. Theory 5: 261-272 (2024) - [j8]Payam Delgosha
Binary Classification Under ℓ0 Attacks for General Noise Distribution. IEEE Trans. Inf. Theory 70(2): 1284-1299 (2024) - 2023
- [j7]Payam Delgosha
A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs. IEEE Trans. Inf. Theory 69(2): 719-751 (2023) - 2022
- [j6]Payam Delgosha
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. IEEE J. Sel. Areas Inf. Theory 3(4): 746-758 (2022) - [j5]Payam Delgosha
Robust Classification Under $\ell_0$ Attack for the Gaussian Mixture Model. SIAM J. Math. Data Sci. 4(1): 362-385 (2022) - [j4]Payam Delgosha
Distributed Compression of Graphical Data. IEEE Trans. Inf. Theory 68(3): 1412-1439 (2022) - 2020
- [j3]Payam Delgosha
Universal Lossless Compression of Graphical Data. IEEE Trans. Inf. Theory 66(11): 6962-6976 (2020) - 2017
- [j2]Payam Delgosha
High-Probability Guarantees in Repeated Games: Theory and Applications in Information Theory. Proc. IEEE 105(2): 189-204 (2017) - [j1]Payam Delgosha
Information Theoretic Cutting of a Cake. IEEE Trans. Inf. Theory 63(11): 6950-6978 (2017)
Conference and Workshop Papers
- 2023
- [c14]Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Generalization Properties of Adversarial Training for -ℓ0 Bounded Adversarial Attacks. ITW 2023: 113-118 - 2022
- [c13]Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Binary Classification Under ℓ0 Attacks for General Noise Distribution. ISIT 2022: 1731-1736 - [c12]Mark Beliaev, Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Efficient and Robust Classification for Sparse Attacks. ISIT 2022: 3150-3155 - [c11]Seung Byum Seo, Hyoungwook Nam, Payam Delgosha:
MM-GATBT: Enriching Multimodal Representation Using Graph Attention Network. NAACL-HLT (Student Research Workshop) 2022: 106-112 - 2021
- [c10]Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs. ISIT 2021: 2792-2797 - 2020
- [c9]Payam Delgosha, Venkat Anantharam:
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. ISIT 2020: 2349-2354 - 2019
- [c8]Payam Delgosha, Naveen Goela:
Deep Switch Networks for Generating Discrete Data and Language. AISTATS 2019: 3060-3069 - 2018
- [c7]Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. ISIT 2018: 2216-2220 - 2017
- [c6]Payam Delgosha, Venkat Anantharam:
Load balancing in hypergraphs. Allerton 2017: 45-52 - [c5]Payam Delgosha, Venkat Anantharam:
Universal lossless compression of graphical data. ISIT 2017: 1578-1582 - 2016
- [c4]Payam Delgosha, Amin Aminzadeh Gohari
High probability guarantees in repeated games: Theory and applications in information theory. ISIT 2016: 1621-1625 - 2012
- [c3]Payam Delgosha, Amin Aminzadeh Gohari:
Information theoretic cutting of a cake. ITW 2012: 517-521 - 2011
- [c2]Ali Mousavi, Pedram Pad, Payam Delgosha, Farokh Marvasti:
A new decoding scheme for errorless codes for overloaded CDMA with active user detection. ICT 2011: 201-205 - [c1]Dominique Tschopp, Suhas N. Diggavi, Payam Delgosha, Soheil Mohajer:
Randomized Algorithms for Comparison-based Search. NIPS 2011: 2231-2239
Informal and Other Publications
- 2024
- [i14]Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Generalization Properties of Adversarial Training for 𝓁0-Bounded Adversarial Attacks. CoRR abs/2402.03576 (2024) - 2023
- [i13]Payam Delgosha, Venkat Anantharam:
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. CoRR abs/2301.05742 (2023) - 2022
- [i12]Mark Beliaev, Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Efficient and Robust Classification for Sparse Attacks. CoRR abs/2201.09369 (2022) - [i11]Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Binary Classification Under 𝓁0 Attacks for General Noise Distribution. CoRR abs/2203.04855 (2022) - 2021
- [i10]Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Robust Classification Under 𝓁0 Attack for the Gaussian Mixture Model. CoRR abs/2104.02189 (2021) - [i9]Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs. CoRR abs/2107.08350 (2021) - 2019
- [i8]Payam Delgosha, Naveen Goela:
Deep Switch Networks for Generating Discrete Data and Language. CoRR abs/1903.06135 (2019) - [i7]Payam Delgosha, Venkat Anantharam:
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs. CoRR abs/1908.00964 (2019) - [i6]Payam Delgosha, Venkat Anantharam:
Universal Lossless Compression of Graphical Data. CoRR abs/1909.09844 (2019) - 2018
- [i5]Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. CoRR abs/1802.07446 (2018) - 2017
- [i4]Payam Delgosha, Venkat Anantharam:
Load Balancing in Hypergraphs. CoRR abs/1710.00308 (2017) - 2015
- [i3]Payam Delgosha, Amin Aminzadeh Gohari, Mohammad Akbarpour:
High Probability Guarantees in Repeated Games: Theory and Applications in Information Theory. CoRR abs/1509.08571 (2015) - 2013
- [i2]Payam Delgosha, Salman Beigi:
Impossibility of Local State Transformation via Hypercontractivity. CoRR abs/1307.2747 (2013) - 2012
- [i1]Payam Delgosha, Amin Aminzadeh Gohari:
Information Theoretic cutting of a cake. CoRR abs/1205.4144 (2012)
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 2024-06-19 21:50 CEST 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: