跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

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

多维市场中的次优交易具有一半效率

Second-Best Trade Is Half Efficient in Multidimensional Markets

Dirk Bergemann, Yang Cai, Kangning Wang, Jinzhao Wu, Renzhe Xu

AI 速读 基于摘要

作者证明在多维双边市场中,总能通过满足贝叶斯激励相容、临时个体理性和强预算平衡的机制,实现至少一半的最优交易收益。

cs.GT

查看原文摘要

We prove that at least half of the first-best gains from trade can always be achieved in multidimensional two-sided markets with additive values and costs and arbitrary downward-closed feasibility constraints. The guarantee is achieved by a mechanism satisfying Bayesian incentive compatibility, interim individual rationality, and strong budget balance, and is tight already in single-item bilateral trade. Types are independent across agents, while the coordinates of each agent's type may be arbitrarily correlated. Feasibility constraints may couple trades across items and agents. This extends the known tight one-half guarantee for single-item bilateral trade. Our proof develops a new application of the Cai--Devanur--Weinberg duality framework. We show that the objective of every feasible dual is at least half of the first best. Strong duality then yields the guarantee without characterizing an optimal mechanism or dual. The key observation is that every feasible dual induces continuous-time Markov chains that, when stopped by exponential clocks, recover true types as expectations of virtual types. The dual constraints control the rate at which these chains change the prior distributions. We establish our bound by combining this control with a coupling of the agents' clocks.

新论文 · v1arXiv:2611.14488

你的机器人记忆只是一个时钟吗?记忆增强VLA策略中的时间捷径

Is Your Robot's Memory Just a Clock? Temporal Shortcuts in Memory-Augmented VLA Policies

Chubin Zhang, Bo An

AI 速读 基于摘要

作者报告记忆增强VLA策略依赖时间戳而非事件来填充记忆,导致机器人把空事件误判为任务进展并提前停止。

cs.RO

查看原文摘要

Memory-augmented vision-language-action (VLA) policies are meant to remember what happened. Many of them, however, fill memory by time: they sample frames uniformly across the episode and stamp each frame with its time step. Because time passes even when nothing happens, such a memory may not tell waiting from working. We show that it does not. On the counting tasks of RoboMME, we make the robot briefly pause or fidget its wrist. Such a null event changes nothing the task depends on, yet a released memory VLA counts the interval as work done and stops early. We call this failure phantom progress. It cuts success from 47 to 16 of 50 on one task and from 44 to 10 on the other. When the same frames are withheld from memory, success returns, so the cause lies in memory rather than in the interruption itself. We trace the failure to a temporal shortcut: because demonstrations proceed at a steady pace, elapsed time predicts progress. Indeed, rescaling the time stamps alone makes the policy stop early when the clock runs fast and repeat when it runs slow. Surprisingly, removing the time encoding does not cure the failure, because the frames of a null event still occupy slots of the time-sampled memory. Across RoboMME's released designs, vulnerability follows how memory is indexed. Of the fixes the diagnosis suggests, training with injected pauses does not remove the failure and impairs counting, whereas indexing memory by events recovers half or more of the loss without retraining. A memory meant to remember what happened should count events rather than clock ticks.

版本更新 · v2arXiv:2606.20467

智能体符号搜索:超越手工表达式、网格与神经网络的偏微分方程近似求解

Agentic Symbolic Search: Approximating Solutions of PDEs Beyond Hand-crafted Expressions, Meshes, and Neural Networks

Zongmin Yu, Jun Zhai, Liu Yang

AI 速读 基于摘要

提出 Agentic Symbolic Search(ASYS),让编码智能体结合进化搜索与梯度拟合,从已知 PDE 和数学知识出发构造并改进显式符号近似。

cs.LG · math.NA · physics.comp-ph

查看原文摘要

Numerical methods and neural networks have transformed our understanding of nonlinear partial differential equations (PDEs), yet discovering mathematical representations that explain their dynamics remains largely an expert task. We introduce Agentic Symbolic Search (ASYS), in which coding agents construct and refine explicit approximations from a known PDE and supplied mathematical knowledge. ASYS couples evolutionary search over differentiable symbolic programs with gradient-based fitting, using the governing equation to evaluate candidates and guide their revision. For a singular generalized Constantin-Lax-Majda profile, ASYS infers a missing decay term that sets how fast the field approaches its singular-time limit, and builds a basis that fits the profile to a median error of $3.90\times10^{-5}\%$. For Fujita blow-up, separating diffusion from reaction and deriving a local response lowers the supplied formula's error from 55.5% to 0.0879%. For Allen-Cahn interfaces, a 14-parameter construction yields a mode-coupling law confirmed by independent simulations. These studies show how agentic search develops mathematical starting points into accurate, analyzable approximations.

版本更新 · v2arXiv:2611.10529

超越平均差距:转移角度QAOA在超导处理器上保留了什么

Beyond the Mean Gap: What Transferred-Angle QAOA Retains on a Superconducting Processor

Sanim Yousuf Fahim, Mohammad Arif Hossain

AI 速读 基于摘要

作者在IBM Heron超导处理器上测试转移角度QAOA,发现平均代价差距的保持率会高估最优解概率的保持率,建议优化电路验证应报告最优解及近优解集合的保持情况。

quant-ph · cs.AI

查看原文摘要

Hardware executions of the quantum approximate optimization algorithm (QAOA) are often validated by comparing the device's mean cost with a simulation, a check that can miss what matters for optimization. Under global depolarization, the mean normalized gap and the floor-corrected probability of every set of bitstrings, the optimum included, retain the same fraction of their noiseless improvement over uniform sampling. We test this prediction with depth-2, transferred-angle QAOA circuits for binary subproblems of an alternating-direction decomposition on the IBM Heron processor \texttt{ibm\_marrakesh}, with and without dynamical decoupling and twirling. At 12 qubits, the main-family circuits retained 29\% to 46\% of their mean-gap improvement but only 5\% to 15\% of their probability of the optimum, lower on at least nine of ten instances per run. Near-optimal bitstrings were lost about as much as the optimum, whereas the avoidance of poor bitstrings was retained best. In the first submission, a device-matched noise model reproduced the pattern but overestimated the retention of the optimum five- to eightfold. On a rugged planted family, the device found the optimum in 62\% of 768-shot blocks (noiseless: 98\%), within the range of local heuristics. Validations of optimization circuits should report retention of the optimum and of near-optimal sets.

