跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 23,348 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.14862

Branching Visual Inquiry in a Generative Visual Browser: A Matched Walkthrough Study

Hanjing Shi, Kimberly Wang, Dominic DiFranzo

原文摘要

Generative visual browsers combine AI-generated visual pages with reader-selected branches rather than a fixed sequence. We analyzed eight author self-walkthroughs of Flipbook, organized as four pairs with identical starting prompts about sleep, vaccines, flight, and Pluto. Three paired routes differed at the first selection; the sleep routes separated after a shared repair-oriented opening. A route could remain locally coherent while narrowing to one mechanism or leaving part of its starting question unanswered. Some diagrams lacked sources. The analysis motivates three design directions: persistent path histories, prompts that reconnect a route to its starting question, and source or uncertainty cues for generated claims. It characterizes how one generative visual browser structured eight documented routes.

cs.HC

版本更新 · v2arXiv:2609.30012

Low-Cost Assays for Measuring Model Behavior Across Vendors and Releases

Tapan Parikh

原文摘要

Language models advise people, keep them company, and write software while they sleep. Measuring what they do is hard: behavior has to be sampled repeatedly across models, prompts and releases, most of it lives in unstructured text that has to be coded before it can be counted, and the result has to be legible and rigorous enough to meaningfully compare models and vendors. To address these constraints, we present a simple, cheap, scalable, and replicable model for studying model behavior. Each study is a frozen, public stimulus run identically on a cross-vendor panel, at a few dollars per model or less. Each reads its transcripts one of three ways, chosen by how much interpretation the behavior needs: exact match on a clamped reply, a codebook applied by LLM judges whose agreement with a human coder is reported per code, and an instrumented environment that records what an agent did independently of what it said. Run across four years of model releases from both frontier and open-source labs, these instruments find four things. Convergence: asked to pick a word, 27 of 44 models answer serendipity at least once in four tries. Resistance: a trailing "right?" moves endorsement by up to 32 points, and the sign flips from sycophantic to resistant as generations advance, keyed to the tag's surface form. House: whether a model holds a position under pressure tracks its generation, and how it holds tracks the lab that built it. Account: told to do something the documentation in their repository contradicts, some coding agents never went along silently and others always did, and the same model can change with the harness it runs in. Re-run on every release, batteries like these track how behavior is changing across vendors and over time.

cs.CL · cs.AI

新论文 · v1arXiv:2611.14861

Is Jev a Good Multilingual Judge?

Wei Liu, Yi Fan, Xiyan Fu

原文摘要

Generative large language models are widely used for multilingual text evaluation, yet whether decision models that directly output judgment probabilities can serve as multilingual judges has received limited attention. We evaluate Jev against generative LLM judges on four multilingual benchmarks with human annotations, covering up to 47 language varieties and three evaluation formats: binary decisions, pairwise comparisons, and graded ratings. At approximately $1/31$ to $1/61$ of GPT-6.1's evaluation cost, Jev is competitive on most multilingual judging tasks, but falls behind GPT-6.1 on knowledge-intensive answer verification. Further analysis shows that Jev is more likely to accept incorrect answers in low-resource languages than in English and that its probability outputs help identify errors across tasks. Based on these findings, we offer recommendations on evaluation instructions, confidence-based selection, and model routing, providing empirical guidance for using Jev as a multilingual judge.

cs.CL

新论文 · v1arXiv:2611.14858

The Price of Anarchy in Markets for Lemons

Naveen Durvasula, Tim Roughgarden

原文摘要

We study the worst-case equilibrium gains from trade in simple bilateral trade mechanisms with interdependent valuations. Equilibria in such settings are typically complex, as proposed prices can convey private information held by the proposer. Such equilibria suffer lost gains from trade both due to the inefficiency introduced by screening (as in independent private value settings) and due to adverse selection. We identify broad conditions under which, nevertheless, sequential equilibria are guaranteed to achieve a constant fraction of the first-best gains from trade. Our bounds quantify the central role of rare pessimistic seller signals and rare optimistic buyer signals. The results apply to seller-proposer, buyer-proposer, and random-proposer mechanisms. The key idea in our analysis is to relate equilibrium gains from trade to proposer profits in an auxiliary market with independent private values.

cs.GT · cs.DS · econ.TH

新论文 · v1arXiv:2611.14857

In-orbit demonstration of object-based change detection applied to the maritime domain

Cristopher Castro Traba, Tom Hendrix, Amaury Perrocheau, Francesco Pasanisi, Finian Rogers, Aubrey Dunne, David Rijlaarsdam, Roberto Del Prete 等 10 位作者

原文摘要

This article presents the successful in-orbit validation of an object-based change detection pipeline for low latency maritime monitoring onboard the CogniSAT-6 mission. We propose and validate a lightweight, three-phase operational sequence: optimized ground-based dual-acquisition scheduling, real-time onboard AI-based vessel segmentation, and multi-temporal matching. Upon acquiring consecutive images over a targeted Area of Interest (AoI), the onboard system correlates vessel detections using a hybrid matching approach that integrates the Hungarian algorithm for optimal assignment with RANSAC-driven spatial and size filters for outlier rejection. A series of in-orbit validations demonstrated robust performance across 11 diverse maritime scenarios, achieving valid recall and precision values (considering only vessel size and location) exceeding 0.8. The validation demonstrated the ability of the system to track both cooperative targets and uncooperative "dark" vessels strictly through geometric consistency. This capacity to autonomously generate and act upon real-time intelligence establishes a foundation for next-generation Insight-as-a-Service (IaaS) and tipping-and-cueing architectures.

