跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 10:40库内论文最新更新时间:2026-11-13 16:48

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

23,434 已收录论文19,641 AI 相关6,765 有修订112 HF 社区发现

浏览论文库

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

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

$\mathsf{SVP}_\infty$ 在二的幂次分圆理想中是 NP-难的

$\mathsf{SVP}_\infty$ Is NP-Hard for Power-of-two Cyclotomic Ideals

Yansong Feng, Jiaqi Liu, Hengyi Luo, Yanbin Pan

AI 速读 基于摘要

作者报告证明了在二的幂次分圆环的主理想与秩二自由模上,系数 $\ell_\infty$ 范数下的精确判定 SVP 是 NP-完全的,并给出从子集和问题的确定性多项式时间多一归约。

cs.CC

查看原文摘要

We prove that exact decision-$\mathsf{SVP}$ in the coefficient $\ell_\infty$-norm is $\mathsf{NP}$-complete for principal ideals and free modules of rank two over the cyclotomic rings $R_n=\mathbb{Z}[X]/(X^n+1)$, where $n$ ranges over powers of two. For each case, we give a deterministic polynomial-time many-one reduction from the Subset Sum problem. For an instance with $s$ positive input integers, the output lattice has dimension $O(s)$. A solution to the original Subset Sum instance can be recovered in polynomial time from any nonzero output lattice vector of norm at most the specified bound. We also transfer these reductions from $R_n$ to the power-of-two cyclic rings $S_{2n}=\mathbb{Z}[X]/(X^{2n}-1)$. This gives $\mathsf{NP}$-completeness of decision-$\mathsf{SVP}$ in the coefficient $\ell_\infty$-norm for principal ideals and free modules of any fixed positive rank over these rings.

新论文 · v1arXiv:2611.14333

AI 并非变笨,而是我们变得更挑剔:大语言模型人工评估标准的上升

AI Isn't Getting Dumber, We're Getting Pickier: Rising Standards in Human Evaluation of Large Language Models

Zihan Chen, Lei Nico Zheng, Di Zhu

AI 速读 基于摘要

基于 Chatbot Arena 126 万余条盲投票,作者报告:在模型版本固定的同一模型对上,"两者都差"的投票比例逐月上升,而相对排名保持平稳,提示人工评估的绝对标准在漂移。

cs.HC · cs.AI · cs.CL · cs.CY

查看原文摘要

Users often complain that AI assistants such as ChatGPT are getting worse. Some versions do change, but human evaluation leaves a second possibility untested: the people judging may change. We separate the two on Chatbot Arena, a public platform where people compare answers from two anonymous large language models (LLMs) and pick the better one or say both are bad. We study 1,260,967 blind votes cast from May 2023 to August 2024 on pairs of models whose versions are fixed: dated vendor snapshots and models with fixed open weights. For the same pair of unchanged models, the share of votes saying "both are bad" rises by 1.71 percentage points a month on a mean of 17.1%, and by 1.91 points a month in 2024. In fourteen pairs observed often in both 2023 and 2024, it rose in every one, from 15.5% to 23.3%. The ranking does not trend: in 2024, the stronger model's share of decisive votes is flat. The rise holds within the same voter and on the same pair, and across arrival cohorts from their first recorded vote. It holds with prompt controls, in every major language, for dated vendor snapshots, open-weight models and models with stable answer length, and between interface changes. The drift is shared across models: month effects estimated from other models' pairs remove it from each model's own pairs. Platform-wide, the average model would be expected to score 78% against the 2023 average, yet the share of "both are bad" votes ended near where it began. The pattern fits a standard that follows the category's progress, so a product that stands still is judged as declining. Absolute verdicts on AI drifted while relative comparisons held steady, an evaluation drift that matters for LLM leaderboards and for the human feedback used to train models.

新论文 · v1arXiv:2611.14328

前向值离散化:无需高阶近似的高效随机扩散采样

Forward-Value Discretization: Faster Stochastic Diffusion Sampling Without High-Order Approximation

Yuchen Jiao, Na Li, Changxiao Cai, Yuting Wei, Gen Li

AI 速读 基于摘要

作者提出免训练的前向值离散化框架,通过在基于历史预测构造的前瞻点上评估模型,在保持一阶收敛的同时改善随机扩散采样的采样效率。

cs.LG · cs.AI · stat.ML

查看原文摘要

Stochastic diffusion samplers often require substantially more neural function evaluations (NFEs) than deterministic samplers to achieve comparable sample quality. Although higher-order discretization accelerates deterministic sampling, its benefits for stochastic sampling remains unclear. We establish matching upper and worst-case lower bounds showing that stochastic samplers with higher-order approximations remain first-order convergent, even with exact score functions. Thus, increasing the approximation order does not generally improve the convergence order. Motivated by this limitation, we introduce forward-value discretization, a training-free framework that evaluates the data/noise prediction model at a lookahead estimate constructed from previous predictions. For deterministic sampling, the resulting Forward DPMSolver (F-DPMSolver), improves sample quality at low NFE budgets through its DDIM-based variant, despite remaining first-order convergent. For stochastic sampling, we develop Forward DDPM (F-DDPM), which evaluates the model at a cleaner lookahead point adjusted for subsequent noise injection. This estimate reuses both the previous model prediction and the previously injected noise. Both variants admit first-order convergence guarantees with one model evaluation per iteration. Across CIFAR-10, ImageNet, FFHQ, and LSUN, F-DDPM consistently achieves lower FID than the evaluated stochastic baselines at matched NFE budgets. With 1.5 times as many NFEs as deterministic baselines, it achieves competitive sample quality, narrowing the practical efficiency gap between stochastic and deterministic sampling. Code is available at https://github.com/Na-Li66/F-DDPM.

版本更新 · v3arXiv:2605.31562

通过掩码基因表达实现有效的生物表征学习

Effective Biological Representation Learning by Masking Gene Expression

Kian Kenyon-Dean, Alina Selega, Ihab Bendidi, Jordan M. Sorokin, Luca Bertinetto, David Errington, Hayley Donnella, Oren Kraus

AI 速读 基于摘要

