Pith. sign in

REVIEW 1 cited by

Click: Controllable Text Generation with Sequence Likelihood Contrastive Learning

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 2306.03350 v1 pith:IY6PMP52 submitted 2023-06-06 cs.CL

Click: Controllable Text Generation with Sequence Likelihood Contrastive Learning

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

It has always been an important yet challenging problem to control language models to avoid generating texts with undesirable attributes, such as toxic language and unnatural repetition. We introduce Click for controllable text generation, which needs no modification to the model architecture and facilitates out-of-the-box use of trained models. It employs a contrastive loss on sequence likelihood, which fundamentally decreases the generation probability of negative samples (i.e., generations with undesirable attributes). It also adopts a novel likelihood ranking-based strategy to construct contrastive samples from model generations. On the tasks of language detoxification, sentiment steering, and repetition reduction, we show that Click outperforms strong baselines of controllable text generation and demonstrate the superiority of Click's sample construction strategy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Soft Sequence Policy Optimization

    cs.LG 2026-02 reject novelty 5.0

    SSPO replaces hard clipping and token-level averaging in GRPO-style objectives with a geometric mean of soft token gates, but the paper reports no experimental results to support its claimed gains.