Pith. sign in

REVIEW 2 cited by

Amulet: ReAlignment During Test Time for Personalized Preference Adaptation of LLMs

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 2502.19148 v3 pith:XHTA5EPZ submitted 2025-02-26 cs.CL cs.LG

Amulet: ReAlignment During Test Time for Personalized Preference Adaptation of LLMs

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

How to align large language models (LLMs) with user preferences from a static general dataset has been frequently studied. However, user preferences are usually personalized, changing, and diverse regarding culture, values, or time. This leads to the problem that the actual user preferences often do not coincide with those trained by the model developers in the practical use of LLMs. Since we cannot collect enough data and retrain for every demand, researching efficient real-time preference adaptation methods based on the backbone LLMs during test time is important. To this end, we introduce Amulet, a novel, training-free framework that formulates the decoding process of every token as a separate online learning problem with the guidance of simple user-provided prompts, thus enabling real-time optimization to satisfy users' personalized preferences. To reduce the computational cost brought by this optimization process for each token, we additionally provide a closed-form solution for each iteration step of the optimization process, thereby reducing the computational time cost to a negligible level. The detailed experimental results demonstrate that Amulet can achieve significant performance improvements in rich settings with combinations of different LLMs, datasets, and user preferences, while maintaining acceptable computational efficiency.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. Automatic Hard Example Synthesis with Multi-Level Agentic Data Curation

    cs.AI 2026-07 conditional novelty 5.0

    Test-time retrieval of committee-disagreement-mined synthetic images cuts a safety classifier's false-negative rate on a hard HoliSafe subset from 41.2% to 24.5%.

  2. PrefReward: Learning User Preference Matrix for Personalized Text Generation

    cs.CL 2026-07 conditional novelty 4.0

    PrefReward selects the most style-aligned LLM output via a KL-divergence reward against an explicit user preference matrix, beating retrieval baselines on LongLaMP.