| The power of recursion in graph neural networks for counting substructures B Tahmasebi, D Lim, S Jegelka AISTATS 2023, 2023 | 48* | 2023 |
| The exact sample complexity gain from invariances for kernel regression B Tahmasebi, S Jegelka NeurIPS 2023, 2023 | 46 | 2023 |
| Private sequential function computation B Tahmasebi, MA Maddah-Ali IEEE ISIT 2019, 2019 | 22 | 2019 |
| Sample complexity bounds for estimating probability divergences under invariances B Tahmasebi, S Jegelka ICML 2024, 2024 | 18* | 2024 |
| On the identifiability of parameters in the population stratification problem: A worst-case analysis B Tahmasebi, AS Motahari, MA Maddah–Ali IEEE ISIT 2018, 2018 | 15* | 2018 |
| A Universal Class of Sharpness-Aware Minimization Algorithms B Tahmasebi, A Soleymani, D Bahri, S Jegelka, P Jaillet ICML 2024, 2024 | 11* | 2024 |
| Private function computation B Tahmasebi, MA Maddah-Ali IEEE ISIT 2020, 2020 | 10 | 2020 |
| 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 JSAC 36 (10), 2233-2245, 2018 | 8 | 2018 |
| Coded Computing for Resilient Distributed Computing: A Learning-Theoretic Framework P Moradi, B Tahmasebi, MA Maddah-Ali NeurIPS 2024, 2024 | 7* | 2024 |
| Generalization Bounds for Canonicalization: A Comparative Study with Group Averaging B Tahmasebi, S Jegelka ICLR 2025, 2025 | 5* | 2025 |
| Information theory of mixed population genome-wide association studies B Tahmasebi, MA Maddah-Ali, SA Motahari IEEE ITW 2018, 2018 | 5 | 2018 |
| Genome-wide association studies: Information theoretic limits of reliable learning B Tahmasebi, MA Maddah-Ali, AS Motahari IEEE ISIT 2018, 2018 | 5 | 2018 |
| Learning with Exact Invariances in Polynomial Time A Soleymani, B Tahmasebi, S Jegelka, P Jaillet ICML 2025, 2025 | 4 | 2025 |
| Regularity in Canonicalized Models: A Theoretical Perspective B Tahmasebi, S Jegelka AISTATS 2025, 2025 | 4 | 2025 |
| A Robust Kernel Statistical Test of Invariance: Detecting Subtle Asymmetries A Soleymani, B Tahmasebi, S Jegelka, P Jaillet AISTATS 2025, 2025 | 4 | 2025 |
| From Finite to Infinite Groups: A Polynomial-Time Algorithm for Learning with Exact Invariances A Soleymani, B Tahmasebi, P Jaillet, S Jegelka NeurIPS 2025 Workshop on Symmetry and Geometry in Neural Representations, 2025 | 1 | 2025 |
| The capacity of associated subsequence retrieval B Tahmasebi, MA Maddah-Ali, SA Motahari IEEE Transactions on Information Theory 67 (2), 790-804, 2021 | 1 | 2021 |
| Achieving Approximate Symmetry Is Exponentially Easier than Exact Symmetry B Tahmasebi, M Weber arXiv preprint arXiv:2512.11855, 2025 | | 2025 |
| Geometric Algorithms for Neural Combinatorial Optimization with Constraints N Karalias, A Rafiey, Y Xu, Z Luo, B Tahmasebi, C Jiang, S Jegelka NeurIPS 2025, 2025 | | 2025 |
| On Counting Substructures with Graph Neural Networks B Tahmasebi Massachusetts Institute of Technology, 2025 | | 2025 |
Stefanie JegelkaTUM and MITVerified email at mit.edu