cs.CV

版本更新 · v2arXiv:2611.10649

MACaQ: Fast, Model Agnostic Calibrated Quantization for Low-Precision Weights and Activations

Lorenz K. Muller, Philippe Bich, Chiara Boretti, Hyun-Min Chang, Jiawei Zhuang, Lukas Cavigelli

原文摘要

Weight-activation quantization can reduce the memory and compute cost of neural-network inference, but recent methods often require expensive optimization and architecture-specific propagation of basis transforms across layers. We introduce MACaQ, an MXFP4 W4A4 post-training quantization method that treats every linear layer independently. MACaQ applies a per-channel scale and a block-Hadamard transform online to each layer's activations, while absorbing the corresponding inverse transforms into its weights. Retaining these transforms online avoids cross-layer dependencies and enables a simple streaming implementation of the quantization process, in which only one layer must reside in memory at a time. To improve over round-to-nearest quantization, we introduce Flip-Refinement, a Hessian-aware coordinate-descent procedure that greedily moves individual FP4 codes to adjacent representable values. Despite executing the activation transforms at inference time, MACaQ adds only 2.3% end-to-end overhead over pure MXFP4 on Qwen3-32B in vLLM. MACaQ reaches lower perplexity than DuQuant++ and MR-GPTQ, and already matches their best perplexity on Llama-3-8B in 11 times less quantization time. We further apply MACaQ without architecture-specific modifications to an image diffusion model, illustrating the generality of its layer-local design and show quantization of a 122B parameter model in 64 minutes, using only 32.5GB GPU RAM. Code is available at https://github.com/huawei-csl/MACaQ .

cs.LG

版本更新 · v2arXiv:2510.16785

Robust Reasoning Segmentation for Open-World MLLMs without Catastrophic Forgetting

Jiazhen Liu, Long Chen

原文摘要

Ensuring trustworthiness and versatility in Open-World Visual Recognition is a core goal of Multimodal Large Language Models (MLLMs). While integrating segmentation is desirable, prevailing methods require invasive fine-tuning, which often leads to catastrophic forgetting of the model's general-purpose capabilities. This trade-off between task-specific performance and general reliability fundamentally undermines the goal of building unified, trustworthy systems. We introduce LENS (Leveraging kEypoiNts for MLLMs' Segmentation), a novel plug-and-play paradigm designed to equip MLLMs with pixel-level ability without compromising their foundational integrity. LENS attaches a lightweight head to a completely frozen MLLM, interpreting the intrinsic spatial cues embedded in attention maps. It extracts keypoints and translates them into prompt-compatible features for a mask decoder. Extensive experiments validate that LENS achieves segmentation performance competitive with retraining-based methods. Crucially, it largely preserves the MLLM's open-world generalization, avoiding the degradation observed in fine-tuned counterparts. By decoupling segmentation from generation, LENS offers a robust and efficient path toward truly multi-talented and reliable vision models.

cs.CV

新论文 · v1arXiv:2611.14856

Honest Fusion Evaluation for Cross-Domain Deepfake Detection: Leakage Audits and Tail Robustness

Luke Collins, Chang-Tsun Li, Duc Thanh Nguyen

原文摘要

Cross-domain video deepfake detection increasingly uses frozen foundation-model experts, combined by calibrated score averaging, a per-video router picking one expert, or a learned head over concatenated features. Expressive routing and feature fusion are often reported to beat plain averaging. Across a 22-dataset frozen-expert testbed, we find those gains are largely evaluation artifacts. A corner theorem locates the gap routing aims to close: because AUC depends only on score ordering, the best any score-space router can do is an oracle reading the test label to pick each video's expert, a ceiling no realisable, label-blind router reaches. The theorem does not order real routers against a calibrated global average; the case against routing is empirical, and no router we test beats that average. Feature fusion reads raw features, falls outside the theorem, and is audited empirically. Reported gains trace to leakage: holding out one dataset leaks siblings sharing identities and reals (over-crediting routing), while holding out one manipulation keeps that dataset's reals in training (over-crediting feature fusion). A $2\times 2$ over fold and evaluation granularity pins the $+2.6$pp feature-fusion "win" to the fold alone: 12/12 significant under leaky folds vs. 0/12 under honest family-held-out folds, where both gains vanish. Fusion still pays off in the tail of hard videos and families: as experts are added, videos every expert misclassifies drop from 15.2% to 2.3%, and global calibrated fusion (InvB) beats the best single expert on worst-family AUC, selective risk (AURC), and low-false-positive recall, stably across protocols. Practitioners should calibrate and combine globally, hold out whole dataset families, and measure tail performance. For score-space routing under ranking metrics, honest evaluation and expert diversity matter more than combiner complexity.

cs.CV

版本更新 · v2arXiv:2607.14203

Instant NuRec: Feed-Forward 3D Gaussian Reconstruction for Driving Scene Simulation

NVIDIA, :, Jiahui Huang, Jiawei Ren, Michal Tyszkiewicz, Bjoern Haefner, Michael Shelley, Xin Kang 等 17 位作者

原文摘要