作者提出面向RNA-seq计数数据的自监督掩码自编码模型TxFM,并构建公开语料DiverseRNA-1.4M,报告其在基因表征迁移任务上优于规模大逾100倍的图谱级语料训练的转录组基础模型。

cs.LG

查看原文摘要

RNA sequencing produces rich and diverse datasets of gene expression, offering compelling insights into cellular state and function that have many applications in drug discovery. Modeling such data is challenging due to inherent technical noise and experimental batch effects, as evidenced by many existing transcriptomic foundation models (FMs) underperforming relative to linear baselines. Such results raise the question of whether deep representation learning provides a distinct advantage over the direct use of raw transcript counts. Our work explores this by developing a new self-supervised model, TxFM, with a focus on inductive representation learning evaluations. TxFM employs a masked autoencoding approach tailored to diverse RNA-seq count data, and our ablation study empirically identifies crucial architecture configurations required for strong transfer performance. Additionally, we curate a public training corpus, DiverseRNA-1.4M, and find that TxFM trained on this curated dataset yields high-fidelity gene representations that outperform FMs trained on atlas-scale corpora over 100x larger. Overall, our results indicate that inductive self-supervised learning is a viable modeling approach for transcriptomics representation, provided a careful synthesis of model architecture and training data curation.

新论文 · v1arXiv:2611.14327

固定树宽平面图的刻画

Characterizing Fixed-Treewidth Planar Graphs

Laura Merker, Samuel Schneider, Torsten Ueckerdt

AI 速读 基于摘要

作者给出对每个 k≥3 的树宽为 k 的平面图的第一个归纳刻画,并由此推出树宽至多 4 的平面图顶点荫度至多 2。

math.CO · cs.DM

查看原文摘要

We give the first inductive characterization of planar graphs of treewidth $k$ for each $k \geq 3$. Our definition generalizes the well-known inductive definition of planar $3$-trees and the recent definition of so-called planar quasi-$4$-trees [Förster, 2024]. As a key step, which may be of independent interest, we show that every planar triangulation $G$ of treewidth $k$ admits a tree decomposition of width $k$ where each adhesion set induces a cycle in $G$. As an application of planar quasi-$4$-trees, we show that planar graphs of treewidth at most $4$ have vertex arboricity at most $2$. That is, the vertex-set of every planar graph of treewidth at most $4$ can be partitioned into two sets that each induce a forest.

版本更新 · v3arXiv:2601.05636

多重集删除码:循环校验子构造、界与精确结果

Multiset Deletion Codes: Cyclic Syndrome Constructions, Bounds, and Exact Results

Avraham Kreindel, Isaac Barouch Essayag, Aryeh Lev Zabokritskiy

AI 速读 基于摘要

该论文研究可纠正至多 t 次删除的多重集码,给出基于几何和标签与基数构造的校验子类大小尖锐估计及若干精确结果。

cs.IT

查看原文摘要

We determine sharp class-size estimates for multiset codes over $q$ symbols that correct up to $t$ deletions. For fixed $q,t\ge2$, we prove that the syndrome classes defined by Nathanson's geometric-sum labels modulo $M=1+t+\cdots+t^{q-1}$ differ from their average size by $O(n^{q/p-1})$, where $n$ is the blocklength and $p$ is the least prime divisor of $q$. This exponent is sharp, and every prescribed class has size asymptotic to the average. For prime $q$, all classes have equal size when $n\equiv-1,\ldots,-(q-1)\pmod M$. We also present our radix construction, whose labels are zero and the first $q-1$ powers of $t+1$, starting at $1$, modulo $t(t+1)^{q-2}+1$. We determine its sharp class-size deviation exponent. For even $q\ge4$, its syndrome classes have a smaller deviation exponent, although their average size is smaller. Over four symbols and every $t\ge2$, we show that the radix labels still correct up to $t$ deletions modulo a reduced modulus, which gives bounded deviations and eventually larger classes than either unmodified construction. For a fixed number $k\ge2$ of surviving symbols, we prove that some maximum code contains all constant words, reducing the remaining optimization to multisets with multiplicities below $k$. Finally, for one deletion at length four over $q\ge4$ symbols, we show that the best bound from fractional weights on deletion outputs, rounded down, equals the maximum code size exactly when $q\equiv2,4\pmod6$.

新论文 · v1arXiv:2611.14326

智能体何时该记住?面向LLM智能体的证伪门控自我进化

When Should Agents Remember? Falsification-Gated Self-Evolution for LLM Agents

Runxuan Tang, Haoyu Gao, Yuyan Ding, Junyi Yao, Zihao Zheng, Zecheng Sheng, Liwei Hou

AI 速读 基于摘要

提出证伪门控的自我进化框架FGSE,把经验教训当作带验证器的结构化假设,经临时试用与多类探针检验后再决定是否写入持久记忆。

cs.AI · cs.LG

查看原文摘要

LLM agents increasingly operate in long-horizon, verifier-rich environments, but current self-improvement mechanisms often write episode-derived lessons directly into memory, making local success an unreliable signal for reusable and safe knowledge. This paper addresses the core question of when an experience-derived behavioral update should be admitted into persistent agent state. We propose Falsification-Gated Self-Evolution (FGSE), a verifier-grounded framework that represents each candidate lesson as a structured hypothesis with an explicit precondition, behavior change, expected effect, and verifier. FGSE applies the hypothesis only in a temporary state, tests it on target-transfer, falsification, and archived-regression probes, and then commits, refines, or rejects it according to measured gain and risk. Across web, app, tool-use, and long-term memory benchmarks, FGSE achieves strong task performance, including 39.8 WebArena success rate, 78.8 AppWorld average completion, and 0.724/0.487 Pass$^1$ on $τ$-Retail/$τ$-Airline, while reducing falsification failures to 5.0%, regression damage to 1.3%, and harmful committed updates to 3.6%. These results suggest that testing memory updates as hypotheses supports more reliable long-term adaptation.

版本更新 · v3arXiv:2606.12601

双状态槽注意力:解耦外观与身份的视频物体中心学习

Dual-State Slot Attention: Decoupling Appearance and Identity for Video Object-Centric Learning

