Cohen, William W.
14 papers on CoChat
Most cited papers
- Verified · note
HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering
Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W., Salakhutdinov, R., & Manning, C. D. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
Topic ModelingMultimodal Machine Learning Applications
Cited by 1,804
- Verified
Gated-Attention Readers for Text Comprehension
Dhingra, B., Liu, H., Yang, Z., Cohen, W., & Salakhutdinov, R. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Topic ModelingInformation Retrieval and Search Behavior
Cited by 366
- Verified
Time-aware language models as temporal knowledge bases
Dhingra, B., Cole, J. R., Eisenschlos, J. M., Gillick, D., Eisenstein, J., & Cohen, W. W. (2022) · Transactions of the Association for Computational Linguistics
Topic ModelingNatural Language Processing Techniques
Cited by 212
- Verified
Handling Divergent Reference Texts when Evaluating Table-to-Text Generation
Dhingra, B., Faruqui, M., Parikh, A., Chang, M.-W., Das, D., & Cohen, W. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics
Topic ModelingNatural Language Processing Techniques
Cited by 150
- Verified
Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks
Chen, W., Ma, X., Wang, X., & Cohen, W. W. (2022) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 125
- Verified
HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering
Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W. W., Salakhutdinov, R., & Manning, C. D. (2018) · arXiv
Topic ModelingMultimodal Machine Learning Applications
Cited by 97
- Verified
Semi-Supervised Classification of Network Data Using Very Few Labels
Lin, F., & Cohen, W. W. (2010) · 2010 International Conference on Advances in Social Networks Analysis and Mining
Machine Learning and AlgorithmsAdvanced Graph Neural Networks
Cited by 96
- Verified
Re-Imagen: Retrieval-Augmented Text-to-Image Generator
Chen, W., Hu, H., Saharia, C., & Cohen, W. W. (2022) · arXiv
Generative Adversarial Networks and Image SynthesisMultimodal Machine Learning Applications
Cited by 55
- Verified
Faithful Embeddings for Knowledge Base Queries
Sun, H., Arnold, A. O., Bedrax-Weiss, T., Pereira, F., & Cohen, W. W. (2020) · arXiv
Advanced Graph Neural NetworksTopic Modeling
Cited by 51
- Verified
Structure Learning via Parameter Learning
Wang, W. Y., Mazaitis, K., & Cohen, W. W. (2014) · Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management
Logic, Reasoning, and KnowledgeBayesian Modeling and Causal Inference
Cited by 47
- Verified
Attributed Question Answering: Evaluation and Modeling for Attributed Large Language Models
Bohnet, B., Tran, V. Q., Verga, P., Aharoni, R., Andor, D., Soares, L. B., Ciaramita, M., Eisenstein, J., Ganchev, K., Herzig, J., et al. (2022) · arXiv
Topic ModelingAuthorship Attribution and Profiling
Cited by 30
- Verified
Why Tutored Problem Solving May be Better Than Example Study: Theoretical Implications from a Simulated-Student Study
Matsuda, N., Cohen, W. W., Sewall, J., Lacerda, G., & Koedinger, K. R. (2008) · Lecture Notes in Computer Science
Intelligent Tutoring Systems and Adaptive LearningVisual and Cognitive Learning Processes
Cited by 17
- Verified
Reasoning Over Virtual Knowledge Bases With Open Predicate Relations
Sun, H., Verga, P., Dhingra, B., Salakhutdinov, R., & Cohen, W. W. (2021) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 14
- Verified
VLM Agents Generate Their Own Memories: Distilling Experience into Embodied Programs of Thought
Sarch, G., Jang, L., Tarr, M. J., Cohen, W. W., Marino, K., & Fragkiadaki, K. (2024) · arXiv
Multimodal Machine Learning ApplicationsAI-based Problem Solving and Planning
Cited by 6
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free