版本更新 · v2arXiv:2606.03148

A²:更小的自监督ViT定位效果更好

$A^2$: Smaller Self-Supervised ViTs Localize Better than Larger Ones

Sreehari Rammohan, Huy Ha, Carl Vondrick

AI 速读 基于摘要

作者发现较小的自监督ViT的注意力图在定位前景物体上优于较大的ViT,并提出A²方法,将“看哪里”与“提取什么”解耦,以兼顾定位与表征。

cs.CV

查看原文摘要

Robust visual classification often depends on localizing the main foreground objects in an image while ignoring contextual distractors. Surprisingly, we find that the last layer attention maps of smaller self-supervised ViTs localize foreground objects better than those of larger ViTs. However, we still need large ViTs, because they extract richer representations from each patch. To get the best of both worlds, good localization and rich representations, we propose $A^2$, a simple method that leverages this inverse scaling finding by decoupling where to look (a small attention model) from what to extract (a large embedding model): we crop around the attention peaks of a small model and embed the crops with a larger model. $A^2$ uses entirely pretrained features, requires no group labels, and does not require per-dataset attention or backbone training. Across 5 benchmarks, $A^2$ is competitive with backbone-matched loss-level methods like DFR, and outperforms end-to-end attention training under stronger distribution shifts.

新论文 · v1arXiv:2611.14476

BoviShift:跨越个体与时间的六年视觉牛表型多属性审计

BoviShift: A Six-Year Multi-Attribute Audit of Visual Cattle Phenotyping Across Animals and Time

Mobasshir Bhuiya Shagor, Nilambar Halder Tonmoy, Md Saef Ullah Miah

AI 速读 基于摘要

作者构建了覆盖2021–2026六个连续年度队列的牛视觉数据集BoviShift,并用固定ResNet-50多任务基线系统比较不同数据划分策略与未来队列迁移表现。

cs.CV

查看原文摘要

Computer vision offers a scalable, non-contact means of estimating livestock traits, but correlated images and video frames make reliable evaluation difficult. Image-random splitting can place views of the same animal in both training and test sets, while deployment further requires transfer to animals captured in future years. We introduce BoviShift, a corpus reconstructed from six consecutive annual cohorts of an operational cattle marketplace collected from 2021 to 2026. It contains 2{,}657 cattle, 10{,}610 still images, and 2{,}566 walk-around videos across nine recorded breed categories. We evaluate three splitting strategies through four configurations: image-random and pooled cattle-disjoint splits over the same development cohorts, followed by separate future-2025 and locked future-2026 evaluations. Using a fixed ResNet-50 multi-task baseline, we assess weight, age, height, breed, and coat color. Differences between image-random and cattle-disjoint splitting are task-dependent rather than a universal leakage penalty. Future-cohort behavior is also attribute- and cohort-specific: breed declines relative to pooled evaluation; mean weight and age performance fails to beat constant baselines in 2025; height remains above baseline; and color transfers well to 2025 but degrades in 2026. Multi-task training improves all five point estimates in a single-seed ablation, still-view aggregation helps selectively, and zero-shot video-frame aggregation exposes a still-to-video domain gap. To our knowledge, BoviShift is the longest-spanning cattle-vision resource combining consecutive annual cohorts with physical and visual attributes.

版本更新 · v3arXiv:2610.38851

仅从参考样本中学习推理:面向现代 LLM 后训练的强化对抗学习

Learning to Reason from Reference Samples Alone: Reinforced Adversarial Learning for Modern LLM Post-Training

Albert Bou, Javier Valdes-Aleman, Jon M. Laurent, Samuel G. Rodriques, Andrew D. White, Michaela Hinks, Siddharth Narayanan

AI 速读 基于摘要

提出 Reinforced Adversarial Learning(RAL),用共同训练的 LLM 评判器把参考答案转化为唯一奖励,用于推理 LLM 的在线策略后训练。

cs.AI · cs.LG

查看原文摘要

In many settings where LLM post-training is desirable, high-quality answers are recognizable but difficult to score with explicit rewards. Reinforcement learning with verifiable rewards (RLVR) is limited to tasks where an explicit correctness signal is available. Prior adversarial approaches to training reasoning LLMs either complement verifiable rewards with co-trained critics or require reference reasoning traces. We ask whether a co-trained LLM judge can turn reference answers alone into the sole reward for on-policy post-training of reasoning LLMs. We call this method Reinforced Adversarial Learning (RAL). We first validate RAL on three verifiable tasks (integer multiplication, code-based arithmetic-expression synthesis, and SMILES-to-formula translation), using the verifiers only for evaluation. With sufficiently capable judges and enough training, RAL matches direct RLVR. We then apply RAL to scientific abstract generation in two settings. In the first setting, RAL guides the generator to produce abstracts in the scientific domain of the reference abstracts, even though the prompt leaves that domain unspecified. In the second setting, we generate abstracts for U.S. National Institutes of Health grant proposals conditioned on the grant title. Human scientists and an ensemble of LLM judges find our generations harder to distinguish from real abstracts than those of frontier-LLM baselines. These results suggest a path toward post-training reasoning models in scientific and other high-value domains, where increasingly capable judges infer hard-to-specify reward functions from example answers.

版本更新 · v2arXiv:2512.14932

Kronecker 乘积 MMSE 滤波器的自动正则化

Automatic regularization for Kronecker product MMSE filters

Daniel Gomes de Pinho Zanco, Leszek Szczecinski, Jacob Benesty, Eduardo Vinicius Kuhn

AI 速读 基于摘要

作者提出用近似留一交叉验证(ALO)指标自动确定基于 Kronecker 乘积表示的低秩 MMSE 滤波器的正则化参数。