Sieu Tran, Duc Nguyen, Hao Vo, Khoa Vo, Ngan Le

AI 速读 基于摘要

提出DSSA,将槽向量拆分为逐帧外观的局部状态与跨帧稳定的身份状态,并抑制弱匹配槽的虚假更新,以提升无监督视频物体中心学习的身份稳定性。

cs.CV

查看原文摘要

Unsupervised video object-centric learning aims to decompose dynamic scenes into persistent, object-level representations without supervision. However, existing slot-based methods struggle to maintain stable object identity in challenging settings such as rapid motion and partial occlusion. First, they typically encode both the per-frame appearance of an object and its identity across frames in a single slot vector, creating an objective conflict that leads to slot swapping: reconstruction requires sensitivity to transient visual changes, whereas temporal consistency requires invariance to them. Second, the token renormalization used in Slot Attention can amplify weakly attending slots, allowing them to absorb tokens from other objects and destabilize slot-to-object correspondence. We propose Dual-State Slot Attention (DSSA), a fully self-supervised framework that addresses these limitations by separating appearance from identity and by reducing spurious updates from weakly matching slots. DSSA decomposes each slot into a local state for per-frame appearance and an identity state for temporally stable object information, thereby aligning reconstruction and temporal consistency with separate representations. The identity state is updated through a learned recurrent transition that acts as a temporal filter on the local state, while competition-modulated aggregation (CMA) down-weights updates from weakly matching slots and prevents them from absorbing tokens from other objects. Experiments on MOVi-C, MOVi-D, and YouTube-VIS demonstrate that DSSA consistently improves segmentation quality and temporal consistency over prior methods, while also yielding stronger downstream object recognition and video dynamics prediction. Code is available at https://uark-aicv.github.io/dssa/.

新论文 · v1arXiv:2611.14325

面向财报电话会议的时间点编码器

Point-in-Time Encoders for Earnings Calls

Alessio Brini

AI 速读 基于摘要

作者构建按年度截止日期训练的财报电话会议文本编码器“vintages”,以消除回测中的前视偏差,并报告其在检索与部分预测任务上的表现。

cs.CL · cs.IR · q-fin.ST

查看原文摘要

Text encoders turn earnings calls into vectors for search, for language models that answer from retrieved passages, and for forecasting models. A live retriever can use an encoder trained once on all available text, as finance retrievers are, but a backtest needs an encoder that read no text written after the date of each vector. To address this look-ahead bias, from 412,248 calls we train vintages under four pretraining recipes, with yearly cutoffs from 2010 to 2024, and each vintage reads only text dated on or before its cutoff. We then fine-tune each vintage on the question-answer pairs of the calls themselves. The vintages we train on calls alone, with 33.8M parameters, retrieve answers on held-out calls better than the general retrievers we tested in every test quarter. Their vectors also raise by about half the rank correlation between next-day returns and forecasts built from past returns and firm size. When each vintage continues the previous one, a later vintage retrieves better on earlier quarters than the vintage available at the time, and a point-in-time language model that answers from the passages the later vintage retrieves inherits the gain. The 2024 vintage of our families also forecasts earnings surprises better, although the interval of this gain includes zero on calls that no vintage read. It forecasts returns no better, so point-in-time vintages matter most for retrieval and little for forecasts of returns.

新论文 · v1arXiv:2611.14323

审计评判者:用于大语言模型推理保障的内部信号

Auditing the Judge: Internal Signals for LLM Reasoning Assurance

Mayank Gulati, Gerhard Wunder

AI 速读 基于摘要

比较评判者的连续判定 token 分数与基于注意力头激活的监督正确性探针,在固定审查预算下评估二者对推理错误的排序能力。

cs.LG

查看原文摘要

Language-model systems use self-judgment to decide which answers to release, review, or recompute. Because intervention is costly, an assurance score must rank errors well at the available budget, not merely over the full ranking. We compare the judge's continuous verdict-token score with a supervised correctness probe trained on attention-head activations from the same prompt. Exact identities link fixed-budget error recall to residual risk and show that AUROC averages recall over all budgets. Across three open 7-12B models on GSM8K and MATH, the probe finds 1.3-22.5 additional percentage points of errors at 5% review in all six model-dataset settings (median 7.4 points). At 10% routing, probe-guided allocation improves accuracy over equal-cost random allocation in both GSM8K experiments, but beats judge-guided routing only for the weaker judge. Cross-dataset transfer lowers probe AUROC for every model in both directions relative to target-domain training. Because dataset, weight precision, and generation budget change together, this measures a joint protocol shift rather than a dataset-only effect. Internal signals can improve supervised, in-domain budget allocation, but are not domain-general confidence estimators.

新论文 · v1arXiv:2611.14322

Kostka 数的界与近似

Bounding and Approximating Kostka Numbers

Jonathan Leake, Zirou Zhang

AI 速读 基于摘要

作者提出一种确定性算法,在变量数与分拆规模上以单指数因子近似 Kostka 数,方法结合 Gurvits 容量界与 Schur 多项式容量的近似算法。

math.CO · cs.DS

查看原文摘要

Kostka numbers, the coefficients of Schur polynomials, count semistandard Young tableaux of prescribed shape and weight. We give a deterministic algorithm for approximating Kostka numbers within a simply exponential factor in the number of variables and the size of the partition. Our approach combines Gurvits capacity bounds for log-concave polynomials with an algorithm for approximating the Gurvits capacity of a Schur polynomial. For a Schur polynomial in $n$ variables indexed by $λ$, we show that the logarithm of the capacity associated with any nonzero coefficient can be approximated to additive error $ε$ in time polynomial in $n$, $|λ|$, and $\log(1/ε)$. The analysis establishes an explicit bounded optimization region and efficient approximate first-order oracles, and handles boundary weights through a factorization into smaller Schur polynomials.

新论文 · v1arXiv:2611.14320

不要只信任你的记忆:证据关联记忆减少LLM智能体中的记忆诱发退化

Don't Just Trust Your Memory: Evidence-Linked Memory Reduces Memory-Induced Degradation in LLM Agents

