Beyond Linear LLM Invocation: An Efficient and Effective Semantic Filter Paradigm
Nan Hou, Kangfei Zhao, Jiadong Xie, Jeffrey Xu Yu

TL;DR
This paper introduces CSV, a framework that significantly reduces large language model invocation costs for semantic filtering by clustering, sampling, and voting, achieving sublinear complexity with maintained accuracy.
Contribution
CSV is a novel framework that reduces LLM calls for semantic filtering to sublinear complexity using clustering, sampling, and voting strategies, with error guarantees.
Findings
Reduces LLM calls by up to 355x compared to existing methods.
Maintains comparable accuracy and F1 scores with fewer invocations.
Demonstrates effectiveness on real-world datasets.
Abstract
Large language models (LLMs) are increasingly used for semantic query processing over large corpora. A set of semantic operators derived from relational algebra has been proposed to provide a unified interface for expressing such queries, among which the semantic filter operator serves as a cornerstone. Given a table T with a natural language predicate e, for each tuple in the relation, the execution of a semantic filter proceeds by constructing an input prompt that combines the predicate e with its content, querying the LLM, and obtaining the binary decision. However, this tuple-by-tuple evaluation necessitates a complete linear scan of the table, incurring prohibitive latency and token costs. Although recent work has attempted to optimize semantic filtering, it still does not break the linear LLM invocation barriers. To address this, we propose Clustering-Sampling-Voting (CSV), a new…
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.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Advanced Graph Neural Networks
