跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+806新增论文
+644其中 AI 相关
+92已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

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

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 21,358 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.17103

面向无数据模型合并的联合零空间投影

Joint Null-Space Projection for Data-Free Model Merging

Tian Xia

AI 速读 基于摘要

提出无需数据的闭式联合零空间投影(JNSP),通过去除各任务向量在其它任务输入子空间中的分量来缓解任务向量干扰,并在 CLIP 图像分类任务上报告了优于参数级免训练基线的合并精度。

cs.CV · cs.LG

查看原文摘要

Merging independently fine-tuned checkpoints into a single multi-task model requires no data, no labels, and no gradient steps. In practice the task vectors of different tasks interfere, and the standard remedies--averaging, magnitude pruning, sign election--operate entry by entry, ignoring that each delta induces a low-dimensional update on the hidden features it acts upon. We recast merging as a subspace interference problem. For every two-dimensional weight tensor we take the top-r right-singular subspace of each task's delta--the input directions along which that task moves the representation most--and remove from each task vector the component lying in the union of the other tasks' subspaces. The resulting Joint Null-Space Projection (JNSP) is closed-form and order-independent, needs no forward pass, and is defined entirely by the checkpoint set. On eight CLIP image-classification tasks JNSP merges ViT-B/16 experts to 89.45% average accuracy without using a single image, 11.88 points above the strongest parameter-wise training-free baseline (TIES-Merging, 77.57%), 14.22 above Task Arithmetic, and 0.98 above WUDI's data-free consensus merge (88.47%). The gain holds across three backbones on the independently trained TALL release (+10.8, +12.6, +9.1 over TIES for ViT-B/16, ViT-B/32, ViT-L/14) and replicates there at 89.20%; controls confirm the source--a single shared subspace instead of per-task ones loses 2.9 points, and a sequential variant collapses to 69.6%. On RoBERTa-large the same projection underperforms plain task arithmetic, which we report rather than hide. Code is available at https://github.com.

新论文 · v1arXiv:2611.17102

关于密码学非线性全有或全无变换

On cryptographically non-linear all-or-nothing transforms

Anantajeet Devaraj, Navid Nasr Esfahani

AI 速读 基于摘要

该论文研究无条件安全的密码学非线性(t,s,v)-AONT,区分非可加性、非仿射性与密码学非线性,并给出枚举方法与由线性AONT构造非可加AONT的方案。

cs.CR

查看原文摘要

An unconditionally secure $(t, s, v)$-all-or-nothing transform (AONT) is a bijection from $s$ input elements to $s$ output elements over an alphabet of size $v$, such that given any $s - t$ output elements, no information can be obtained about any $t$ input elements. While linear AONTs have been extensively studied, comparatively little is known about the existence of non-linear AONTs. In this paper, we investigate unconditionally secure cryptographically non-linear $(t, s, v)$-AONTs, distinguishing between non-additivity, non-affinity, and cryptographic non-linearity. To achieve this, we first present a computational method for enumerating general AONTs focusing on the case $(t, 3, 3)$-AONTs for $t = 1 and 2$, establishing the existence of non-additive AONTs. We then introduce a general construction of non-additive AONTs from linear ones using coordinate-wise symbol permutations. We measure the non-linearity of the AONT instances generated from this construction, using differential $Δ_F$-uniformity and Walsh magnitude. Finally, we establish theoretical conditions under which $Δ_F$-uniformity is reduced and present statistical results examining the non-linearity of AONTs obtained through our construction.

新论文 · v1arXiv:2611.17101

一种结合滤波器组卷积的紧凑型xDAWN引导时空网络用于P300检测

A Compact xDAWN-Guided Spatio-Temporal Network with Filter-Bank Convolution for P300 Detection

Mohammad Mahdi Habibi Bina, Mohammad Reza Daliri

AI 速读 基于摘要

作者提出一种仅含5100个可训练参数的紧凑深度学习架构,将xDAWN空间滤波、固定滤波器组与深度可分离卷积结合用于P300检测,并在两个公开基准上报告了准确率与速度的折中表现。

cs.HC · cs.AI

查看原文摘要

P300-based brain-computer interfaces (BCIs) enable communication by decoding stimulus-evoked EEG responses into character selections without requiring voluntary motor output. Reliable P300 detection remains difficult because of low response amplitude and signal-to-noise ratio, while practical spellers require accurate character selection with few stimulus repetitions and low computational cost. We propose a compact deep learning architecture that combines xDAWN spatial filtering for event-related potential enhancement and dimensionality reduction, a fixed frequency-selective filter bank, and convolutional feature learning for spatio-temporal EEG decoding. Depthwise-separable convolutions and progressive average pooling reduce computational complexity while retaining discriminative temporal information. The resulting target/non-target classifier contains only 5,100 trainable parameters. We evaluated the model on two public benchmarks, BCI Competition II Dataset IIb and BCI Competition III Dataset II, and compared it with established P300 decoding methods across different numbers of stimulus repetitions. The model achieved an information transfer rate of 17.8 bits/min with two repetitions on BCI Competition III and 40.5 bits/min on BCI Competition II, demonstrating a favorable accuracy-speed trade-off. These results suggest that combining domain-informed spatial and spectral priors with compact neural networks can support efficient P300 decoding for EEG-based BCI communication.

新论文 · v1arXiv:2611.17098

速度即算力:美国本土 AI 数据中心供电的技术经济分析

Speed-to-Power Dominates Energy Costs for AI Data Centers: Technoeconomic Analysis of Powering AI in the Continental United States

Alex C. Newkirk, Daniel L. Gerber, Erica R. H. Fuchs, Alex Hubbard, M. Granger Morgan, Arman Shehabi, Sarah J. Smith, Constantine Samaras

AI 速读 基于摘要

作者提出“速度调整后的度电成本”,把建设速度带来的算力收益纳入比较,发现直流耦合微电网因部署更快,在多数美国地点成为经济上最优的 AI 数据中心供电方案。

cs.AI · eess.SY

查看原文摘要