Yukyeong Lee, Yumin Choi, Jinheon Baek, Sung Ju Hwang

AI 速读 基于摘要

提出证据关联记忆系统WikiTrace,让LLM智能体在使用经验教训前可回溯其原始轨迹进行核查,从而减少记忆诱发的性能退化。

cs.AI · cs.MA

查看原文摘要

External memory enables LLM agents to improve from experience by distilling trajectories of past tasks into concise lessons for new tasks. However, memory can also lead to memory-induced degradation, where an agent fails on tasks it would solve without memory, often because it follows a lesson that is incorrect, or misapplies or misreads a valid one. This is because lessons are inferred from trajectories labeled only with task success or failure, yet are typically provided without the trajectories they came from, leaving the agent no way to check them. To address this, we introduce WikiTrace, an evidence-linked memory system designed to let agents check each lesson against its original trajectory. Specifically, motivated by the finding that a trajectory often still holds the evidence needed to catch an erroneous lesson, WikiTrace stores each lesson as a concise insight linked to a summary of why its trajectory succeeded or failed and to the raw trajectory itself. Then, on a new task, the agent starts from all insights and, whenever one lacks details needed to act, conflicts with another, or comes from a failed task, descends through its links with terminal tools to fill in missing details or correct the insight before acting. We validate WikiTrace on five agentic benchmarks, showing that it consistently outperforms existing memory approaches and a baseline given the same insights alone, while also reducing memory-induced degradation. Our code is available at https://github.com/yukyeongleee/wikitrace

版本更新 · v2arXiv:2605.10852

置换自动机右商接受状态谱的一元到非一元转变

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata

Samuel German

AI 速读 基于摘要

作者报告置换自动机右商运算的接受状态谱在任意字母表下由一元情形的有限区间变为全部正整数,从而解决了 Rauch 与 Holzer 提出的开放问题。

cs.FL

查看原文摘要

This paper determines the accepting-state spectrum of the right-quotient operation for permutation automata, solving an open problem posed by Rauch and Holzer. They showed that in the unary case in which the languages whose right quotient we consider are languages over an alphabet with but one symbol, the accepting state complexities which could ensue for automata recognizing their quotient is exactly all integers between $1$ and $mn$ inclusive when $m,n \ge 1$; we show that for arbitrary alphabets the accepting-state spectrum is $g^{\operatorname{asc}}_{-1,\mathrm{PFA}}(m,n)=\{0\}$ if $m=0$ or $n=0$, and $g^{\operatorname{asc}}_{-1,\mathrm{PFA}}(m,n)=\mathbb{N}_{>0}$ if $m,n\ge 1$. Our result shows that every positive accepting-state complexity ensues for right quotient as long as both of the languages of which we consider the right quotient are nonempty. $0$ becomes the only unavoidable magic value. Moreover, we show that an alphabet with just two letters can witness any arbitrary $α\ge 1$ when $m,n \ge 1$, in that languages can be defined over a binary alphabet with accepting-state complexity $m$ and $n$ respectively for which their right quotient has accepting-state complexity $α$. What ultimately happens in our proof is that we construct $(A^{\mathrm q}_{m,α},B^{\mathrm q}_{n,α})$ such that the words accepted by $B^{\mathrm q}_{n,α}$ induce a point stabilizer in a symmetric group, and the standard quotient construction giving an automaton recognizing the quotient language then saturates the original final set of $A^{\mathrm q}_{m,α}$ to a full orbit; this gives a minimal quotient automaton with exactly $α$ final states. The complete spectrum which is our result follows from this, solving the open question of what the right quotient's accepting-state complexity for permutation automata is.

新论文 · v1arXiv:2611.14317

MammothDP:面向可信硬件与无泄漏超参数的私有提升决策树

MammothDP: Private Boosted Decision Trees Ready for Trusted Hardware and Leakage-free Hyperparameters

Moritz Kirschte, Thorsten Peinemann, Kari Kostiainen, Jan Wichelmann, Thomas Eisenbarth, Esfandiar Mohammadi

AI 速读 基于摘要

作者提出 MammothDP,将 S-BDT 梯度提升决策树与隐私过滤器、时序侧信道加固和 TEE 部署结合,并引入无隐私开销的早停准则与改进的回滚保护。

cs.CR · cs.DB · cs.LG

查看原文摘要

Data spaces like the European Health Data Space (EHDS) require the protection of sensitive data in studies during the data's processing and the study's release alike. In this work, we investigate how to implement this mandate using established trusted execution environments (TEEs) and timing side-channel hardening to protect the processing even under a compromised server, and the state-of-the-art differential privacy (DP) notion to protect the release of studies on tabular data. This combined setup could seem to complete the picture, but in fact raises unexpected security challenges that we mitigate by introducing MammothDP: a significant milestone towards a holistic machine learning system based on the recent gradient boosted decision tree learner S-BDT that is provably DP if used within a privacy filter, timing side-channel hardened, and deployed on a TEE. To achieve a strong privacy-utility tradeoff, we introduce two novel components: an early stopping criterion that adaptively selects the number of trees without any privacy overhead, and an improved rollback protection that is no longer vulnerable under timing side-channel attacks.

版本更新 · v3arXiv:2512.05038

SuperActivator 机制:Transformer 将可靠概念信号集中于尾部

The SuperActivator Mechanism: Transformers Concentrate Reliable Concept Signals in the Tail

Cassandra Goldberg, Chaehyeon Kim, Adam Stein, Eric Wong

AI 速读 基于摘要

作者提出并理论刻画了 SuperActivator 机制,即概念对齐注意力会把最可靠的概念证据集中到少数高激活 token 上,并据此改进概念检测与定位。

cs.LG

查看原文摘要