cs.LG

查看原文摘要

In this work, we propose a method to automatically find the regularization parameter for low-rank MMSE filters based on a Kronecker-product representation, using an approximate leave-one-out (ALO) cross-validation metric. We formulate the problem in a constrained form that covers both error minimization and interference suppression, and explore the link between regularization and rank selection. The proposed method is validated on system identification and antenna beamforming problems, showing significant gains over commonly used methods.

新论文 · v1arXiv:2611.14470

TanCRAFT:面向装配任务的上下文推理式预期反馈

TanCRAFT: Context-Reasoned Anticipatory Feedback for Assembly Tasks

Sassan Mokhtar, Lars Doorenbos, Marius Bock, Sina Mokhtar, Katharina Beckh, Dominik Bach, Juergen Gall

AI 速读 基于摘要

TanCRAFT 是一个四阶段实时预测式辅助系统,通过跟踪场景、推理当前部分装配、预测被操作部件的近期运动,在预测放置与目标不兼容时提前干预,并在七巧板装配任务中验证其效果。

cs.RO · cs.CV

查看原文摘要

Preventing human error in physical assembly tasks requires assistance systems that can intervene before mistakes are made. This is especially challenging in settings where users are free to choose the construction order and correctness depends on the evolving assembly rather than a fixed next step. We present TanCRAFT, a four-stage real-time predictive assistance system that tracks the scene state, reasons about the current partial assembly, forecasts the near-future motion of manipulated pieces, and intervenes when the predicted placement is incompatible with the target. We instantiate our framework and confirm its effectiveness in a controlled tangram assembly task through offline benchmarks and a within-subject user study. Our findings show that the predictive feedback significantly reduces mistakes relative to unguided and reactive sessions, while yielding the lowest mean perceived workload and shortest mean completion time. Overall, these results demonstrate the value of predictive feedback for error prevention and provide a step toward cost-aware assistance for automation and human-robot workcells.

新论文 · v1arXiv:2611.14469

C²-Routing:面向高效视觉语言推理的互补裁剪与压缩

C$^2$-Routing: Complementary Cropping and Compression for Efficient Vision-Language Inference

Guorui Lu, Qinyu Chen

AI 速读 基于摘要

提出 C²-Routing,根据图像与问题自适应选择裁剪或压缩来减少视觉 token,并用安全门控制精度损失。

cs.CV · cs.LG

查看原文摘要

Visual Question Answering (VQA) imposes substantial computational overhead on vision-language models (VLMs), motivating model-agnostic input reduction methods that can be readily applied across diverse VLMs, including in black-box settings. Simply enforcing a visual-token cap reduces computation, but it can discard information needed to answer the question. A single reduction strategy also struggles to accommodate different scenarios. Our key observation is that cropping and compression are complementary: cropping highlights small targets and local details, whereas whole-image compression better preserves context for large targets or distributed evidence. Based on this observation, we propose C$^2$-Routing, which adaptively selects cropping or compression according to the input image and question. Since both strategies may still discard key information, we further design a safety gate that uses the predicted joint correctness distribution under original and reduced inputs to guide fallback and protect accuracy. To accommodate consumer GPU resource constraints, all training and evaluation experiments run on RTX 3090 GPUs. To measure gains beyond token capping, we use full-image baselines with the same cap of 1,024 visual tokens. We conduct extensive evaluation on three VLMs and 18 datasets spanning local details, global scenes, scene text, and documents. With the visual budget already capped, C$^2$-Routing further reduces end-to-end FLOPs by 36.53% and visual tokens by 42.36% on average, with a mean relative task-score decrease of only 0.77%.

新论文 · v1arXiv:2611.14468

异质SIS反应扩散模型的贝叶斯反问题与流行病阈值不确定性

Bayesian inverse problems and epidemic-threshold uncertainty for a heterogeneous SIS reaction-diffusion model

Duc-Lam Duong

AI 速读 基于摘要

该文研究在异质SIS反应扩散模型中,如何利用早期感染观测对疾病持续阈值进行贝叶斯推断,并给出低流行极限下的后验收敛与阈值概率误差界。

math.AP · cs.LG · math.NT · math.ST · q-bio.PE

查看原文摘要

We study Bayesian inference of persistence from early observations of a heterogeneous susceptible--infected--susceptible (SIS) reaction--diffusion model with standard incidence. We show that the leading prevalence dynamics depend on the unknown coefficients only through the difference between the transmission and recovery rates and the infected diffusivity. The same pair determines the principal eigenvalue whose sign governs persistence, so early prevalence can inform the threshold even when the individual rates remain uncertain. We prove global weak well-posedness and quantitative parameter stability for the SIS system and use the resulting observation-map estimates to establish Bayesian well-posedness. For an initial infection of size $\varepsilon$, we derive a uniform second-order expansion that describes how the separate rates enter prevalence. Incidence depends explicitly on transmission at leading order. When the noise standard deviation is proportional to $\varepsilon$, we prove $O(\varepsilon)$ convergence in Hellinger distance of the nonlinear posteriors to their low-prevalence limits for both prevalence alone and joint prevalence and incidence data. We bound the principal eigenvalue using the growth rate of the infected $L^2$ norm between two times. This rate gives a lower bound for the full nonlinear system, and the upper bound separates spatial transients from nonlinear saturation. Uniform spectral estimates and bounds on infection size and measurement error give sufficient conditions for persistence and extinction. We also bound the error in posterior persistence probabilities under forward and eigenvalue approximation, accounting for posterior mass near the threshold. Numerical examples illustrate threshold inference and the predicted \(O(\varepsilon)\) convergence of the nonlinear posteriors to their low-prevalence limits in Hellinger distance.

新论文 · v1arXiv:2611.14467

后训练中策略优化的理论:覆盖坍塌与参考重置

A Theory of Policy Optimization in Post-Training: Coverage Collapse and Reference Resets

Audrey Huang, Nan Jiang, Sham M. Kakade, Sadhika Malladi, Akshay Krishnamurthy, Dylan J. Foster