The rapid growth of artificial intelligence is driving demand for new data centers at large scale and on short deployment timelines. To power them, firms connect to the commercial grid or contract generation directly, but interconnection and gas-turbine delays now incentivize on-site generation. We compare grid-connected and off-grid data center energy infrastructure (AC- and DC-coupled solar-plus-storage, islanded natural gas, and grid interconnection) across the continental U.S. Using an open-source technoeconomic framework built on empirically calibrated AI training loads, climate-driven cooling, stage-by-stage power conversion, and physics-based battery degradation, we model designs providing equivalent energy services. Our central contribution is a speed-adjusted cost of energy that values the compute unlocked by faster construction, making options with different deployment timelines directly comparable on one physically consistent basis. We find DC coupling reduces lifetime energy costs by 18% ($0.09/ kWh) on average versus AC counterparts by eliminating inverters and improving efficiency. Though rarely cheapest on unadjusted energy cost, DC-coupled microgrids' faster deployment makes them the lowest-cost modeled option in 85% of U.S. locations once foregone compute is valued, or 55% under accelerated natural gas timelines. For AI infrastructure, deployment speed rather than unit energy cost determines the economically preferred path to power.

新论文 · v1arXiv:2611.17097

广播而非复制:消除数据中心大语言模型服务中的权重HBM

Broadcast, Don't Replicate: Eliminating Weight HBM in Datacenter LLM Serving

Hannah Atmer, Yuan Yao, Thiemo Voigt, Stefanos Kaxiras

AI 速读 基于摘要

提出光学广播内存(OBM)架构,用集中式光纤广播替代在数万加速器本地DRAM中复制只读模型权重,以消除权重HBM。

cs.AR · cs.DC · cs.ET · cs.NI

查看原文摘要

Large language model (LLM) inference at datacenter scale is fundamentally bottlenecked by memory capacity and bandwidth limits. Because model weights are read-only and identical across instances, conventional architectures that replicate these parameters across the local DRAM of tens of thousands of accelerators incur massive capital expenditures, significant static power dissipation, and redundant memory-fetch energy. A recent proposal to use optical fiber loops as delay-line memory alleviates these issues, but its recirculating loop must hold the whole model: loop length grows with model size, slack is fixed when the ring is built, and the layouts that serve modern Mixture of Experts (MoE) models efficiently do not fit in it. We propose Optical Broadcast Memory (OBM), an open-ended hierarchical Tap-and-Amplify fiber architecture that generalizes and replaces the optical ring paradigm. A centralized memory server continuously broadcasts weights to distributed inference nodes that passively tap the data stream using receive-only co-packaged optics, delivering parameters directly to compute units without intermediate buffering. To overcome the limitations of continuous weight streaming, we use dynamically-sized slack to accommodate large and variable context lengths. We show how removing the restrictions of the optical ring allows OBM to efficiently serve MoE models. Evaluated at a datacenter scale of 80,000 accelerators, OBM eliminates petabytes of HBM while being competitive or better in throughput and energy per token than an HBM-based system.

版本更新 · v2arXiv:2508.09082

低连通度广义自行车码:最小距离界与竞争性电路级性能

Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Competitive Circuit-Level Performance

Reza Dastbasteh, Olatz Sanz Larrarte, Arun John Moncy, Paul Schnabl, Pedro M. Crespo, Josu Etxezarreta Martinez, Ruben M. Otxoa

AI 速读 基于摘要

该文为低连通度广义自行车(GB)码给出超越经典码技术能力的最小距离上下界,构造两类高度简并的连通度四码族并分析其容错逻辑门与电路级噪声性能。

cs.IT · cs.DM · quant-ph

查看原文摘要

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes that go beyond the capabilities of techniques based on classical codes. These bounds are shown to capture the true minimum distance for specific subclasses within the GB family. In particular, we demonstrate the existence of two highly degenerate GB code families with parameters $[\![d^2+1,2,d]\!]_2$ for odd $d \geq 3$ and $[\![d^2,2,d]\!]_2$ for even $d \geq 4$, both having qubit connectivity of four, similar to that of surface codes. For the odd-distance family, we analyze the structure of low-weight logical Pauli operators and establish the existence of a fault-tolerant logical CNOT gate between the two logical qubits, achievable via a simple relabeling of data qubits. Next, using nearly self-inverse polynomials, we extend our results to construct an infinite class of connectivity-six GB codes with an improved rate. For GB codes based on these polynomials, we further present a technique to realize transversal logical CNOT gates via data-qubit permutations. We further construct syndrome extraction schemes for our connectivity four GB families that avoid reductions in minimum distance due to circuit-level faults propagating from check qubits to data qubits. Finally, we numerically evaluate the logical error rate performance of the mentioned connectivity four families of GB codes under circuit-level noise, obtaining thresholds comparable to those of rotated surface codes.

新论文 · v1arXiv:2611.17094

GRID-MRI:协同网络物理攻击下电力系统的韧性评估

GRID-MRI: Resilience Assessment of Power Systems under Coordinated Cyber-Physical Attacks

Isaac Ortega Romero, Ioannis Zografopoulos

AI 速读 基于摘要

提出多维韧性指数 GRID-MRI,用反事实仿真量化协同网络物理攻击与外部压力对电力系统韧性的非加性影响。

eess.SY · cs.CR

查看原文摘要

The increasing penetration of inverter-based resources and growing cyber-physical interdependencies expose electrical power systems to disturbances that challenge conventional resilience assessments. Existing approaches often evaluate resilience dimensions independently, overlooking the non-additive effects of coordinated disruptions and the influence of exogenous stressors. To address this gap, this paper proposes a Grid Multidimensional Resilience Index (GRID-MRI) that integrates endogenous disruption severity, coordination effects, and climatic and economic-regulatory conditions. The framework quantifies physical, cyber, and operational degradation, identifies interaction effects through counterfactual (i.e., what-if), simulations of individual and coordinated attacks, and incorporates exogenous stressors as scenario-dependent scaling factors. Its application to a modified IEEE 39-bus system under three escalating cyber-physical attack scenarios, informed by the December 2025 Polish cyberattack incident, reveals that coordinated attacks induce system collapse despite stable individual and additive responses. The corresponding resilience losses are 3.72 and 4.09 times their additive estimates, while GRID-MRI increases from 0.062 to 1.188 and reaches 6.081 under additional exogenous stress. These findings demonstrate the limitations of additive assessments and establish a quantitative basis for distinguishing the dominant mechanisms of multidimensional resilience degradation.

新论文 · v1arXiv:2611.17093

FlinkEval:用于评估流式 SQL 自然语言接口的合成语料库

FlinkEval: A Synthetic Corpus for Evaluating Natural Language Interfaces to Streaming SQL

Alfio Massimiliano Gliozzo, Nandana Mihindukulasooriya, Gaetano Rossiello, Erick Lee, Lisa Amini

