跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 23,345 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
新论文 · v1arXiv:2611.26391

Simulation-pretrained autoencoders versus PCA for compressing multimode fibre transmission matrices

Callum J. Wilson, Terry Wright, Qing Yang, Zhong Wen, Michael P. Pound, George S. D. Gordon

原文摘要

Multimode optical fibres can image through a thin, flexible probe once their transmission matrix (TM) has been measured, but a TM is large and must be re-measured whenever the fibre moves. A compact model of feasible TMs would make storing and re-estimating them cheaper, so we ask how compactly TMs can be represented, and from how few measured TMs. Here we benchmark a permutation-equivariant autoencoder, pretrained on simulated fibres and adapted to measured TMs, against principal component analysis (PCA). At 62x compression, adapting the pretrained autoencoder with just two measured TMs reconstructs the TM of a 50um fibre well enough to focus light at 98% of the ideal enhancement, and it stays accurate when the TMs are shifted by 25 pixels or zoomed by 10%, which quickly degrades a linear basis. It is not, however, a better compressor: PCA is about ten times more accurate when fitted on all 163 real TMs (1.1% against 11.9% error on held-out TMs) and is already more accurate from ten. The autoencoder's value is as a prior when few or no real TMs exist: with none it reaches 29% error, against 91% for PCA fitted on the same simulation. Transfer to a different fibre is only partial. The most important extension, not yet tested, is to recover pixel-basis TMs from fewer measurements than a full TM, which would turn the pretrained prior from a compressor into a measurement-saving tool.

physics.optics · cs.LG

新论文 · v1arXiv:2611.26390

SpecFlow:加速度谱中的流匹配用于多智能体轨迹预测

SpecFlow: Flow Matching in the Acceleration Spectrum for Multi-Agent Trajectory Forecasting

Ziyang Xu, Peng Han, Hai Zhou

AI 速读 基于摘要

SpecFlow 将未来加速度的 DCT 系数作为生成状态,用条件流匹配从噪声生成加速度谱,再经解析积分重建速度与位置,用于多智能体轨迹预测。

cs.RO

查看原文摘要

Multimodal trajectory forecasting must cover diverse future behaviors without sacrificing dynamical coherence. Most generative forecasters evolve frame-wise positions directly, leaving the relationships among position, velocity, and acceleration implicit. We present SpecFlow, a conditional flow-matching framework that treats the Discrete Cosine Transform (DCT) coefficients of future accelerations as its generative state. SpecFlow learns a transport from Gaussian noise to acceleration spectra and reconstructs velocity and position through fixed analytical integration initialized by the last observed state. A joint phase-space objective supervises all three kinematic levels. To represent destination uncertainty without future information, an endpoint predictor produces candidate destinations and confidence scores solely from observed context, and the highest-confidence candidate conditions the spectral denoiser. Alternating attention over trajectory hypotheses and agents captures multimodality and interaction. Under best-of-20 evaluation, SpecFlow achieves average minADE/minFDE of 0.15/0.22 on ETH/UCY, 0.69/0.86 at four seconds on NBA, and 7.38/11.57 on SDD. It establishes state-of-the-art results across all five ETH/UCY scenes and achieves the lowest four-second ADE on NBA with a tied-best FDE, while remaining competitive on SDD. Together, these results demonstrate that acceleration-spectrum flow matching provides an effective structured generative state across smooth pedestrian motion, coordinated multi-agent sports dynamics, and heterogeneous outdoor trajectories. Code will be made publicly available.

新论文 · v1arXiv:2611.26389

ViDecide:教视频扩散模型逐步推理与规划

ViDecide: Teaching Video Diffusion Models to Reason and Plan Step by Step

Kaiwen Zhang, Yiming Gao, Zeqi Xiao, Xintao Wang, Pengfei Wan, Kun Gai, Xingang Pan

AI 速读 基于摘要

ViDecide 将视频生成训练从固定长度片段预测转变为以决策为中心的框架,通过预测状态转移和停止决策,显著提升多步推理与规划任务的成功率。

cs.CV

查看原文摘要

Current leading video generation models can synthesize highly realistic videos, while still frequently violating physical and logical constraints in multi-step reasoning and planning, even after training with large-scale reasoning data or existing diffusion RL methods. We attribute these failures to the conventional video training paradigm, which treats a solution as a fixed-length clip rather than a chain of decisions. We present ViDecide, a decision-centric framework that trains video diffusion models to predict state transitions causally and decide when to stop, with a decision-focused training schedule. We further propose Corrective Fine-tuning (CFT), which corrects failed decisions by mapping their noise to the model's own successful continuations, achieving stable improvement without policy-gradient optimization. Across abstract games, planning tasks, and a new benchmark of multi-step robot planning, ViDecide achieves an average strict success rate of 83.8%, far above 23.3% for standard fine-tuning and 67.8% for the strongest prior method, and generalizes to larger puzzles and unseen layouts. Our framework therefore unlocks greater potential for video generation models as reliable reasoners and planners in the visual world. Project page: https://kevin-thu.github.io/ViDecide.

版本更新 · v3arXiv:2512.23889

大型语言模型如何歪曲美国气候舆论

How Large Language Models Misrepresent American Climate Opinions

Sola Kim, Jieshu Wang, Marco A. Janssen, John M. Anderies

AI 速读 基于摘要

作者用978名美国气候舆论调查受访者的个人资料提示六个大语言模型,发现模型生成的回答向人群均值压缩,且性别假设在种族交叉处方向出错。

cs.CY · cs.AI

查看原文摘要

Large language models are increasingly used to simulate public opinion, standing in for survey respondents as "silicon samples." Whether they faithfully represent U.S. climate opinion, particularly at the intersections of race, gender, and ideology, remains largely untested. We prompted six large language models with the profiles of 978 respondents to a nationally representative U.S. climate opinion survey and compared the generated responses with those respondents' own answers across 20 questions. The models compress the diversity of American climate opinion, pulling predictions toward the population mean: less-concerned groups are predicted as more concerned, more-concerned groups as less, and the variance of predicted responses falls, on average, 29% below that of human responses. The compression is intersectional. The models apply one gender assumption, predicting women as more pro-climate than men in every racial group. The assumption matches the direction of the human pattern for White, Hispanic, and Other Americans and runs the wrong way for Black Americans. We claim the direction of that difference rather than its size, since it rests on small cells at the ideological extreme. An audit of gender alone would report that the models understate the gender gap, and would miss that the error changes direction by race, which is what single-variable audits cannot detect. What is at stake is not accuracy alone but representation: whose views a synthetic sample renders legible.

