Pith. sign in

REVIEW 1 cited by

Efficient slot labelling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.09343 v2 pith:RBA2LJMV submitted 2024-01-17 cs.CL

classification cs.CL
keywords labellingslotaimingalmostapplicableapproachesargumentsbert
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Slot labelling is an essential component of any dialogue system, aiming to find important arguments in every user turn. Common approaches involve large pre-trained language models (PLMs) like BERT or RoBERTa, but they face challenges such as high computational requirements and dependence on pre-training data. In this work, we propose a lightweight method which performs on par or better than the state-of-the-art PLM-based methods, while having almost 10x less trainable parameters. This makes it especially applicable for real-life industry scenarios.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient and Effective Query Context-Aware Learning-to-Rank Model for Sequential Recommendation

    cs.IR 2025-07 conditional novelty 5.0 of 10

    Adding shifted query-context embeddings to the last attention layer's query position (plus the output head) improves next-item ranking in offline and online tests, though open-dataset validation uses a target-derived ...

Pith tools