跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 13:55 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 14:43 — 2026-11-15 14:43(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 13:55最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 13:54(北京时间)
版本更新 · v2arXiv:2608.17162

OraclePhys: A Systematic Framework for LLM Fine-Tuning on Structural Mechanics

Mingyu Li, Guorui Song, Jing Lin, Haoqian Wang

原文摘要

What fine-tuning teaches a model is usually diagnosed after the fact. We make it an experimental variable. OraclePhys has three parts. OraclePhys-Bench is a structural-mechanics benchmark whose finite-element oracle grades every answer and counterfactual edit. OraclePhys-30K holds seven answer forms over byte-identical structure descriptions. A controlled training study compares the forms and verifier roles. Two findings follow. First, within this task family the answer form of the label determines what fine-tuning teaches. Ranking supervision lifts held-out localization of the most-deforming story on taller structures from 0.25 to 0.86, a peak-value label yields at best a partial predictor, and a pass/fail label none. This ranking-versus-peak gap replicates on a second domain, a second model family and a paraphrased surface. Second, the gap between our standard SFT and GRPO runs is mostly a recipe effect. With learning rate and step budget matched, the two reach held-out accuracies within 0.03 of each other. At higher rates, GRPO falls below its start while SFT does not. Both also teach the model to apply edits given as instructions. The trained 8B matches a specialist and exceeds a frontier LLM. Both domains are linear, steady-state systems with synthetic text inputs.

cs.LG

新论文 · v1arXiv:2611.08831

Global Solar Siting from Geospatial Embeddings

Abdullah Rehman, Quentin Paletta, Rui Song

原文摘要

Global solar photovoltaic (PV) capacity is rapidly growing, helping decrease our emissions and dependence on fossil fuels. However, optimally siting a solar plant remains challenging, requiring anticipation of geographical, urban, and infrastructure needs. Current methods rely on multi-criteria decision analysis (MCDA) using hand-picked geophysical layers and solar-resource products, however these strategies are not geographically transferable and do not capture the practical requirements of solar sites. We use geospatial embeddings, dense vectors representing geophysical properties of a location, to analyse 38,591 existing solar sites and the land they were built on to learn the latent solar suitability signal. We assess a set of linear and non-linear models and select a soft-voting ensemble of a random forest and a multilayer perceptron (RF+MLP ensemble), chosen for accuracy and large scale deployability. Validated against future installations in thirteen countries, the ensemble separates existing solar sites from random land with a median ROC-AUC of 0.90. Compared with published MCDA strategies, the ensemble increases ROC-AUC by 0.06-0.30 in every country. The ranking also concentrates real deployment: the most-suitable 20% of land holds 84% of estimated generation (annual energy yield) and 67% of installed capacity (potential power output). After applying standard siting constraints, 5.6% of global land (9.8% if cropland is permitted) remains highly suited to solar. The global 10 m resolution solar suitability dataset and code can be found here: https://github.com/Abdullahr29/Global-Solar-Siting.

cs.LG · cs.CV · cs.CY

版本更新 · v2arXiv:2605.11225

PIVOT: Bridging Planning and Execution in LLM Agents via Trajectory Refinement

Tuo Zhang, Alin-Ionut Popa, Yan Xu, Rui Song, Dimitrios Dimitriadis

原文摘要

Large language model (LLM)-based agents frequently generate seemingly coherent plans that fail upon execution due to infeasible actions, constraint violations, and compounding errors over extended horizons. PIVOT (Plan-Inspect-eVOlve Trajectories) addresses this plan-execution misalignment through a self-supervised framework that treats trajectories as optimizable objects iteratively refined via environment interaction. The framework comprises four stages: PLAN generates candidate trajectories; INSPECT executes them and computes structured losses with textual gradients encoding plan-execution discrepancies; EVOLVE applies these signals to produce improved trajectories; and VERIFY performs a final global check against task constraints. A monotonic acceptance process ensures a non-decreasing solution quality. Empirical evaluations on DeepPlanning and GAIA demonstrate state-of-the-art performance: with human-in-the-loop (HITL) feedback, PIVOT establishes a strong upper bound up to 94% relative improvement in constraint satisfaction, while its fully autonomous variant retains substantial gains, showing that the core trajectory-refinement mechanism remains effective without external supervision. At the same time, PIVOT remains computationally efficient, requiring up to 3x to 5x fewer tokens than competing refinement methods. These findings establish that (self- or human-supervised) feedback-based trajectory optimization is a principled methodology for mitigating plan-execution gaps in autonomous agent systems.

cs.AI · cs.LG · cs.MA