新论文 · v1arXiv:2611.26386

SEEC:用于自监督外眼表征学习的大规模数据集与基准

SEEC: A Large-Scale Dataset and Benchmark for Self-Supervised External-Eye Representation Learning

George R. Nahass, Michelle Fleishaker, Sanjay Ganesh, Sasha Hubschman, R. V. Paul Chan, Chad A. Purnell, Pete Setabutr, Ann Q. Tran 等 9 位作者

AI 速读 基于摘要

作者构建了包含435万张图像的外眼标准化语料库SEEC,并提出了从表征层面和功能层面评估自监督外眼表征的基准。

cs.CV

查看原文摘要

External-eye photography captures clinically relevant periocular anatomy at low acquisition cost, yet no large-scale standardized resource exists for evaluating self-supervised external-eye representations. We introduce a 4.35-million-image Standardized External-Eye Corpus (SEEC) derived from fourteen heterogeneous public face datasets, together with a benchmark for external-eye representation learning. For evaluation, we provide held-out evaluation distributions, landmark-annotated anatomical probe sets, and clinical disease-classification experiments spanning ptosis, thyroid eye disease, and craniofacial syndromes. We evaluate representations at two complementary levels: (a) the representation level, by assessing embedding geometry across multiple data distributions, and (b) the functional level, by assessing anatomical recovery, out-of-distribution anatomical transfer, and disease classification. Our models include ResNet-101 and ViT-B encoders pretrained using InfoNCE, VICReg, and LeJEPA objectives and compared with DINOv2 and MAE. Our results indicate that representation-level and functional-level evaluations are dissociable: broader embedding-space utilization does not consistently correspond to anatomical transfer or disease-classification performance, and no single encoder is universally optimal. Domain-specific external-eye encoders outperform DINOv2 and MAE on cross-dataset anatomical transfer despite being pretrained at substantially smaller scale, while external-eye-pretrained ViT models match or outperform these general-purpose baselines on frozen disease-classification probes. We release benchmark code, evaluation scripts, and preprocessing pipelines to reproduce SEEC at https://monkeygobah.github.io/seec-project/

新论文 · v1arXiv:2611.26385

超越汇点解释:基于流的VLA策略中的径向注意力

Beyond the Sink Interpretation: Radial Attention in Flow-Based VLA Policies

Yuxi Zheng, Yueqian Lin, Yudong Liu, Zijia Tang, Junyu Pan, Yiheng Wang, Hai Helen Li, Yiran Chen

AI 速读 基于摘要

作者在单个π0.5检查点上检验了流式VLA策略中首尾动作令牌的高注意力是否构成“汇点”,发现它们不符合汇点特征,而前缀BOS令牌才符合,且相对偏移路由能保持动作令牌的分散性和闭环成功率。

cs.RO

查看原文摘要

Prior work calls the high attention on the first and last action tokens of a flow-based VLA policy a radial action sink, and uses these tokens to set the execution horizon. In language models, a sink is a token with high incoming attention, a small value, and little effect on the output. We test whether that profile holds, not the horizon rule, in one $π_{0.5}$ checkpoint on five RoboCasa tasks. The two endpoints receive 5.4% of action-key mass, 1.4 percentage points above their uniform share, and rotary positional encoding produces this excess: directly in shallow layers and through upstream action-token RoPE deeper in the network. The endpoints do not fit the sink profile. Their value norms stay near the action-token mean in all 18 layers. On 250 paired episodes, masking them or zeroing their values changes success by less than 4 points, and replacing their value directions with those of another observation lowers it by 3.2 to 7.2 points across three donors, whereas the same replacement on two non-endpoint tokens in the executed prefix lowers it by 28.4 points. The token that does fit the sink profile on mass and value norm is the prefix BOS; on this checkpoint, zeroing its value raises success in two paired runs, by +13.2 points (95% CI [+7.0, +19.4]) and +6.0 points ([+0.2, +11.8]). Inside the action chunk, a relative-offset routing profile estimated on other tasks keeps 75% of action-token spread and keeps closed-loop success on three held-out tasks (42.7% against a 38.7% baseline), while uniform or shuffled routing drops success to 3-4%. High attention mass alone does not tell what a token does.

新论文 · v1arXiv:2611.26384

面向点云的完备几何消息传递架构

A Complete Geometric Message-Passing Architecture for Point Clouds

Nadav Dym, Tal Amir, Gia Chi Dang, Christopher Morris

AI 速读 基于摘要

提出一种简单且等变的点云消息传递架构,并证明其具有完备性,实验表明它能区分基于距离的消息传递无法区分的点云。

cs.LG

查看原文摘要

Three-dimensional point clouds are a fundamental data modality, and a large family of machine learning architectures has been developed to respect their natural symmetries to rigid motions and permutations. A principled way to compare these architectures, which vary widely in complexity and cost, is through their expressive power. That is, an architecture is complete if it can distinguish any two inputs not related by the symmetries it respects. Simple distance-based message-passing networks are known to be incomplete, and while there exist complete alternatives, they typically rely on computationally intensive mechanisms like high-order representations of the rotation group or higher-order Weisfeiler-Leman-type tests. In this work, we devise a novel, simple, equivariant message-passing architecture for point clouds, and prove that it is complete. We complement our theoretical result with experiments showing that our architecture separates challenging point clouds that distance-based message passing provably cannot distinguish. Our results suggest that high-order equivariant features may not be necessary to enhance the expressivity of point cloud architectures, and can help settle completeness for other equivariant architectures for which such results are currently unknown. We give initial evidence for this by proving completeness of a slightly modified version of SEGNN.

新论文 · v1arXiv:2611.26383

多机制因果发现基准中的证据:UCMT算法、比较性能与受控消融研究

Evidence from a Multi-Regime Causal Discovery Benchmark: UCMT Algorithms, Comparative Performance, and Controlled Ablation Studies

Mahyar Eslami

AI 速读 基于摘要

作者报告了UCMT因果发现算法家族在多种基准机制下的预注册评估,显示其在部分比较中优于NOTEARS和DAGMA,但未确立整体优势。

cs.LG

查看原文摘要