3D simulation platforms are critical for autonomous driving because they enable end-to-end policy evaluation, thereby reducing development costs and improving safety. In recent years, neural simulation has become predominant, with methods such as NuRec playing a central role; however, these methods remain relatively slow and typically require per-scene tuning. In this work, we present Instant NuRec, a feed-forward neural reconstruction model that turns a short multi-view driving log into a fully simulatable 3D Gaussian Splatting (3DGS) world in a single forward pass. The model accepts multi-view input from a calibrated camera rig and emits a layered output consisting of static and dynamic 3DGS layers, a sky cubemap, and per-camera ISP corrections, while providing native support for non-pinhole camera models via 3DGUT. It reconstructs a 10-20-second multi-camera scene in roughly 1.5 seconds and achieves a PSNR on the Waymo Open Dataset that is 2.01 dB above the strongest evaluated baseline. Instant NuRec is deeply integrated into NuRec and is compatible with AlpaSim for closed-loop simulation.

cs.GR · cs.AI · cs.CV

新论文 · v1arXiv:2611.14853

Can I join you? Extended Social Force Based Model with Predictive Control and Barrier Functions for Humanoid Group Repositioning Amidst Obstacles

Chuxuan Zhang, Niloofar Jahanshahi, Yasaman Etesam, Mo Chen, Angelica Lim

原文摘要

As social and service robots increasingly share interaction spaces in public, they may form groups while coordinating tasks or interacting with humans. Initial group formation alone is insufficient in dynamic settings, because it can be disrupted when a person or another agent joins, leaves, or passes through the group. Although group dynamics and repositioning have been widely studied in swarm robotics and virtual-agent settings, little attention has been given to socially appropriate repositioning behaviors in groups of humanoid robots. Existing social-force-based approaches provide a useful foundation for group behavior, but they have limited obstacle handling, and can produce unsafe behavior as environmental complexity increases. We propose a novel framework that modulates traditional Social Force, guided by Model Predictive Control (MPC) to plan ahead, bounded by Control Barrier Functions (CBF) to increase safety for robot groups repositioning behaviors. This approach aims to produce safer and socially aware group repositioning behaviors under various group formation disturbance. We evaluate the method in simulation through an ablation study and an online user study. The results show that our proposed method can produce smoother and safer repositioning behaviors in complex environments while preserving social appropriateness.

cs.RO · cs.HC

版本更新 · v3arXiv:2601.22204

FedAdaVR: Adaptive Variance Reduction for Robust Federated Learning under Limited Client Participation

S M Ruhul Kabir Howlader, Xiao Chen, Yifei Xie, Lu Liu

原文摘要

Federated learning (FL) encounters substantial challenges due to heterogeneity, leading to gradient noise, client drift, and partial client participation errors, the last of which is the most pervasive but remains insufficiently addressed in current literature. In this paper, we propose FedAdaVR, a novel FL algorithm aimed at solving heterogeneity issues caused by partial client participation by incorporating an adaptive optimiser with a variance reduction technique. This method takes advantage of the most recent stored updates from clients, even when they are absent from the current training round, thereby emulating their presence. Furthermore, we propose FedAdaVR-Quant, a server-side memory compression variant that stores historical client updates in quantised form (while keeping client-server communication in full precision), reducing the server memory footprint of FedAdaVR by 50% (FP16), 75% (Int8), and 87.5% (Int4) while maintaining highly competitive, and occasionally superior model performance. We analyse the non-convex convergence behaviour of FedAdaVR with Adagrad and prove that our proposed framework eliminates the first-order partial client participation bias while improving monotonically with cohort size. Extensive experiments conducted on multiple vision and NLP datasets demonstrate that FedAdaVR consistently outperforms state-of-the-art baseline methods.

cs.LG · cs.DC

新论文 · v1arXiv:2611.14851

Paired Geometric Supervision for Generalizable Deepfake Detection

Luke Collins, Chang-Tsun Li, Duc Thanh Nguyen, Victor Sanchez

原文摘要

We present OrthoPairGTL, a geometric training framework for cross-domain deepfake detection, built on a partially frozen DINOv3 backbone ($\sim$300M parameters), and make three contributions: (1) We re-evaluate six recent transfer-learning detectors (Forensics Adapter, Effort, three GenD variants and FakeSTormer) using the authors' released checkpoints under a single preprocessing pipeline across 17 cross-domain datasets (2018-2025), so that the reported gaps reflect method rather than per-method pipeline tuning. (2) We model the transformation between paired real and fake samples, training Parameter-Efficient Fine-Tuning (PEFT) adapters with an orthogonal pair decomposition, hyperspherical regularisation, and (in the GSD-LoRA variant) a set-level coherence objective. (3) Under LoRA, this regularisation gives a more stable optimisation profile: GSD-LoRA's post-peak validation degradation is $4.2\times$ shallower than plain LoRA at the same parameter footprint, and the time-averaged validation AUC across training is 1.82 pp higher. On the 17 datasets, GSD-LoRA matches or exceeds every re-evaluated baseline (92.82% vs. 91.58% for the strongest; paired Wilcoxon signed-rank $p=0.015$, 13/17 per-dataset wins), with the largest gains on modern reenactment-heavy benchmarks (DSv1.1, DSv2). Under strict parameter budgets, LayerNorm-only tuning ($\approx$0.03% of the backbone) is the most stable configuration and matches the strongest baseline with a mean of 91.97%.

cs.CV

新论文 · v1arXiv:2611.14850

Effective Teacher Support for Reasoning Distillation

Lavinia Ghita, Dhruv Desai

原文摘要