AI 速读 基于摘要

作者提出一个基于执行验证的合成基准 FlinkEval,用 3,903 个问题–SQL 对评估面向流式 SQL 的自然语言接口。

cs.DB

查看原文摘要

Existing natural-language-to-SQL benchmarks primarily evaluate queries over bounded relational data, leaving streaming semantics underexplored. We introduce FlinkEval, an execution-grounded synthetic benchmark comprising 3,903 question--SQL pairs across 45 industry domains and 45 semantic labels. We create diverse schemas and domain-plausible, temporally consistent data through iterative generation and validation. SQL patterns collected from the human-written NL2SQL pairs and vendor documentation drive quota-balanced generation, and execution with a repair loop on Confluent Cloud Apache Flink produces reference queries covering windowing, temporal joins, pattern matching, nested types, and data manipulation. The corpus includes paired schema-explicit and business-language requests, with annotations for analysis by query pattern, complexity, and execution mode. A seven-level Question Specification Ladder examines semantics-preserving reformulation and underspecified requests augmented with oracle-derived clues. Baseline evaluations combine execution outcomes with adjudicated LLM judgments, revealing challenges in pattern composition and request specification.

新论文 · v1arXiv:2611.17091

面向可证明安全语言隐写的最优单历史分词消歧

Optimal Single-History Tokenization Disambiguation for Provably Secure Linguistic Steganography

Feng Jiang

AI 速读 基于摘要

作者提出 coin projection 方案,在单历史接收器下用共享随机性固定前缀森林上的停止决策,以逼近可证明安全语言隐写中分词消歧的熵界。

cs.CL · cs.CR

查看原文摘要

Provably secure linguistic steganography assumes that the receiver recovers the sender's tokens, but a text channel delivers only text, and ambiguous tokenizations break extraction. Existing fixes change the distribution, synchronize whole pools of tokens at a capacity that collapses with large vocabularies, or track several token histories. We prove that if extraction is exact and error-free across full-support language models, a single-history receiver is confined to a prefix-free candidate set at every step -- even if it reads the entire future text and the sender constrains later steps -- and must therefore give up the stop entropy, the entropy of deciding whether each prefix token ends there. Fixing these stop decisions on the prefix forest with shared randomness yields coin projection: a closed-form scheme that attains the bound, works with any distribution coder in one model call per token, preserves ordinary sampling, and refines SyncPool for every key. Across English, Chinese and Japanese, ambiguous text is rare (at most 11 in 1,000 tokens), yet the stop entropy at word and morpheme prefixes takes 7.2-9.0% of the entropy at every step; SyncPool's further loss comes from space and single-byte UTF-8 hubs that merge subtrees while carrying almost no stop uncertainty. Coin projection keeps 91-93% of the string entropy for the coder at every vocabulary size; with the full vocabulary, it turns 2.16-6.85 times as much entropy into message bits as SyncPool and recovers every completed message.

新论文 · v1arXiv:2611.17090

基于平移几何尺度的在线运输问题

Online Transportation via Shifted Geometric Scales

John Jeang

AI 速读 基于摘要

作者提出一种竞争比为 ρ(m-1)+1(ρ≈5.64)的在线运输算法,通过平移几何搜索尺度来改进已有结果。

cs.DS

查看原文摘要

In the Online Transportation problem, introduced by Kalyanasundaram and Pruhs (1995), requests arrive sequentially in a metric space and must be assigned immediately and irrevocably to one of $m$ facilities with available capacity. The objective is to minimize the total distance between requests and their assigned facilities. The problem generalizes the Online Metric Matching problem, in which each facility has unit capacity, and inherits a $2m-1$ lower bound on the competitive ratio for all deterministic algorithms. For Online Metric Matching, Kalyanasundaram and Pruhs (1993) and Khuller, Mitchell, and Vazirani (1994) established an optimal deterministic competitive ratio of $2m-1$, attained by the Retrospective (Permutation) algorithm. Kalyanasundaram and Pruhs (1998) conjectured that the same ratio is achievable for online transportation. Recently, Seth, Das, and Raghvendra (2026) obtained a competitive ratio of approximately $6.66m-2.89$ using their Robustified Greedy algorithm. We give an algorithm with competitive ratio $ρ(m-1)+1$, where $ρ\approx5.64$. Our algorithm builds on minimum-spanning-tree search techniques developed by Harada and Itoh (2025) and Arndt, Moseley, Pruhs, and Uetz (2026), using priority-based virtual depth-first searches over the known facilities. However our algorithm uses a phase to shift the geometric search scales, to decide when to skip certain searches and optimize the thresholds that define what edges to include in a given search.

版本更新 · v3arXiv:2611.08577

美团机器人-0:面向桌面操作视觉-语言-动作基础模型

Meituan-Robotics-0: A Vision-Language-Action Foundation Model for Desktop Manipulation

Meituan Robotics Team, Caicheng Wang, Chen Zhao, Chengpeng Jin, Duo Xu, Fengjiao Chen, Guanglu Wan, Heqing Yang 等 38 位作者

AI 速读 基于摘要

MR0 是一个面向固定底座桌面操作的视觉-语言-动作基础模型与具身智能体系统,通过三阶段训练和 Rollback 数据机制实现跨本体控制与任务恢复。

cs.RO · cs.CV

查看原文摘要

We present Meituan-Robotics-0 (MR0), a vision-language-action foundation model and embodied-agent system for stationary-base desktop manipulation. MR0 combines 147 million vision-language samples with 15,060 hours of curated robot trajectories spanning 12 embodiments. A three-stage training recipe aligns multimodal representations with robot behavior through discrete action-token pre-training, transfers these priors to continuous cross-embodiment control through flow-matching mid-training, and adapts the policy through real-world post-training. We introduce Rollback, which pairs replaced policy segments with human corrections to provide positive and negative supervision for CFG-DAgger without value learning or advantage labeling. A unified end-effector interface supports heterogeneous embodiments, while asynchronous action-chunk merging maintains smooth execution under variable inference latency. An event-driven agent maintains persistent task events and reassesses plans when progress or feasibility changes, enabling cross-task retrieval and conditional task resumption. MR0 achieves 93.6% success on RoboTwin 2.0 and ranks fifth in the RoboDojo VLA track. Under matched HG-DAgger post-training, MR0 achieves higher average success rate and progress score than $π_{0.5}$ across three real-robot tasks. On Ethernet insertion, CFG-DAgger trained with Rollback data reaches 70% success and a progress score of 0.90. Qualitative agent deployments demonstrate cross-task event retrieval and recovery from temporarily unsatisfied task conditions.