Concept vectors aim to enhance model interpretability by linking learned internal representations with human-understandable semantics, but their practical utility is often limited by noisy and inconsistent activations. In this work, we discover the SuperActivator Mechanism: a transformer dynamic that amplifies concept activation gaps, concentrating the most reliable concept evidence into a small set of highly activated tokens, which we call SuperActivators. We theoretically characterize this mechanism, proving that concept-aligned attention produces two competing effects: a tail amplification effect, where gaps among already-high activations grow disproportionately fast, and an equalization effect that eventually dominates as attention concentrates on extreme tokens. We validate the predicted tail amplification empirically, finding that in-concept activation distributions develop well-separated upper tails consistently across models, image and text modalities, and concept types. Moreover, we demonstrate the practical implications of SuperActivators for concept detection and localization. First, using only high-activation tokens as concept indicators improves detection by up to 14 F1 points over competing baselines. Second, restricting detection to the extreme activation tail is not merely sufficient but essential: including activations beyond the top 5-10% of the in-concept distribution introduces noise that degrades performance. Finally, using SuperActivators as instance-specific attribution targets yields more accurate and faithful concept localization heatmaps than using global concept vectors.

版本更新 · v2arXiv:2611.11424

无嫉妒分配的查询复杂度:蛋糕、杂务与混合资源

The Query Complexity of Envy-Free Division: Cake, Chores, and Mixed Resources

Alireza Farhadi, Mohammadtaghi Hajiaghayi

AI 速读 基于摘要

研究蛋糕、杂务及正负混合资源在无嫉妒分配下的查询复杂度,给出上界协议与下界不可能性结果。

cs.GT

查看原文摘要

We study the query complexity of envy-free division for cake, chores, and resources with both positive and negative values. For arbitrary nonnegative nonatomic chore costs, we give a deterministic exact protocol using $2^{n\log_2 n+O(n)}$ queries and cuts. For both cake and chores, a Las Vegas protocol uses $O(n^{12}\log(2n))$ expected queries and $O(n^{11}\log(2n))$ expected cuts. Conversely, every exact protocol with fixed positive success probability requires $Ω(n^2)$ expected queries in general, even with arbitrarily many output cuts at no query cost. For mixed cake and chores, no uniform finite expected-query bound exists even when every Cut returns the leftmost root or every Cut returns the rightmost root. This holds for any fixed positive multiplicative approximation factor and success probability, already when all net totals are one. An additive impossibility holds on the same normalized domain.

新论文 · v1arXiv:2611.14312

PSL-RGHA:面向梯度发散缓解的参考梯度半空间对齐并行拆分学习

PSL-RGHA: Parallel Split Learning with Reference Gradient Half-Space Alignment for Mitigating Gradient Divergence

Han Li, Zheng Lin, Miao Yang, Zehang Lin, Jing Yang, Zihan Fang, Qiyang Zhang, Zhaolu Kang 等 12 位作者

AI 速读 基于摘要

提出并行拆分学习框架 PSL-RGHA,通过参考梯度渐进构造与梯度半空间对齐来缓解异构数据下的训练发散。

cs.LG · cs.NI

查看原文摘要

The escalating complexity of deep neural networks hinders the deployment of federated learning (FL) on resource-constrained devices, especially for multimedia applications such as on-device image classification and speech recognition. Parallel split learning (PSL) has emerged as a promising solution by offloading a substantial portion of the computational workload to the server through layer-wise model partitioning, making it particularly suitable for resource-limited visual and speech intelligence scenarios. However, the absence of client-side aggregation renders PSL sus ceptible to severe training divergence and potential convergence failure under heterogeneous data distributions. To address this challenge, we propose PSL-RGHA, a gradient-aligned PSL framework that employs reference gradient half-space alignment mechanism to mitigate training divergence among client devices. PSL-RGHA comprises two novel components: reference gradient progressive construction (RGPC) and gradient half-space alignment (GHA). Specifically, RGPC evaluates the directional consistency of client gradients and progressively synthesizes a robust reference gradient via Weiszfeld updates, effectively approximating the global descent direction. Then, GHA constrains client gradients within the reference half-space defined by RGPC to mitigate gradient conflicts and rectify local updates. Extensive experiments demonstrate that our PSL-RGHA framework outperforms existing baselines in various settings.

新论文 · v1arXiv:2611.14311

保留已获得正确答案的多模态拒答机制

Multimodal Abstention That Preserves Acquired Correct Answers

Jinyuan Zhang

AI 速读 基于摘要

提出 ReFrain 方法,在任务适配的多模态模型上加入拒答能力,同时尽量不丢失适配阶段已获得的正确答案。

cs.AI · cs.CV · cs.LG

查看原文摘要

Adding abstention to a task-adapted multimodal model can discard correct answers, including capabilities acquired during adaptation. We formulate abstention repair as maximizing correct abstention on unanswerable questions under a budget on newly lost correct answers. We propose ReFrain (Regression-Free Abstention), which combines a linear probe on first-token logits, threshold calibration on held-out image clusters, and a deterministic veto that replaces rejected outputs with the displayed "none of the above" option while preserving all other responses. "Regression-free" denotes zero loss on the calibration set at the zero-budget target. All abstention methods in our main comparison start from the same answering-SFT checkpoint; we separately track lost correct answers, repaired errors, and retained SFT gains. On Qwen2.5-VL-3B, ReFrain at zero budget retains all 57 SFT-gained answers with no losses and improves correct abstention by 7.30 percentage points. At a 0.5% calibration budget, it reaches 74.05% correct abstention with 8 losses and retains 55 gains; CLIP-UP EmbLoRA reaches 64.65% with 62 losses, 41 repairs, and 40 retained gains. The same probe at its default threshold loses 298 correct answers. With models and thresholds frozen, confirmation on 228 independent question clusters yields 66.05% correct abstention and no losses at the 0.5% point, exceeding EmbLoRA by 32.72 percentage points. Ordinary refusal SFT achieves higher correct abstention at greater regression cost. Code and reproduction materials: https://github.com/ModeLiberaL/ReFrain.

新论文 · v1arXiv:2611.14309

MMDM:衡量大规模多任务决策能力

MMDM: Measuring Massive Multitask Decision Making

Junhao Shen, Qing Zong, Yue Guo, Zhanqiu Zhang, Yiwen Guo, Hong Cheng

AI 速读 基于摘要

作者提出包含5,448道题、16类任务的大规模多任务决策基准MMDM,用于评测System-1决策模型在长上下文、大选项空间和复杂逻辑依赖下的表现。

cs.LG · cs.CL

查看原文摘要

