| 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 | 44* | 2023 |
| The exact sample complexity gain from invariances for kernel regression B Tahmasebi, S Jegelka Advances in Neural Information Processing Systems 36, 2023 | 21* | 2023 |
| Private sequential function computation B Tahmasebi, MA Maddah-Ali 2019 IEEE International Symposium on Information Theory (ISIT), 1667-1671, 2019 | 18 | 2019 |
| On the identifiability of parameters in the population stratification problem: A worst-case analysis B Tahmasebi, AS Motahari, MA Maddah–Ali 2018 IEEE International Symposium on Information Theory (ISIT), 1051-1055, 2018 | 13* | 2018 |
| Sample complexity bounds for estimating probability divergences under invariances B Tahmasebi, S Jegelka Forty-first International Conference on Machine Learning, 2024 | 8* | 2024 |
| Private function computation B Tahmasebi, MA Maddah-Ali 2020 IEEE International Symposium on Information Theory (ISIT), 1118-1123, 2020 | 7 | 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 Journal on Selected Areas in Communications 36 (10), 2233-2245, 2018 | 7 | 2018 |
| Information theory of mixed population genome-wide association studies B Tahmasebi, MA Maddah-Ali, SA Motahari 2018 IEEE Information Theory Workshop (ITW), 1-5, 2018 | 5 | 2018 |
| Genome-wide association studies: Information theoretic limits of reliable learning B Tahmasebi, MA Maddah-Ali, AS Motahari 2018 IEEE International Symposium on Information Theory (ISIT), 2231-2235, 2018 | 5 | 2018 |
| Coded Computing for Resilient Distributed Computing: A Learning-Theoretic Framework P Moradi, B Tahmasebi, MA Maddah-Ali The Thirty-eighth Annual Conference on Neural Information Processing Systems, 2024 | 3* | 2024 |
| A Universal Class of Sharpness-Aware Minimization Algorithms B Tahmasebi, A Soleymani, D Bahri, S Jegelka, P Jaillet Forty-first International Conference on Machine Learning, 2024 | 2* | 2024 |
| 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 |
| Regularity in Canonicalized Models: A Theoretical Perspective B Tahmasebi, S Jegelka The 28th International Conference on Artificial Intelligence and Statistics, 2025 | | 2025 |
| A Robust Kernel Statistical Test of Invariance: Detecting Subtle Asymmetries A Soleymani, B Tahmasebi, S Jegelka, P Jaillet The 28th International Conference on Artificial Intelligence and Statistics, 2025 | | 2025 |
| Learning with Exact Invariances in Polynomial Time A Soleymani*, B Tahmasebi*, S Jegelka, P Jaillet https://people.csail.mit.edu/bzt/polytime.pdf, 2024 | | 2024 |
| Generalization Bounds for Canonicalization: A Comparative Study with Group Averaging B Tahmasebi, S Jegelka https://people.csail.mit.edu/bzt/gencan.pdf, 2024 | | 2024 |
Stefanie JegelkaTUM and MITVerifisert e-postadresse på mit.edu
