Sep 2026· Proceedings of the 20th ACM Conference on Recommender Systems· 0 citations· 12 references
TL;DR
Two training-time mitigations, label augmentation and shortcut-targeted hard negatives, which reduce judged nonsense while preserving ranking performance are studied.
Abstract
Skill-extraction models are typically evaluated with ranking metrics scored against human-annotated positives. At the scale of ESCO (13,939 skills), annotation is inherently incomplete, and unannotated labels are treated as uniformly wrong irrespective of semantic proximity. Training sentences, dominated by LLM-generated synthetic data, mention many skills (almost) verbatim, so any model trained on them is prone to simplicity bias: exploiting surface-level lexical, or partly semantic, overlap between the input text and skill label as a shortcut. We demonstrate this on the popular contrastive bi-encoder setup. Annotated positives and the shortcut often coincide, so ranking metrics remain high even when other top predictions are semantically nonsensical. We use an LLM-as-a-judge, validated against human labels, to flag such nonsense at scale, and isolate the shortcut with a controlled diagnostic we construct automatically from the taxonomy, in which every distractor shares a content token with the gold skill yet comes from a clearly different domain. We then study two training-time mitigations, label augmentation and shortcut-targeted hard negatives, which reduce judged nonsense while preserving ranking performance. Our findings show how incomplete annotations silently degrade skill recommender quality, and give practical diagnostics and training-time levers for this setting.
Testing an LLM on two e-commerce data quality tasks, entity matching and brand mislabeling, against rule based baselines and human verified ground truth, under both zero-shot and few-shot prompting suggests that the value of using an LLM over traditional methods depends heavily on the task.
An iterative framework that automates the extraction of interpretable, schema-bound categorical features from unstructured text for tabular prediction models that guarantees instance-level interpretability and provides a fully transparent, semantic audit trail for every prediction.
A sequential behavioral alignment framework pairing fine-tuning with preference optimization over paired correct and counterfactual rationales is developed and applied, demonstrating that behavioral alignment mitigates bidirectional rationalization while delivering human-interpretable reasoning traces without manual pi...
Alireza S. Ziabari, Kat Ellis, Colleen E. Chan et al.· 0 citations
Blations show that most of the oracle improvement comes from post-edited explanations and annotator comments rather than the scalar centrality feature, suggesting that LLMs are most useful for exposing and approximating structured semantic supervision rather than replacing human judgment directly.
Girish A. Koushik, Swapnil Bhosale, Samarth Agrawal et al.· 0 citations
Resource-constrained edge intelligence increasingly requires lightweight and trustworthy access to heterogeneous knowledge, where decisions often involve reasoning over structured tables and associated text. In this paper, trustworthiness is operationalized as robustness under weak supervision, imperfect evidence selec...
Jian Lyu, Jingfeng Xue, Thar Baker et al.· IEEE Transactions on Network...· 0 citations
SODA, a plug-and-play alignment framework that adopts a BPR-style contrastive objective to align recommender representations with target-side distributional representations against negative ones, is developed and demonstrated that SODA consistently strengthens diverse generative recommendation architectures.
Zi-Qiu Xue, Ding-Xian Wang, Yi-Meng Bai et al.· Proceedings of the 20th ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.