版本更新 · v2arXiv:2308.02666

用自动学习的谓词更快求解《见证者》三角谜题

Solving Witness Triangle Puzzles Faster with an Automatically Learned Predicate

Justin Stevens, Vadim Bulitko, David Thue

AI 速读 基于摘要

作者报告通过自动学习一个可解释的谓词来预测部分路径能否补全为解,从而在保持搜索完备性的前提下加速《见证者》谜题搜索。

cs.AI

查看原文摘要

The Witness is a game with combinatorial puzzles that are challenging for both human players and AI solvers. Search-based AI solvers can require large amounts of time to solve such puzzles. We accelerate search by automatically learning a predicate that predicts whether a partial path to a Witness puzzle is completable to a solution path. We demonstrate that our learned predicate is human-explainable, which makes it amenable to proofs, and we prove a key property that allows us to use it for pruning successor states in search. Doing so accelerates search by about six times while maintaining search completeness. Conversely, given a fixed time budget per puzzle, our predicate-accelerated search can solve more puzzles of larger sizes than a baseline search using a hand-coded predicate. Finally, we empirically demonstrate how accelerating search using an automatically learned predicate can outperform two competitors, weighted A* and Levin tree search with neural networks, in terms of time and number of nodes expanded.

新论文 · v1arXiv:2611.17084

扩展式博弈中的策略性披露与认知操纵

Strategic disclosure and epistemic manipulation in extensive games

Sergei Artemov, Benjamin Prud'homme

AI 速读 基于摘要

作者提出一个博弈论框架,用来刻画代理人通过选择性披露自身未来行动的真实信息来影响对手,并在一个二人交替行动的认知博弈案例中证明:操纵者至多披露 n 次,就能实现所有可诱导结果。

cs.LO

查看原文摘要

In many strategic settings, agents can influence opponents by selectively disclosing truthful information about their own future actions. We introduce a game-theoretic framework to model this phenomenon. As a case study, we consider a two-player, alternating-move epistemic game in which Player A evaluates actions under a conservative maximin rule, while Player B-the manipulator-leverages this behavior by strategically revealing commitments. We prove that the manipulator can implement every inducible outcome using at most n disclosures in a binary game of depth 2n with n decisions per player. This establishes a sharp contrast between the game tree's exponential size and the linear amount of information required to control the outcome, highlighting a general mechanism by which limited information can exert disproportionate strategic influence.

版本更新 · v3arXiv:2602.15919

无需重训模型评估逐样本成员推断脆弱性

Assessing Per-Sample Membership Inference Vulnerability without Retraining

Valentin Dorseuil, Jamal Atif, Olivier Capp{é}

AI 速读 基于摘要

作者提出一种仅需单个已训练模型、无需影子模型的逐样本成员推断攻击(MIA)脆弱性替代评分,并在实验中报告其优于损失与梯度范数基线。

stat.ML · cs.AI · cs.LG

查看原文摘要

Recent work in the privacy literature shows that sample-targeted membership inference attacks (MIAs) significantly outperform untargeted approaches by a wide margin. Motivated by this observation, we address the following question: can the privacy vulnerability of individual training points be assessed without training shadow models? We show that per-sample exposure to MIA is governed not only by a point's loss, but also by a data-dependent geometric measure. In the linear setting, we derive a closed-form decomposition of individual black-box MIA vulnerability into a population leverage score and a residual loss term, making explicit how sample-dependent geometry translates into privacy exposure. Since the final layer of most modern architectures is linear, we extend this framework to deep networks and propose a surrogate score operating on last-layer representations that requires only a single trained model and no shadow models. Empirical evaluations across diverse datasets and architectures show that our score outperforms loss and gradient-norm baselines at identifying the highest-risk points under state-of-the-art attacks, providing a computationally efficient and theoretically grounded tool for per-sample privacy risk assessment.

新论文 · v1arXiv:2611.17077

SALT:面向遥感单时相跨数据集结构定位的状态对齐低秩迁移

SALT: State-Aligned Low-Rank Transfer for Single-Temporal Cross-Dataset Structural Localization in Remote Sensing

Aggelos Psiris, Georgios Angelidis, Giorgos Sfikas, Maria Vakalopoulou, Thomas Lagkas, Panagiotis Sarigiannidis, Georgios Th. Papadopoulos

AI 速读 基于摘要

SALT 提出一种状态对齐低秩迁移框架,在冻结 DINOv3 主干下学习正负结构状态,实现单时相跨数据集遥感结构定位。

cs.CV

查看原文摘要

Change detection in remote sensing conventionally relies on spatially aligned bi-temporal imagery, which may be unavailable or unreliable in practical scenarios. Recent single-temporal approaches address this limitation by learning structural evidence, such as building regions, from a labeled source dataset and transferring it to unseen target imagery using only the current image. However, adaptation to the source dataset can over-specialize pretrained features and reduce their cross-dataset generalization, a risk that this paper argues is higher when the feature adaptation is parameterized independently of the states used for prediction. To address this issue, the current study introduces SALT, a State-Aligned Low-Rank Transfer framework. SALT keeps a DINOv3 backbone frozen and learns negative and positive structural states that both score each patch and, through State-Aligned Low-Rank Adaptation (SALA), span the rank-2 subspace in which patch features are corrected. Directional State Alignment supervises these corrections to raise the evidence of positive patches and lower that of negative ones, while Geometry Preservation limits changes to the pairwise relations among pretrained patch features. Experiments on LEVIR-CD and the WHU aerial building dataset show that, at the pixel level and in both transfer directions, SALT outperforms four baselines reproduced under a common source-only protocol, improving over the strongest reproduced baselines by 9.45 and 5.79 points in pixel-level AP and by 27.69 and 14.25 points in IoU (LEVIR-CD to WHU and WHU to LEVIR-CD, respectively), with only 0.068M trainable parameters and 40.2 ms per image. In order to facilitate reproducibility and further research, the source code of SALT is available at https://github.com/gthpapadopoulos/SALT

版本更新 · v31arXiv:2312.00326

Agent-OM:利用大语言模型智能体进行本体匹配

Agent-OM: Leveraging LLM Agents for Ontology Matching