System-1 Decision Models directly make structured probabilistic decisions over query-specified options given a state in a single forward pass, without autoregressively generating reasoning trajectories or textual responses. Recent evaluations cover diverse tasks but often rely on existing benchmarks, where prior exposure to test material can obscure generalization. Moreover, real-world decision making often involves long contexts, large option spaces, and complex logical dependencies, challenges that existing benchmarks do not adequately capture together. Thus, we introduce MMDM (Massive Multitask Decision Making), a benchmark of 5,448 high-quality questions across 16 task categories, combining newly constructed tasks with source-grounded recompositions and rewrites for single-select, multi-select, and soft-label decision making in fresh contexts. It covers realistic scenarios such as agent state tracking, tool and skill selection, preference judgments, and rubric scoring, with option spaces ranging from 2 to 1,024 and inputs extending to 64,817 tokens. With MMDM, we conduct a comprehensive quantitative evaluation of 28 decision models, showing that many perform well on common knowledge yet struggle with interdependent options, constrained decisions, and multi-select tasks. For example, Perplexity Decider-V1.2 reaches 78.75% Hard Single-select Accuracy on world knowledge, but only 53.95% on option logic and 47.95% on constraint planning, while the best Hard Multi-select Accuracy across all models is 36.81%. These results highlight joint reasoning, constraint-aware selection, and complete multi-select recovery as key priorities for decision model development, with MMDM providing a testbed for measuring this progress.

版本更新 · v2arXiv:2611.05347

谁的护栏?用户身份塑造模型免责声明在缓解大语言模型政治说服中的有效性

Whose Guardrail? User Identity Shapes the Effectiveness of Model Disclaimers in Mitigating LLM Political Persuasion

Jillian Fisher, Daniel W. Fisher, Jennifer Pan, Yulia Tsvetkov, Katharina Reinecke

AI 速读 基于摘要

一项预注册实验(N=1,586)考察免责声明的设计与用户特征如何影响用户对政治偏见大语言模型说服的易感性。

cs.HC

查看原文摘要

Politically biased AI can shift users' opinions, yet it remains unclear whether model disclaimers protect against such persuasion. We report a preregistered experiment (N=1,586) examining how disclaimer design and user characteristics shape susceptibility to politically biased AI. We varied whether disclaimers identified political bias versus potential inaccuracies and whether they included an explanation. Participants completed two decision-making tasks with an LLM biased against their political views, with outcomes assessed immediately and one week later. Disclaimers identifying political bias and including an explanation reduced persuasion, but effects varied across contexts and did not persist. Individual differences were more consistent predictors: Republicans were more persuaded and reported higher trust than Democrats across tasks. Similarly, participants who used AI more frequently were also more persuaded, whereas those with greater self-reported AI knowledge were less persuaded. These findings suggest that generic disclaimers are not enough: effective safeguards must account for user heterogeneity and context.

新论文 · v1arXiv:2611.14307

TaoMate-R1:面向流式多参考视频生成的时间角色专门化

TaoMate-R1: Temporal Role Specialization for Streaming Multi-Reference Video Generation

Qijun Gan, Chenwei Zhang, Xinyang Li, Meiguang Jin, Junfeng Ma

AI 速读 基于摘要

作者提出按“场景建立”与“场景延续”两种时间角色分配低秩适配器的流式多参考视频生成器,并在自建多参考案例上报告了边界一致性与时序相似度方面的改进。

cs.CV

查看原文摘要

Streaming multi-reference video generation establishes a scene from specified people and objects, then continues it under changing instructions. We introduce TaoMate-R1, a streaming multi-reference generator that organizes adaptation parameters through temporal role specialization. It assigns separate low-rank adapters to scene establishment and continuation on a frozen backbone. Each adapter performs both denoising and context writing for its role; Self Gradient Forcing jointly trains the roles through the history they construct. This allocation contrasts with operation-based specialization, which separates denoising from context writing across all chunks. A fixed-replay gradient analysis characterizes the update directions admitted by the two sharing schemes. On 32 multi-reference cases, we compare the schemes at the same two-adapter budget. Across ten approximately two-minute streams with changing instructions and shared teacher-audio conditioning, TaoMate-R1 reduces the mean boundary luminance jump from 1.96 to 0.613, with higher boundary feature similarity. It also achieves higher mean CLIP and DINO temporal similarity across short interactions, long streams, and public reference compositions. These results support grouping adaptation parameters by scene establishment and continuation for streaming multi-reference generation. Our code and model are released at https://github.com/TaoLiveAIGC/TaoMate-H3.

版本更新 · v2arXiv:2610.37914

Muon 使首个混合专家层更难平衡

Muon Makes the First Mixture-of-Experts Layer Harder to Balance

Marcos Hernanz

AI 速读 基于摘要

作者报告在 55M 与 108M 激活参数模型中,Muon 相比 AdamW 显著放大首个 MoE 层路由偏置跨度,导致该层负载更难平衡。

cs.LG · cs.CL

查看原文摘要

Many open mixture-of-experts (MoE) language models train with Muon instead of AdamW. Most balance the load with a bias on each expert's routing score, adjusted after every step. Their recipes disagree on whether Muon should also train the router. In models with 55M and 108M active parameters, we measure how the optimizer changes the span of these biases, the largest minus the smallest in a layer. The span grows when all tokens favor the same experts, so it shows how hard a layer is to balance. At learning rates tuned on shorter runs, Muon raised the span of the first MoE layer at every seed, roughly doubling it on average, while the other layers changed much less. The rise came from Muon on the rest of the network, whichever optimizer trained the router. In those runs, the inputs to the first router shared a direction, and soon after the warmup its busiest expert averaged four to seven times its fair share. Over the first 3,000 steps, subtracting the batch mean from these inputs removed this overload while barely changing the loss. On the smaller model, halving Muon's learning rate removed most of the rise and slightly improved the loss. Moving only the router to AdamW made the loads shift more during the warmup and slightly raised the loss, so at this scale the results favor keeping the router on Muon.

版本更新 · v3arXiv:2605.26368

基于多视图基础模型的统一全景几何估计

