让大模型稳定生成多视图图表,避免各部分出错导致整体失效。
Crystalis: Progressive Nucleation and Semantic Annealing for Coordinated Multi-View Visualization Generation

- 通过分层依赖图分解图表生成任务,分步构建数据、可视化和交互组件。
- 在12个任务上实现75%的端到端成功率,远超基线方法的8.3%。
- 适合需要可靠多视图可视化的数据分析与自动化工具开发者。
大型语言模型(LLMs)可生成单个图表,但协调式多视图可视化(CMVs)——其中视图共享数据流并存在跨视图交互——仍难以实现。数据变换、视觉编码与交互协调之间的紧密耦合,使得任一组件的错误会无声地破坏其他部分。我们不追求依赖模型能力、领域知识和用户经验的端到端分析质量,而是聚焦基础问题:大模型能否可靠生成结构正确的CMVs?什么抽象机制能实现这一点?我们提出Crystalis框架,基于以查询为中心的CMV建模,将CMV分解为跨越数据、可视化、交互三类组件及需求、规格、可执行对象三个抽象层级的结构化查询。两种互补机制在此结构上运行:渐进式成核从需求到对象沿依赖顺序逐层构建,语义退火通过分层逻辑检查确保各层级查询间的横向一致性。在涵盖五个前沿大模型的12项任务基准测试中,Crystalis实现最高75%的端到端成功率,显著优于使用相同基础模型的代理编码基线(8.3%)。12名从业者参与的用户研究也证实了该分解与迭代优化流程的可用性。
原文摘要 · Abstract (English)
Large language models (LLMs) can generate individual charts, but coordinated multi-view visualizations (CMVs), where views share data flows and cross-view interactions, remain out of reach. Tight field-level coupling among data transformations, visual encodings, and interaction coordinations causes errors in one component to silently invalidate others. Rather than pursuing end-to-end analytical quality, which depends on model capability, domain knowledge, and user expertise, we target a foundational question: can LLMs reliably produce structurally correct CMVs, and what abstractions make this possible? We present Crystalis, a framework built on query-centric CMV modeling that decomposes a CMV into structured queries over a dependency graph spanning three component types (Data, Visualization, Interaction) and three abstraction levels (requirement, specification, executable object). Two complementary mechanisms operate over this structure: progressive nucleation crystallizes each query vertically from requirement to object along the dependency order, while semantic annealing enforces horizontal consistency across queries at each level through layered logical checks. On a 12-task benchmark across five frontier LLMs, Crystalis achieves up to 75% end-to-end success, substantially outperforming an agentic coding baseline (8.3% E2E with the same foundation model), and a user study with 12 practitioners confirms the usability of the decomposition and iterative refinement workflow.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。