The Power of Recursion in Graph Neural Networks for Counting Substructures B Tahmasebi, D Lim, S Jegelka International Conference on Artificial Intelligence and Statistics, 11023-11042, 2023 | 28* | 2023 |
Private sequential function computation B Tahmasebi, MA Maddah-Ali 2019 IEEE International Symposium on Information Theory (ISIT), 1667-1671, 2019 | 17 | 2019 |
On the identifiability of finite mixtures of finite product measures B Tahmasebi, SA Motahari, MA Maddah-Ali arXiv preprint arXiv:1807.05444, 2018 | 12 | 2018 |
The Capacity of Associated Subsequence Retrieval B Tahmasebi, MA Maddah-Ali, SA Motahari IEEE Transactions on Information Theory 67 (2), 790-804, 2021 | 7* | 2021 |
Optimum transmission delay for function computation in NFV-based networks: The role of network coding and redundant computing B Tahmasebi, MA Maddah-Ali, S Parsaeefard, BH Khalaj IEEE Journal on Selected Areas in Communications 36 (10), 2233-2245, 2018 | 7 | 2018 |
Private function computation B Tahmasebi, MA Maddah-Ali 2020 IEEE International Symposium on Information Theory (ISIT), 1118-1123, 2020 | 6 | 2020 |
The Exact Sample Complexity Gain from Invariances for Kernel Regression B Tahmasebi, S Jegelka Advances in Neural Information Processing Systems 36, 2023 | 5* | 2023 |
On Scale-Invariant Sharpness Measures B Tahmasebi, A Soleymani, S Jegelka, P Jaillet NeurIPS 2023 Workshop on Mathematics of Modern Machine Learning, 2023 | | 2023 |
Sample Complexity Bounds for Estimating Probability Divergences under Invariances B Tahmasebi, S Jegelka arXiv preprint arXiv:2311.02868, 2023 | | 2023 |