Forward-KL language-model distillation normally computes dense teacher and student scores over the full vocabulary at every supervised position, making training and stored teacher targets expensive. We instead distill from the teacher's highest-probability vocabulary fraction, renormalizing the retained mass as we sweep support from 100% to 0.01%. Our main study distills Qwen3 4B -> 1.7B. We confirm the broader support-reduction finding on larger Qwen3 8B -> 4B and Nemotron Nano 12B -> 9B pairs and under answer-only supervision. We evaluate generation primarily on MMLU-Pro and secondarily on GPQA-Diamond. Across the Qwen3 settings, retaining 0.01% of the vocabulary causes no observed MMLU-Pro degradation relative to full-vocabulary distillation, although disagreement with the complete teacher distribution increases. Nemotron Nano matches full-vocabulary MMLU-Pro at 0.1%, but smaller fractions fail to emit the closing reasoning tag, showing that the reliable cutoff depends on the model family. At 0.01% support, caching the retained next-token scores from the teacher forward pass cuts training step time by 38%, while restricting student output computation to those tokens cuts peak memory by 24%; neither causes observed MMLU-Pro degradation.

cs.AI · cs.CL · cs.LG

首次观测 · 记录 #1软件学报:jos:7693软件学报

基于自适应双重知识蒸馏的毫米波雷达行人重识别

基于自适应双重知识蒸馏的毫米波雷达行人重识别

盛碧云, 徐志颖, 蔡惠, 周剑, 肖甫

AI 速读 基于摘要

提出一种以视频模态为离线外部知识源、通过自适应双重知识蒸馏提升毫米波雷达点云行人重识别性能的“模型增强”训练范式。

cs.*

软件学报 · 2026 · 正式发表

查看原文摘要

现有的基于毫米波雷达点云的行人重识别技术, 因输入信号固有的稀疏性和信息量的物理限制, 其性能提升受到了极大限制. 为打破这一性能瓶颈, 提出一种新的“模型增强”训练范式: 利用信息更丰富的视频模态作为离线外部知识源, 通过知识蒸馏来提升毫米波雷达行人重识别的精度. 具体地, 设计对称时序建模架构以对齐师生模型的“认知范式”, 并在此基础上提出双重知识引导机制. 一方面, 基于“不同模态下, 人体步态的运动学特征在时序演变上具有一致性”这一关键洞察, 引入时序注意力蒸馏, 显式地指导雷达模型聚焦于步态关键帧. 另一方面, 通过对齐高层决策逻辑传递类别判别信息. 此外, 引入基于实例难度的自适应学习策略, 实现对困难样本的重点辅导. 在自建数据集上的实验结果表明, 所提方法能显著提升雷达模型的识别性能. 相较于最先进的单模态毫米波雷达模型, 在mAP (mean average precision)指标上取得了3.8%的提升.

首次观测 · 记录 #1软件学报:jos:7694软件学报

基于动态图注意力与多视角对齐的多模态推荐方法

基于动态图注意力与多视角对齐的多模态推荐方法

张?, 张会彬, 熊晨伊, 王帅, 王怡然, 李志飞

AI 速读 基于摘要

提出DAMARec,用文本-视觉双通道用户表示、动态图注意力加权交互关系和交互驱动的多视角跨模态对齐来改进多模态推荐。

cs.* · cs.CV

软件学报 · 2026 · 正式发表

查看原文摘要

多模态推荐通过联合建模用户历史行为与物品的图像、文本等内容信息, 能够在协同信号之外提供更丰富的语义线索, 从而提升推荐系统对用户偏好的刻画能力. 尽管现有工作已在多兴趣建模、结构学习和跨模态对齐等方面取得了一定进展, 但仍面临若干挑战: 一方面, 部分方法倾向于将用户行为信号与多模态内容压缩到共享表示空间, 导致不同模态下偏好表达的差异性刻画不足; 另一方面, 静态用户-物品交互图在稀疏或噪声较强的场景下容易引入无关邻居传播, 限制表示质量; 此外, 现有对比学习目标多聚焦于同一实体的跨视图一致性或模态内部约束, 对真实用户-物品交互关系的显式利用仍不充分. 针对上述问题, 提出一种融合动态图注意力与多视角对齐的多模态推荐方法DAMARec. 该方法在用户侧采用文本-视觉双通道表示, 以增强差异化兴趣建模; 在结构建模阶段, 引入动态图注意力机制对用户-物品交互关系进行自适应加权, 以突出关键信息传播并抑制噪声干扰; 在此基础上, 从用户侧与物品侧共同构建交互驱动的多视角跨模态对齐目标, 实现协同信号与多模态语义的一致约束. 在3个公开数据集上的实验结果表明, DAMARec在Recall@10和NDCG@10指标上平均提升6.31%和8.18%, 显著优于代表性基线方法, 验证了其在提升表示鲁棒性、增强跨模态语义一致性以及缓解稀疏场景噪声传播方面的有效性.

首次观测 · 记录 #1软件学报:jos:7744软件学报

基于学习状态和认知水平融合的双路径认知诊断模型

基于学习状态和认知水平融合的双路径认知诊断模型

谢志文, 张文婷, 付杨杰, 周光有

AI 速读 基于摘要

提出一种融合非认知学习状态与因果认知水平的双路径认知诊断模型,并在三个真实教育数据集上报告了优于九种基线的实验结果。

cs.*

软件学报 · 2026 · 正式发表

查看原文摘要

认知诊断旨在通过建模学生作答行为推断其知识点掌握情况, 对提升个性化教育和学习干预具有重要意义. 现有方法主要依赖统计模型或深度序列模型刻画学生知识掌握变化, 但通常忽视了作答过程中的非认知因素对学习状态的影响, 以及对作答结果的作用. 为解决上述问题, 提出基于学习状态和认知水平融合的双路径认知诊断模型. 在该模型中, 状态路径通过学生非认知行为特征推断学习状态, 并引入监督式对比学习增强状态表征的判别性; 认知路径结合因果分析刻画知识掌握水平与作答结果之间的因果关系; 两条路径通过门控式融合机制实现互补与动态调节, 从而全面反映学生的真实掌握水平. 为了验证所提模型的有效性, 在3个真实教育数据集上进行实验, 结果表明该模型在各类关键指标上均优于9种基线模型, 同时消融实验验证了双路径设计和门控融合在提升认知诊断性能与可解释性方面的有效性.