Zhangcheng Qiang, Weiqing Wang, Kerry Taylor

AI 速读 基于摘要

提出由两个孪生 LLM 智能体(检索与匹配)及一组本体匹配工具组成的通用框架 Agent-OM,并在概念验证系统中评估其本体匹配表现。

cs.AI · cs.CL · cs.IR

查看原文摘要

Ontology matching (OM) enables semantic interoperability between different ontologies and resolves their conceptual heterogeneity by aligning related entities. OM systems currently have two prevailing design paradigms: conventional knowledge-based expert systems and newer machine learning-based predictive systems. While large language models (LLMs) and LLM agents have revolutionised data engineering and have been applied creatively in many domains, their potential for OM remains underexplored. This study introduces a novel agent-powered LLM-based design paradigm for OM systems. With consideration of several specific challenges in leveraging LLM agents for OM, we propose a generic framework, namely Agent-OM (Agent for Ontology Matching), consisting of two Siamese agents for retrieval and matching, with a set of OM tools. Our framework is implemented in a proof-of-concept system. Evaluations of three Ontology Alignment Evaluation Initiative (OAEI) tracks over state-of-the-art OM systems show that our system can achieve results very close to the long-standing best performance on simple OM tasks and can significantly improve the performance on complex and few-shot OM tasks.

新论文 · v1arXiv:2611.17072

LoRA领域适配中的推理监督与能力保持

Reasoning Supervision and Capability Retention in LoRA Domain Adaptation

Saleh Ashkboos, Dhruv Desai, Lavinia Ghita

AI 速读 基于摘要

该论文通过消融实验比较三种LoRA微调方案在金融领域适配中对任务性能与通用能力保持的影响。

cs.AI · cs.CL · cs.LG

查看原文摘要

Fine-tuning foundation models on financial data has a wide range of applications, including identifying event types from news, monitoring risk and compliance language, and answering questions over filings and earnings calls. In this setting, the main challenge is to improve task performance without degrading the generalization capabilities of the model. In this paper, we present an extensive set of ablations for fine-tuning Qwen3-8B with low-rank adaptation (LoRA). We compare three training regimes: (1) response-only LoRA, where the supervised response is the label alone; (2) single-adapter reasoning, where reasoning traces from a teacher model are included alongside the labels in the training loss; and (3) dual-adapter composite training, where separate LoRA adapters are trained on traces and labels. Response-only LoRA improves in-domain performance and leaves general capabilities near those of the frozen model. The in-domain change is largest for calibration and argmax accuracy. Under single-adapter reasoning, the in-domain metrics remain behind those of the response-only regime, while MMLU-Pro can rise slightly and the other retention benchmarks stay within ordinary variation. Dual-adapter composite training remains on the same side of this comparison and yields no further gain. Finally, we compress the teacher traces by summarizing them before training, and show that shorter summaries move calibration toward the response-only regime without reaching it.

新论文 · v1arXiv:2611.17068

通过程序演化发现有效的智能体记忆设计

Discovering Effective Agent Memory Designs through Program Evolution

Xinheng Ding, Seyyed Saeid Cheshmi, Ziyang Zhang, Tairan Chen, Wenya Xie, Yu Hou, Rui Zhang, Zirui Liu

AI 速读 基于摘要

提出 MAPE 框架,用程序演化从极简种子自动搜索完整的智能体记忆程序,并在 LoCoMo 与 LongMemEval 上总结出可复用的记忆设计模式。

cs.CL · cs.AI

查看原文摘要

Program evolution provides a promising approach to discover agent memory designs and study the choices underlying their effectiveness. We introduce MAPE, a framework that evolves whole memory programs from minimal seeds through a standardized lifecycle interface and an iterative diagnosis-proposal loop. Experiments on LoCoMo and LongMemEval yield an absolute accuracy gain of up to 12% over manually designed baselines at 35% of the serving cost, with further evaluations supporting transfer across serving backbones and benchmarks. Empirical analyses and ablations identify and validate two recurring design patterns: retaining raw conversations as retrievable evidence preserves details omitted from extracted memories, while composing retrieved evidence according to query intent helps the answering model use it effectively. Transplanting the composition module into five existing memory systems improves accuracy across all five. Beyond these patterns, the search objective shapes where computation goes: optimizing serving cost alongside accuracy shifts computation from LLM-based memory construction to selective processing at query time while retaining competitive accuracy. Together, these findings offer empirical lessons for agent memory design. Code is available at https://github.com/ash-ding/MAPE.

新论文 · v1arXiv:2611.17059

容量受限延迟反馈下的在线保形风险控制

Capacity-Constrained Delayed Feedback for Online Conformal Risk Control

Bowen Wang, Osvaldo Simeone

AI 速读 基于摘要

针对反馈延迟且跟踪容量有限导致反馈丢失的场景,提出容量感知的在线保形风险控制框架 CA-OCRC,联合优化反馈跟踪分配与预测集构造。

cs.LG · eess.SP

查看原文摘要

Online conformal risk control (OCRC) enables reliable uncertainty quantification in machine learning by converting model outputs into prediction sets with long-term risk guarantees. These guarantees, however, hinge on the assumption that the loss of each round is revealed immediately and losslessly. In practice, feedback may be delayed, and limited resources may prevent tracking all pending predictions, causing some feedback to be lost. To address this challenge, we develop capacity-aware OCRC (CA-OCRC), a framework that jointly determines how to allocate limited tracking feedback capacity and how to construct prediction sets. CA-OCRC is based on a randomized tracking policy that samples a proxy delay to decide whether, and for how long, feedback for the current round is tracked. CA-OCRC updates the prediction sets via inverse probability weighting, compensating for the possibility of feedback lost due to delays and limited tracking capacity. We analyze risk bounds for both arbitrary and stochastic delays, revealing a trade-off between receiving more feedback and avoiding capacity saturation. Building on these bounds, we optimize the proxy delay distribution, showing scaling laws for the tracking capacity that ensure the same long-term risk as OCRC with unlimited feedback. Experiments on medical imaging, natural language processing, computer vision, and wireless communications show the effectiveness of CA-OCRC as compared to existing OCRC mechanisms.

新论文 · v1arXiv:2611.17058

神经表征作为新的交互模式

Neural Representations as New Modes of Interactivity

Stanley Huang, Anthony Baez, Catherine Yeh, Pat Pataranutaporn

AI 速读 基于摘要