We present an internal, pre-registered evaluation of the UCMT causal discovery algorithm family alongside established alternatives across heterogeneous benchmark regimes, complemented by a separately pre-registered, controlled study of UCMT v2 Global components. The contribution is both empirical and methodological: a family-stratified comparison of three actively developed algorithm configurations and targeted evidence about which internal stages affect their outcomes. In the main benchmark, UCMT v2 Global has higher directed F1 than NOTEARS and DAGMA in selected real, semi-synthetic and Gaussian-network comparisons at the paired-run level, while trailing leading permutation-search methods in other settings. The BOSS-based UCMT v4 produces a CSuite-specific directed-F1 improvement over BOSS (mean paired difference +0.279; pair-level Holm p < 0.001), but the dataset-level adjusted result is not significant (p = 0.188). In a separate fixed-skeleton ablation, UCMT v2 Global exceeds an adapted R^2-SortnRegress orientation baseline on standardized iSCM data (directed F1 0.537 vs 0.468, dataset-level Holm p = 0.031); absolute orientation accuracy is 0.563 and there is no established broad advantage over RESIT, ANM or DirectLiNGAM. Controlled ablations show that sparsity and BIC-based refinement materially affect some outcomes, whereas the examined arbitration and automatic regime-selection mechanisms do not yield confirmed general improvements. We report performance shortcomings, multiple-testing correction, runtime costs, evaluation limitations and reproducibility checks. The results support UCMT as an implemented and empirically investigated algorithm family, not a claim of overall superiority, independent validation or demonstrated commercial impact.

新论文 · v1arXiv:2611.26382

具有共轭对轨道相互作用的费米子基态能量估计的高效经典算法

Efficient Classical Algorithms for Ground Energy Estimation of Fermions with Conjugate-Pair Orbital Interactions

Ziyi Yang, Yexin Zhang, Yuexin Su, Xinzhao Wang, Xiaoyang Wang, Tongyang Li

AI 速读 基于摘要

针对具有共轭跃迁矩阵和共轭对轨道相互作用的费米子哈密顿量(包括吸引哈伯德模型),作者提出一种无需谱隙或弱耦合假设的高效经典随机算法来近似基态能量。

quant-ph · cs.DS

查看原文摘要

Estimating the ground energy of interacting fermions is central to quantum many-body physics, and recent quantum algorithms provide polynomial-time guarantees for some structured families. Classical approaches commonly rely on quantum Monte Carlo, where the sign problem is a major obstacle. However, even when a nonnegative expansion without sign problem is available, rigorous guarantees for rapid mixing are still far from well understood. In this paper, we give an efficient classical randomized algorithm for approximating the ground energy of fermionic Hamiltonians with conjugate hopping matrices and conjugate-paired orbital interactions, which includes the attractive Hubbard models. This guarantee not only holds without a physical spectral gap or a weak-coupling assumption, but also covers interactions beyond onsite density attractions. Technically, we first reduce ground-energy estimation to partition-function estimation and then use a discretization with controlled energy error to obtain a nonnegative weighted sum of squared determinant moduli and then apply the Chen--Liu log-concave counting theorem. In addition, we obtain a sharper arithmetic bound by controlling how many independent sampling runs and matrix updates are needed, and using sparse matrices to reduce the cost of each update.

版本更新 · v2arXiv:2605.17170

TriAxialKV:面向智能体推理任务的极低精度 KV 缓存量化

TriAxialKV: Toward Extreme Low-Precision KV-Cache Quantization for Agentic Inference Tasks

Hanzhang Shen, Haoran Wu, Yiren Zhao, Robert Mullins

AI 速读 基于摘要

作者提出按时间、模态、语义角色三轴为每个 token 打标签并校准敏感度,在固定显存预算下分配 INT2/INT4 位宽,实现智能体推理的混合精度 KV 缓存量化服务系统。

cs.LG

查看原文摘要

Agentic workloads have emerged as a major workload for LLM inference. They differ significantly from chat-only workloads, requiring long-context processing, the ability to handle multimodal inputs, and structured multi-turn interactions with tool calling capabilities. As a result, their context exhibits structure that can carry different importance along three key axes: temporal recency to the current turn, modality such as text or image tokens, and semantic role such as user queries, tool calls, observations, or reasoning. These axes capture distinct token behaviors and lead to different sensitivities to KV-cache compression. However, existing KV-cache quantization methods are typically homogeneous or exploit only heterogeneity on a single dimension, such as temporal proximity or modality, overlooking the interactions among them. To this end, we introduce TriAxialKV, a novel mixed-precision KV-cache quantization scheme that assigns each token a triaxial tag, calibrates per-tag sensitivity, and allocates INT2/INT4 bit-widths under a fixed memory budget. We implement TriAxialKV as an end-to-end serving system, comprising calibration, mixed-precision quantization and memory management, and custom fused Triton decode kernels. When using Qwen3-VL-32B-Thinking as a computer-use agent operating the OSWorld, TriAxialKV matches the accuracy of SGLang with BF16 KV cache while supporting 4.5$\times$ KV cache capacity and achieving 30% higher end-to-end throughput, when running on real GPU systems.

版本更新 · v4arXiv:2609.02986

自回归语言建模的两条原则

Two Principles for Autoregressive Language Modeling

Runlin Shi, Bojian Yin, Guoqi Li

AI 速读 基于摘要

作者通过基于干预的指标分析 RoPE Transformer 中检索与位置建模的功能分化,提出功能组织与位置依赖两条建模原则,并用从头预训练与架构消融实验加以支持。

cs.LG

查看原文摘要

We investigate the functional differentiation learned by RoPE Transformers to derive principles for autoregressive language modeling. We introduce two intervention-based metrics: RoPE Frequency Importance Score (RFIS) measures how removing a frequency contribution changes a head's full attention distribution, and RoPE Positional Dependence (RPD) isolates the effect of rotary modulation. In Qwen3 and Llama3.1, these metrics distinguish retrieval from positional modeling, while individual heads can exhibit both functions. A mid-low-frequency Global Positional Band (GPBand) separates their frequency dependencies and tracks the training sequence length in controlled experiments, suggesting that global positional fitting can hinder zero-shot length extrapolation. These findings motivate two principles. (1) Functional Organization: retrieval and positional functions should be assigned separately and mixed within layers with layer-specific allocation; and (2) Positional Dependence: positional modeling should operate only locally, while global access should rely on position-independent retrieval. Matched pretraining from scratch and targeted architectural ablations at 380M and 1.4B parameters support both principles and highlight the importance of mechanism choice in realizing each function. Together, these findings suggest a promising route toward architectural innovation grounded in the functional requirements of autoregressive language modeling.

新论文 · v1arXiv:2611.26378

最优抢占:保障平均年龄及更广范围内的信息新鲜度

