Known Intents, New Combinations: Clause-Factorized Decoding for Compositional Multi-Intent Detection
Abhilash Nandy

TL;DR
This paper introduces a new benchmark and a lightweight decoder for compositional multi-intent detection, demonstrating strong generalization to unseen intent combinations and shifts.
Contribution
It presents CoMIX-Shift, a controlled benchmark for compositional generalization, and ClauseCompose, a simple decoder trained on singleton intents, outperforming baselines.
Findings
ClauseCompose achieves up to 95.7% exact match on unseen intent pairs.
The benchmark reveals significant challenges in compositional generalization.
Simple factorization methods perform well when evaluated properly.
Abstract
Multi-intent detection papers usually ask whether a model can recover multiple intents from one utterance. We ask a harder and, for deployment, more useful question: can it recover new combinations of familiar intents? Existing benchmarks only weakly test this, because train and test often share the same broad co-occurrence patterns. We introduce CoMIX-Shift, a controlled benchmark built to stress compositional generalization in multi-intent detection through held-out intent pairs, discourse-pattern shift, longer and noisier wrappers, held-out clause templates, and zero-shot triples. We also present ClauseCompose, a lightweight decoder trained only on singleton intents, and compare it to whole-utterance baselines including a fine-tuned tiny BERT model. Across three random seeds, ClauseCompose reaches 95.7 exact match on unseen intent pairs, 93.9 on discourse-shifted pairs, 62.5 on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
