Built independently by an author, for readers. Read the story and support ChapterPal

keyword

length-constrained summarization

Length-constrained summarization is a natural language processing task that involves generating a concise summary of a source document while strictly adhering to predetermined output limits, such as an exact or maximum number of words, tokens, sentences, or characters. Unlike standard text summarization, where the length of the generated output is flexible or loosely guided, this approach requires models to balance information retention, saliency, and grammatical coherence under rigid capacity constraints. The constraint is typically enforced through specialized model training objectives, prompt specifications, or guided decoding algorithms during text generation, allowing systems to reliably produce summaries that fit strict user requirements, fixed display interfaces, or character limits.

1 item

DeAL: Decoding-time Alignment for Large Language Models

DeAL: Decoding-time Alignment for Large Language Models

James Y. Huang, Sailik Sengupta, Daniele Bonadiman, Yi-An Lai, Arshit Gupta, Nikolaos Pappas, Saab Mansour, Katrin Kirchhoff, Dan Roth

OrganizationsAmazon Web ServicesUniversity of Southern California

Why you should read this

Proposes DeAL, a framework that aligns large language models at decoding time by framing generation as heuristic search, enabling fine-grained control over customizable and modular reward functions without requiring model fine-tuning.

Large Language Models (LLMs) are nowadays expected to generate content aligned with human preferences. Current work focuses on alignment at model training time, through techniques such as Reinforcement Learning with Human Feedback (RLHF). However, it is unclear if such methods are an effective choice to teach alignment objectives to the model. First, the inability to incorporate multiple, custom rewards and reliance on a model developer’s view of universal and static principles are key limitations. Second, the reliability of such approaches is also questionable (e.g. susceptibility to jailbreaking even after safety training). To address these issues, we propose DeAL, a framework that allows the user to customize reward functions and enables Decoding-time ALignment of LLMs. At its core, we view decoding as a heuristic-guided search process and facilitate the use of a wide variety of alignment objectives. Our experiments with programmatic constraints such as keyword and length constraints, and abstract alignment objectives such as harmlessness and helpfulness, show that we can DeAL with fine-grained trade-offs and improve adherence to alignment objectives. Lastly, we demonstrate that DeAL is largely complementary to existing alignment strategies, and can be effectively paired with RLHF and prompting techniques to achieve better alignment.

Added

2026-09-26