提出“神经表征交互”(NRI)范式,将神经网络内部表征视为用户可检视、引导和编辑的交互材料,并构建相应设计空间。

cs.HC

查看原文摘要

Human-AI interaction today runs almost entirely through prompts and outputs, keeping AI systems opaque to general users. We introduce Neural Representation Interaction (NRI), a paradigm that treats the internal representations of neural networks as an interaction material people can inspect, steer, and edit. Situating NRI alongside graphical, tangible, and bio-computer interaction, we argue that the concepts and algorithms models encode internally offer representational affordances for richer human-AI interaction. We synthesize actionable mechanistic interpretability methods and, drawing on General Morphological Analysis, construct a design space spanning Interaction, Target, Referent, and Purpose. Mapping existing interfaces onto this space reveals that most serve expert auditors, while few support lay users. We then present speculative applications in education, personal user modeling, and hiring audits, and discuss design principles, limitations, and sociotechnical risks. NRI offers HCI researchers abstractions for designing interactions that work with AI computation rather than only through its inputs and outputs.

版本更新 · v3arXiv:2609.15964

构造即可验证:LLM 能否用逐字引文充分支撑其临床主张?

Verifiable by Construction: How Well Do LLMs Substantiate Their Clinical Claims with Verbatim Quotes?

Jiashuo Zhang, Yuling Chen, Yvonne Commodore-Mensah, Michael Oberst

AI 速读 基于摘要

该研究构建标准化评测框架,分阶段考察十四种 LLM 在临床问答中为每条事实性主张提供逐字引文、并使引文充分支撑主张的能力。

cs.CL

查看原文摘要

Large language models (LLMs) have been widely adopted for clinical question answering (QA). Current systems can attach citations to their answers, but these often point to broad texts, leaving time-pressed clinicians unable to verify them efficiently. An alternative is to ensure that responses are verifiable by construction: providing fine-grained verbatim quotes from reference material that substantiate claims, so users can verify an answer without opening other documents. In this paper, we evaluate the ability of current models to perform this task end-to-end: from providing citations for every factual claim, to producing verbatim quotes, to ensuring that those quotes fully substantiate the claims. To do so, we build a standardized harness over four clinical practice guidelines and evaluate fourteen LLMs on 222 synthetic clinical questions, measuring each of these stages separately. We find that most models can attach verbatim quotes to over 90% of their claims from prompting alone, apart from some lightweight models such as claude-haiku-4.5. Yet these quotes often fail to substantiate every detail of the claims they accompany. For instance, claude-opus-5 produces verbatim quotes for 98.0% of its claims, but fully substantiates only 37.1%. Our work provides insights into the current capability gap of LLMs in building verifiable clinical QA systems, along with artifacts for future research.

新论文 · v1arXiv:2611.17052

审计AI同行评审员:基于真实科学论文的基准

Auditing AI peer reviewers: a benchmark on real scientific papers

Íñigo Zubeldia, Boris Bolliet, Francisco Villaescusa-Navarro, Pablo Villanueva-Domingo, Miles Cranmer

AI 速读 基于摘要

作者构建了一个在真实论文中注入可定位错误的基准,用于按错误类型和严重程度衡量LLM审稿系统的检出率与误报率,并提出多智能体审稿系统Skepthical。

cs.CL · astro-ph.IM · cs.AI · cs.DL

查看原文摘要

LLM-based peer review is now used at production scale, but its evaluation remains limited. We introduce a benchmark that injects objective, localisable errors of four types (general issues, mathematics, numerics, citations) at three severity levels into real papers and measures each reviewer's detection rate by error type and severity, together with its false-positive rate on clean copies. We also present Skepthical, a multi-agent reviewer that verifies citation-backed claims by retrieving the cited papers, mathematics with computer algebra, and numerical claims with executed code. We apply the benchmark to two corpora of 15 recent arXiv preprints each, one in astrophysics and one in machine learning (ML), injecting a total of 357 errors, and evaluate twelve reviewer systems: six single-LLM reviewers, two Claude Code configurations, three publicly available reviewers, and Skepthical. The choice of model has the largest impact on detection rate: given the same prompt, three frontier LLMs differ by about 50 percentage points in total detection on both corpora. Tools and scaffolding help when they contribute what the model cannot supply on its own. In particular, on astrophysics, Claude Code improves on a single Claude call in mathematics and numerics detection, and enforced citation retrieval gives Skepthical the highest citation error detection rate of all systems by a large margin. This citation lead, however, is not observed on ML, where the models appear to know the literature better and Skepthical's citation detection rate is statistically indistinguishable from that of the best single LLM. False-positive rates are below 10% for most systems, but vary with prompt, model, and scaffolding, with mathematics flags the main source of false positives. The evaluation pipeline, the injected errors, and the adjudication logs are released as a benchmark.

版本更新 · v2arXiv:2609.32007

面向模型评估的交互式邻近性证明

Interactive Proofs of Proximity for Model Evaluation

Geoffroy Couteau, Nikolas Melissaris, Tamara Paris

AI 速读 基于摘要

研究资源受限验证者借助不可信证明者(通常是模型所有者)认证模型在未知输入分布下统计性质的交互式邻近性证明(IPP),聚焦双亚线性复杂度与(加权)Hamming重量性质。

cs.CC

查看原文摘要

We study interactive proofs of proximity (IPPs) for model evaluation, where a resource-limited verifier interacts with an untrusted prover, typically the model owner, to certify statistical properties of a model under an unknown input distribution. Our formulation separates sampling the input distribution from querying the model and evaluating its output; distinguishes real audit data (black-box sampling) from generated data (chosen-randomness, or gray-box, access to the sampler); and allows the prover and verifier to use different evaluators. We focus on doubly-sublinear IPPs, where both the verifier and honest prover use sublinear resources, and on (weighted) Hamming weight properties. For ordinary Hamming weight, we give a tolerant doubly-sublinear IPP. For completeness and soundness radii $\varepsilon_c<\varepsilon_f$ and gap $g=\varepsilon_f-\varepsilon_c$, a logarithmic-round instantiation uses $\widetilde{O}(1/g)$ verifier queries and $O(1/g^2)$ honest-prover queries, improving the cubic dependence of Amir, Goldreich, and Rothblum (ITCS 2025). We prove matching query lower bounds up to polylogarithmic factors. For distribution-weighted Hamming weight, black-box sampling requires $Θ(1/g^2)$ verifier samples but only $\widetilde{O}(1/g)$ evaluations; the quadratic sample complexity is necessary in the interior regime. With chosen-randomness access, the problem reduces to ordinary Hamming weight, yielding $\widetilde{O}(1/g)$ calls and evaluations. If the parties' evaluators disagree arbitrarily on a $ρ$-fraction of the distribution and by at most $γ$ elsewhere, our protocols remain doubly sublinear whenever $g>2κ$, where $κ=ρ+(1-ρ)γ$. Applications include auditing accuracy, group fairness, calibration, harmlessness, usefulness, and average-case robustness.

