Jennifer Hsia
Author directory2026
Joint Constraint Aggregation for Qualifier-Sensitive Retrieval-Augmented QA
Jennifer Hsia | Zachary Chase Lipton | Aarti Singh
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Jennifer Hsia | Zachary Chase Lipton | Aarti Singh
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Retrieval-augmented QA can fail even when the correct answer is in the retrieved evidence. This can happen when a competing answer satisfies some, but not all, of the question’s requirements and is mentioned frequently in the retrieved documents, making it look like a strong choice. To test whether this retrieval skew actually affects the decision, we manipulate it directly: increasing the prevalence of passages that favor the competing answer makes models more likely to select it. This points to a decision problem that candidate-level support alone cannot resolve. We therefore introduce Joint Constraint Aggregation (JCA), which compares candidates against the same question-derived requirements using the retrieved evidence. Across our evaluation settings, JCA improves overall accuracy, and its advantage grows when retrieval favors a competing answer. Together, these results suggest that when partial matches and retrieval prominence pull models toward a competing answer, comparing candidates against the question’s full requirements can make selection more reliable.
2024
Goodhart’s Law Applies to NLP’s Explanation Benchmarks
Jennifer Hsia | Danish Pruthi | Aarti Singh | Zachary Lipton
Findings of the Association for Computational Linguistics: EACL 2024
Jennifer Hsia | Danish Pruthi | Aarti Singh | Zachary Lipton
Findings of the Association for Computational Linguistics: EACL 2024
Despite the rising popularity of saliency-based explanations, the research community remains at an impasse, facing doubts concerning their purpose, efficacy, and tendency to contradict each other. Seeking to unite the community’s efforts around common goals, several recent works have proposed evaluation metrics. In this paper, we critically examine two sets of metrics: the ERASER metrics (comprehensiveness and sufficiency) and the EVAL-X metrics, focusing our inquiry on natural language processing. First, we show that we can inflate a model’s comprehensiveness and sufficiency scores dramatically without altering its predictions or explanations on in-distribution test inputs. Our strategy exploits the tendency for extracted explanations and their complements to be “out-of-support” relative to each other and in-distribution inputs. Next, we demonstrate that the EVAL-X metrics can be inflated arbitrarily by a simple method that encodes the label, even though EVAL-X is precisely motivated to address such exploits. Our results raise doubts about the ability of current metrics to guide explainability research, underscoring the need for a broader reassessment of what precisely these metrics are intended to capture.