首次观测 · 记录 #1软件学报:jos:7748软件学报

基于多模态隐喻对齐与多智能体协作推理的反事实隐式情绪分析

基于多模态隐喻对齐与多智能体协作推理的反事实隐式情绪分析

廖健, 赵轩, 王素格, 郑建兴, 李德玉

AI 速读 基于摘要

提出反事实隐式情绪分析(CIEA)新任务,并构建多智能体协作推理的多模态语义对齐框架MOSAMAC,用于处理反事实陈述中的隐式情绪识别。

cs.* · cs.CL · cs.AI · cs.MA · cs.CV

软件学报 · 2026 · 正式发表

查看原文摘要

反事实陈述通过假设性和否定性的可能情境传达情绪, 为隐式情绪分析(implicit emotion analysis, IEA)带来独特且复杂的挑战. 当前研究面临3大主要障碍: 缺乏高质量的反事实隐式情绪分析(counterfactual IEA, CIEA)多模态语料库、对未发生场景的语义建模存在困难、解构反事实关联隐喻信息的复杂性. 针对上述不足, 提出CIEA这一新任务, 并构建一个基于多智能体协作推理的多模态语义对齐框架(multimodal semantic alignment framework with multi-agent collaborative reasoning, MOSAMAC). 该框架首先利用大语言模型(large language model, LLM)和多模态大语言模型(multimodal LLM, MLLM)生成视觉场景, 以解构文本中隐含的隐喻信息. 随后, 采用一种词元-图块级的融合方法, 将视觉语义与文本表示进行跨模态细粒度对齐. 此外, 通过设计多智能体协作机制对假设条件进行语义层面的推理, 并将其与多模态特征融合以实现最终的情绪预测. 构建两个新的CIEA数据集, 涵盖中英文并配套了多模态语义资源. 通过与多个具有竞争力的基线模型进行对比实验验证所提方法的有效性.

新论文 · v1arXiv:2611.14849

Generalize Then Personalize: Wearable-Based Heart Rate Forecasting Under Scarce Ruck-March Data

Muntaqim Ahmed Raju, Ruizhe Ma, John W. Ramsay, David J. Cornell

原文摘要

Heart rate (HR) forecasting may provide advance information about near-future cardiovascular response, potentially supporting physiological monitoring and workload-management decisions during ruck marching. However, robust model development is constrained by the difficulty of collecting large-scale ruck-march datasets, creating a scarce-data problem in which models must generalize across participants while adapting to individuals from limited personal data. To address this problem, we benchmark population-only training (POT), personalized-from-scratch training (PFST), and population-pretrained fine-tuning (PPFT) for HR forecasting during loaded ruck marching using data from eight active-duty U.S. Army medics across thirteen sessions. LSTM, Attention-LSTM, and CNN-LSTM backbones were evaluated against a persistence baseline at 30 s and 60 s horizons. Across all neural architectures and horizons, PPFT yielded lower mean MAE, RMSE, and endpoint MAE than both POT and PFST. Participant-level paired analysis after averaging across three training seeds showed that, relative to PFST, PPFT reduced trajectory MAE by 2.22-4.30 bpm and endpoint MAE by 1.24-2.88 bpm. All six trajectory-MAE comparisons remained significant after Holm adjustment ($p_{adj}$ = 0.0469), while four of six endpoint-MAE comparisons remained significant after adjustment. At 30 s, persistence achieved the lowest MAE (3.555 $\pm$ 1.274 bpm), while CNN-LSTM PPFT achieved the lowest RMSE (4.669 $\pm$ 1.916 bpm); LSTM PPFT achieved the lowest endpoint MAE (5.093 $\pm$ 2.365 bpm). At 60 s, Attention-LSTM PPFT achieved the lowest MAE (5.573 $\pm$ 1.939 bpm) and RMSE (7.134 $\pm$ 2.260 bpm), while CNN-LSTM PPFT achieved the lowest endpoint MAE (7.553 $\pm$ 2.357 bpm). These results suggest that population pretraining followed by participant-specific fine-tuning may provide a practical strategy for scarce-data wearable HR forecasting.

cs.LG

新论文 · v1arXiv:2611.14848

Tideway: Phase-Aware Tiered Memory Management for MoE Inference on Consumer Devices

Yifei Wang, Tsun-yu Yang, Yechen Xu, Hancheng Ye, Qinsi Wang, Baijun Zhou, Tingjun Chen, Hai "Helen" Li 等 10 位作者

原文摘要

Large language model (LLM) agents are rapidly becoming a dominant paradigm for AI applications. Recently, there is a growing demand to deploy large-scale Mixture-of-Experts (MoE) models locally on consumer PCs to balance data privacy, API costs, and inference efficiency. However, unlike datacenter servers with abundant DRAM, consumer devices are tightly constrained in both GPU VRAM and host RAM, forcing massive MoE weights to spill across VRAM, host RAM, and SSD. Under such spilling, we observe that existing systems fail to fully utilize this memory hierarchy, treating the tiers as independent caches and thrashing in inference. We present TIDEWAY, a system for efficient inference of large MoE models on memory-constrained consumer devices. Our core insight is to manage host RAM and GPU VRAM as a unified memory pool. Within this pool, TIDEWAY couples phase-aware memory layouts, which adapt to the distinct access patterns of prefill and decode, with an execution engine that optimizes CUDA Graph execution under expert paging. Our evaluations on representative consumer hardware with frontier MoE models demonstrate that TIDEWAY significantly outperforms state-of-the-art systems. On average, TIDEWAY achieves speedups of 1.97x in end-to-end latency and 2.40x in Time-to-First-Token (TTFT), along with 1.61x higher decode throughput against the fastest baseline. Our source code is publicly available at https://github.com/Afterglow231/Tideway .

cs.OS

版本更新 · v2arXiv:2610.30907

Near-Quadratic Time Multivariate Polynomial Interpolation

Chandra Kanta Mohapatra

原文摘要

Let $\F$ be a finite field. Given $N$ distinct points $\bmα_1,\ldots,\bmα_N \in \F^m$ and associated values $β_1,\ldots,β_N \in \F$, we study the problem of computing an $m$-variate polynomial $f(\vy) \in \F[\vy]$ of individual degree less than $d$, with $d^m \ge N$, that satisfies $f(\bmα_i)=β_i$ for all $i\in[N]$, whenever such an $f$ exists. This is known as the\textit{ multivariate polynomial interpolation} problem. In this work, given $N=d^m$, we present a deterministic algorithm for multivariate polynomial interpolation over an arbitrary finite field $\F$ that runs in near-quadratic time $N^{2+o(1)}\poly(m,d,\log|\F|)$, assuming $d$ is $ω(1)$. This bound holds whenever the associated \emph{multivariate Vandermonde} matrix is nonsingular, has constant co-rank, or admits some special structure. In the general case, we give a randomized Las Vegas algorithm attaining the same near-quadratic running time, provided the finite field is sufficiently large and $d$ grows similar to the previous case. Unlike other multivariate interpolation strategies, we do not assume black-box access to the polynomial. In particular, we are not permitted to query arbitrary input points to obtain their evaluations. Our interpolation result follows by combining Wiedemann's classical approach~\cite{w86} for solving sparse linear systems with known bounds for fast \emph{multivariate multipoint evaluation} over finite fields~\cite{umans08, KU11, BGKM23, BGGKU24}. Specifically, our deterministic interpolation strategy relies on a deterministic variant of Wiedemann's approach, which is more commonly used in the randomized setting.

cs.DS · cs.CC · cs.SC

新论文 · v1arXiv:2611.14846

Open Challenges and Opportunities in Human-Agent Systems

Reuth Mirsky, Sarath Sreedharan, Nitay Alon, Stefan Sarkadi, Munindar P. Singh, Liz Sonenberg, Peter Stone, Silvia Tulli 等 10 位作者

原文摘要

Agentic AI systems increasingly undertake extended tasks and act on people's behalf, making human-agent interaction central to their effectiveness. Successful interaction requires understanding human perspectives, coordinating complementary capabilities, and maintaining productive relationships within socio-technical environments. This paper examines how foundations developed by the Autonomous Agents and Multi-Agent Systems (AAMAS) community inform these demands. We consider interactions ranging from individual human-agent partnerships to teams and larger groups, where participants differ in their roles, decision authority, capabilities, and objectives. We organize computational approaches around the connected challenges of understanding others and deciding how to interact with them. Theory of Mind, belief-desire-intention architectures, goal and plan recognition, inverse planning, and recursive reasoning provide mechanisms for representing and inferring partially observable mental states. Observer-aware planning, model reconciliation, and decision-theoretic communication connect these inferences to action, explanation, and information exchange. Together with shared autonomy, argumentation, and cooperative inverse reinforcement learning, these approaches offer foundations for agentic systems that account for evolving human knowledge, intentions, and expectations. We argue that progress requires treating human interaction as an ongoing decision problem shaped by uncertainty, interdependence, and potentially conflicting objectives.

cs.AI · cs.MA

版本更新 · v2arXiv:2611.01509

A linear edge bound for k-quasi-planar graphs

Ankan Sadhu

原文摘要

We prove the $k$-quasi-planar graph conjecture for topological drawings. For every integer $k\ge 2$, a simple graph on $n\ge 3$ vertices admitting a drawing with no $k$ pairwise crossing edges has at most $1056(k-1)^2(n-2)$ edges. Thus the number of edges is linear in $n$, with an explicit quadratic dependence on $k$. The result allows multiple crossings between the same pair of edges, including edges with a common endpoint. The proof uses the double of a sphere with boundary to represent graph edges by closed geodesics on a hyperbolic surface. The endpoints of geodesic lifts induce partial orders of width at most $k-1$. A stability bound for greedy chain partitions, together with a counting argument over a triangulation, gives the stated edge bound.

math.CO · cs.CG

新论文 · v1arXiv:2611.14844

AutoAssumption: Searching over Assumptions Discovers ML-Systems Algorithms

Igor Sadalski, Minghao Guo, Benjamin Jones, Wojciech Matusik

原文摘要

Many advances in ML systems came from breaking an assumption that earlier methods took for granted: speculative decoding dropped the assumption that a model needs one forward pass per token. Yet algorithms rarely state their assumptions, so experts and discovery harnesses search over programs, where one edit changes several design choices and gains are difficult to attribute. Searching over the assumptions themselves remains largely unexplored. Writing algorithms as proofs makes their assumptions explicit and turns algorithm design into a search over a small, structured space that an LLM can explore and a proof checker can audit. We formalize 89 algorithms from KV-cache eviction, weight pruning and speculative decoding as proof graphs with explicit assumptions, checked in Lean. Our harness, AutoAssumption, relaxes one assumption of a published method, re-derives and re-proves it, and generates its code. In KV-cache eviction and weight pruning, this search improved on every published algorithm we ran and produced state-of-the-art algorithms. The eviction algorithm has the highest RULER-4K score of the published methods we ran, and the pruning algorithm the lowest perplexity of thirteen on four LLaMA models. At equal budget, the harness scores within a point of OpenEvolve, an open-source implementation of AlphaEvolve, with a lower standard deviation across repeats. Future work will formalize more fields and combine them through the principal assumptions they share.

cs.AI · cs.LG

版本更新 · v2arXiv:2608.02985

Temporal Leakage in LLM Backtesting: Measurement, Validation, and Adjusted Scores

Zeyu Zhang, Bradly C. Stadie

原文摘要

The standard check for contamination in LLM backtests is simple: compare scores before and after the training cutoff. We show this check is uninformative. Four flagship models fail it on questions they cannot have memorized: every scored question resolved after their cutoffs. The reason is structural. Models legitimately know more about times near their cutoff, so recency mimics leakage, and we prove no passive backtest can separate the two from genuine skill. Measurement, not just detection, requires information from outside the backtest. We supply it in two forms. A known cutoff identifies leakage at the boundary; a matched clean control identifies it globally and yields a leakage-adjusted score. Under a convex-pull model, leakage concentrates on outcomes that surprised the crowd and that training covered well. Partial memorization gives a large part of the full inflation. In twin models with planted leakage, the estimators detect and localize it, track its dose, and return null on clean questions. On frontier models, the estimators detect one cutoff-localized signature. They find no significant leakage at the tested boundaries in five models with positive naive gaps. Backtests need not be discarded; they need one defensible reference.

cs.LG · cs.CL · stat.ML

版本更新 · v2arXiv:2608.20627

When Failures Propagate: Causal Failure Attribution in Agentic Retrieval-Augmented Generation

Lauren Pothuru, Spurthi Setty, Natan Vidra

原文摘要

Agentic retrieval-augmented generation (RAG) interleaves retrieval, reasoning, and answer generation across multiple hops. A retrieval error at hop 1 can surface only as a wrong answer at hop 3, while later retrieval can also repair the trajectory. This paper introduces AgenticRAG-FP, an interventional benchmark for causal failure attribution in agentic RAG. The benchmark injects a certified fault at a specified hop, re-executes the downstream trajectory, and evaluates diagnosers against the known intervention site. Its central question is whether a post-hoc trace still identifies the injected hop after the suffix changes. In the dense Claude Haiku 4.5 structural sweep on three-hop MuSiQue questions, coverage-based diagnosis is 0.91 at hop 1 and 0.00 at hops 2 and 3 (n=43,36,21 failed trajectories), but it predicts hop 1 in 96% of failures, an earliest-hop rule; at hops 2 and 3, an LLM judge and frozen-hop repair localize only 0.25 to 0.48 of failures. In larger content-corruption runs, depth-2 exact-hop accuracy is 0.00 for coverage, 0.49 for an LLM judge, 0.59 for frozen-hop repair, and 0.14 for suffix regeneration (n=51); the judge and frozen-hop repair do not significantly differ (exact McNemar p=0.33).

cs.CL · cs.AI

版本更新 · v3arXiv:2604.26963

MARS: Towards High Goodput and Low KV Thrashing in Agent Serving under GPU Memory Constraints

Yifei Wang, Tsun-yu Yang, Hancheng Ye, Yechen Xu, Cong Guo, Chiyue Wei, Qinsi Wang, Dongting Li 等 12 位作者

原文摘要

Self-hosted LLM agents offer greater control over sensitive data and model customization while avoiding per-request API fees. However, serving concurrent, multi-turn workflows within limited GPU memory makes it difficult to achieve high workflow-level goodput. In particular, as workflows accumulate context, their reusable key-value (KV) caches can easily outgrow GPU capacity, triggering repeated eviction and recovery, known as KV cache thrashing. This process consumes resources and delays workflow completion. Although existing approaches propose various methods, our motivation study shows that the evaluated baselines still incur substantial thrashing overhead or fail to address the workflow-level goodput issue. We present MARS, an agent serving system that coordinates workflow admission and in-engine scheduling to achieve high workflow-level goodput on memory-constrained devices while avoiding KV cache thrashing. Specifically, outside the engine, an admission controller selects root workflows using initial prefix footprint estimates and live KV availability, adapting admissions to memory pressure. Inside, an agent-centric scheduler prioritizes turn completion and coordinates prefill allocation with KV reclamation to reduce disruptive evictions. Across two models and three GPU configurations, MARS achieves 1.59x-7.56x mean end-to-end latency speedups over the fastest baseline. Integrated as the serving backend for OpenCode, Codex, and OpenHands, MARS further improves mean workflow completion time by 1.17x-1.87x. Our source code is publicly available at https://github.com/Afterglow231/MARS_preview .

cs.OS · cs.DC · cs.LG · cs.MA

版本更新 · v2arXiv:2602.01411

Mean field optimal Core Allocation across Malleable jobs

Zhouzi Li, Mor Harchol-Balter, Benjamin Berg

原文摘要