新论文 · v1arXiv:2611.17044

[实验、分析与基准] LLMs 对关系数据库模式的理解与设计能力如何?

[Experiment, Analysis, and Benchmark] How well do LLMs comprehend and design relational database schemata?

Sriom Chakrabarti, Sean Bin Yang, Arijit Khan, Sebastian Link

AI 速读 基于摘要

提出 SchemaBridge 基准,评估 LLM 在 Text2Schema、Schema2Text 及模式往返转换中的保真度。

cs.DB

查看原文摘要

Large Language Models (LLMs) are increasingly used for database tasks, yet most work, such as Text2SQL, assumes that the relational schema already exists. We ask whether LLMs can design a schema from natural language requirements (Text2Schema), verbalize an existing schema (Schema2Text), and preserve its structure through a Schema-to-Text-to-Schema round trip. We present SchemaBridge, a benchmark of 902 schemata from three collections, stratified by size and constraint complexity, that scores fidelity separately for tables, attributes, domain (data types and nullability), entity, and referential integrity. Evaluating six open-weight and proprietary LLMs, we find that: (i) human-written requirements under-specify schemata, with no model exceeding 0.27 referential integrity F1; (ii) LLM-generated descriptions carry far more structure when explicitly asked to be complete, raising GPT-5.4-mini's referential F1 on SchemaBench from 0.228 to 0.909, even as BLEU, ROUGE-L, and BERTScore decrease; (iii) controlled experiments show that both constructor and describer choices influence round-trip fidelity under fixed settings; and (iv) masked schema experiments show that structural cues support recovery of keys and relationships, while joint data-type and nullability information is poorly retained through verbalization. Code and data are available at https://github.com/iamsriom/SchemaBridge

新论文 · v1arXiv:2611.17042

可验证人工智能的基础设施:证明成本去向与硬件如何助力

Infrastructure for Verifiable AI: Where Proof Costs Go and How Hardware Can Help

Yihan Xia, Wenxin Xu, Taotao Wang

AI 速读 基于摘要

作者提出四层分析框架并补充六种证明系统与七类内核的实测,指出可验证AI的证明成本瓶颈随证明系统与输入长度变化,硬件加速需围绕目标工作负载的成本画像来设计。

cs.AR · cs.CR · cs.LG

查看原文摘要

Users of artificial intelligence services, including those powered by large language models and other transformer-based models, need assurance that inference and training follow the declared computation without exposing private models or data. Zero-knowledge proofs can provide this assurance, but proof generation remains expensive. Hardware acceleration research often reports gains for individual cryptographic operations, leaving their effect on the full cost of proving neural-network workloads, particularly large transformer models, unclear. We introduce a four-layer framework linking verifiable AI workloads, proof systems, cryptographic kernels and hardware platforms, use it to review the literature, and add original measurements of six provers and seven kernels to identify which costs matter in practice. Our measurements show that the dominant cost changes with the proof system and input length. In low-rank fine-tuning, the cost of opening commitments to fixed model weights remains nearly constant across input lengths from 64 to 2048, while the work associated with intermediate values grows. A 13-billion-parameter fine-tuning configuration exceeds the capacity of a 40-gigabyte graphics processor but completes on an 80-gigabyte device, showing why capacity must be assessed alongside execution time. Our kernel profiling further identifies instruction issue and synchronization limits that a bandwidth-only model misses. We use these findings to assess graphics processors, reconfigurable logic, custom chips and existing artificial intelligence accelerators. The resulting research agenda connects proof-friendly numeric formats, reuse of fixed-weight commitments, heterogeneous execution and shared benchmarks to the measured bottlenecks. Effective acceleration requires selecting hardware and proof-system optimizations around the cost profile of the target workload.

新论文 · v1arXiv:2611.17035

编辑后水印文本的占比界:功效包络与校准敏感性

Prevalence Bounds for Edited Watermarked Text: Power Envelopes and Calibration Sensitivity

Kuancheng Ye

AI 速读 基于摘要

针对可能被未知程度编辑的文档,为Gumbel-max与green-list(KGW)水印推导语料中水印文本占比的可识别集合与有限样本界,并分析零假设校准误差的影响。

stat.ML · cs.CL · cs.CR · cs.LG

查看原文摘要

Watermark detectors decide whether one document came from a watermarked language model. Auditors often need a different number: the share of a corpus that did. We study this share for Gumbel-max and green-list (KGW) watermarks when every document may have been edited by an unknown amount. Without restrictions on the edits, the upper end of the identified set is 1. Combining a known least-favourable next-token distribution with a sequential coupling, we derive a power envelope indexed by three budgets: a retention floor, an entropy budget, and a budget for in-place substitutions, which for Gumbel-max make edited positions look less watermarked than human text. The envelope gives an identified set that is sharp for the alternatives it dominates, finite-sample bounds on the realized share of a fixed corpus with either the exact null or a null calibrated on an independent human sample, and confidence sequences for streams. In Gumbel-max simulations where the envelope binds, the bounds cover, and the threshold that maximizes the gap between envelope and null is generally as tight as twelve thresholds. On text from OPT-1.3B and Qwen3-1.7B, 12,000 fresh human documents scored under three keys show no robust departure from the exact null, and all bounds covered in resampling trials from finite pools of documents with random edits, substitutions and paraphrases; at a share of 0.2 the exact-null bound is about [0.14,0.38]. These results are fragile in two ways we make precise. LLM-paraphrased KGW pools fall below the envelope, yet at 2000 documents the bounds still covered in these trials. A simulated null error of 0.01, comparable to the largest deviation we observed at our thresholds, is likewise harmless at 2000 documents but breaks exact-null coverage at 100,000; a null calibrated on an independent human sample keeps coverage there, but needs a large reference sample to stay narrow.

新论文 · v1arXiv:2611.17031

你的视觉基础模型其实是一个脑电基础模型

