Kad: A Framework for Proxy-based Test-time Alignment with Knapsack Approximation Deferral

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Hammal, Ayoub, Zweigenbaum, Pierre, Corro, Caio
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866918303403868160
author Hammal, Ayoub
Zweigenbaum, Pierre
Corro, Caio
author_facet Hammal, Ayoub
Zweigenbaum, Pierre
Corro, Caio
contents Several previous works concluded that the largest part of generation capabilities of large language models (LLM) are learned (early) during pre-training. However, LLMs still require further alignment to adhere to downstream task requirements and stylistic preferences, among other desired properties. As LLMs continue to scale in terms of size, the computational cost of alignment procedures increase prohibitively. In this work, we propose a novel approach to circumvent these costs via proxy-based test-time alignment, i.e. using guidance from a small aligned model. Our approach can be described as a token-specific cascading method, where the token-specific deferral rule is reduced to 0-1 knapsack problem. In this setting, we derive primal and dual approximations of the optimal deferral decision. We experimentally show the benefits of our method both in task performance and speculative decoding speed.
format Preprint
id arxiv_https___arxiv_org_abs_2510_27017
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Kad: A Framework for Proxy-based Test-time Alignment with Knapsack Approximation Deferral
Hammal, Ayoub
Zweigenbaum, Pierre
Corro, Caio
Computation and Language
Several previous works concluded that the largest part of generation capabilities of large language models (LLM) are learned (early) during pre-training. However, LLMs still require further alignment to adhere to downstream task requirements and stylistic preferences, among other desired properties. As LLMs continue to scale in terms of size, the computational cost of alignment procedures increase prohibitively. In this work, we propose a novel approach to circumvent these costs via proxy-based test-time alignment, i.e. using guidance from a small aligned model. Our approach can be described as a token-specific cascading method, where the token-specific deferral rule is reduced to 0-1 knapsack problem. In this setting, we derive primal and dual approximations of the optimal deferral decision. We experimentally show the benefits of our method both in task performance and speculative decoding speed.
title Kad: A Framework for Proxy-based Test-time Alignment with Knapsack Approximation Deferral
topic Computation and Language
url https://arxiv.org/abs/2510.27017