AI 速读 基于摘要

该文从理论上分析后训练中策略优化算法的样本与梯度复杂度,提出覆盖保持算法,并揭示REINFORCE类方法的覆盖坍塌问题及参考重置的缓解作用。

cs.LG · stat.ML

查看原文摘要

Policy optimization is central to language model post-training, yet principled guidance remains limited. We revisit its theoretical foundations to identify algorithms that learn near-optimal policies using total samples and gradient steps governed by the base model's response coverage, a measure of how readily it generates optimal responses. We call such algorithms coverage-preserving. This guarantee captures the goal of amplifying capabilities accessible through sampling from the base model. (1) Coverage collapse. REINFORCE, the basis for PPO and GRPO, can drive the probability of optimal responses to near zero, even as reward improves. This coverage collapse stalls optimization, and convergence can require exponentially many steps despite good initial coverage. The failure arises even with exact gradients and persists under KL regularization to the base model. (2) Reference resets. We show that repeatedly resetting the KL reference to the most recent policy mitigates coverage collapse. We formalize this intervention in Approximate Policy Mirror Descent (APMD), a meta-algorithm that approximately solves a sequence of KL-regularized RL subproblems. APMD enables stronger regularization, making each subproblem easier to solve, while reference resets allow convergence to global optimality. (3) Coverage-preserving algorithms. For softmax linear policies over pretrained features, we use APMD to establish the first global convergence guarantees showing that widely used families of post-training algorithms are coverage-preserving. These include stylized PPO and GRPO variants with explicit KL regularization and reference resets, and squared-loss algorithms that implement them implicitly, including those used to train the Kimi models. These results clarify how regularization, clipping, and objective choice affect the sampling and optimization costs of post-training.

版本更新 · v2arXiv:2610.11790

易预测但难计算:边界依赖发现熵修补遗漏的计算输出

Easy to anticipate, hard to compute: boundary dependence finds the computed outputs that entropy patching misses

Nicolás Vera Zúñiga

AI 速读 基于摘要

在紧patch预算下,BLT的熵规则会漏掉那些类型可预测但值需计算的字节位置,而边界依赖信号能无标签地找到这些位置并提升计算结果的准确率。

cs.CL

查看原文摘要

Byte-level language models such as the Byte Latent Transformer (BLT) group bytes into patches and run their large global model once per patch. BLT starts a patch where a small model's next-byte entropy is high. We show that under tight patch budgets this rule has a blind spot: positions whose type the preceding text fixes but whose value must be computed, such as the number after "= " in a worked math solution. A nearly certain digit keeps the next byte's entropy near or below log2(10) = 3.32 bits, about BLT-1B's threshold for a 10% budget. In Meta's BLT-1B with patch starts on 10% of bytes, the entropy rule puts a patch start at 16% of the computed results in GSM8K solutions and gets 19.0% of them exactly right given the true preceding text; a boundary after each "=" at the same patch count gets 51.8%, and entropy combined with a label-free boundary-dependence signal gets 67.1% (default layout at 26% of bytes: 76.8%). The gap survives adapting BLT-1B to the budget with low-rank adapters (32.9% vs 72.7%, three runs per rule). In byte models trained from scratch at a 10% budget on a 1.9 GB math corpus, it is not detectable at 1M parameters, appears on final answers at 12M and on both targets at 50M, as training data grow too: at 50M boundary dependence gets 35.9% of computed results against 13.9% for entropy and 78.9% of final answers against 59.0% (3 seeds each), although final answers mostly copy the solution's last number and entropy starts a patch at every one. In BLT-1B the blind spot narrows at larger budgets (entropy covers about 90% of the values right after "= " at 20% of bytes) and in the same solutions rewritten as prose, where a patch start at each value still pays. Boundary dependence, the change in the model's own loss when a patch start is removed or added, measured per two-byte context on text in the same format, finds these positions without labels.

新论文 · v1arXiv:2611.14463

交叉验证方差的理论

A Theory of Cross-Validation Variance

Nathaniel S. O'Connell, Jaime L. Speiser

AI 速读 基于摘要

该文从每个观测在交叉验证中同时承担训练与评估两种角色的权重表示出发,给出交叉验证估计方差的精确有限样本恒等式,并据此比较不同划分方案的方差性质。

stat.ML · cs.LG · math.ST

查看原文摘要

Cross-validation estimates predictive performance by repeatedly splitting the data into training and validation sets, fitting the model on the first and evaluating it on the second. Every observation influences the estimate in two roles, through its own evaluation when it is held out and through the models it helps fit when it trains. The random splits determine its weight in each role. From this representation, we prove an exact finite-sample identity for the variance of the cross-validated estimate. For a given splitting scheme with a common training set size, the variance is a function of these weights, with constants of the model, the metric, and the population. It covers metrics averaged over observations, such as mean squared error, and over case--control pairs, such as the AUC. The identity shows which schemes to use. The variance decomposes into sampling variance, which depends only on the training size, and variance due to the random fold splitting, which arises when the weights change from one draw of the splits to the next. K-fold cross-validation, whose weights are equal across observations by design, is therefore variance optimal at first order; Monte Carlo and bootstrap cross-validation are not. The first-order variance of K-fold does not depend on K, and under reasonable conditions on the model leave-one-out has the smallest variance of any K-fold scheme. For the AUC the same holds for leave-pair-out, which evaluates every case--control pair. Finally, we show the cross-validated estimate is asymptotically normal with the identity's full variance. Together, these results provide a general theoretical foundation for inference on cross-validated performance and establish principles for selecting variance-optimal cross-validation designs.

版本更新 · v2arXiv:2605.00645

From Prediction to Practice: A Task-Aware Evaluation Framework for Blood Glucose Forecasting

Alireza Namazi, Heman Shakeri

原文摘要

