今日速览
| 序号 | 标题 | 来源 | 日期 | 主题 | 推荐等级 |
|---|---|---|---|---|---|
| 1 | Token-Efficient Data Reasoning Agents via Adaptive Structuring of Unstructured Data | arXiv | 2026-08-31 | RAG | 高 |
| 2 | Reconciling Process Supervision with Outcome-Based Credit in Agentic Policy Optimization | arXiv | 2026-08-31 | RAG | 高 |
重点论文与技术动态
1. Token-Efficient Data Reasoning Agents via Adaptive Structuring of Unstructured Data
- 来源：arXiv
- 日期：2026-08-31
- 作者/机构：Milad Rezaei Hajidehi, Qitong Wang, Stratos Idreos
- 主题标签：
RAG,arXiv - 推荐等级：高
- 分类：cs.AI, cs.CL, cs.DB
一句话结论
该研究提出agentic data cracking方法，通过推理过程中自适应结构化非结构化数据，将LLM代理推理成本降低53%而不损失准确性。
核心内容
- 当前LLM代理处理非结构化数据（如网页、PDF）时需反复打开大文档，单次查询消耗高达百万tokens，而理想预结构化存储可便宜28倍。
- agentic data cracking在推理时自适应提取结构化数据：由查询决定结构化时机和内容，并推测性服务于未来查询。
- 在FanOutQA基准测试中，仅添加一个相关问题，推理成本降低53%且保持准确性，使结构化数据覆盖率持续提升。
方法与数据
- 方法为agentic data cracking，利用代理打开文档时的上下文以边际成本提取结构化数据。
- 数据基于FanOutQA基准测试进行验证。
价值判断
- 值得关注：显著降低企业AI代理推理成本，解决高成本问题，提升数据推理效率。
- 可复用点：自适应结构化机制可推广至合同、报告等非结构化数据处理场景。
- 局限/待核查：摘要未明确具体局限。
摘要
Valuable data remains embedded in unstructured sources: web pages, reports, contracts, filings, earnings calls, and PDFs. The big bet in enterprise AI is deploying LLM agents that reason over this data to answer complex questions for every knowledge worker. Agents can do this today, but at prohibitive cost. Each question repeatedly opens large documents to recover scattered evidence, consuming up to a million tokens. However, if the data were already structured, the same question would reduce to a cheap database lookup. For example, on FanOutQA benchmark, reasoning over an ideal pre-structured store is 28X cheaper, and the gap grows to orders of magnitude as questions fan out over more documents. Yet structuring everything in advance is not viable: documents hold vastly more possible structure than any workload will use, and the useful structure and documents are unknown until queries arrive. We propose agentic data cracking, a method that structures unstructured data adaptively and speculatively as a byproduct of reasoning itself. Structuring is adaptive because observed queries decide when it happens and what matters, and speculative because it goes beyond the current question. Whenever the agent opens a document to answer, a cracking sub-agent forks from the already-loaded context at marginal cost and extracts grounded structure likely to serve related future queries. Over time, an increasing share of queries is fully covered by structured data and answered without opening a document, keeping agentic accuracy at close to RAG cost. On FanOutQA, extended with merely one related question per test question, cracking cuts cost by 53% while preserving accuracy. Agentic data cracking is a first step toward next-generation data infrastructure for agentic reasoning over unstructured data: a shared substrate beneath the model where knowledge that reasoning already paid to uncover accumulates.2. Reconciling Process Supervision with Outcome-Based Credit in Agentic Policy Optimization
- 来源：arXiv
- 日期：2026-08-31
- 作者/机构：Jingxiao Yang, Wangjie Gan, Yingxuan Zhuang, Wenqi Zhang, Jintao Chen, Xuhong Zhang
- 主题标签：
RAG,arXiv - 推荐等级：高
- 分类：cs.AI
一句话结论
TASPO通过将特权监督转化为基于结果的动作信用，有效弥合了监督-信用差距，显著提升了智能体策略优化性能。
核心内容
- outcome-based RL的轨迹级优势分配导致粗粒度信用，而特权信息（PI）提供的细粒度监督不直接决定动作如何继承任务结果，造成监督-信用 gap。
- TASPO构建决策适用的PI，聚合PI诱导的似然变化在可执行动作级别，并转换为正、有界、均值保持的权重，使验证结果决定更新方向。
- 在三个智能体基准测试中，TASPO比GRPO提升10.6%，泛化能力更强，减少监督不匹配并稳定优化过程。
方法与数据
- 摘要未明确具体方法细节。
- 摘要未明确数据集。
价值判断
- 值得关注：解决了监督-信用差距问题，为智能体策略优化提供新视角。
- 可复用点：特权监督到动作信用的转换框架可复用于其他强化学习任务。
- 局限/待核查：摘要未明确。