Optimal Preemption: Guaranteeing Information Freshness in Mean Age and Beyond

Aimin Li, Yiğit İnce, Elif Uysal

AI 速读 基于摘要

该论文提出允许发送方抢占正在服务的状态更新并重新采样的框架,在一般服务时间分布和显式动作成本下,证明有限平均延迟足以保证有限平均AoI,并研究VaR/CVaR优化及TAILOR算法。

cs.IT

查看原文摘要

Once a status update enters service, age-optimal policies must wait for it, even when heavy-tailed delays inflate the Age of Information (AoI). We develop a framework in which the sender may preempt the update in service and sample a fresh one, under general service-time distributions and explicit action costs. Our framework covers sources that generate updates at will as well as random update arrivals. Under nondecreasing age costs, we prove that, with preemption, a finite mean delay suffices for a finite average age even under infinite delay variance. We show the optimality of constant service-age thresholds from prior work for exponential service, and exhibit numerically that for general delays the optimal preemption rule depends on both the AoI and the elapsed service time. Under an action-cost budget, we further minimize the Value at Risk (VaR), which bounds the AoI except for a prescribed fraction of time, and the Conditional Value at Risk (CVaR), the mean AoI over that fraction. We reduce both to the same optimality equations without enlarging the state space. Under Pareto and log-normal delays, our algorithm TAILOR keeps the average cost bounded as delay variance grows, while optimal non-preemptive sampling diverges. With optimal preemption, a more variable network can allow fresher data than a steadier one of equal mean delay.

新论文 · v1arXiv:2611.26376

对齐驱动复用:从异构经验中学习可泛化的机器人使用智能体

Alignment Drives Reuse: Learning Generalizable Robot-Use Agents from Heterogeneous Experience

Ziyue Wang, Yaopeng Yang, Liyi Zhou

AI 速读 基于摘要

UniCraft 通过对齐异构场景几何、传感与控制接口及任务格式,让来自多个基准和本体的交互经验共同打磨一套共享操作技能与调度策略。

cs.RO

查看原文摘要

Vision-language models (VLMs) demonstrate broad generalization across tasks and domains. However, comparable generalization in robot manipulation remains challenging. Heterogeneity in robot embodiments, task formulations, geometric conventions, and action interfaces fragments interaction experience across benchmarks and hardware. We rethink robot skill learning through alignment: Can heterogeneous interactions across benchmarks and embodiments jointly improve one shared skillset for robot manipulation? We propose UniCraft, a framework for learning robot manipulation skills by aligning heterogeneous settings. Specifically, UniCraft represents observed scene geometry using consistent coordinate conventions and aligns sensing and control interfaces across robots. It organizes tasks from different benchmarks in a canonical format, allowing interaction feedback to jointly refine shared skills and the orchestration policy that guides their selection and composition, without any demonstrations or model weight updates. We interleave tasks from 3 benchmarks and 6 embodiments, collecting 2,700 learning rollouts per agent model. During training, UniCraft improves pooled task success on unseen scenarios and tasks by 9-28 percentage points on LIBERO-PRO, 10.8-13.3 on RoboTwin 2.0, and 3.1-14.4 on RoboCasa365 (Epochs 1-3). After training, with the learned skills frozen, UniCraft demonstrates zero-shot transfer across 4 new robot embodiments and 5 additional agent models on robosuite and RoboDojo.

版本更新 · v2arXiv:2606.23715

由马尔可夫逻辑网络定义的随机着色有向图

Random coloured digraphs defined by a Markov logic network

Yasmin Tousinejad, Vera Koponen

AI 速读 基于摘要

研究马尔可夫逻辑网络定义的随机有向图概率随域大小变化的极限行为,并给出判定所属情形的有效方法。

math.LO · cs.AI

查看原文摘要

A Markov Logic Network (MLN) $M$ is a probabilistic relational model used in Statistical Relational Artificial Intelligence for defining a probability distribution $P_D^M$ on the set $W_D$ of possible worlds with domain $D$ for an arbitrary finite domain $D$. An MLN consists of first-order formulas, which we call soft constraints, with associated weights which are nonnegative real numbers. The behaviour of the probability distribution, including the effect of the weights, on different domain sizes is poorly understood. We approach the problem in a systematic way by studying sequences $(P_n^M(ψ) : n = 1, 2, 3, \ldots)$ where $ψ$ is a first-order sentence and $P_n^M(ψ)$ is the probability that $ψ$ holds in $W_D$ where $D = [n] := \{1, \ldots, n\}$. We consider a first-order language that can express a property $P(x)$ and relation $R(x, y)$ and show that all of the following cases can be realized for an MLN $M$ such that each of its soft constraints is a boolean combination of $P(x)$, $P(y)$ and $R(x, y)$ in which both $x$ and $y$ appears: For every first-order sentence $ψ$, $P_n^M(ψ)$ converges to 0 or 1 as $n\to\infty$. For every first-order sentence $ψ$, $P_n^M(ψ)$ converges as $n\to\infty$ but not necessarily to 0 or 1. There is a first-order sentence $ψ$ such that $P_n^M(ψ)$ does not converge as $n\to\infty$. In fact, all three cases can be realized even after fixing the soft constraints and, for any $\varepsilon > 0$, by varying their weights by less than $\varepsilon$. We also show that, given any MLN as described above, we can efficiently determine which case it belongs to by inspecting the MLN. Then we show that if the weights are scaled by $1/n$ then we end up in case~(1) no matter how the weights are chosen.

新论文 · v1arXiv:2611.26370

基于少步采样的快速自监督生成式CT去噪

Fast Self-Supervised Generative CT Denoising via Few-Step Sampling

Xingyi Yao, Zhengtao Ma, Zhennong Chen

AI 速读 基于摘要

N2N-iMF 通过少步采样加速自监督生成式 CT 去噪,在保持图像质量的同时大幅缩短生成时间。

cs.CV

查看原文摘要

