跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1865新增论文
+1473其中 AI 相关
+176已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 17:12各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 17:12库内论文最新更新时间:2026-11-17 02:59

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

25,692 已收录论文21,414 AI 相关7,613 有修订112 HF 社区发现

浏览论文库

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

找到 6 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.21072

Sage S2.1 Flash Technical Report

Kun Cai, Haodong Chen, Guangran Cheng, Qingxiu Cheng, Xu Dai, Guanting Dong, Qiming Ge, Lixin Gu 等 206 位作者

原文摘要

We introduce Sage S1.5 Flash, a 320-billion-parameter general-purpose mixture-of-experts model designed to reason over scientific evidence and act in interactive environments. Sage Sci-Perception uses dedicated encoders for molecular graphs and biological sequences and represents spectra as ordered patches of measurements. Modality-specific projectors map these representations into the input space of a shared backbone, which processes them alongside text and images. To develop the model's agent capabilities, we construct verifiable environments for tool use, search, and coding, as well as specialized workflows involving machine learning experiments and scientific software. Task completion is checked against execution results, changes in environment state, or submitted artifacts. We evaluate Sage S1.5 Flash on 33 benchmarks across seven domains. In the primary comparison against five baselines, it ranks first on OfficeQA Pro (72.2), MLE-bench Lite (90.3 HumanRank), Harvey LAB, and SpreadsheetBench~2, and second on OSWorld-Verified (85.2), WebArena-Verified (67.6), and DeepResearch Bench~II (54.2). These results show particular strengths in using documentary evidence, producing verifiable workbooks, and carrying out machine learning tasks, alongside competitive performance in desktop and browser workflows that require the model to act on visual feedback.

cs.AI

新论文 · v1arXiv:2611.19325

Unlocking Fine-Grained Cell Representations via Soft-Interior Rim Dense-Grid Pooling in Pathology Foundation Models

Wenwen Lou, Mingyi He, Xinyi Guo, Yining Li, Weiming Chen, Jiawen Li, Lianghui Zhu, Zhiwei Yang 等 9 位作者

原文摘要

Fine-grained cell representations are essential for characterizing cellular heterogeneity and tissue organization in computational pathology. Pathology foundation models (PFMs) provide powerful pretrained features for transferable tissue analysis. HoVer-Net uses task-trained segmentation and typing, whereas CellViT++ averages native-grid tokens assigned to detected nuclei. However, the former requires cell-specific training; the latter ignores fractional nuclear coverage and can mix nuclear content with neighbouring tissue. Therefore, we propose SRDP, short for Soft-interior Rim Dense-grid Pooling, a training-free geometry-aware readout. We apply the frozen patch projection at half stride, interleave four offset lattices, map the cell mask to fractional coverage weights, and concatenate whole-cell pooling with two inner boundary pools. Across four datasets and six frozen encoders, SRDP improves mean balanced accuracy by 5.68 percentage points over native token averaging across 24 settings, including 11.22 points on average for CoNIC and Lizard. SRDP converts a coarse frozen PFM lattice into a mask-aligned, fine-grained cell representation without updating the encoder.

cs.CV

版本更新 · v3arXiv:2611.05206

Diffusion Plug-in Priors for Self-Supervised Ultrasound Video Restoration

Chu Chen, Mingduo He, Yining Li, Yinhao Wu, Wei Tang, Yiwen Luo, Yixuan Chen, Pasquale Cascarano 等 9 位作者

原文摘要

Ultrasound videos suffer from hardware-constrained spatial resolution and signal-dependent speckle, while paired low- and high-resolution acquisitions are rarely available. We propose UltraDiff, a self-supervised framework for joint ultrasound video super-resolution and despeckling that uses a frozen pre-trained diffusion model as a plug-in prior. Rather than retraining the model, UltraDiff restores each frame by optimizing the sampler's latent seed under a range-constrained maximum a posteriori-inspired formulation. We derive a speckle-aware data-fidelity term from a Rayleigh scale-family model and characterize its relative-residual and locally variance-adaptive weighting properties. To address degeneracy near zero intensities, we introduce a stabilized surrogate fidelity that is bounded below and strictly convex in log intensity for positive observations in its unclamped form. Total-variation regularization complements the removal of mixed noise, and a temporal seed update warm-starts each frame from the optimized seed of its predecessor, accelerating the convergence. On EchoNet-LVH with simulated speckle and additive noise, UltraDiff with a natural-image prior improves peak signal-to-noise ratio by 1.24\,dB over the strongest baseline, and ultrasound-related priors yield further gains. On 100 real EchoNet-Dynamic videos, UltraDiff reduces the mean absolute error of zero-shot ejection fraction prediction from 7.31 to 6.37 percentage points compared with DUP. These results support ground-truth-free ultrasound video restoration using frozen diffusion priors and a speckle-aware fidelity, without paired training data or model retraining.

