Lee, Jason D.
University of California, Berkeley
8 papers on CoChatORCID 0000-0003-0064-7800
Most cited papers
- Verified
Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks
Soltanolkotabi, M., Javanmard, A., & Lee, J. D. (2019) · IEEE Transactions on Information Theory
Stochastic Gradient Optimization TechniquesNeural Networks and Applications
Cited by 356
- Verified
Implicit Bias of Gradient Descent on Linear Convolutional Networks
Gunasekar, S., Lee, J., Soudry, D., & Srebro, N. (2018) · arXiv
Stochastic Gradient Optimization TechniquesNeural Networks and Applications
Cited by 75
- Verified
Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads
Cai, T., Li, Y., Geng, Z., Peng, H., Lee, J. D., Chen, D., & Dao, T. (2024) · arXiv
Natural Language Processing TechniquesTopic Modeling
Cited by 27
- Verified
What Makes a Reward Model a Good Teacher? An Optimization Perspective
Razin, N., Wang, Z., Strauss, H., Wei, S., Lee, J. D., & Arora, S. (2025) · arXiv
Reinforcement Learning in RoboticsMachine Learning and Algorithms
Cited by 2
- Verified
Reward Collapse in Aligning Large Language Models
Song, Z., Cai, T., Lee, J. D., & Su, W. J. (2023) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 2
- Verified
An Information-Theoretic Analysis of In-Context Learning
Jeon, H. J., Lee, J. D., Lei, Q., & Van Roy, B. (2024) · arXiv
Domain Adaptation and Few-Shot LearningMachine Learning and Algorithms
Cited by 1
- Verified
Learning What to Remember: Test-Time Training via Context Distillation
Wang, Z., Dang, X., Zhu, R.-J., Wen, Z., Fu, H., Chai, W., & Lee, J. D. (2026) · arXiv
Topic ModelingDomain Adaptation and Few-Shot Learning
Cited by 0
- Verified
Learning Compositional Functions with Transformers from Easy-to-Hard Data
Wang, Z., Nichani, E., Bietti, A., Damian, A., Hsu, D., Lee, J. D., & Wu, D. (2025) · arXiv
Machine Learning and AlgorithmsNeural Networks and Applications
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