简体中文 · English
Preference Tree Optimization: Simulating continuations for long-term preferences¶
Core mechanism mini-suite. Constructs a preference tree, runs oracle ranking and computes lookahead advantages. This is not the paper's counseling-model experiment.
Paper information¶
| Field | Details |
|---|---|
| Paper | arXiv 2608.12062 |
| Institution | Reichman University |
| First public release | 2026-08-12 (arXiv v1) |
| Author code | No public author code found on 2026-08-13. |
| Local adapter or method key | pto |
| Local reproduction code | src/auto_research/post_training/latest_20260813.py |
Original paper summary¶
Background and main changes¶
Turn-by-turn preferences rate only the current answer and miss long-term goals. PTO expands candidate dialogue trees with an agent and simulated user. An oracle scores both current responses and continuations; preference pairs train DPO iteratively. Deeper lookahead makes the long-term policy more stable.
flowchart LR
S["Current dialogue"] --> B["N candidate responses"]
B --> U["Virtual user continues for K steps"]
U --> O["Oracle scores the complete branch"]
O --> P["Chosen and rejected responses"]
P --> D["DPO updates agent"]
Key figure from the paper¶
Figure 1: Core architecture, modules and connections. From the paper; copyright belongs to the authors. Click for the source.
Core equations¶
Offline and online results¶
The Llama-2-7B baseline Final Score is 3.453. The best model, at lookahead depth 5, reaches 3.982, with Session Satisfaction 4.190 and Working Alliance 3.775. This is offline simulated counseling evaluation, not industrial A/B.
Local reproduction¶
After 120 steps in the arithmetic mini-suite, accuracy rises from 0.1953 to 0.4453. The final step records 12 tree nodes, 6 oracle comparisons and lookahead depth 1. This one-seed task verifies the optimization operator only.
See stable metrics. The cross-topic index links each paper's metrics without duplicating values.
Scope¶
No Llama-2-7B, simulated counseling patient or LLM oracle was run. Deterministic rewards replace only the costly evaluator; preference trees and lookahead credit execute.
