default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohsen Heidari
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On the Reliability Function of Discrete Memoryless Multiple-Access Channel With Feedback. IEEE Trans. Inf. Theory 71(1): 61-89 (2025)- 2024
- [c22]Mohsen Heidari, Wojciech Szpankowski:
New Bounds on Quantum Sample Complexity of Measurement Classes. ISIT 2024: 1515-1520 - [i24]Mohsen Heidari, Masih Mozakka, Wojciech Szpankowski:
Efficient Gradient Estimation of Variational Quantum Circuits with Lie Algebraic Symmetries. CoRR abs/2404.05108 (2024) - [i23]Mohsen Heidari, Wojciech Szpankowski:
New Bounds on Quantum Sample Complexity of Measurement Classes. CoRR abs/2408.12683 (2024) - 2023
- [j11]Mohsen Heidari, Mohammad Hossein Moattar
, Hamidreza Ghaffari:
Forward propagation dropout in deep neural networks using Jensen-Shannon and random forest feature importance ranking. Neural Networks 165: 238-247 (2023) - [j10]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Regret Bounds for Log-Loss via Bayesian Algorithms. IEEE Trans. Inf. Theory 69(9): 5971-5989 (2023) - [j9]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Expected Worst Case Regret via Stochastic Sequential Covering. Trans. Mach. Learn. Res. 2023 (2023) - [j8]Yihong Yang, Xuan Yang, Mohsen Heidari, Mohammad Ayoub Khan, Gautam Srivastava, Mohammad Reza Khosravi, Lianyong Qi:
ASTREAM: Data-Stream-Driven Scalable Anomaly Detection With Accuracy Guarantee in IIoT Environment. IEEE Trans. Netw. Sci. Eng. 10(5): 3007-3016 (2023) - [c21]Mohsen Heidari, Wojciech Szpankowski:
Learning k-qubit Quantum Operators via Pauli Decomposition. AISTATS 2023: 490-504 - [c20]Mohsen Heidari, Wojciech Szpankowski:
Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression. AISTATS 2023: 2922-2938 - [c19]Farhad Shirani, Mohsen Heidari:
On Non-Interactive Source Simulation via Fourier Transform. ITW 2023: 371-376 - [i22]Mohsen Heidari, Wojciech Szpankowski:
Agnostic PAC Learning of k-juntas Using L2-Polynomial Regression. CoRR abs/2303.04859 (2023) - [i21]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback. CoRR abs/2306.06796 (2023) - [i20]Mohsen Heidari, Mobasshir A Naved, Wenbo Xie, Arjun Jacob Grama, Wojciech Szpankowski:
Quantum Shadow Gradient Descent for Quantum Learning. CoRR abs/2310.06935 (2023) - 2022
- [j7]Touheed Anwar Atif, Mohsen Heidari, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements With Applications in Distributed Rate-Distortion Theory. IEEE Trans. Inf. Theory 68(2): 1085-1118 (2022) - [j6]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization. IEEE Trans. Inf. Theory 68(9): 6063-6077 (2022) - [j5]Khosro Rezaee, Seyed Jalaleddin Mousavirad, Mohammad Reza Khosravi, Mohammad Kazem Moghimi, Mohsen Heidari:
An Autonomous UAV-Assisted Distance-Aware Crowd Sensing Platform Using Deep ShuffleNet Transfer Learning. IEEE Trans. Intell. Transp. Syst. 23(7): 9404-9413 (2022) - [c18]Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Toward Physically Realizable Quantum Neural Networks. AAAI 2022: 6902-6909 - [c17]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Sequential vs. Fixed Design Regrets in Online Learning. ISIT 2022: 438-443 - [c16]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Upper Bounds on the Feedback Error Exponent of Channels With States and With Memory. ISIT 2022: 1330-1335 - [c15]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm. NeurIPS 2022 - [i19]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Upper Bounds on the Feedback Error Exponent of Channels With States and Memory. CoRR abs/2202.09933 (2022) - [i18]Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Toward Physically Realizable Quantum Neural Networks. CoRR abs/2203.12092 (2022) - [i17]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm. CoRR abs/2205.03728 (2022) - [i16]Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Expected Worst Case Regret via Stochastic Sequential Covering. CoRR abs/2209.04417 (2022) - [i15]Farhad Shirani, Mohsen Heidari:
On Non-Interactive Source Simulation via Fourier Transform. CoRR abs/2212.09239 (2022) - 2021
- [c14]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Finding Relevant Information via a Discrete Fourier Expansion. ICML 2021: 4181-4191 - [c13]Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. ISIT 2021: 1469-1474 - [c12]Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Information Sufficiency via Fourier Expansion. ISIT 2021: 2774-2779 - [i14]Mohsen Heidari, Wojciech Szpankowski:
A Low Degree Learning Algorithm for Quantum Data via Quantum Fourier. CoRR abs/2102.05209 (2021) - [i13]Mohsen Heidari, Wojciech Szpankowski:
On Agnostic PAC Learning using L2-polynomial Regression and Fourier-based Algorithms. CoRR abs/2102.06277 (2021) - [i12]Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. CoRR abs/2107.06406 (2021) - 2020
- [j4]Mohsen Heidari, S. Sandeep Pradhan:
Structured Mappings and Conferencing Common Information for Multiple-Access Channels. IEEE Trans. Inf. Theory 66(7): 4203-4225 (2020)
2010 – 2019
- 2019
- [j3]Mohsen Heidari, Vahid Ahmadi:
Design and Analysis of a Graphene Magneto-Plasmon Waveguide for Plasmonic Mode Switch. IEEE Access 7: 43406-43413 (2019) - [j2]Mohsen Heidari, Farhad Shirani, S. Sandeep Pradhan:
Quasi Structured Codes for Multi-Terminal Communications. IEEE Trans. Inf. Theory 65(10): 6263-6289 (2019) - [c11]Mohsen Heidari, Touheed Anwar Atif, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory. ISIT 2019: 1162-1166 - [c10]Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. ISIT 2019: 1192-1196 - [i11]Mohsen Heidari, Touheed Anwar Atif, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory. CoRR abs/1901.06788 (2019) - [i10]Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. CoRR abs/1901.10576 (2019) - [i9]Mohsen Heidari, S. Sandeep Pradhan:
Structured Mappings and Conferencing Common Information for Multiple-access Channels. CoRR abs/1905.04760 (2019) - 2018
- [j1]S. Sandeep Pradhan, Mohsen Heidari, Aria Ghasemian Sahebi:
Corrections to "Abelian Group Codes for Channel Coding and Source Coding". IEEE Trans. Inf. Theory 64(5): 3953 (2018) - [c9]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. ISIT 2018: 1126-1130 - [c8]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback. ITW 2018: 1-5 - [i8]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. CoRR abs/1801.05294 (2018) - [i7]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback. CoRR abs/1801.07777 (2018) - 2017
- [c7]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A new achievable rate region for multiple-access channel with states. ISIT 2017: 36-40 - [c6]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the necessity of structured codes for communications over MAC with feedback. ISIT 2017: 2298-2302 - [i6]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A New Achievable Rate Region for Multiple-Access Channel with States. CoRR abs/1702.02330 (2017) - [i5]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Necessity of Structured Codes for Communications over MAC with Feedback. CoRR abs/1702.05544 (2017) - [i4]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
How to Compute Modulo Prime-Power Sums ? CoRR abs/1708.00665 (2017) - 2016
- [c5]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to point-to-point and multi-terminal source coding. ISIT 2016: 730-734 - [c4]Mohsen Heidari, S. Sandeep Pradhan:
How to compute modulo prime-power sums. ISIT 2016: 1824-1828 - [c3]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New sufficient conditions for Multiple-Access Channel with correlated sources. ISIT 2016: 2019-2023 - [i3]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to Point-to-Point and Multi-Terminal Source Coding. CoRR abs/1602.04521 (2016) - [i2]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New Sufficient Conditions for Multiple-Access Channel with Correlated Sources. CoRR abs/1603.05274 (2016) - [i1]Mohsen Heidari, S. Sandeep Pradhan:
How to Compute Modulo Prime-Power Sums. CoRR abs/1609.04360 (2016) - 2015
- [c2]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
New lattice codes for multiple-descriptions. ISIT 2015: 1580-1584 - [c1]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Beyond group capacity in multi-terminal communications. ISIT 2015: 2081-2085
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 2025-01-14 21:10 CET 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:
