跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 11:42库内论文最新更新时间:2026-11-14 01:29

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

23,754 已收录论文19,886 AI 相关6,892 有修订112 HF 社区发现

浏览论文库

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

找到 23,754 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
首次观测 · 记录 #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

新论文 · v1arXiv:2611.14838

Sophon: A Procedural Diagnostic for Spatial Reasoning in Vision-Language Models

J. Zach Gazak, Ryan Swindle, Justin Fletcher

原文摘要

Open-weight Vision-Language Models (VLMs) score 85-94% on spatial benchmarks (BLINK Spatial, What's Up CLEVR) yet collapse to chance on simple geometric questions when object, scene, and texture priors are stripped away. We introduce and open-source Sophon, a procedurally generated diagnostic of paired colored point-cloud stimuli across three coordinate systems (1D linear, 2D Cartesian, 2D polar) and four question types (binary, categorical, comparative, quantitative). Across four open architectures (LLaVA-NeXT, LLaVA-OneVision, Qwen2.5-VL, Idefics3), accuracy clusters at 47-52% while frontier models (Opus 4.6, Gemini 2.5 Pro, GPT-5.4) clear 77-83% and humans reach 84-94%. We use linear probes and low-rank adaptation (LoRA) to trace the open-weight failures. Probes of the vision encoder (ViT) and language decoder (LLM) recover Sophon spatial information at 83-85% and 80-86% accuracy, respectively, and the language tower's reasoning circuit answers text-only controls (point clouds as sets of coordinates) at +40 pp over visual stimuli. Language tower per-layer attention attribution localizes visual integration to mid-stack layers. At readout, models elevate the correct answer-set tokens but select among them randomly. We localize the mechanism by tuning individual and grouped components across every architecture's stack, including the vision tower (ViT workspace and reader), the projector, and the language tower (LLM workspace and reader). These experiments demonstrate that this mid-stack workspace holds circuitry capable of organizing the spatial signal so that the frozen reader can decode it. LoRA fine-tuning adjusts that circuitry such that 7B-class VLMs answer Sophon spatial reasoning questions at frontier aggregate accuracy. This work suggests that these models do not have a capability gap for spatial reasoning but suffer from a routing bottleneck that targeted fine-tuning repairs.

cs.CV · cs.LG

新论文 · v1arXiv:2611.14837

Two-Stage Mixed-Integer Quadratic Programming in Polynomial Time

Alberto Del Pia

原文摘要

Lenstra showed that mixed-integer linear programming can be solved in polynomial time when the number of integer variables is fixed and the number of continuous variables is arbitrary. Mixed-integer quadratic programming (MIQP) can be solved in polynomial time when the total number of variables is fixed. However, since MIQP is NP-hard already without integer variables, the analog of Lenstra's result fails unless P = NP. Hence, polynomial-time algorithms for MIQP with an arbitrary number of continuous variables must exploit additional structure. We study MIQPs with two-stage structure, which underlies Benders decomposition and two-stage stochastic programming. A few linking variables, including all integer variables, are coupled with many blocks of continuous variables that interact only through them, both in the constraints and in the objective. We give a polynomial-time algorithm for MIQP with an arbitrary quadratic objective when the number of linking variables and the block size are fixed, while the number of blocks, and hence the number of variables, is arbitrary. The case with no blocks is MIQP in fixed dimension. None of our assumptions can be dropped. Unless P = NP, the number of linking variables and the block size must both be fixed, the blocks cannot interact or contain integer variables, and large blocks cannot be allowed even if their objective is linear. Unless FPT = W[1], the exponent of the running time must depend on both the number of linking variables and the block size.

math.OC · cs.CC · cs.DS

新论文 · v1arXiv:2611.14835

What Does an RF Fingerprint Identify? A Cross-Corpus Evaluation of Hardware-Family-Associated and Unit-Level Signal

Hyojung Han

原文摘要

RF fingerprinting benchmarks report how well a classifier separates transmitters, not whether that separability reflects the individual unit or its hardware family. We compare a benchmark's real hardware grouping with size-matched random groupings of the same devices, using calibrated, unclipped variational lower bounds under label-blind, device-level cross-fitting on devices never seen in training. On WiSig (OFDM Wi-Fi), the generation grouping exceeded all 999 matched random groupings (permutation p = 0.001, the resolution floor), although no grouping attained a positive certified bound, and the direction survives removing channel equalization. A preregistered replication on a LoRa corpus (chirp spread spectrum, three hardware models), with a front-end frozen on synthetic data, again exceeded all 999 (p = 0.001), and two sensitivity analyses judged by a reversal rule fixed in advance did not reverse the direction. This is a directional replication only: the excess magnitude reflects a miscalibrated null, the chain-rule decomposition leaves a residual of +0.296 bits, and capture order is undocumented. In a same-model corpus of 122 ESP32 radios, a temperature-calibrated held-out bound of +3.338 bits (label entropy 6.931 bits) indicates substantial device-specific identity, not separable from per-device capture-session effects; relying on the calibrated bound was decided after the uncalibrated bound changed sign. On synthetic transmitters a high-capacity convolutional decoder reaches 98.5% of a known 6-bit ceiling, and the audit protocol leaves chain-rule residuals of +0.072 bits (synthetic, fixed physical features) and +0.060 bits (WiSig, audit features). Two further corpora were excluded by preregistered ingest gates. Across WiSig and LoRa, hardware-family groupings consistently produced stronger identity-associated signal than size-matched random groupings.

cs.CR · cs.LG

版本更新 · v2arXiv:2407.01176

Platform Building with Fake Users: On Airdrop Farmers and Activity Procurement

Hanna Hałaburda, Benjamin Livshits, Aviv Yaish

原文摘要

Digital platforms reward observable claims to build their user base. Because claims are imperfect proxies for people, these programs attract bonus hunters and airdrop farmers, who are usually treated as leakage and screened out. We show that screening can be too aggressive when eligibility requires a separable platform-building input. In a monopolist model, fixed per-claim rewards cannot implement finite farmer activity: rewards below farmer cost induce no entry, while rewards above cost induce unbounded entry. A shared pool can succeed because it makes claims rivalrous. Entry dilutes the pool until the per-claim reward equals claim cost, converting the program into identity-blind procurement. In the baseline model, all farmer-created claims have the same lower cost, while all organic claims have the same higher cost; farmers therefore supply the activity. Organic users receive no rewards but benefit from higher quality, so perfect screening can reduce platform profit and organic-user payoffs. In case when primary organic claims are cheaper but additional organic identities cost more than farmer claims, a small pool attracts only organic claims, whereas a larger pool recruits farmers to expand activity. The mechanism applies to separable inputs (e.g., liquidity, inventory, and data) rather than rewards for regular use or mechanical claim creation. Thus, weak identity changes both leakage and how platforms procure growth.

cs.GT

版本更新 · v2arXiv:2611.10648

PENSA: A Spatial Accelerator for BitNet b1.58 Inference on an HBM-equipped AMD Alveo FPGA

Karthikeyan B. Kalyanasundaram, Ivan S. Maksymov, Philip H. W. Leong

原文摘要

Ternary large language models (tLLMs) replace general multiplication in dominant linear layers with sign-controlled accumulation, shifting hardware bottlenecks toward packed-weight delivery, reduction, and operator occupancy. PENSA is an end-to-end FPGA accelerator for the BitNet b1.58 2B4T model on an AMD Alveo U50. Two row-partitioned ternary matrix engines consume packed TQ1_0 weights from eight independent high-bandwidth memory (HBM) pseudo-channels, each processing 1,280 ternary weights per cycle through sign selection and integer reduction. The sequencer, attention, and vocabulary-projection units remain resident on the FPGA, while two-stream interleaved scheduling overlaps sequences across the persistent pipeline to form the Penta-Unit. At 104.1~MHz, PENSA achieves 58.09 tok/s at context 128 and 24.60 tok/s at context 2048, corresponding to 2.14-3.14$\times$ the throughput of a same-model Xeon E-2356G baseline. The resulting system demonstrates end-to-end FPGA execution of 2B-scale BitNet topology without modifying its model structure.

cs.AR · eess.SP

新论文 · v1arXiv:2611.14834

Learning Low-Latency Action Verification for Frozen Vision-Language-Action Models

Wen-Han Hsieh, Ken Jiankun Zheng, Chia-Chien Chen, David M. Chan, Trevor Darrell

原文摘要

Vision-language-action (VLA) models have made significant progress in general-purpose robotic manipulation. However, sampled action sequences can be ineffective, while evaluating alternatives with computationally expensive verifiers adds latency at each policy query. In this work, we propose HDH, a lightweight framework that uses hindsight from a frozen VLA's own deployments to improve action verification. The framework has three stages. First, we deploy the policy and collect its autonomous rollouts. We then train a compact action verifier to assign each action chunk a predicted task-success score. Finally, the frozen VLA generates action candidates, and the verifier selects the candidate with the highest score for execution. Across four LIBERO-10 tasks, HDH achieves an average success rate of 82.3\% and on three real-world manipulation tasks, HDH improves average success over the baseline policy by 22.6\%.

cs.RO · cs.AI · cs.CV

新论文 · v1arXiv:2611.14833

Do People Trust AI Assistants Even When They Are Consistently Wrong?

Cameron R. Jones, Julia Wong, Aaron S. Cohen, James Woolley, Benjamin K. Bergen

原文摘要

People are increasingly using conversational AI systems to make decisions despite concerns around their reliability. How well do people calibrate to AI systems' accuracy in multi-turn conversations? We measure how people's reliance on LLMs' advice changes across repeated interactions, varying whether the AI assistant is helpful (100% accurate), unhelpful (0% accurate), or mixed (50% accurate). Across 4 experiments, we find people learn to trust helpful models more than unhelpful ones (67% vs 21% of the time), but only when they receive external feedback on the models' accuracy. Without feedback, people continue to be persuaded 48% of the time by a consistently unhelpful model (vs 38% for helpful). Rather than gaining trust in helpful models, participant reliance on LLM advisors tended to be high in early trials and only fell with evidence of inaccuracy. Participants trusted LLM advisors more than they trusted human advisors (83% vs 65%, Experiment 4), and LLMs benefited more from having a helpful track record than humans did. In contrast with previous work, we find limited evidence of an advantage for arguing for the truth (versus a falsehood). Truth advantages emerged only when participants were already very confident in their position, and did not emerge at all for static hints. Collectively, the results suggest that people may be swayed by LLM advice, even when it is consistently false, unless they have access to timely ground-truth feedback. Unfortunately, in many domains such feedback may not be available, leading to overreliance on AI.

cs.HC · cs.CL

新论文 · v1arXiv:2611.14832

Neural Compression for Scientific Particle Data: Perspectives on How Learning Can Help

Tian Qiu, Carolina Cuesta-Lazaro, Sheng Di, Haewon Jeong

原文摘要

As particle-based simulations grow in scale, efficient compression of scientific data becomes critical. Neural point cloud compression (PCC) methods excel on computer vision (CV) benchmarks, but do they transfer to scientific particle data? We highlight that scientific particles differ from CV point clouds in fractal dimension: CV point clouds are locally planar, but particles are not. This key difference limits the effectiveness of the octree data structure that underpins most PCC methods. Neural codecs achieve only marginal bitrate reductions over the traditional G-PCC baseline on scientific data, revealing a significant performance gap. Supported by an evaluation spanning domains of cosmology, molecular dynamics, and plasma physics, we outline where the structure of scientific data limits current neural approaches and where learning can help in the future.

cs.CV

版本更新 · v2arXiv:2404.09443

Hybrid FedGraph: An efficient hybrid federated learning algorithm using graph convolutional neural network

Jaeyeon Jang, Diego Klabjan, Veena Mendiratta, Fanfei Meng

原文摘要

Federated learning is an emerging paradigm for decentralized training of machine learning models on distributed clients, without revealing the data to the central server. Most existing works have focused on horizontal or vertical data distributions, where each client possesses different samples with shared features, or each client fully shares only sample indices, respectively. However, the hybrid scheme is much less studied, even though it is much more common in the real world. Therefore, in this paper, we propose a generalized algorithm, FedGraph, that introduces a graph convolutional neural network to capture feature-sharing information while learning features from a subset of clients. We also develop a simple but effective clustering algorithm that aggregates features produced by the deep neural networks of each client while preserving data privacy.

cs.LG · cs.DC

版本更新 · v2arXiv:2601.21334

Do Pathology Foundation Models Encode Disease Progression? A Pseudotime Analysis of Visual Representations

Pritika Vig, Ren-Chin Wu, William Lotter

原文摘要

Vision foundation models trained on discretely sampled images achieve strong performance on classification benchmarks, yet whether their representations encode the continuous processes underlying their training data remains unclear. This question is especially pertinent in computational pathology, where we posit that models whose latent representations implicitly capture ordinal disease progression may better reflect underlying biology, support more robust generalization, and enable quantitative analyses of features associated with disease transitions. Using diffusion pseudotime, a method developed to infer developmental trajectories from single-cell transcriptomics, we probe whether foundation models organize disease states along coherent progression directions in representation space. Across four cancer progressions and six models, we find that all pathology-specific models recover trajectory orderings significantly exceeding null baselines, with pathology vision-only models achieving the highest average fidelities. Model rankings by trajectory fidelity on reference diseases predict few-shot classification performance on held-out diseases ($ρ= 0.91$), and exploratory analysis shows cell-type composition varies along inferred trajectories in patterns consistent with known stromal remodeling. Together, these results suggest that vision foundation models can implicitly learn to represent continuous processes from independent static observations, and that trajectory fidelity provides a complementary measure of representation quality beyond downstream performance. While demonstrated in pathology, this framework could be applied to other domains where continuous processes are observed through static snapshots.

cs.CV

新论文 · v1arXiv:2611.14828

LLMs and the Homogenization of Teaching

Mei Tan, Hyunji Nam, Hari Subramonyam, Dorottya Demszky

原文摘要

Large language models (LLMs) are known to lack diversity in open-ended text generation, a limitation that is especially consequential in education, where homogeneity can narrow the kinds of thinking and disciplinary work students are invited to do. We study diversity in two educational generation tasks: math items and essay feedback. We compare frontier and open-weight models with human-authored reference distributions using lexical, semantic, and domain-grounded measures. For math, we examine the mathematical activities students are asked to perform; for feedback, we examine the revision work requested and the rhetorical strategies used to communicate it. We evaluate direct prompting, two diversity prompting methods, and post-training. Across both tasks, directly prompted model outputs are markedly less diverse than human-authored content--78% higher on lexical (Self-BLEU) and 51% higher on semantic (embedding) similarity--and represent a narrower range of instructional forms. Diversity prompting and post-training increase variation largely through surface features without broadening the instructional repertoire. Models inherit and amplify the most normative routines of human instruction. Overcoming mode collapse in education will require richer instructional data and investment in teachers' creative capacity and professional judgment.

cs.CL

新论文 · v1arXiv:2611.14827

Sublogarithmic Online Graph Exploration

Julia Baligacs

原文摘要

We study the online graph exploration problem, in which an agent must visit every vertex of an initially unknown weighted graph on $n$ vertices and return to its starting vertex. In this model, a vertex's incident edges and their weights are revealed when it is first visited. Despite extensive research, the best known competitive guarantee for general graphs had remained $\mathcal{O}(\log n)$, a bound already established in 1977 for the greedy TSP heuristic Nearest Neighbor. Subsequent approaches, including hierarchical depth-first search (hDFS) and Blocking, achieve better guarantees on restricted graph classes but have logarithmic or worse competitive ratios on general graphs. This raises the question of whether the logarithmic barrier is inherent and Nearest Neighbor is asymptotically optimal. We answer this question in the negative by giving an $\mathcal{O}(\log n/\log \log n)$-competitive algorithm. Our algorithm is a slight modification of hDFS, and we establish its competitive guarantee with a surprisingly short proof.

cs.DS · cs.DM

版本更新 · v2arXiv:2610.31821

What the Query Remembers: Query Abstraction Governs Lexical and Dense Retrieval of Classical Arabic Poetry

Omar Farouk Zouak, Selma Mani, Larbi Said Chikh, Raid Abderrezak Ouahioune

原文摘要

How well a poetry archive can be searched depends on what the user still remembers, not only on what the model understands. We show this for Classical Arabic poetry, benchmarking nine dense encoders and BM25 over two corpora, three indexing modes and two evaluation protocols. Which retriever wins is governed by how much of a poem's wording the query still carries. On tip-of-the-tongue queries BM25 leads every dense encoder, including a large multilingual embedding model (Qwen3-Embedding-8B, 0.746 vs. 0.717 Recall@5); on abstract queries it falls to eighth out of ten (0.392 vs. 0.748). Editing the wording of the same queries shows that this ranking largely reflects query composition: adding one remembered half-verse raises BM25 by 38 points, rewriting the quoted words by hand leaves BM25 level with the 8B encoder, and BM25's sensitivity to remembered wording is significantly steeper than that of the strongest dense encoder. The same axis controls explanation augmentation, whose effect swings from +37 to -39 points. The mechanism splits by system type: lexical containment best predicts how BM25 responds to explanations, embedding proximity how dense encoders do. Finally, the field's two standard protocols, known-item retrieval and thematic relevance, dissociate on the same systems, a result reproduced by two blind human annotators and by two open-weights judges, one of them under a rubric with no literal-match criterion. A benchmark that reports one protocol, or one query register, can give a materially wrong picture. Code and data are available at https://github.com/Ellzo/what-the-query-remembers.

cs.CL · cs.AI · cs.IR