跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

采集已暂停
正在读取账号与研究记录…

全站更新概况

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

arXiv 最近完成扫描:等待完成 · 全站最近入库:2026-11-02 00:39各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:尚未完成最近发现新增版本:2026-11-02 00:39库内论文最新更新时间:2026-10-30 01:59

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

8,677 已收录论文7,675 AI 相关1,866 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。

找到 2 篇论文 · 按版本更新时间排序等待首次采集
新论文 · v1arXiv:2610.38095

Nemotron 3.5 Super and Lightning: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Models for Agentic AI

NVIDIA, :, Aastha Jhunjhunwala, Aayushi Ashokkumar Srivastava, Abhibha Gupta, Abhinav Garg, Abhinav Khattar, Achsah Wildish 等 559 位作者

We introduce Nemotron 3.5 Super and Nemotron 3.5 Lightning, open and efficient Mixture-of-Experts Hybrid Mamba-Transformer models designed for reasoning, long-context understanding, and agentic workloads. Super is a 120B-parameter, 12B-active multimodal model, while Lightning is a smaller 30B-parameter, 3B-active text model; both designed for efficient deployment. Both models combine large-scale distillation, long-context training, and native speculative decoding, while Super further incorporates Indic continued pretraining and agentic software-engineering mid-training. We develop a comprehensive post-training pipeline spanning supervised fine-tuning and reinforcement learning (RLVR and RLHF), complemented in Super by specialized teacher training and multi- teacher on-policy distillation (MOPD). This transforms Super from a text-only base model into a multimodal agent capable of reasoning over text, images, video, and interactive tool environments. We further explore test-time scaling through parallel agent execution and self-verification. Across training and deployment, we jointly optimize capability and efficiency. Indic continued pretraining improves Indian-language benchmarks by up to 9.82 percentage points, while agentic mid-training strengthens software-engineering capabilities and robustness across agent harnesses. The post-trained Super model achieves 51.78% on SWE-bench Pro, surpassing Nemotron 3 Ultra despite using approximately 4.6x fewer active parameters. Post-training MTP boosting improves speculative- decoding acceptance length by up to 21.8% under probabilistic draft sampling, while NVFP4 quantization achieves 99.62% median accuracy recovery relative to BF16. Inference optimizations enable up to 4,856 output tokens/s/GPU on GB200 while sustaining at least 50 tokens/s/user.

尚无 AI 解读,展示原文摘要

cs.CL · cs.AI · cs.LG
arXiv ↗PDF ↗
版本更新 · v3arXiv:2605.04130

Constrained Extreme Gradient Boosting for Parametric Proper Orthogonal Decomposition Subspace Prediction

Melika Baghi, Xiao Liu, Kamran Paynabar

High-fidelity simulations such as computational fluid dynamics and finite element analysis are essential for modelling complex engineering systems but remain prohibitively expensive for tasks including parametric studies, optimisation and real-time control. Projection-based reduced-order models (ROMs) alleviate this cost by projecting full-order dynamics onto low-dimensional subspaces. On the other hand, projection-based ROMs can become less robust under parameter variation, and one approach is to adapt the projection basis (that is, the subspace) as the parameters change. We propose constrained extreme gradient boosting (cXGBoost) for predicting the proper orthogonal decomposition (POD) basis at given parameter settings. In particular, given the observed parameter-subspace pairs, we map the subspaces from the Grassmann manifold to a Euclidean space. Then, cXGBoost is trained in this Euclidean space with a constraint that the norm of the predicted vectors is bounded to ensure the injectivity of the mapping between the Euclidean space and the Grassmann manifold. On four parametric problems, a cylinder wake, Kolmogorov flow, the Kuramoto-Sivashinsky equation and a forced beam, cXGBoost has lower mean reconstruction errors than existing approaches, namely the projected Gaussian process and Grassmann interpolation.

尚无 AI 解读,展示原文摘要

cs.LG
arXiv ↗PDF ↗