Zaheer, Manzil
Google DeepMind (United Kingdom)
7 papers on CoChatORCID 0009-0009-2708-691X
Most cited papers
- Verified
Federated Optimization in Heterogeneous Networks
Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2018) · arXiv
Privacy-Preserving Technologies in DataStochastic Gradient Optimization Techniques
Cited by 4,023
- Verified
Big Bird: Transformers for Longer Sequences
Zaheer, M., Guruganesh, G., Dubey, A., Ainslie, J., Alberti, C., Ontanon, S., Pham, P., Ravula, A., Wang, Q., Yang, L., et al. (2020) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 1,349
- Verified
Adaptive Federated Optimization
Reddi, S., Charles, Z., Zaheer, M., Garrett, Z., Rush, K., Konečný, J., Kumar, S., & McMahan, H. B. (2020) · arXiv
Privacy-Preserving Technologies in DataStochastic Gradient Optimization Techniques
Cited by 840
- Verified
Modifying Memories in Transformer Models
Zhu, C., Rawat, A. S., Zaheer, M., Bhojanapalli, S., Li, D., Yu, F., & Kumar, S. (2020) · arXiv
Topic ModelingDomain Adaptation and Few-Shot Learning
Cited by 48
- Verified
Large Language Models with Controllable Working Memory
Li, D., Rawat, A. S., Zaheer, M., Wang, X., Lukasik, M., Veit, A., Yu, F., & Kumar, S. (2023) · Findings of the Association for Computational Linguistics: ACL 2023
Topic ModelingNatural Language Processing Techniques
Cited by 46
- Verified
StreamingQA: A Benchmark for Adaptation to New Knowledge over Time in Question Answering Models
Liška, A., Kočiský, T., Gribovskaya, E., Terzi, T., Sezener, E., Agrawal, D., d'Autume, C. D. M., Scholtes, T., Zaheer, M., Young, S., et al. (2022) · arXiv
Topic ModelingInformation Retrieval and Search Behavior
Cited by 19
- Verified
Scaling Test-Time Compute for Agentic Coding
Kim, J., Yang, W., Niu, K., Zhang, H., Zhu, Y., Helenowski, E., Silva, R., Chen, Z., Iyer, S., Zaheer, M., et al. (2026) · arXiv
Software Engineering ResearchAI-based Problem Solving and Planning
Cited by 0
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free