Low-dose and thin-slice computed tomography (CT) images suffer from elevated noise that obscures anatomical detail, while clean references for supervised denoising are often unavailable. Although Noise2Noise permits self-supervised training from noisy pairs, direct regression tends to oversmooth fine structure. Averaging multiple independently generated samples mitigates this blur, though repeating multi-step diffusion sampling is costly. We introduce Noise2Noise with Improved Mean Flow (N2N-iMF) to accelerate this process via few-step sampling. N2N-iMF learns to generate one noisy image conditioned on its paired counterpart; at inference, independent outputs are sampled and averaged to suppress noise. We evaluated image quality and sampling efficiency on simulated thin-slice brain and low-dose abdominal CT across four sampling methods and averaging counts from 1 to 20, and validated the approach on real-world photon-counting CT (PCCT) brain scans. With ten samples per conditioning input and three network evaluations per sample, N2N-iMF achieved a mean absolute error of 2.60 HU on brain CT and 14.02 HU on abdominal CT, outperforming 50-evaluation denoising diffusion implicit model (DDIM) sampling (2.91 and 14.53 HU). On the same GPU, per-output generation time dropped from 7.29 to 0.43 s. Across eight PCCT cases, N2N-iMF reached a mean gray-white matter contrast-to-noise ratio of 1.341, versus 0.916 for Noise2Noise and 1.176 for DDIM. N2N-iMF accelerates self-supervised generative CT denoising without distillation while keeping the number of averaged outputs adjustable at inference.

版本更新 · v2arXiv:2611.23035

在分页服务引擎中仅存储一次 Gemma 4 的 K=V 缓存:注意力核不变下的精确全局 KV 内存节省

Storing the Gemma 4 K=V Cache Once: Exact Global-KV Memory Savings in a Paged Serving Engine with Unchanged Attention Kernels

Kushagra Bainsla

AI 速读 基于摘要

作者提出在 Gemma 4 全局注意力层中只存储一行 640 个值,通过两个重叠的跨步视图分别作为 key 和 value 缓存,在不修改注意力核的情况下精确减少 KV 内存占用。

cs.LG · cs.CL · cs.DC

查看原文摘要

In the global attention layers of Gemma 4 31B, the value is the normalized key projection, and the key is the value scaled by a fixed weight, with rotary position encoding on one quarter of its dimensions. The Gemma 4 report states that this design reduces the global KV cache by up to 37.5%, but the open serving engines that we checked still store a full key and a full value: 1,024 values per KV head and token. We store one 640-value row instead, exact in real arithmetic, and an unchanged paged attention kernel reads it through two overlapping strided views as its key cache and its value cache. In a vLLM prototype with the 16-bit 31B model, the outputs are bit-identical to an emulation of the same arithmetic on the stock cache, 2 of 432 final answers differ from the stock engine (within its run-to-run noise), and the steady decode KV memory per request falls by a factor of 1.34 to 1.40 at 32K to 64K tokens. On a prefill/decode pair of two A100 GPUs with NIXL transfer and CPU offload, a decode engine with a full 15 GiB pool ran 1.38 times the stock decode tokens per step for 16K-token prompts (repeated to 0.06%) and 1.24 times for 8K-token prompts; a model of the vLLM block pool predicted both ratios to within 1% (the engine was 0.7% to 0.9% higher) and matched the change between them. The eager decode throughput rose by 1.30 and 1.11 times, and on this path the compact engine gave the same output tokens as the emulation for 8 prompts at batch 1. The run-time prototype makes an eager step 4% to 9% slower at equal batch, and the method does not yet stack with an 8-bit KV cache at the default scale.

新论文 · v1arXiv:2611.26367

基于热成像与3D-CNN的非接触式呼吸频率估计

Contactless Estimation of Respiratory Frequency Using 3D-CNN on Thermal Images

Federica Gioia, Filippo Pura, Alberto Greco, Dario Piga, Arcangelo Merla, Marco Forgione

AI 速读 基于摘要

作者提出一种直接在原始热视频上运行的3D卷积神经网络,无需复杂预处理和ROI跟踪即可估计呼吸频率。

cs.CV

查看原文摘要

Monitoring physiological parameters such as respiratory rate ($f_R$) is essential for diagnosing and managing various pathological conditions. Thermal imaging offers a promising contactless alternative to traditional methods, which often rely on partially invasive sensors or obtrusive wearable systems. However, existing approaches for $f_R$ estimation from thermal signals typically require extensive pre-processing and manual or semi-automatic region-of-interest (ROI) tracking, limiting their practical applicability. This study proposes a deep learning-based method for estimating $f_R$ directly from thermal videos, eliminating the need for complex pre-processing and ROI tracking. A 3D Convolutional Neural Network (3D-CNN) is developed to operate on raw thermal video data. To address challenges related to small datasets, the model is trained using data augmentation and transfer learning from synthetic datasets. Experimental results demonstrate that the proposed approach achieves a validation $R^2$ score of approximately 0.61 on both pre-processed and raw thermal videos. By simplifying the workflow, this method holds promise for enhancing the feasibility of thermal imaging in real-world applications, such as remote healthcare and driver monitoring in automotive applications.

新论文 · v1arXiv:2611.26366

世界模型更依赖学习先验而非视觉证据

World Models Favor Learned Priors over Visual Evidence

Han Xiao, Zhiyong Bao, Xiaotong Liu, Yanhao Chen, Qingqiang Wu

AI 速读 基于摘要

论文提出 TailWorld 基准与 RIFT 方法,研究世界模型能否从短视频中的物体运动证据推断当前物理规则,并迁移到新初始状态进行预测。

cs.AI

查看原文摘要

World models are increasingly used to simulate physical interactions, but training a separate model for each environment limits scalability. Cross-environment prediction requires identifying the current physical rule, which appearance alone may not reveal. We therefore study visual calibration: using object motion and interactions in a short video as direct evidence to infer the current rule and predict motion under that rule from a different initial state. However, differences in data availability across physical conditions can yield a long-tailed training distribution, biasing models toward common rules even when evidence supports rare ones. To study this challenge, we introduce TailWorld, which evaluates the transfer of demonstrated rules across initial states while independently controlling training imbalance and calibration informativeness. The benchmark compares predictions with two reference futures from the same prediction initial state, one following the demonstrated rule and the other a common rule, to measure prediction bias toward common dynamics. We further propose Rule Inference for Transfer (RIFT), which learns how different rules affect object motion, infers the current rule from calibration interactions, and applies it to prediction from a new initial state. RIFT explicitly controls the influence of training frequency on rule inference, allowing sufficiently informative observational evidence to support rare rules. Experiments on TailWorld show that RIFT improves prediction accuracy and physical consistency across varying training imbalances and distribution shifts, with gains in predicting rare dynamics.

版本更新 · v2arXiv:2610.05332

多类分类中的紧凑集值深度集成

Compact set-valued deep ensembling in multi-class classification

Kim-Dung Tran, Dang-Man Nguyen, Vu-Linh Nguyen, Xuan-Truong Hoang, Sébastien Destercke, Van-Nam Huynh

