| Challenge: | Existing information retrieval datasets cannot capture abstract semantic associations well. |
| Approach: | They propose a task that retrieves relevant plots from the book for a query using a labeled dataset. |
| Outcome: | The proposed task can be used to evaluate the performance of IR models on the novel task Plot Retrieval. |
Similar Papers
CoIR: A Comprehensive Benchmark for Code Information Retrieval Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods and benchmarks for information retrieval are inadequately representing the diversity of code in various domains and tasks. |
| Approach: | They propose a benchmark specifically designed to assess code retrieval capabilities. |
| Outcome: | The proposed benchmark aims to invigorate research in the code retrieval domain . it shares the same data schema as other popular benchmarks like MTEB and BEIR . |
Retrieval Models Aren’t Tool-Savvy: Benchmarking Tool Retrieval for Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) suffer from inherent inabilities to interact with the physical world and access vast, up-to-date knowledge. |
| Approach: | They propose a tool retrieval benchmark for large language models (LLMs) that includes 7.6k diverse retrieval tasks and a corpus of 43k tools. |
| Outcome: | The proposed model performs poorly on the heterogeneous tool retrieval benchmark, resulting in low pass rate and low retrieval quality. |
Graph-Augmented Open-Domain Multi-Document Summarization (2025.coling-industry)
Copied to clipboard
| Challenge: | Existing methods for summarizing documents neglect the relationships between documents . existing methods treat retrieval and summarization as separate tasks . |
| Approach: | They propose a framework that captures global document relationships through graph-based clustering . this cluster-level thematic information is then used to guide large language models . |
| Outcome: | The proposed framework significantly improves retrieval accuracy and produces better summaries than existing methods. |
CALAMR: Component ALignment for Abstract Meaning Representation (2024.lrec-main)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) graphs represent semantic structure in a syntactic independent way. |
| Approach: | They propose a method for graph alignment that can support summarization and evaluation. |
| Outcome: | The proposed method produces graphs that explain what is summarized through their alignments, which can be used to train graph based summarization learners. |
Integrating Semantic Scenario and Word Relations for Abstractive Sentence Summarization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing graph-based methods only consider word relations or structure information, which neglect the correlation between them. |
| Approach: | They propose a Dual Graph network for Abstractive Sentence Summarization that captures word relations and structure information from sentences. |
| Outcome: | The proposed model outperforms state-of-the-art methods on two popular benchmark datasets. |
A Semantic Mention Graph Augmented Model for Document-Level Event Argument Extraction (2024.lrec-main)
Copied to clipboard
| Challenge: | Document-level Event Argument Extraction (DEAE) aims to identify arguments and their specific roles from unstructured document. |
| Approach: | They propose a document-prompt-based method for document-level event argument extraction that uses a semantic mention graph to capture relations between documents and prompts. |
| Outcome: | The proposed method surpasses baseline methods and achieves state-of-the-art performance on RAMS and WikiEvents datasets. |
Joint Learning from Labeled and Unlabeled Data for Information Retrieval (C18-1)
Copied to clipboard
| Challenge: | Recent studies have focused on neural information retrieval (IR) models. |
| Approach: | They propose a framework which can benefit from both labeled and more abundant unlabeled data . they propose supervised retrieval over several strong baselines for IR . |
| Outcome: | The proposed framework can benefit from labeled and more abundant unlabeled data for representation learning in the context of IR. |
DiffusionRet: Diffusion-Enhanced Generative Retriever using Constrained Decoding (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Generative retrieval methods have suffered from the lack of the intermediate reasoning step . generative retrieval uses sequence-to-sequence diffusion models to map a query to relevant docids . |
| Approach: | They propose a novel method that uses query as an intermediate step before retrieval . they propose to use sequence-to-sequence diffusion models to map a query to relevant docids . |
| Outcome: | Experiments show that proposed method outperforms existing methods on MARCO and Natural Questions datasets. |
Knowledge Graph-Augmented Abstractive Summarization with Semantic-Driven Cloze Reward (2020.acl-main)
Copied to clipboard
| Challenge: | Abstractive summarization models for document encoders suffer from fabricated content and are often near-extractive. |
| Approach: | They propose a framework for abstractive summarization with Graph-Augmentation and semantic-driven RewarD that uses a sequential document encoder and a graph-structured encoder to maintain the global context and local characteristics of entities. |
| Outcome: | The proposed framework produces higher ROUGE scores than a variant without knowledge graph on New York Times and CNN/Daily Mail datasets. |
Anchor and Broadcast: An Efficient Concept Alignment Approach for Evaluation of Semantic Graphs (2024.lrec-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a sentencelevel formalism designed for English. |
| Approach: | They present an intuitive tool for evaluating graph-based meaning representations . they use an anchor broadcast alignment algorithm that is not subject to local maxima . |
| Outcome: | The proposed tool is highly correlated with the widely used Smatch score, but computation takes only about 40% the time. |