Riedel, Sebastian
31 papers on CoChatORCID 0000-0002-3655-2486
Most cited papers
- Verified
Task-aware Retrieval with Instructions
Asai, A., Schick, T., Lewis, P., Chen, X., Izacard, G., Riedel, S., Hajishirzi, H., & Yih, W.-T. (2023) · Findings of the Association for Computational Linguistics: ACL 2023
Information Retrieval and Search BehaviorTopic Modeling
Cited by 46
- Verified
Generating fact checking briefs
Fan, A., Piktus, A., Petroni, F., Wenzek, G., Saeidi, M., Vlachos, A., Bordes, A., & Riedel, S. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)
Misinformation and Its ImpactsTopic Modeling
Cited by 42
- Verified
Knowledge Graph Completion via Complex Tensor Factorization
Trouillon, T., Dance, C. R., Welbl, J., Riedel, S., Gaussier, É., & Bouchard, G. (2017) · arXiv
Advanced Graph Neural NetworksRecommender Systems and Techniques
Cited by 41
- Verified
Convolutional 2D Knowledge Graph Embeddings
Dettmers, T., Minervini, P., Stenetorp, P., & Riedel, S. (2017) · arXiv
Advanced Graph Neural NetworksTopic Modeling
Cited by 30
- Verified
The Web Is Your Oyster - Knowledge-Intensive NLP against a Very Large Web Corpus
Piktus, A., Petroni, F., Karpukhin, V., Okhonko, D., Broscheit, S., Izacard, G., Lewis, P., Oğuz, B., Grave, E., Yih, W.-T., et al. (2021) · arXiv
Information Retrieval and Search BehaviorTopic Modeling
Cited by 22
- Verified
Improving Language Plasticity via Pretraining with Active Forgetting
Chen, Y., Marchisio, K., Raileanu, R., Adelani, D., Stenetorp, P. L. E. S., Riedel, S., & Artetxe, M. (2023) · Advances in Neural Information Processing Systems 36
Domain Adaptation and Few-Shot LearningNatural Language Processing Techniques
Cited by 3
- Verified
Do Large Language Models Latently Perform Multi-Hop Reasoning?
Yang, S., Gribovskaya, E., Kassner, N., Geva, M., & Riedel, S. (2024) · arXiv
Topic ModelingDomain Adaptation and Few-Shot Learning
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