Pith. sign in

REVIEW 4 cited by

DExperts: Decoding-Time Controlled Text Generation with Experts and Anti-Experts

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 2105.03023 v2 pith:IDP7KXYQ submitted 2021-05-07 cs.CL

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

Despite recent advances in natural language generation, it remains challenging to control attributes of generated text. We propose DExperts: Decoding-time Experts, a decoding-time method for controlled text generation that combines a pretrained language model with "expert" LMs and/or "anti-expert" LMs in a product of experts. Intuitively, under the ensemble, tokens only get high probability if they are considered likely by the experts, and unlikely by the anti-experts. We apply DExperts to language detoxification and sentiment-controlled generation, where we outperform existing controllable generation methods on both automatic and human evaluations. Moreover, because DExperts operates only on the output of the pretrained LM, it is effective with (anti-)experts of smaller size, including when operating on GPT-3. Our work highlights the promise of tuning small LMs on text with (un)desirable attributes for efficient decoding-time steering.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Test-Time Scaling via Error Localization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    TTEL uses feedback-induced token probability drops to localize the first error in a failed reasoning trace and branch a new generation from that prefix, improving pass@k per token on coding and math benchmarks.

  2. Distribution Preference Optimization: A Fine-grained Perspective for LLM Unlearning

    cs.LG 2025-10 conditional novelty 6.0 of 10

    DiPO is a distribution-level unlearning method that constructs preference distributions from the model's own high-confidence logits and achieves state-of-the-art forget quality on TOFU while preserving utility.

  3. Chat-Ghosting: A Comparative Study of Methods for Auto-Completion in Dialog Systems

    cs.CL 2025-07 conditional novelty 5.0 of 10

    Simple tries and n-gram models beat large neural models for chat autocompletion on seen prefixes, while fine-tuned transformers and conversational context lead on unseen ones.

  4. A New Query Expansion Approach via Agent-Mediated Dialogic Inquiry

    cs.IR 2025-02 conditional novelty 4.0 of 10

    AMD uses three LLM agents (Socratic questioning, dialogic answering, reflective feedback) to generate and refine pseudo-answers for query expansion, reporting gains over prior methods on BEIR and TREC benchmarks.

Pith tools