Clinical time-series forecasting is increasingly studied for decision support, yet standard aggregate metrics can obscure whether a model is actually useful for the task it is meant to serve. In safety-critical settings, low average error can coexist with dangerous failures in exactly the high-risk regimes that matter most. We present a task-aware evaluation framework for blood glucose forecasting built around two downstream uses: hypoglycemia early warning and insulin dosing decision support. For early warning, we evaluate on real data from three clinical cohorts using event-level recall and false alarms per patient-day, metrics that reflect operational alarm burden rather than aggregate accuracy. We show that models appearing acceptable overall, with recall above 0.9 on the full test set, can fail badly in the post-bolus slice, where insulin-on-board is elevated and missed warnings carry the greatest clinical consequences. Standard forecasting evaluation, however, does not test whether a model can reason about the effects of actions, a requirement for supporting insulin dosing decisions. We therefore add a second, interventional arm using the FDA-accepted UVA/Padova simulator, where we evaluate whether forecasters can predict glucose responses to altered insulin plans in paired factual/counterfactual scenarios. We show that models that look strong on real-data forecasting often fail to predict the direction, magnitude, or ranking of intervention effects, and choose poor insulin doses when evaluated under a clinically motivated cost. Taken together, the two arms reveal a consistent gap between forecasting accuracy and task-relevant usefulness. We release the benchmark, the standardized preprocessing pipeline for public cohorts, and the simulator-based interventional dataset as a reproducible toolkit.

cs.LG

新论文 · v1arXiv:2611.14459

文本编码何时对语言建模重要?

When does text encoding matter for language modeling?

Eugene Jang, Catherine Arnett, Terra Blevins

AI 速读 基于摘要

作者比较 UTF-8 与多种编码策略在字节级语言模型中的表现,发现编码选择的影响因语言而异,主张编码应作为语言特定设计决策。

cs.CL

查看原文摘要

UTF-8's role as the de facto encoding standard in language models introduces cross-lingual inequities due to its variable-length design. However, the effect that this encoding choice has on model performance remains largely unexamined. In this work, we investigate how text encoding impacts the performance of byte-level language models, comparing UTF-8 with a wide range of other encoding strategies, including other Unicode-based approaches, language-specific encodings, and our own customized encodings. To facilitate our analysis, we propose Aether: a hybrid encoding scheme that uses script-specific encodings for our target setting while maintaining full Unicode coverage through UTF-8 fallbacks, using this framework to model four orthographically diverse languages. Surprisingly, we find that while languages with information-dense characters (Chinese, Korean) significantly benefit from compressive encodings, languages whose characters carry less information individually (Georgian, Tamil) are largely insensitive to encoding choice. In light of these findings, we argue that text encoding should be a language-specific design decision, rather than a universal default.

版本更新 · v3arXiv:2607.16769

图神经网络作为供应链优化元模型的潜力:数据集、架构与方向

On the Potential of Graph Neural Networks as Metamodels for Supply Chain Optimization: Dataset, Architectures, and Directions

Tushar Lone, Neha Karanjkar

AI 速读 基于摘要

该论文为供应链优化中的图神经网络代理模型奠定基础,构建公开数据集、探索节点级与网络级预测架构,并讨论梯度优化等研究方向。

cs.LG

查看原文摘要

Graph Neural Networks (GNNs) have emerged as a powerful, differentiable class of learning models for graph-structured systems. Their ability to generalize across topologies opens the prospect of a surrogate for combined structural and parametric optimization, which classical metamodels cannot offer. Supply chains are a natural target, yet the use of GNN surrogates for supply chain problems is largely unexplored. This paper lays the foundation, presents initial steps, and discusses key research directions. As a foundation, we formulate the problem and create a large public training dataset of programmatically generated supply chain graphs with input parameters and steady-state performance metrics obtained using our SupplyNetPy simulation library. As initial steps, we explore GNN architectures that work well as surrogates for node- and network-level predictions, and analyze their accuracy-compute trade-off against simulation. Most importantly, we outline the exciting directions this opens, namely gradient-based optimization over topology, fast design-space exploration, and sensitivity analysis.

新论文 · v1arXiv:2611.14451

一种用于实时皮肤渲染与数字化的轻量级可微方法

A Lightweight Differentiable Method for Real-Time Skin Rendering and Digitization

Mario Marquez-Balduque, Carlos Rodriguez-Pardo, Jorge Lopez-Moreno

AI 速读 基于摘要

提出可微的屏幕空间次表面散射框架,从单光单视角轻量采集直接估计适配实时渲染管线的皮肤散射参数。

cs.CV · cs.GR

查看原文摘要

Inverse rendering for skin typically relies on offline path tracing to estimate physical properties, which fail to map directly to the approximate shaders utilized in interactive applications, such as game engines. We bridge this gap by directly estimating subsurface scattering parameters tailored for real-time rendering pipelines. We introduce a differentiable Screen-Space Subsurface Scattering (SSSS) framework that enables the joint optimization of spatially varying base textures and scattering distances. To account for local variations in skin thickness, we estimate these parameters across distinct facial regions, generating a blended profile map ready for production runtime engines. Our pipeline utilizes a low-cost, single-light, single-view capture setup designed for accessible and practical appearance acquisition. Optimization is driven by a masked loss function targeting regions where subsurface scattering effects are dominant. We validate our approach on a real-world dataset of $45$ individuals across the Monk Skin Tone Scale, ensuring demographic generalization. Furthermore, we complement this evaluation with synthetic data, a multi-light setup validating our single-light assumption, and a tilted-view configuration confirming angular consistency. Results demonstrate that our method effectively recovers scattering parameters from lightweight inputs, yielding realistic skin appearance directly compatible with standard real-time shaders.

版本更新 · v3arXiv:2605.24001

带扩散奖励的 Diff-Instruct:面向有原则的一步生成器强化学习

Diff-Instruct with Diffused Reward: Towards Principled One-step Generator RL

Junyi Wu, Weijian Luo, Haoyang Zheng, Ruizhe Zhang, Guang Lin

AI 速读 基于摘要

提出 DIDR,一种基于积分 KL 最小化的无数据轨迹级对齐框架,把 RLHF 最优的奖励倾斜干净图像分布沿扩散轨迹传播到各噪声层级,用于一步文本到图像生成器的强化学习对齐。

