Adaptive Planning for Multi-Attribute Controllable Summarization with Monte Carlo Tree Search
arXiv cs.CL / 4/13/2026
💬 OpinionIdeas & Deep AnalysisModels & Research
Key Points
- The paper introduces PACO (Adaptive Planning for Multi-Attribute Controllable Summarization), a training-free method for generating summaries that satisfy multiple, potentially correlated, user-specified attributes.
- PACO reframes controllable summarization as a planning problem where the system decides the sequence of attribute control steps, using a customized Monte Carlo Tree Search (MCTS) over summary states.
- Each MCTS node represents a candidate summary and actions correspond to single-attribute adjustments, allowing the framework to iteratively refine only the attributes that still need improvement.
- Experiments across domains and model families show PACO improves multi-attribute controllability compared with LLM-based self-planning approaches and fine-tuned baselines.
- The method is notably efficient, with results indicating that PACO using Llama-3.2-1B can approach the controllability of much larger Llama-3.3-70B fine-tuned baselines, and larger models further boost performance.
Related Articles

Why Fashion Trend Prediction Isn’t Enough Without Generative AI
Dev.to

Chatbot vs Voicebot: The Real Business Decision Nobody Talks About
Dev.to

วิธีใช้ AI ทำ SEO ให้เว็บติดอันดับ Google (2026)
Dev.to

Free AI Tools With No Message Limits — The Definitive List (2026)
Dev.to

Why Domain Knowledge Is Critical in Healthcare Machine Learning
Dev.to