用小模型三阶段流水线,低成本实现高精度泰国KOL匹配。
InfluMatch: Frontier-Quality KOL Search at 4B-Model Cost

- 三阶段流水线:检索→打分→推理,全用小型开源模型。
- 在50个候选中精准选出前5名,准确率达94.1%,比基线显著提升。
- 推理成本仅为前沿模型的1/35,适合实际部署且结果可解释。
将影响力人物(KOL)与自由格式、多要素的泰语营销需求匹配,现有方法或依赖关键词检索(忽略语义),或对每个候选调用前沿大模型(准确但昂贵)。我们提出InfluMatch,一种基于小型开源模型的低成本三阶段流水线——密集检索返回50个候选,40亿参数的点式打分器通过单个“是”标记的对数概率评分并保留10个,40亿参数的推理器按评分标准逐项评估短名单并生成泰语理由。该设计显著降本:对前10名推理耗时减半,总令牌数仅前沿模型的1/35。在包含11个查询、所有50个候选均标注的人工相关性测试中,端到端准确率达94.1% P@5,远超仅检索的基线;性能媲美前沿模型Kimi-K2.6(91.8%),且50个候选的查询响应时间约20秒(单张A100)。值得注意的是,唯一有效微调为成对训练:经SimPO微调的打分器达到78.0%的最优选择准确率,而基于单项指标的点式标签微调虽提升离线分数,却损害端到端排序表现——此反常源于绝对标签任务设计。最终,未微调的基础模型成为最强推理器。系统可在极低成本下实现可解释的高质量KOL搜索。
原文摘要 · Abstract (English)
Matching influencers (KOLs) to free-form, multi-part Thai marketing criteria is today served either by keyword search over structured profiles, which misses semantic fit, or by prompting frontier LLMs over every candidate, which is accurate but slow and expensive. We present InfluMatch, a low-cost three-stage cascade -- retrieval $\rightarrow$ rerank $\rightarrow$ reason -- built entirely from small open-weight models: dense retrieval returns 50 candidates, a 4B pointwise reranker scores each by the log-probability of a single Yes token and keeps 10, and a 4B reasoner grades the shortlist per criterion on a rubric with a Thai rationale. The cascade is designed for cost: reasoning over a filtered top-10 halves token spend versus reasoning over all 50 while scoring 14 points higher. End-to-end against human relevance labels on an 11-query set with all 50 candidates labeled, the full cascade reaches 94.1% P@5, versus a retrieval-only baseline near random; it matches the frontier model Kimi-K2.6 (91.8%) while emitting ${\sim}35\times$ fewer output tokens and serving a 50-KOL query in ${\sim}20$ s on one A100. Notably, the only fine-tuning that pays off is pairwise: a SimPO-tuned reranker matches the frontier baseline's best-pick accuracy (78.0 EM), whereas fine-tuning the reasoner on pointwise per-criterion labels improves offline scores yet degrades end-to-end ranking -- an inversion we trace to the design of the absolute labeling task -- leaving the untuned base model as the strongest deployed reasoner. The result is a deployable, explainable KOL search system at a small fraction of frontier serving cost.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。