cs.CV · cs.AI · cs.LG

查看原文摘要

Recent advances in one-step text-to-image generation have enabled real-time synthesis with remarkable efficiency and quality. Previous reinforcement learning methods for one-step generators combine image-space reward optimization with diffusion noisy-space distribution matching. This paradigm brings challenges due to a mismatch between terminal reward optimization and the underlying generative dynamics. As a result, optimization tends to exploit stochastic degrees of freedom, often improving reward at the expense of image fidelity. To address this issue, we propose Diff-Instruct with Diffused Reward (DIDR), a data-free trajectory-level alignment framework derived from Integral KL minimization. DIDR propagates the RLHF-optimal reward-tilted clean-image distribution across all noise levels along the diffusion trajectory. We show that this objective admits the same minimizer as clean-image RLHF, while naturally inducing the Diffused Reward Score (DRS), which acts as a reward-driven correction to the reference score function. To make this practical, we further introduce the Diffused Reward Proxy (DRP), an efficient estimator of DRS based on differentiable short-step denoising. Extensive experiments demonstrate that DIDR consistently Pareto-dominates existing one-step SDXL baselines. Moreover, when transferred to a 6B DiT backbone (Z-Image), DIDR surpasses its 50-step teacher in preference alignment while requiring only a single generation step. Code: https://github.com/Junyi-W/DIDR

版本更新 · v2arXiv:2611.07751

公式化Alpha语言中的调整锚依赖:一个可验证语法与重锚审计

Adjustment-Anchor Dependence in Formulaic Alpha Languages: A Certified Grammar and a Re-Anchoring Audit

Zhengkai Tu, Xinyue Xiang, Jimmy Huang

AI 速读 基于摘要

该论文形式化了公式化Alpha挖掘中价格调整锚依赖问题,提出可验证锚不变性的类型系统,并通过重锚审计揭示已发表方法挖掘的池在存储表示上IC偏高。

cs.SI

查看原文摘要

Several public scripts for formulaic alpha mining store prices adjusted to the snapshot's last day, so a past day's stored price changes with every later split or dividend and formulas that do not cancel the adjustment factor depend on future corporate actions. We formalise a change of adjustment anchor as a per-stock group action and give a two-sorted type system that soundly certifies anchor invariance from a formula's syntax, under a declared field-adjustment contract and idealised operator semantics; its second sort admits log-returns, and a linear-time checker plugs into any miner. In a re-anchoring audit on Chinese A-shares, pools that five published methods mined in our benchmark pipeline score a mean information coefficient (IC) 0.005 higher on the stored representation than on a cutoff-anchored one, about 14% of their IC. The mean signed change for certified pools is about -0.001, and pools mined on past-anchored data stay sensitive. On the Chinese development folds, certification shows no detectable predictive cost or gain; the estimated minimum detectable difference is about 0.017 IC across cells on pool ICs of 0.03-0.04. We also trace an erroneous index-membership entry to public Qlib data snapshots and show that re-mining exposes the effect of such data defects, which re-evaluating fixed pools understates.

新论文 · v1arXiv:2611.14606

Discovering the Relation Between Architectural Models and Reference Architectures

Thi Dinh Tran, Maria Teresa Rossi, Ludovico Iovino, Leonardo Mariani

原文摘要

Assessing whether concrete software architectures are consistent with their reference architecture (RA) is essential to ensure that architectural decisions scale coherently across projects, preserving the quality attributes the RA was designed to guarantee. In the absence of dedicated techniques, mapping the components of an architectural model onto a predefined RA can be addressed only with general-purpose model-comparison algorithms. Our experiments show that these algorithms are inaccurate when applied to RAs. To address this gap, we propose Reference Architecture Mapping Discovery (RAMD), an LLM-based workflow that combines model analysis with structured prompting, and refines results through an iterative RA compliance-checking mechanism. We evaluate RAMD on 64 open-source architectural models spanning three RAs from the IoT, self-driving, and smart parking domains. With domain knowledge and GPT-4o, RAMD reaches 85.8% mapping accuracy and outperforms the strongest baseline by 44.6 percentage points, while ensuring structural consistency with the RA.

cs.SE

版本更新 · v2arXiv:2504.09341

少数派报告:在真值数据标注中平衡成本与质量

Minority Reports: Balancing Cost and Quality in Ground Truth Data Annotation

Hsuan Wei Liao, Christopher Klugmann, Daniel Kondermann, Rafid Mahmood

AI 速读 基于摘要

该研究通过识别与多数投票标签不一致的“少数派报告”,探索在保证标注质量的前提下削减重复标注以降低成本。

cs.LG · cs.CV · cs.HC

查看原文摘要

Data annotation is an essential but costly aspect of developing machine learning-based technology, requiring multiple human workers to repeatedly label each data point in a data set. We explore the tradeoff between annotation accuracy and cost by identifying minority reports---worker responses disagreeing with the reference majority-vote label---that may indicate unnecessary redundancy, and can therefore be proactively pruned before they are executed. We develop a theoretical framework for choosing the number of repeated annotations required for a task and pruning policies at a target label quality. We estimate minority-report risk on two computer vision datasets re-annotated through a professional platform, then evaluate a rolling policy on the assignment stream to prune over 35% of repeats while preserving more than 99.9% of reference majority-vote labels.

版本更新 · v2arXiv:2607.09745

SupplyNetPy:用于任意供应链与库存网络高保真建模与仿真的开源 Python 库

SupplyNetPy: An Open-Source Python Library for High-Fidelity Modeling and Simulation of Arbitrary Supply Chain and Inventory Networks

Tushar Lone, Neha Karanjkar

AI 速读 基于摘要

作者介绍了一个开源 Python 库 SupplyNetPy,它支持任意多级供应链网络的离散事件仿真,并报告了与解析基准、商业工具和已发表案例的验证结果。

cs.AI · cs.LG

查看原文摘要

