Papers by Noah Ziems
TOWER: Tree Organized Weighting for Evaluating Complex Instructions (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Evaluating the ability of large language models to follow human-written instructions remains a challenge. |
| Approach: | They propose a new evaluation metric that incorporates human-judged importance into the assessment of complex instruction following. |
| Outcome: | The proposed evaluation metric incorporates human-judged importance into the assessment of complex instruction following. |
Optimizing Decomposition for Optimal Claim Verification (2025.acl-long)
Copied to clipboard
| Challenge: | Existing decomposition and verification paradigms ignore their interactions and potential misalignment. |
| Approach: | They propose a reinforcement learning framework that leverages verifier feedback to learn a policy for dynamically decomposing claims to verifier-preferred atomicity. |
| Outcome: | The proposed framework outperforms existing decomposition policies in verification confidence tests . it improves accuracy and confidence by 0.12 on average across varying verifiers, datasets, and atomcities of input claims. |
Large Language Models are Built-in Autoregressive Search Engines (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing dual-encoder dense retrievers obtain representations for questions and documents independently, allowing only shallow interactions between them. |
| Approach: | They propose to use large language models to generate URLs for document retrieval by following human instructions. |
| Outcome: | The proposed method achieves better retrieval performance than existing retrieval approaches on open-domain question answering benchmarks. |