Papailiopoulos, Dimitris
University of Wisconsin–Madison
7 papers on CoChat
Most cited papers
- Verified
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory
Advanced Data Storage TechnologiesStochastic Gradient Optimization Techniques
Cited by 829
- Verified
Attack of the tails: Yes, you really can backdoor federated learning
Wang, H., Sreenivasan, K., Rajput, S., Vishwakarma, H., Agarwal, S., Sohn, J.-Y., Lee, K., & Papailiopoulos, D. (2020) · arXiv
Adversarial Robustness in Machine LearningPrivacy-Preserving Technologies in Data
Cited by 406
- Verified
DETOX: A redundancy-based framework for faster and more robust gradient aggregation
Rajput, S., Wang, H., Charles, Z., & Papailiopoulos, D. (2019) · arXiv
Stochastic Gradient Optimization TechniquesDistributed systems and fault tolerance
Cited by 72
- Verified
LIFT: Language-Interfaced Fine-Tuning for Non-Language Machine Learning Tasks
Dinh, T., Zeng, Y., Zhang, R., Lin, Z., Gira, M., Rajput, S., Sohn, J.-Y., Papailiopoulos, D., & Lee, K. (2022) · arXiv
Topic ModelingDomain Adaptation and Few-Shot Learning
Cited by 67
- Verified
Prompted LLMs as Chatbot Modules for Long Open-domain Conversation
Lee, G., Hartmann, V., Park, J., Papailiopoulos, D., & Lee, K. (2023) · arXiv
Speech and dialogue systemsTopic Modeling
Cited by 34
- Verified
Prompted LLMs as Chatbot Modules for Long Open-domain Conversation
Lee, G., Hartmann, V., Park, J., Papailiopoulos, D., & Lee, K. (2023) · Findings of the Association for Computational Linguistics: ACL 2023
Speech and dialogue systemsTopic Modeling
Cited by 34
- Verified
Gradient Coding Using the Stochastic Block Model
Charles, Z., & Papailiopoulos, D. (2018) · 2018 IEEE International Symposium on Information Theory (ISIT)
Stochastic Gradient Optimization TechniquesDistributed systems and fault tolerance
Cited by 23
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free