This paper introduces SupplyNetPy, an open-source, well-documented Python library for modeling and discrete-event simulation of supply chain networks with arbitrary multi-echelon structures. It supports multiple replenishment policies, perishable inventory, node disruptions, and stochastic demand and lead times. All components are extensible via inheritance. Users describe a supply chain as a graph with node and link attributes, while the library handles simulation, providing logs and extensive node and network level performance reports. This paper presents the motivation, design, key features, and architecture of SupplyNetPy, along with detailed validation results (against analytical benchmarks, a commercial tool, and a published case study). A key motivation behind SupplyNetPy's development is programmatic generation and simulation of complex models, enabling design-space exploration, what-if analysis, training data generation, and supply chain digital twins.

新论文 · v1arXiv:2611.14440

UGG:统一生成式几何模型

UGG: Unified Generative Geometry Model

Amani Kiruga, Zhiyi Li, Ruojin Cai, Hansen Lillemark, Xiaoshan Wu, Ayush Tewari, Yilun Du

AI 速读 基于摘要

UGG 将 RGB 视频与深度、相机位姿等几何表示统一到单一生成模型中,用跨模态、跨时间的不同噪声水平把视觉生成与几何预测表述为条件补全。

cs.CV · cs.LG · cs.RO

查看原文摘要

Understanding 4D scenes is a core challenge in visual intelligence, requiring models to jointly capture scene geometry, appearance, and dynamics from partial observations. However, existing approaches are subdivided into feedforward models for direct geometric prediction, and generative models for visual synthesis. We introduce UGG, a unified framework for 4D scene understanding that jointly models RGB video and geometric representations such as depth and camera pose. By assigning different noise levels across modalities and time, UGG formulates visual generation and geometric prediction as conditional completion within a single generative model. This flexible formulation enables the model to learn from diverse, heterogeneous datasets with different subsets of geometric and visual annotations. Furthermore, our generative formulation enables inference-time search over multiple plausible scene hypotheses, using geometric evidence extracted from observed RGB frames to improve geometric prediction without ground truth geometry. We demonstrate UGG's effectiveness over non-unified baselines across camera-controlled video generation, depth estimation, and camera pose prediction, including in challenging sparse observation settings. Code and visualizations are available at https://ugg-model.github.io/

版本更新 · v3arXiv:2606.12683

从AGI到ASI

From AGI to ASI

Tim Genewein, Matija Franklin, Alexander Lerchner, Laurent Orseau, Samuel Albanie, Adam Bales, Cole Wyeth, Stephanie Chan 等 14 位作者

AI 速读 基于摘要

该报告探讨后AGI时代机器智能如何沿连续谱继续发展,重点分析从人类水平AGI到人工通用超级智能(ASI)的过渡路径、摩擦与开放研究问题。

cs.AI · cs.CY · cs.LG

查看原文摘要

Over the last decade, building human-level artificial general intelligence has moved from far-fetched speculation to being a concrete next-decade target for many of the largest AI organizations. Achieving this goal would have profound and far-reaching impacts on human society, which raises many complex questions for the decade ahead. This report investigates how AI itself might continue to develop in a post-AGI world along the continuum of machine intelligence. The endpoint of this continuum, Universal AI, is theoretically well understood, which provides some formal grounding for the main focus of this report: the transition from human-level AGI to artificial general superintelligence, which can intuitively be understood as a system that is more intelligent and cognitively capable than large organizations of humans. After characterizing ASI, the report discusses four potential pathways from AGI to ASI: scaling AGI, AI paradigm shifts, ASI emerging from large-scale multi-agent collectives, and recursive improvement. The report then discusses possible frictions and bottlenecks along these pathways. Determining whether the impact of these frictions will be negligible or substantial raises a number of concrete open research questions. While large uncertainties for predicting ASI progress remain, it cannot be ruled out that AI progress might continue to accelerate over the next years. This would imply that the image of a single transformative step change, caused by the introduction of human-level AGI into our society, could be inaccurate. More apt might be the prospect of a series of transformative societal changes caused by AI-enabled progress and breakthroughs across many areas of science and technology. Preparing for this prospect requires a massively interdisciplinary endeavor of global scope and interest.

新论文 · v1arXiv:2611.14436

面向可解释深度伪造检测的指标对齐组相对策略优化

Metric-Aligned Group Relative Policy Optimization for Explainable Deepfake Detection

Luka Dragar, Peter Peer, Vitomir Štruc, Borut Batagelj

AI 速读 基于摘要

提出先预测后解释的解耦流程,并用指标对齐的GRPO优化解释器,以提升深度伪造检测的可解释性与评测表现。

cs.CV

查看原文摘要

Deepfake detectors are commonly evaluated on real/fake classification alone, but real-world applications require explanations of the visual evidence behind each prediction. Joint vision-language models struggle with authenticity assessment, producing "real" narratives for manipulated images. To address this, we propose a decoupled predict-then-explain pipeline as our submission to the ACM Multimedia 2026 Explainable Deepfake Detection Challenge, with methods trained and evaluated on the XPlainVerse benchmark. A vision-foundation-model ensemble first classifies the image, then a Qwen3-VL-8B model generates a decision-conditioned explanation of the visual evidence. For fake images, a second Qwen3-VL-8B compresses that text into a short non-expert summary without using the image. We further apply metric-aligned Group Relative Policy Optimization (GRPO) to optimize both explainers against the challenge criteria. Under matched conditions, GRPO raises complex BERTScore-F1 from 0.686 to 0.712 and also improves grounding (entity and evidence F1); our submission ranked first on complex BERTScore-F1 and seventh overall.

版本更新 · v2arXiv:2605.26599

从算法视角重新审视仅求特征值的分治三对角特征值求解器

Revisiting Eigenvalue-Only Divide-and-Conquer Tridiagonal Eigensolver from Algorithmic Perspective

Ruiyi Zhan, Dajun Huang, Lu Shi, Shaoshuai Zhang

AI 速读 基于摘要

作者提出仅用每个合并节点的首末两行边界行构成递推来携带分治状态,将持久内存从二次降为线性,并在 CPU 与 GPU 上按去膨胀后的有效秩做细粒度调度。