AI 速读 基于摘要

用紧凑深度集成产生概率预测并构造代表分布,再据此定义任意效用下的贝叶斯最优集值预测。

cs.LG

查看原文摘要

This paper tackles visible challenges in deep ensemble learning, where deep neural networks serve as ensemble members: training and storage burdens, and robustness of cautious (set-valued) predictions targeting multiple utilities, which may involve reward-sensitivity. To mitigate the training and storage burdens, we propose to employ compact ensembles, such as Bayesian Neural Networks and Convolutional Neural Networks with the Monte-Carlo dropout prediction option, to produce probabilistic predictions. For each query instance, these probabilistic predictions are then used to define a representative distribution optimizing some statistical distance. The representative distribution is then employed to define the Bayes-optimal prediction (BOP) of any utility. To address the potential unrobustness of singleton prediction making, we propose a family of set-utilities satisfying some desirable properties and whose set-valued BOPs can be found efficiently. Empirical evidence is then given to illustrate the potential (dis)advantages of the proposed ensemble learning framework.

版本更新 · v3arXiv:2605.05236

面向软体机器人的拓扑驱动防缠绕控制

Topology-Driven Anti-Entanglement Control for Soft Robots

Haoyang Le, Shengxuan Wang, Mohan Chen, Shuo Feng

AI 速读 基于摘要

提出拓扑驱动的多智能体强化学习框架 TD-MARL,通过集中学习共享拓扑状态、分布式执行与拓扑安全层,协调多机器人系统在受限环境中完成解缠操作。

cs.RO · cs.AI

查看原文摘要

In the field of precision manufacturing in complex constrained environments, the role of soft robots is increasingly prominent, and the realization of anti-winding control based on multi-intelligent body reinforcement learning has become a research hotspot. One of the core problems at present is to coordinate multiple robots to complete the unwinding operation in a highly constrained environment. The existing distributed training framework faces some observability challenges in high-density barrier and unstable environments, resulting in poor learning results. This paper proposes a topology-driven Multi-Agent Reinforcement Learning (TD-MARL) framework to coordinate multi-robot systems to avoid entanglement. Specifically, the critical network adopts centralized learning, so that each intelligent body can perceive the strategies of other intelligent bodies by sharing the topological state, thus alleviating the training instability caused by complex interactions; eliminating the demand for communication resources between robots through distributed execution, Upgrade system reliability; the integrated topological security layer uses topological invariants to accurately assess and mitigate the risk of entanglement to avoid the strategy from falling into local difficulties. Finally, the full simulation experiments carried out in the real simulation environment show that the method is better than the current advanced deep reinforcement learning (DRL) method in terms of convergence and anti-winding effect.

新论文 · v1arXiv:2611.26359

从上下文学习:跳跃扩散模型中的留一预测

Learning from Context: Leave-One-Out Prediction in Jump Diffusions

Christian Wald

AI 速读 基于摘要

研究跳跃扩散模型中留一预测(LOO)的理论性质,并实验表明基于LOO的变体在文本和分子图生成上优于无限制预测。

cs.LG

查看原文摘要

Continuous diffusion models generate discrete data through stochastic dynamics in an embedding space. We consider jump diffusions that additionally reset coordinates to embeddings of categorical values. A coordinate's own corrupted state can make prediction easy, potentially reducing the pressure to learn dependencies between coordinates. We study leave-one-out (LOO) prediction, in which each coordinate is predicted from the corrupted states of the other coordinates. We show that, under stated assumptions, jump diffusions with complete coordinate resets and state-independent clocks preserve the prescribed marginals when reset destinations use exact LOO probabilities and the drift uses the full endpoint posterior. We further show that this drift can be constructed from LOO probabilities by analytic likelihood completion without additional network evaluations. We evaluate unrestricted, LOO, and completed predictions on Text8 and LM1B text generation and ZINC250k molecular graph generation. LOO-based variants improve key generation metrics over matched unrestricted controls on all three datasets. Controlled interventions assess reliance on local inputs and context, and we analyze the effect of analytic likelihood completion.

新论文 · v1arXiv:2611.26358

Beam 模型技术报告

Beam Model Technical Report

Reflection Team, Adam Abdulhamid, Osama Abuelsorour, Yasmin Alameddine, Carlo Alfano, Duarte Alves, Brandon Amos, Selvaraj Anandaraj 等 230 位作者

AI 速读 基于摘要

Beam 是一个面向编码、推理与智能体工作负载的稀疏 MoE 模型,总参数 501.3B、激活参数 23.4B,作者报告其推理算力需求比同类模型低 3–4 倍。

cs.CL · cs.AI

查看原文摘要

Beam is a sparse Mixture-of-Experts (MoE) model with 501.3B total parameters and 23.4B active parameters, specifically built and optimized for coding, reasoning, and agentic workloads. Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class. Pretrained on 23.8T diverse, curated, high-quality tokens, Beam features a 1M-token context window achieved through a novel two-stage midtraining phase, built on verifiable, correctness-anchored data. Post-training leveraged a large-scale, fully asynchronous reinforcement learning (RL) campaign across 10.5K GB300 GPUs, generating over 100M rollouts over 4 weeks of training. We believe this is one of the largest scale RL runs conducted by any open lab to date. Across our evaluation suite, capabilities continued to improve as we increased RL compute, with no sign of a plateau. Supported by deep hardware-model co-design, FP8/NVFP4 quantization, and a 1.93B-parameter speculative decoding drafter (DFlash 2), Beam maximizes serving throughput with efficient, flexible deployment. Averaged across conversation turns and harm categories, Beam refuses or pivots on 88.9% of harmful requests while complying with 81.5% of harmless requests, achieving the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier.

版本更新 · v2arXiv:2606.22439

Curvature-aware 3D length estimation of greenhouse cucumbers using RGB-D imaging and cubic spline arc-length integration

Manveen Kaur, Rajmeet Singh, Saeed Mozaffri, Majid Ahmadi, Shahpour Alirezaee

原文摘要

