Papers by Pranav Krishna
DART: Open-Domain Structured Data Record to Text Generation (2021.naacl-main)
Copied to clipboard
Linyong Nan, Dragomir Radev, Rui Zhang, Amrit Rau, Abhinand Sivaprasad, Chiachun Hsieh, Xiangru Tang, Aadit Vyas, Neha Verma, Pranav Krishna, Yangxiaokang Liu, Nadia Irwanto, Jessica Pan, Faiaz Rahman, Ahmad Zaidi, Mutethia Mutuma, Yasin Tarabar, Ankit Gupta, Tao Yu, Yi Chern Tan, Xi Victoria Lin, Caiming Xiong, Richard Socher, Nazneen Fatema Rajani
| Challenge: | Data-to-text annotations can be costly when dealing with tables with nontrivial structures. |
| Approach: | They propose a procedure for extracting semantic triples from tables that encodes their structures by exploiting table headers and table title. |
| Outcome: | The proposed method exploits the semantic dependencies between table headers and title to extract semantic triples from tables. |
Corpus-based Content Construction (C18-1)
Copied to clipboard
| Challenge: | Existing work in this direction focuses on generating content for standard platforms like Wikipedia, where the content style is fairly consistent, but there could be multiple representations of the same information across the repository. |
| Approach: | They propose an automatic approach to generate an initial version of the author’s intended text based on an input content snippet. |
| Outcome: | The proposed approach improves performance against baselines on several metrics. |
Auto-Evolve: Enhancing Large Language Model’s Performance via Self-Reasoning Framework (2024.findings-emnlp)
Copied to clipboard
Krishna Aswani, Huilin Lu, Pranav Patankar, Priya Dhalwani, Xue Tan, Jayant Ganeshmohan, Simon Lacasse
| Challenge: | Recent advances in prompt engineering strategies rely on static seed reasoning modules to simulate human approach to problem-solving. |
| Approach: | They propose a framework that enables LLMs to self-create dynamic reasoning modules and downstream action plan. |
| Outcome: | The proposed framework outperforms existing prompting strategies on a BigBench-Hard dataset and improves performance by 2.8% over existing methods. |