Shao, Rulin
University of Washington
7 papers on CoChatORCID 0000-0002-8228-2106
Most cited papers
- Verified
On the Adversarial Robustness of Vision Transformers
Shao, R., Shi, Z., Yi, J., Chen, P.-Y., & Hsieh, C.-J. (2021) · arXiv
Adversarial Robustness in Machine LearningAdvanced Neural Network Applications
Cited by 68
- Verified
Synthesizing scientific literature with retrieval-augmented language models
Asai, A., He, J., Shao, R., Shi, W., Singh, A., Chang, J. C., Lo, K., Soldaini, L., Feldman, S., D’Arcy, M., et al. (2026) · Nature
Topic ModelingInformation Retrieval and Search Behavior
Cited by 38
- Verified
Scaling Retrieval-Based Language Models with a Trillion-Token Datastore
Shao, R., He, J., Asai, A., Shi, W., Dettmers, T., Min, S., Zettlemoyer, L., & Koh, P. (2024) · Advances in Neural Information Processing Systems 37
Topic ModelingInformation Retrieval and Search Behavior
Cited by 8
- Verified
OpenScholar: Synthesizing Scientific Literature with Retrieval-augmented LMs
Asai, A., He, J., Shao, R., Shi, W., Singh, A., Chang, J. C., Lo, K., Soldaini, L., Feldman, S., D'arcy, M., et al. (2024) · arXiv
Topic ModelingInformation Retrieval and Search Behavior
Cited by 7
- Verified
Language models scale reliably with over-training and on downstream tasks
Gadre, S. Y., Smyrnis, G., Shankar, V., Gururangan, S., Wortsman, M., Shao, R., Mercat, J., Fang, A., Li, J., Keh, S., et al. (2024) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 5
- Verified
Spurious Rewards: Rethinking Training Signals in RLVR
Shao, R., Li, S. S., Xin, R., Geng, S., Wang, Y., Oh, S., Du, S. S., Lambert, N., Min, S., Krishna, R., et al. (2025) · arXiv
Reinforcement Learning in RoboticsTopic Modeling
Cited by 1
- Verified
JobBench: Aligning Agent Work With Human Will
Li, Y., Feng, Y., Xu, Z., Ma, Z., Zheng, K., Jiang, F., Sun, X., Shao, R., Chen, Z., Huang, Y., et al. (2026) · arXiv
Ethics and Social Impacts of AIAI and HR Technologies
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