Commercial greenhouse cucumber production is graded by fruit length, which drives harvest scheduling, labour allocation, and logistics. Manual measurement with thread or caliper is accurate but infeasible at commercial scale. This paper presents CucumberVision, a non-contact length estimation framework using an Intel RealSense D435 RGB-D camera. A YOLO26n instance segmentation model locates cucumbers, and SAM (ViT-B backbone) refines each detection to a pixel-precise mask. Five methods are evaluated under matched conditions: (M1) a dominant-axis skeleton scan-line baseline; (M2) PCA on the bounding-box depth point cloud; (M3) SAM mask with medial-axis skeletonisation; (M4) a hybrid keypoint-guided approach using a YOLO26-pose model predicting five anatomical landmarks (KP0--KP4) with piecewise 3D arc-length; and (M5) a novel medial arc spline method fitting a cubic spline through the 3D medial axis of the SAM mask and computing arc length by trapezoidal integration -- the first such application to elongated vegetable measurement. All methods share five-frame burst depth averaging, colour-stream intrinsic alignment, and adaptive method selection with cascading fallbacks ensuring 100% coverage. A benchmark of 48 captures across seven cucumbers in three size categories (small ~8 cm, medium ~13 cm, large ~25 cm) with thread-based ground truth establishes a significant accuracy hierarchy: M1 (MAPE 9.68%) > M2 (5.31%) > M4 (5.51%) > M3 (5.82%) > M5 (4.13%). M5 significantly outperforms all competitors at Bonferroni-corrected alpha=0.0125. A secondary contribution is identifying a 12--18% length underestimation caused by using depth-stream rather than colour-stream intrinsics after rs.align(rs.stream.color) -- an under-reported error source. The complete system is released open source and runs in real time on a single consumer-grade GPU.

cs.CV · cs.RO

新论文 · v1arXiv:2611.26355

Mamba Flow Matching Neural Processes: Linear-Time Inference for Irregularly Observed Spatial Fields

Cosmo Santoni, Giovanni Charles, Timothy James Hitge, Oliver Watson, Elizaveta Semenova

原文摘要

Interpolating a spatial field, such as daily maximum temperature, from sparse, irregularly located observations recurs across the environmental and health sciences. Standard Gaussian-process kriging refits hyperparameters and solves an $O(N^3)$ system for every new field. When many related fields are observed, such as daily maps from one sensor network, neural processes (NPs) instead learn the interpolation map from past fields and predict a new field in one forward pass. Joint-predictive variants, which sample whole fields rather than independent per-location values, typically use self-attention over context and query points, costing $O(K^2)$ in the combined point count $K$ and limiting practical use to a few thousand points. State-space models offer a linear-time alternative, but a direct state-space adaptation compresses the context into one hidden state before reading queries, reducing what the decoder sees. We propose MambaFlowNP, a linear-compute joint-predictive NP trained with conditional flow matching. A multi-directional Mamba-2 scan reads context and query tokens in one shared sequence, so each query's velocity is read from its own scan position rather than a compressed context summary, and because queries only read the scan state, predictions are consistent across query sets. MambaFlowNP is competitive with the strongest attention-based joint-predictive baselines on synthetic Matérn Gaussian-process benchmarks, and on regional to continental-scale NOAA temperature interpolation it attains the lowest RMSE and CRPS and near-nominal coverage on every tier, while running 114--784$\times$ faster than the strongest joint-predictive baseline. A single forward pass scales to $10^6$ points on one NVIDIA L40S GPU in under a second. This makes joint prediction feasible for continental-scale, irregularly sampled sensor networks; predictive quality is evaluated up to $K=5{,}580$.

cs.LG

新论文 · v1arXiv:2611.26353

当怀疑累积时:优化蜜罐内鬼威胁检测的随机框架

When Suspicion Adds Up: A Stochastic Framework for Optimizing Honeypot-Based Insider-Threat Detection

Saharnaz Mehrani, Lujia Zhan, Mohsen Emadikhiav, Payman Dehghanian

AI 速读 基于摘要

作者提出一个基于连续时间马尔可夫链的决策框架,联合选择蜜罐数量与监控时长,以最小化恶意活动与误报带来的期望损失。

math.OC · cs.CR

查看原文摘要

Insider threats pose security risks when employees or other trusted users misuse their access to organizational systems. Detecting these threats is difficult because harmful activity can resemble routine behavior. Honeypots, or decoy resources monitored for suspicious interactions, can provide evidence of potentially malicious activity. We develop a decision framework that models evidence accumulation through honeypot interactions using a continuous-time Markov chain and jointly selects honeypot counts and monitoring horizons to minimize expected losses from malicious activity and false detections. For thresholds of two and three interactions, we derive closed-form true- and false-detection probabilities and expected detection times conditional on detection within the monitoring horizon. We characterize boundary cases and establish stochastic-ordering results. Our numerical results highlight the value of the proposed framework across different settings.

新论文 · v1arXiv:2611.26351

TRCF:面向不规则多元时间序列的时间参考互补预测

TRCF: Temporal-Reference Complementary Forecasting for Irregular Multivariate Time Series

Xudong Zuo, Shusen Ma, Qirui Chen, Bing Fan, Yun-Bo Zhao

AI 速读 基于摘要

TRCF 通过为紧凑的通道独立预测器增加一个互补的通道依赖分支,在不规则多元时间序列预测中同时利用跨变量信息并保留各变量的不规则历史。

cs.LG

查看原文摘要

Irregular multivariate time series forecasting supports healthcare monitoring, environmental analysis, and activity recognition. Channel-independent (CI) approaches capture each variable's temporal patterns but do not explicitly use observations from other variables. Channel-dependent (CD) modeling exploits relationships among variables, yet asynchronous measurements make these relationships difficult to learn. Incorporating cross-variable information while preserving each variable's irregular history therefore remains a key challenge. We propose Temporal-Reference Complementary Forecasting (TRCF), a framework that augments a compact CI forecaster with a complementary CD branch. ANCHOR aggregates observed values and timestamps at shared temporal locations, retaining observation support to form compact CI features. BRIDGE constructs complementary features through history completion. It first estimates each variable's historical values from its own observations, then uses differences between other variables' observed and estimated values at nearby times to correct missing entries. The completed history preserves observed values and is encoded to supply context alongside the direct CI representation. Finally, the two representations are fused, combined with the query-time embedding, and passed to a shallow multilayer perceptron for forecasting. Experiments on four real-world datasets show that TRCF achieves the lowest mean squared error and mean absolute error in the main benchmark comparison, while reducing measured peak inference memory by 17.28% to 87.98% relative to APN.

新论文 · v1arXiv:2611.26350

PUPPET:用于临场感、具身与远程操作物理统一平台

PUPPET: Physical-Unified Platform for Presence, Embodiment, and Teleoperation

Mahika Vats, Milan Groshev, Carlos Gomez Cubero, Eduardo Castelló Ferrer

AI 速读 基于摘要