Modern data centers and cloud computing clusters are increasingly running workloads composed of malleable jobs. A malleable job can be parallelized across any number of cores, yet the job typically exhibits diminishing marginal returns for each additional core on which it runs. Examples of malleable jobs include machine learning tasks, parallelized across multiple GPUs, and large-scale database queries, parallelized across multiple servers. Given the prevalence of malleable jobs, theoretical works have posed the problem of how to allocate a fixed number of cores across a stream of arriving malleable jobs so as to minimize the mean response time across jobs. We refer to this as the Core Allocation to Malleable jobs (CAM) problem. Although quite a few recent papers have been written on CAM, the problem remains challenging to solve optimally. In particular, prior theoretical work has only solved the CAM problem in very constrained cases. This paper takes a new approach to CAM, looking at the problem in the mean field asymptotic regime. In this regime, we are able to optimally solve a much more general instance of CAM. We derive two distinct mean field optimal policies, FW-CAM and GLAM. FW-CAM demonstrates a new intuition: in the mean field regime, individual job sizes are not relevant in finding an optimal policy. GLAM (Gittins-Like Allocation for Malleable jobs) is asymptotically optimal under certain common assumptions, and also serves as a good heuristic outside of the asymptotic regime by adapting dynamically to the current number of jobs in the system. Notably, none of the policies previously proposed in the literature are mean field optimal when jobs follow different speedup functions.

cs.DC

新论文 · v1arXiv:2611.14840

SPIRE: Task-agnostic embodied continual learning through autonomous situation inference and causal motor-primitive reuse

Yiyang Jia, Mingyang Lyu, Gongce Cao, Feifei Zhao, Yinqian Sun, Yi Zeng

原文摘要

Embodied continual learning requires controllers to infer changing situations, retain prior behavior and reuse motor skills without task labels or known boundaries. The challenge is deciding when to recover earlier behavior and which skills can support new learning. We introduce Situation-guided Primitive Integration for Recurrent Embodiment (SPIRE), a recurrent-spiking system that infers latent contexts from action-outcome evidence and learns context-specific motor actors online. Mature actors become protected sources that combine with a target-context residual to drive recurrent-spiking motor populations. Across coordinate, three-joint and hidden-force control, SPIRE maintained control, autonomously inferred situations, retained prior behavior and accelerated acquisition of an unseen source composition, reducing mean interactions to criterion by approximately 40% relative to matched fresh controllers. Rewinding compatible source actors impaired early acquisition in every matched intervention, demonstrating causal reuse. Against seven recurrent continual-learning and modular-control comparators, SPIRE achieved 2.4 times the mean prior-learning advantage of the strongest eligible task-free alternative selected for each paired stream. These results demonstrate autonomous recovery and causal reuse of motor skills for new learning in continuous embodied control.

cs.LG · cs.RO

版本更新 · v6arXiv:2602.23811

Beyond State-Wise Mirror Descent: Offline Policy Optimization with Parametric Policies

Xiang Li, Yuheng Zhang, Nan Jiang

原文摘要

We investigate the theoretical aspects of offline reinforcement learning (RL) under general function approximation. While prior works (e.g., Xie et al., 2021) have established the theoretical foundations of learning a good policy from offline data via pessimism, existing algorithms that are computationally tractable (often in an oracle-efficient sense), such as PSPI, only apply to finite and small action spaces. Moreover, these algorithms rely on state-wise mirror descent and require actors to be implicitly induced from the critic functions, failing to accommodate standalone policy parameterization which is ubiquitous in practice. In this work, we address these limitations and extend the theoretical guarantees to parameterized policy classes over large or continuous action spaces. When extending mirror descent to parameterized policies, we identify contextual coupling as the core difficulty, and show how connecting mirror descent to natural policy gradient leads to novel analyses, guarantees, and algorithmic insights, including a surprising unification between offline RL and imitation learning.

cs.LG · cs.AI

版本更新 · v3arXiv:2602.01404

BOA Constrictor: Squeezing Performance out of GPUs in the Cloud via Budget-Optimal Allocation

Zhouzi Li, Cindy Zhu, Arpan Mukhopadhyay, Mor Harchol-Balter, Benjamin Berg

原文摘要

The past decade has seen a dramatic increase in demand for GPUs to train Machine Learning (ML) models. Because it is prohibitively expensive for most organizations to build and maintain a large GPU cluster, organizations instead choose to rent GPUs from cloud providers. The customer is responsible for devising a policy for (i) deciding how many GPUs to rent at every moment in time to process a stream of ML training jobs and (ii) allocating the rented GPUs among the currently active jobs in the system. Because ML training jobs can be parallelized across different numbers of GPUs, the customer generally has many options for how many GPUs to use for each job. Allocating more GPUs to a single training job will cause the job to complete more quickly. However, the customer pays for each GPU-hour they use, and a training job receives a diminishing marginal benefit from running on additional GPUs. Hence, allocating too many GPUs to a single training job can dramatically increase the overall cost that the customer pays to the cloud provider. This gives rise to a cost-performance tradeoff that customers must balance when running training jobs in the cloud. To balance the cost-performance tradeoff, we develop BOA Constrictor, a new scheduler for ML training jobs which uses a Budget-Optimal Allocation (BOA) policy to squeeze the highest level of performance out of a cloud-deployed GPU cluster given a fixed budget constraint. We explicitly formulate the problem as a budget-constrained scheduling problem and derive the BOA policy which minimizes the average job completion time (JCT) of a stream of arriving jobs subject to the user's budget. For a given budget level, we demonstrate that BOA Constrictor can reduce average JCT by 1.6 times in small-scale implementation experiments and by 2 times in detailed, large-scale simulations compared to state-of-the-art heuristic based schedulers.

cs.DC