Your Vision Foundation Model Is Secretly an EEG Foundation Model

Guoan Wang, Feng Liu

AI 速读 基于摘要

作者提出SeeEEG,将EEG信号渲染为图像并输入冻结的视觉基础模型,仅学习显示参数,在多个下游任务上优于冻结的EEG基础模型。

cs.AI

查看原文摘要

Electroencephalography (EEG) foundation models are pretrained on thousands of hours of recordings, yet their frozen features transfer poorly to downstream tasks, and this transfer does not consistently improve with larger models or more pretraining data. We show that a vision foundation model that has never seen EEG is a stronger frozen EEG encoder than these specialized models, once the signals are rendered as images that a vision transformer can read. Our method, SeeEEG, keeps the vision backbone frozen and learns only how EEG is displayed to it. Each channel occupies a dedicated row of patches and is drawn either as a waveform at a fixed gain or as a scalogram whose frequency range spans the patch height, so that task-relevant patterns fall within individual tokens. The montage, filtering, and contrast parameters of this display are initialized from a standard clinical montage and optimized with the task loss through the frozen backbone, which amounts to at most 1,113 trainable parameters per view. We compare SeeEEG with seven EEG foundation models on eight clinical, sleep, affective, and brain-computer interface datasets, with every encoder frozen and paired with identical readout heads. With a frozen DINOv3 ViT-B, SeeEEG outperforms every EEG foundation model in balanced accuracy on all eight datasets and reaches a mean rank of 1.3 in Cohen kappa or AUROC, compared with 2.9 for the strongest baseline, REVE. The learned displays transfer without further optimization to the video encoder V-JEPA 2.1, which outperforms every EEG foundation model on both metrics on six of the eight datasets. Replacing DINOv3 with a randomly initialized ViT-B lowers the score by 15.2 points on average, so the ability to read rendered EEG comes from visual pretraining.

新论文 · v1arXiv:2611.17030

相似但不冗余:面向高细粒度主题模型的嵌入门控精炼方法

Similar but Not Redundant: Embedding-Gated Refinement for High-Granularity Topic Models

Daniel Denley, Robert L. Nicol, Mike J. Chantler

AI 速读 基于摘要

针对高细粒度主题建模中"过度聚类"的争议,提出嵌入门控迭代合并方法 EGIM,用嵌入相似度提名候选、再用 LLM 判断是否真正冗余,以保留语义相近但有意义的细分主题。

cs.CL · cs.IR

查看原文摘要

High-granularity topic modelling extracts hundreds of niche topics from a corpus, yet this regime is rarely studied and is more commonly framed as a failure mode: "over-clustering," in which coherent themes fragment into redundant subtopics. We argue that this framing conflates genuine redundancy with topics that are semantically similar but meaningfully distinct, and that the central challenge in high-granularity modelling is separating the two. Recent post-hoc refinement methods address topic redundancy through either embedding-based similarity thresholding or LLM-guided merging. We show that neither suffices in high-granularity settings and propose embedding-gated iterative merge (EGIM), a hybrid approach that iteratively generates context-rich topic representations, uses embedding similarity to propose candidate merges across the topic space, then applies LLM judgement to accept only genuinely redundant pairs while preserving niche distinctions. Across two patent corpora and one legal corpus, LLM judgement rejects 83% of embedding-identified candidates as non-redundant. EGIM improves discriminability on merged topics by 25-55% over a prior iterative LLM baseline while better preserving the original topic distribution.

新论文 · v1arXiv:2611.17020

最大化LLM效用并管理其易错性

Maximizing LLM Utility While Managing LLM Fallibility

Ekta U. Samani, Christopher G. Atkeson

AI 速读 基于摘要

这篇综述主张:系统应随着关于LLM表现的证据不断积累,动态调整对LLM的依赖程度,从而在利用LLM能力的同时管理其出错风险。

cs.RO

查看原文摘要

Large language models (LLMs) can supply autonomous systems with plans, predictions, and judgments, but these contributions are sometimes wrong. This review asks how a system can maximize an LLM's utility while managing its fallibility. Our answer is to adapt the system's reliance on the LLM as evidence about the LLM's performance accumulates. Systems built from imperfect components, such as noisy sensors and faulty software, have long worked in this way, and the classical methods they use can be applied to LLM-based systems as well. A system can change its reliance on an LLM in several ways, depending on the LLM's role and on the other components in the system. Each change needs an estimate of the LLM's reliability, and the LLM's role and the kind of contribution it makes determine what to estimate. Classical methods from decision theory, estimation, and online learning then turn these estimates into reliance decisions. These decisions can reduce how often LLM errors affect the system. However, some errors matter even when they are rare. An independently verified mechanism can prevent such errors from being executed. Without one, adapting reliance using reliability estimates can still keep their risk within a bound. Studies on adapting reliance on LLMs are emerging but limited, and the reviewed comparisons suggest that adapting reliance can improve system performance.

新论文 · v1arXiv:2611.17018

探索面向包容性小组对话的社会可接受3D反馈设计

Exploring Socially Acceptable 3D Feedback Design for Inclusive Small-Group Conversation

Qianjie Wei, Yifan Li, Zhen Bai

AI 速读 基于摘要

该研究在XR小组对话场景中,探索如何通过幽默、降低社会注意和间接表达等策略设计公开3D反馈,使其既保持效果又提升社会可接受性。

cs.HC · cs.ET

查看原文摘要

Prior research has shown that providing feedback on group dynamics can improve the quality of small-group conversations. However, publicly delivered feedback that targets specific individuals may reduce social acceptability due to negative experiences such as social pressure, embarrassment, and resistance. This work investigates how public feedback can be designed to remain socially acceptable while maintaining its effectiveness in XR-based small-group conversations. Informed by social science and HCI literature, we identified three design strategies (incorporate humor, reduce social attention, and use indirectness) and proposed a set of metaphor- and agent-based 3D feedback probes. We then conducted a two-phase study: (1) an online survey with 50 participants to examine how such feedback designs are perceived under public and private delivery, and (2) follow-up interviews with 14 participants who completed the survey to better understand their interpretations and elicit additional insights. Results show that metaphor- and agent-based feedback can reduce social discomfort while maintaining effectiveness. Interview findings further highlighted the role of three strategies in making feedback easier to accept, while requiring careful balance. We also discussed design implications for creating socially acceptable 3D feedback to support inclusive small-group conversations in XR.