PUPPET 通过持续同步的 VR 副本和试验验证流程,提升远程操作任务表现与实验记录可复用性。

cs.RO

查看原文摘要

Remote access to robotics hardware does not by itself guarantee usable experimental data. A teleoperated trial can complete the task and still produce an incomplete or inconsistent record. PUPPET aims to solve this problem by presenting a cyber-physical framework that opens a physical robotics laboratory through a continuously synchronized VR replica of the robot, stranding environment, and task objects. In addition, PUPPET integrates a trial validation pipeline built into the experimental workflow. We evaluated PUPPET in a within-subject study with 30 participants, who performed the same table-to-shelf object-transfer task in person, through 2D teleoperation, and through PUPPET. VR reduced post-learning completion time by 27.7% over 2D (68.7,s vs. 95.0,s), statistically indistinguishable from in-person execution (72.1,s). It also produced more validation-ready (85.6% vs. 66.0%) and intervention-free (89.7% vs. 67.2%) trials. With PUPPET we show that modality shapes the remote task performance and the reusability of the resulting experimental record.

新论文 · v1arXiv:2611.26349

Perfumer:基于大语言模型的智能体框架加速第一性原理计算中的结构弛豫与电子能带预测

Perfumer: A Large Language Model-based Agentic Framework Accelerating Structural Relaxation and Electronic Band Prediction for First-Principle Calculation

Zhiwei Li, Yuhao Zhou, Yikai Yang, Haonan Wang, Qing Ye, Jiancheng Lv, Kazunari Matsuda

AI 速读 基于摘要

Perfumer 是一个基于大语言模型的智能体框架,耦合 Quantum ESPRESSO 与两个预测模型,加速结构弛豫和电子能带预测。

cond-mat.mtrl-sci · cs.LG

查看原文摘要

First-principles structural relaxation and band calculations require substantial computation and expertise. Here we present Perfumer, a large language model-based agentic framework that couples Quantum ESPRESSO with two predictive models. Across tested structures, pre-relaxation with Perfumer-relax model followed by QE refinement yielded a 2.75-fold overall speedup over QE alone. Perfumer-band model combines a periodic graph neural network with a latent Hermitian spectral head returns 12 band energies at any requested wavevector, preserving reciprocal lattice periodicity and time-reversal symmetry without constructing Hamiltonian. Trained on 125,153 self-curated band structures, Perfumer-band model reaches a median per-material mean absolute error of 0.157 eV on 2,607 test materials, including lanthanide, actinide and magnetic compounds, from held-out composition families spanning 85 elements, taking about 97 ms per material on two consumer CPU cores. The agent turns natural-language requests into relaxation-to-band workflows, from a single uploaded structure to automatically constructed new candidates and returns predicted properties.

新论文 · v1arXiv:2611.26347

OffBeat:超越相机帧率的四维捕捉多陪集采样

OffBeat: Multicoset Sampling for 4D Capture Beyond the Camera Frame Rate

Chi-Wei Lee, An-Kai Chen, Cheng-Han Chiang, Yi-Chun Chang, Po-Chih Kuo

AI 速读 基于摘要

OffBeat 将交错触发多相机装置建模为空间分布的多陪集采样器,通过仅改变各相机触发时机,在相同帧数下捕捉更快运动并提升动态区域重建质量。

cs.CV · eess.IV

查看原文摘要

For 4D reconstruction, a synchronized multi-camera rig records all views at the same timestamps and misses the motion between them. Staggered triggers spread the same frames over more timestamps. However, when the cameras along each row fire one after another, as in 4DSloMo's schedule on the N3DV rig, the row acts as one moving camera that confounds depth with motion. We introduce OffBeat, which models a staggered rig as a spatially distributed multicoset sampler: shifted copies of one sampling grid. From the calibration alone, OffBeat derives camera groups that fire together and their firing order. Since one group records each timestamp, a short-lived primitive can fit an error its cameras share, such as a color offset, and flicker in novel views. We show that a primitive's opacity over time weights all groups equally, for every number of groups, only if it lasts at least one camera frame interval. On Spacetime Gaussians, a minimum lifetime approximates this bound, and a closed-form smoothed box of that length satisfies it exactly, with less flicker than a Gaussian in its place at nearly equal PSNR. In simulated staggered capture on N3DV, OffBeat outperforms the full 4DSloMo pipeline with video diffusion on every test frame, by 3.04 dB in mean dynamic-region PSNR. Between the first and last synchronized frame, it outperforms the best synchronized method of each scene, with or without frame interpolation, by 1.98 dB in mean dynamic-region PSNR, while synchronized capture is better at its own frames. On PanopticSports, in this frame range, OffBeat is comparable in PSNR to synchronized capture with interpolation. On every N3DV scene, replacing 4DSloMo's schedule with ours raises the dynamic-region PSNR of Spacetime Gaussians, 4DSloMo without diffusion, and our reconstruction. Multi-camera rigs could follow faster motion at the same frame count by changing only when each camera fires.

版本更新 · v2arXiv:2611.18714

如何构建道德能动者:情感主义与理性主义作为审视AI的透镜

How to make a moral agent: sentimentalism and rationalism as lenses on AI

David Gottlieb, Jared Moore

AI 速读 基于摘要

作者提出一个描述性道德能动性研究纲领,从哲学与道德心理学中提取人类道德能动性的候选能力,并建议将其细化为可在AI系统(尤其是LLM)中检验的实证方案。

cs.AI · cs.CL

查看原文摘要

Can AI systems be moral agents? That is, can they undertake actions that can be correctly assessed as morally right or wrong? There is no settled normative criterion of moral agency that applies neatly outside paradigm human cases. Because of the difficulties with a normative account, we instead propose a research program to explore descriptive moral agency. Most basically, we ask, what are the capabilities we humans possess that underlie our moral agency? To do so, we draw on historical scholarship in philosophy and moral psychology to isolate candidate capabilities. Then we suggest refining candidate capabilities so that they are testable in the context of AI systems. Finally, we offer specific empirical recommendations to test AI systems, especially large language models (LLMs), for those refined capabilities. Our approach offers several benefits. Firstly, it may demonstrate whether the behaviors of AI systems are aligned, or in a broad sense desirable. Secondly, the debate may inform policy questions (e.g., what models should be deployed in which contexts?). Thirdly, our approach may complement engineering and design efforts: when capabilities can be precisely characterized, they can inform the development of models. Fourthly, applying our moral reasoning concepts in the new context of AI systems should improve our understanding of those concepts.