Suvrit Sra
Suvrit Sra has 2 papers in our library, in 2023, most of them on Language models & pretraining; often with Kwangjun Ahn, Xiang Cheng, Chulhee Yun.
OpenAlex · ORCID · Wikidata · h-index 46 · 327 works · 9,110 citations OpenAlex, 2026-10-14
📄 2 works in our library · 🔗 Cited 41 times in our library · 2 more in our library without a page yet · ⭐ Paper Stars ranking: #9809
Affiliations
🎓Technical University of MunichMunich ·
Germany2024–2026 · 8 papers🎓Massachusetts Institute of TechnologyCambridge ·
United States2014–2023 · 99 papersEmployment since 2015🔬Max Planck SocietyMunich ·
Germany2003–2015 · 34 papers🔬Max Planck Institute for Biological CyberneticsTübingen ·
Germany2003–2014 · 33 papers🔬Max Planck Institute for Intelligent SystemsStuttgart ·
Germany2011–2015 · 25 papers🎓The University of Texas at AustinAustin ·
United States2003–2008 · 14 papersEducation🎓Umeå UniversityUmeå ·
Sweden2021–2025 · 6 papers🎓Carnegie Mellon UniversityPittsburgh ·
United States2014–2015 · 6 papers🎓Tsinghua UniversityBeijing ·
China2021–2023 · 3 papers
Fields, topics and concepts
📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Artificial Intelligence · 2 worksArts and Humanities · 2 worksComputer Science · 2 worksLanguage and Linguistics · 2 works
🧭 Topics 1Research subjects and languages the work is about.Language models & pretraining · 1 work
Works by year
2020s
Papers
- Transformers learn to implement preconditioned gradient descent for in-context learning (2023 · 37 citations)
The paper asks whether transformers merely can represent optimization algorithms or whether ordinary training actually drives them to do so. - Linear attention is (maybe) all you need (to understand transformer optimization) (2023 · 10 citations)
Training Transformers is notoriously hard. Plain SGD lags well behind adaptive optimizers such as Adam, and the loss landscape shows unusual properties that classical optimization theory does not account for. Full Transformers are too complex to analyze directly, so the authors look for the simplest model that still…
All works
- Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization ↗neural information processing systems · no summary yetSashank Jakkam Reddi et al.2016 · 96 citations
- A Generic Approach for Escaping Saddle points ↗arXiv (Cornell University) · no summary yetSashank Jakkam Reddi et al.2017 · 52 citations
- Transformers learn to implement preconditioned gradient descent for in-context learningConference on Neural Information Processing Systems (NeurIPS)Kwangjun Ahn, Xiang Cheng, Hadi Daneshmand, et al.2023 · 37 citations
- Linear attention is (maybe) all you need (to understand transformer optimization)arXiv:2310.01082Kwangjun Ahn, Xiang Cheng, Minhak Song, et al.2023 · 10 citations
Co-authors here
Venues
- Conference on Neural Information Processing Systems (NeurIPS): NeurIPS 2023
- neural information processing systems
Cited by
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/authors/suvrit-sra/