Dao, Tri
16 papers on CoChat
Most cited papers
- Verified
Mamba: Linear-Time Sequence Modeling with Selective State Spaces
Gu, A., & Dao, T. (2023) · arXiv
Topic ModelingAdvanced Neural Network Applications
Cited by 1,579
- Verified
FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness
Dao, T., Fu, D. Y., Ermon, S., Rudra, A., & Ré, C. (2022) · arXiv
Parallel Computing and Optimization TechniquesAdvanced Neural Network Applications
Cited by 1,214
- Verified
StarCoder: may the source be with you!
Li, R., Allal, L. B., Zi, Y., Muennighoff, N., Kocetkov, D., Mou, C., Marone, M., Akiki, C., Li, J., Chim, J., et al. (2023) · arXiv
Software Engineering ResearchTopic Modeling
Cited by 261
- Verified
Hungry Hungry Hippos: Towards Language Modeling with State Space Models
Fu, D. Y., Dao, T., Saab, K. K., Thomas, A. W., Rudra, A., & Ré, C. (2022) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 123
- Verified
FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision
Shah, J., Bikshandi, G., Zhang, Y., Thakkar, V., Ramani, P., & Dao, T. (2024) · arXiv
Parallel Computing and Optimization TechniquesAdvanced Neural Network Applications
Cited by 104
- Verified
Hyena Hierarchy: Towards Larger Convolutional Language Models
Poli, M., Massaroli, S., Nguyen, E., Fu, D. Y., Dao, T., Baccus, S., Bengio, Y., Ermon, S., & Ré, C. (2023) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 96
- Verified
Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Duality
Dao, T., & Gu, A. (2024) · arXiv
Network Security and Intrusion DetectionNetwork Packet Processing and Optimization
Cited by 76
- Verified
StarCoder 2 and The Stack v2: The Next Generation
Lozhkov, A., Li, R., Allal, L. B., Cassano, F., Lamy-Poirier, J., Tazi, N., Tang, A., Pykhtar, D., Liu, J., Wei, Y., et al. (2024) · arXiv
Software Engineering ResearchTopic Modeling
Cited by 74
- Verified
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations
Dao, T., Gu, A., Eichhorn, M., Rudra, A., & Ré, C. (2019) · arXiv
Advanced Neural Network ApplicationsNeural Networks and Applications
Cited by 43
- 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
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps
Dao, T., Sohoni, N. S., Gu, A., Eichhorn, M., Blonder, A., Leszczynski, M., Rudra, A., & Ré, C. (2020) · arXiv
Advanced Neural Network ApplicationsNeural Networks and Applications
Cited by 21
- Verified
An Empirical Study of Mamba-based Language Models
Waleffe, R., Byeon, W., Riach, D., Norick, B., Korthikanti, V., Dao, T., Gu, A., Hatamizadeh, A., Singh, S., Narayanan, D., et al. (2024) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 19
- Verified
Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models
Dao, T., Chen, B., Liang, K., Yang, J., Song, Z., Rudra, A., & Ré, C. (2021) · arXiv
Advanced Neural Network ApplicationsStochastic Gradient Optimization Techniques
Cited by 10
- Verified
Mamba-3: Improved Sequence Modeling using State Space Principles
Lahoti, A., Li, K. Y., Chen, B., Wang, C., Bick, A., Kolter, J. Z., Dao, T., & Gu, A. (2026) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 1
- Verified
Log-Linear Attention
Guo, H., Yang, S., Goel, T., Xing, E. P., Dao, T., & Kim, Y. (2025) · arXiv
Topic ModelingAdvanced Neural Network Applications
Cited by 0
- Verified
Squeeze Evolve: Unified Multi-Model Orchestration for Verifier-Free Evolution
Maheswaran, M., Lakhani, L., Zhou, Z., Yang, S., Wang, J., Hooper, C., Hu, Y., Tiwari, R., Wang, J., Singh, H., et al. (2026) · arXiv
Evolutionary Algorithms and ApplicationsSoftware Engineering Research
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