cs.DC · math.NA

查看原文摘要

Divide-and-conquer (D&C) is the natural parallel strategy for symmetric tridiagonal eigenvalue decomposition, yet eigenvalue-only solvers fall back to serial QR algorithm because the quadratic transform state each merge carries exhausts memory at scale. In this paper, we demonstrate that each merge stage in D&C needs only two boundary rows, the first and last rows of a node's eigenvector block, and these close into a recurrence whose parent rows follow from its children's and local merge data alone, so the state is carried up the tree with nothing replayed and persistent memory drops from quadratic to linear. Because this state keeps no replay workspace, adapting the schedule to each merge's post-deflation active rank is a scheduling choice, so both CPU and GPU spend finer-grained parallelism only where substantial secular work survives. We evaluate optimized CPU and GPU implementations, with complexity and correctness analysis, against QR, bisection, and D&C routines in standard libraries.

新论文 · v1arXiv:2611.14430

每个严格拆解层级上的线性规模图

Linear-size graphs at every strict dismantling level

Jesús F. Espinoza, Martín Eduardo Frías-Armenta, Rosalía G. Hernández-Amador, Héctor A. Hernández-Hernández

AI 速读 基于摘要

作者为每个严格拆解层级 k 构造了顶点数随 k 线性增长(3k+8 与 4k+4)的图,并给出最小阶数的上界 min{4k+4, 3k+8}。

math.CO · cs.CG · cs.GR

查看原文摘要

Dismantling reduces a graph to one vertex by successive deletions. At level zero, a vertex is eligible if one of its neighbours is adjacent to all its other neighbours. At level $k\geq1$, its neighbours must induce a graph dismantlable at level $k-1$. A graph has strict level $k$ if it admits a reduction at level $k$ and none at level $k-1$. For every $k\geq1$, we construct a graph of strict level $k$ with $3k+8$ vertices. Each step adds three vertices: the neighbours of one induce the preceding graph, and the other two provide the adjacencies used to rule out other first deletions at the lower level. A second construction gives a graph of order $4k+4$ at strict level $k$. Together the two families give the upper bound $\min\{4k+4,3k+8\}$ on the least order at strict level $k$.

新论文 · v1arXiv:2611.14426

两个社区,一个问题:分支定界与A*在资源受限项目调度中的比较

Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling

Izack Cohen, Dominik Kress, Lara Nehrke, Erwin Pesch, Shimrit Shtern

AI 速读 基于摘要

该研究以资源受限项目调度问题(RCPSP)为例,比较了分支定界(B&B)与A*两种精确搜索方法的基本实现,发现基于图的A*在基准实例上表现更优。

math.OC · cs.AI

查看原文摘要

Branch-and-Bound (B&B) and $A^*$ are popular exact search methods originating from Operations Research and Artificial Intelligence, respectively. Although the two methods share fundamental search principles, their different ways of exploring the search space can lead to substantially different computational performance. We investigate these differences using the Resource-Constrained Project Scheduling Problem (RCPSP) as an exemplary problem setting. We first establish the relationships between mixed-integer linear programming, state-action, and timed Petri-net representations. Since B&B and $A^*$ admit numerous algorithmic enhancements, we focus on relatively basic implementations. This allows us to examine the fundamental differences between the methods rather than compare the performance of state-of-the-art solvers. By using the same lower bound and best-first node selection, we isolate the effects of the search mechanisms, particularly the identification of equivalent states reached through different scheduling decision sequences. Experiments on 480 benchmark RCPSP instances show that graph-based $A^*$ substantially outperforms the B&B variants considered. With additional pruning rules, $A^*$ proves optimality for all 480 instances, compared with 445 for best-first B&B under the same time and memory limits. Depth-first B&B uses less memory and can find feasible solutions even when the search does not finish within the time limit. Stronger linear programming relaxations reduce the search space but introduce considerable computational overhead. Our findings highlight the importance of duplicate-state detection and clarify the computational trade-offs between the search approaches. These insights can help researchers select an appropriate method and identify opportunities to incorporate effective mechanisms from one approach into the other.

版本更新 · v2arXiv:2607.01128

GAIA:面向正问题与反问题的几何自适应算子学习

GAIA: Geometry-Adaptive Operator Learning for Forward and Inverse Problems

Meenakshi Krishnan, Pranav Pulijala, Ke Chen, Haizhao Yang, Ramani Duraiswami

AI 速读 基于摘要

提出几何自适应积分自编码器 GAIA,将边界与内部场编码为几何 token 并用交叉注意力调节积分变换核,从而在任意几何上单次前向求解正问题与反问题。

cs.LG · math.NA

查看原文摘要

Operator learning for partial differential equations (PDEs) on arbitrary geometries builds fast neural surrogates for large-scale simulation. While recent geometry-adaptive neural operators have made substantial progress, they are mainly designed for forward problems in which inputs and outputs share the same spatial domain. This limits their applicability for boundary value problems (BVPs) and inverse problems, where inputs and outputs may live on different domains. We introduce the Geometry-Adaptive Integral Autoencoder (GAIA), an operator learning model that encodes the domain boundary and the interior field distribution into geometry tokens, and conditions integral transform layers on these tokens via cross-attention, allowing the kernel to adapt locally to geometric features. This yields an architecture capable of learning solution operators for forward and inverse problems on arbitrary domains, solving each in a single pass at inference without per-domain optimization, iterative refinement, or graph construction. We evaluate GAIA on seven 2D and 3D benchmarks, four of which are new or substantially extended benchmarks for inverse problems and BVP: electrical impedance tomography, optical tomography, 3D Darcy flow on varying geometries, and a modified setting of the Poisson BVP on mechanical components benchmark (MCB). GAIA sets new state-of-the-art results on every inverse and BVP task, reducing median relative $L^2$ error by 64% on airfoil flow reconstruction and 22% on EIT relative to the next best amortized method, and outperforming all baselines on every shape category of MCB. On other forward problems, GAIA is competitive with specialized solvers while maintaining stable accuracy across point resolutions on which transformer-based baselines degrade.