cs.CV

版本更新 · v2arXiv:2610.35013HF 社区推荐

Multiscale Policy Optimization for Long-Horizon LLM Agents

Tao Ren, Hui Yang, Jia Deng, Tingyang Chen, Qiyao Wang, Shuo Tang, Ziyang Zeng, Yuhua Jiang 等 19 位作者

原文摘要

Long-horizon LLM agents interact with their environments through complete assistant turns while generating each action token by token. We observe that critic values vary primarily across turns, motivating optimization anchored at turns with finer credit allocation among tokens. We propose Multiscale Policy Optimization (MPO), combining Multiscale Advantage Estimation (MAE) and turn-level importance sampling to align credit assignment and policy updates at the turn scale. Extensive experiments across search, tool-use, and automation tasks with 4B and 30B-A3B models demonstrate consistent gains over strong RL baselines.

cs.AI

版本更新 · v3arXiv:2609.31972

TaiJi: State-Conditional Adaptive Combination of Machine-Learning and Physics-Based Global Weather Forecasts

Jiale Wang, Yining Li, Guihua Wang

原文摘要

Machine-learning weather models now rival or surpass operational numerical weather prediction (NWP), yet no single model dominates across variables, pressure levels, lead times, or regions, and the returns from ever-larger individual models are diminishing. We present TaiJi (after the yin-yang concept of complementary opposites), a spatiotemporal adaptive ensemble framework that recasts optimal model-weight combination as a learned prediction problem: a lightweight convolutional neural network, conditioned on the recent atmospheric state, predicts at every grid point and lead time affine combination weights and an additive residual for the constituent forecasts. The combiner is trained end-to-end over Pangu-Weather, GraphCast, FuXi, IFS-HRES, and the IFS-ENS ensemble mean, a hybrid set of ML and NWP constituents, at less than a tenth of the cost of training any of its ML constituents. Under the WeatherBench 2 protocol (2020 test year), TaiJi outperforms the strongest baseline in nearly every combination of the eight core variables, lead times up to 10 days and two skill metrics (RMSE and ACC), and this advantage extends to heavy-precipitation extremes. The same state-conditional principle transfers to tropical-cyclone track forecasting: by fusing constituent tracks rather than gridded fields, TaiJi-TC reduces track error relative to the equally weighted multi-model consensus at lead times up to 96 h, by about 10% at 36 h, halves the slow along-track bias shared by all constituents up to 60 h, and lowers landfall position error by 13-15% at 60-84 h. The learned weights vary coherently with latitude, season and lead time rather than following a fixed rule. TaiJi thus offers an inexpensive route to better global forecasts that builds on, rather than replaces, existing forecast models.

cs.CE

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.558ACL Anthology · ACL 2026

RouteMoA: Dynamic Routing without Pre-Inference Boosts Efficient Mixture-of-Agents

Jize Wang, Han Wu, Zhiyuan You, Yiming Song Shanghai Jiaotong University, Yijun Wang, Zifei Shan WeChat, Tencent, Yining Li Shanghai AI Laboratory, Songyang Zhang Shanghai Artificial Intelligence Laboratory 等 12 位作者

原文摘要

Mixture-of-Agents (MoA) improves LLM performance through layered collaboration, but its dense topology raises costs and latency. Existing methods employ LLM judges to filter responses, yet still require all models to perform inference before judging, failing to cut costs effectively. They also lack model selection criteria and struggle with large model pools, where full inference is costly and can exceed context limits. To address this, we propose RouteMoA, an efficient mixture-of-agents framework with dynamic routing. It employs a lightweight scorer to perform initial screening by predicting coarse-grained performance from the query, narrowing candidates to a high-potential subset without inference. A mixture of judges then refines these scores through lightweight self- and cross-assessment based on existing model outputs, providing posterior correction without additional inference. Finally, a model ranking mechanism selects models by balancing performance, cost, and latency. RouteMoA outperforms MoA across varying tasks and model pool sizes, reducing cost by 89.8% and latency by 63.6% in the large-scale model pool. Code is available at https://github.com/Jize-W/RouteMoA.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表