Unified Panoramic Geometry Estimation via Multi-View Foundation Models

Vukasin Bozic, Isidora Slavkovic, Dominik Narnhofer, Nando Metzger, Denis Rozumny, Konrad Schindler, Nikolai Kalischek

AI 速读 基于摘要

PaGeR 将面向透视图像的 3D 重建基础模型扩展到全景域,用单次前向同时预测尺度不变深度、度量深度、表面法线与天空掩码。

cs.CV · cs.AI

查看原文摘要

Geometry estimation from perspective images has greatly advanced, maturing to the point where off-the-shelf foundation models are able to reconstruct 3D scene structure not only from multi-view imagery, but even from a single view. A natural extension is 3D reconstruction from panoramas, with the exciting prospect of recovering a full 360-degree scene from a single panoramic image. In this work, we introduce PaGeR (Panoramic Geometry Reconstruction), a framework to lift powerful 3D foundation models designed for perspective imagery to the panorama domain. Our strategy is to start from a pre-trained transformer for 3D reconstruction and turn it into a unified high-performance model that predicts scale-invariant depth, metric depth, surface normals, and sky masks from both perspective and omnidirectional images, in a single forward pass. By keeping architectural changes to a minimum and mixing perspective and panoramic images during training, PaGeR retains the rich 3D prior of the underlying foundation model while learning to also estimate geometrically consistent 360-degree scenes from single panoramas. We extensively test our method in both indoor and outdoor environments and find that it delivers state-of-the-art performance and excellent zero-shot performance across a wide range of scenes. Code, data and models are available $\href{https://github.com/prs-eth/PaGeR}{\text{here}}$.

版本更新 · v2arXiv:2609.01394

无智能体间通信的分布式集群控制自主机器人架桥

Autonomous robotic bridging using distributed swarm control without inter-agent communication

Vishwaak C. Thamaraiselvan, Cody L. Lundberg, Michail Theofandis, Suhas Chelian, Nicholas R. Gans

AI 速读 基于摘要

提出SCARAB系统,用分布式集群控制与多模态感知让无人水面艇在无GPS、无射频通信下自主定位、编队并前往目标点,以物理引擎仿真演示架桥概念。

cs.RO

查看原文摘要

We describe SCARAB--Swarm-Capable Autonomous Robotic Aquatic Bridging. Using distributed swarm control and multi-model sensing of agents and docking targets, agents can localize themselves, join into formations and proceed to desired target locations. Our technologies would eventually allow the Army to perform unpredictable, dispersed river crossings, enhance crew survivability, and minimize the logistics footprint compared to the current Improved Ribbon Bridge. Our methods operate without GPS or RF communications, though these can be used in non-contested environments (e.g., civilian disaster relief for flooding, etc.). We demonstrate our system via physics-engine-based simulation of several agents using unmanned surface vehicles (USVs) in the presence of currents and wind.

新论文 · v1arXiv:2611.14289

基于完全概率设计的对抗性风险分析

Adversarial risk analysis with fully probabilistic designs

Mario Chacón-Falcón, Tatiana Valentine Guy, Miroslav Kárný, David Rios Insua

AI 速读 基于摘要

作者探索将完全概率设计(FPD)与对抗性风险分析(ARA)结合,以简化对智能对手决策的建模与预测,并用于安全博弈。

cs.GT

查看原文摘要

Adversarial risk analysis (ARA) informs decision-makers when facing intelligent opponents and uncertain outcomes, enabling an analyst to model beliefs about the opponents' preferences, capabilities, beliefs, and the strategic calculations that opponents employ. Major applications cover reliability and risk analysis of critical infrastructures in presence of adversarial threats. In such domains, ARA mitigates typical common knowledge assumptions of standard game-theoretic approaches. However, ARA entails complex modelling and computations. To alleviate these, we explore its combination with fully probabilistic design (FPD), a control theory methodology supporting an agent in choosing the decision distribution that achieves the outcomes with a distribution closest to its ideal. We use FPD to model and forecast the opponent's decisions within an ARA setting and present how to handle security games within this ARA-FPD framework, covering both single and multiple stage problems.

新论文 · v1arXiv:2611.14601

VASTRA: Efficient Agentic Top-K Interactive Video Analysis

Tushar Tyagi, Aditya Raghavan, Haoran Qiu, Francisco Romero

原文摘要

Vision-language models (VLMs) enable natural language video retrieval, bypassing traditional hand-engineered pipelines. Integrating agentic reasoning frameworks (e.g., ReAct) further advances this paradigm by allowing models to dynamically inspect video content rather than relying on a single visual pass. Applying this pattern naively to video retrieval inherits problems that video systems cannot afford: results vary from run to run under identical conditions, and cost and latency scale with every reasoning step the agent takes rather than with the work the query actually requires. We present VASTRA, an agentic video retrieval system whose execution is dictated by query complexity rather than an open-ended reasoning loop: cheap, reliably answerable queries are ranked directly from pre-ingested summaries, while harder queries trigger targeted verification only where relevance is genuinely uncertain. This keeps control flow external to the model rather than latent in a growing chain of thought, establishing deterministic control flow by construction and end-to-end rank reproducibility under greedy serving. Across 40 benchmark queries, VASTRA exposes explicit presets: VASTRA-Fast runs 12.2x faster (4.2 s vs. 51.2 s) and 10.4x cheaper ($0.0044 vs. $0.0458) than best performing ReAct agent at a 5.0-point mAP reduction, while VASTRA-Max matches peak ReAct agent accuracy (0.653 vs. 0.649 mAP) at comparable latency, trading higher spend ($0.1022 vs. $0.0458) for zero run-to-run variance.

cs.DB

新论文 · v1arXiv:2611.14288

AI能否成为“无国界研究者”?审计AI辅助中美社会科学研究中的偏见

Can AI be a 'Researcher Without Borders'? Auditing Bias in AI-Assisted Social Science Research about China and the US

Yuan Zhang, Thales Bertaglia, Ralph Schroeder

AI 速读 基于摘要

通过让不同国家开发的模型撰写中美相关社会科学短文并人工标注,作者报告模型整体无明显政治偏见但引用来源存在差异,部分比较性问题仍偏向某一国家。

cs.CY

查看原文摘要

Although large language models have demonstrated strong performance on algorithmic and mathematical tasks, their suitability as social science research assistants remains unclear, particularly because many social science questions lack agreed-upon, quantifiable benchmark answers. Evaluating this suitability is important since researchers and students increasingly rely on AI to generate research ideas. When questions concern the countries in which models were developed, bias may be exacerbated: Do AI models favour the countries where they were developed or the social theories associated with those countries' scholarly traditions? Such biases could distort research findings, undermine scientific credibility, and distort findings when they are disseminated to the public. To investigate whether models exhibit country-focused bias in social science research, we designed a benchmarking task requiring AI to write short essays on social science questions in relation to the US and China as well as some broader social science questions. We varied three conditions: question type (cross-country comparisons, country-specific questions, and general questions); model (two US-developed, two China-developed, and one Europe-developed model); and prompting modality (a base essay-writing request, a researcher identity, a US researcher identity, and a Chinese researcher identity). Responses were manually annotated for bias and source use by two researchers with experience in social science in relation to China and the US. Our analyses show that, on the whole, US and Chinese models and the European one are not politically biased but differ in the sources they cite. Still, some comparative questions favour one country over another, and this tendency is more pronounced for certain questions. These findings suggest that researchers and students should exercise caution when using AI for social science research.

新论文 · v1arXiv:2611.14286

ForeseeDrive:面向预期式生成驾驶的未来 token 条件化

ForeseeDrive: Future-Token Conditioning for Anticipatory Generative Driving

Shaokai Wu, Xunchu Zhou, Pinzhi Wang, Bo Dong, Yuting Hu, Yanbiao Ji, Qiuchang Li, Xiao Cui 等 11 位作者

AI 速读 基于摘要

ForeseeDrive 将未来场景演化编码为查询索引 token,在候选轨迹生成之前用其条件化轨迹几何,从而让生成式驾驶规划器具备预期能力。

cs.RO · cs.CV

查看原文摘要

Generative driving planners can represent diverse ego futures, but a downstream scorer can choose only among sampled candidates; it cannot recover an absent maneuver. We present ForeseeDrive, which turns future scene evolution into a deployable interface for shaping candidate generation. Rather than reconstructing dense future states or scoring a fixed menu, ForeseeDrive derives query-indexed tokens from logged actor motion, occupancy evolution, route interactions, and TTC margins, and predicts the same token space from present context at deployment. The tokens condition trajectory geometry before candidates materialize. A zero-token-gated residual path and candidate-preservation loss limit unnecessary drift, while a TTC-margin guard targets brittle safe-to-unsafe boundary crossings. Under their respective benchmark protocols, ForeseeDrive reaches 89.2 PDMS on NAVSIM navtest, 0.41\,m average L2 and 0.05\% collision rate on nuScenes validation, and a 76.50 driving score on Bench2Drive. Controlled DiffusionDrive/NAVSIM diagnostics show an exact zero-token no-op, a small aligned-over-shuffled selected-PDM advantage under preservation, mixed oracle-best quality, and localized TTC-boundary failures. Together, the benchmark results and bounded mechanism tests support future-conditioned generation as a practical interface for anticipation. Code is included in the supplementary materials.

新论文 · v1arXiv:2611.14285

LM-SimBench:面向大语言模型训练仿真的统一框架、数据集与基准

LM-SimBench: A Unified Framework, Dataset, and Benchmark for Large Language Model Training Simulation

Yu Dong, Hong Li, Qiang Sun, Xu Zhou, Jinbiao Huo, Qixiu Cheng, Zhiyuan Liu

AI 速读 基于摘要

提出统一框架、性能剖析数据集与基准 LM-SimBench,用于在可控条件下比较和评估大语言模型训练仿真器。

cs.AI

查看原文摘要

Evaluating candidate parallelization strategies through distributed training runs makes strategy selection prohibitively expensive at scale. Performance simulation offers a lower cost alternative, yet controlled comparisons among existing simulators remain difficult because they differ in the training stages they model and the workloads on which they are evaluated. We introduce LM-SimBench, a unified framework, profiling dataset, and benchmark for evaluating LLM training simulators. The framework decomposes simulation into functional stages from model compilation to schedule level aggregation, connecting execution representations and cost estimators to measurable evaluation targets. Following this framework, we profile 23 model settings from 10 dense and Mixture-of-Experts (MoE) LLM families on an Ascend Neural Processing Unit (NPU) cluster. The resulting dataset contains 348 feasible configurations that jointly vary five parallelism dimensions and activation recomputation, with six views spanning configuration, rank, operator, event, and kernel granularity. Evaluations of representative training simulators demonstrate how LM-SimBench supports comparisons of prediction accuracy, assessment of configuration selection, and diagnosis of prediction errors. Matched GPU-NPU experiments validate the cross-platform applicability of the collection and evaluation protocol and demonstrate NPU-guided GPU configuration selection.

新论文 · v1arXiv:2611.14282

从最坏情况到平滑复杂度:连续优化中的平滑分析框架

From Worst-Case to Smoothed Complexity in Continuous Optimization

Daniel Cortild, Coralia Cartis

AI 速读 基于摘要

作者提出一个平滑分析框架,研究经典连续优化算法在任意函数随机扰动下的表现,并给出若干标准方法的平滑复杂度保证。

math.OC · cs.CC

查看原文摘要

Worst-case complexity bounds often fail to reflect the practical performance of optimization algorithms, while average-case complexity heavily relies on the distribution of the input. In this work, we develop a smoothed-analysis framework for classical continuous optimization algorithms by studying their behaviour on random perturbations of arbitrary functions. Our main contribution is to apply methods suited for non-degenerate functions to perturbations of degenerate functions, thereby recovering the faster best-known rates for the non-degenerate class. We derive smoothed complexity guarantees for several standard methods, including (Accelerated) Gradient Descent, Conjugate Gradient, and Newton-type methods, under various settings including nonconvex ones, and show that these bounds can substantially improve upon their worst-case guarantees, bringing them closer to the practical behaviour of the respective methods.