跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

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

稳定匹配的失真问题

The Distortion of Stable Matching

Aris Filos-Ratsikas, Georgios Kalantzis

AI 速读 基于摘要

本文开创性地研究稳定匹配中的失真问题,分析在有限获取基数偏好信息下,如何计算社会福利等聚合目标较优的稳定匹配。

cs.GT

查看原文摘要

We initiate the study of distortion in stable matching. Concretely, we aim to design algorithms that have limited access to the agents' cardinal preferences and compute stable matchings of high quality with respect to some aggregate objective, e.g., the social welfare. Following the recent agenda of Amanatidis et al. (2021), we seek to find the best possible tradeoffs between the distortion of an algorithm and the amount of information elicited via means of cardinal value queries. As a warm-up, we show that purely ordinal algorithms (i.e., algorithms that only use the preference rankings of the agents but no value queries), including the classic Deferred Acceptance (DA) algorithm of Gale and Shapley (1962), have unlimited distortion. Despite this strong impossibility, we observe that a simple randomized version of the DA algorithm achieves a distortion of $2$, and show that this is in fact optimal among all randomized stable matching algorithms. We then consider algorithms that also use value queries on top of the ordinal ranking information. Again, it is easy to see that the same bound of $2$ can be achieved with only $1$ value query per agent, and thus we focus on the question of improving upon this bound. To this end, we provide two strong lower bounds, namely that any stable matching algorithm requires $Ω(n)$ non-adaptive value queries or $Ω(\log n)$ adaptive value queries per agent to achieve a distortion smaller than $2$, where $n$ is the number of agents. Finally, we show an asymptotically tight bound of $Θ(\log (1+n\varepsilon)/\varepsilon)$ on the number of queries that are necessary and sufficient to achieve near-optimal distortion, i.e., a distortion of $1+\varepsilon$, for any $\varepsilon >0$.

新论文 · v1arXiv:2611.17298

基于显式对应关系的一致视频到视频翻译

Consistent Video-to-Video Translation via Explicit Correspondences

Gaurav Parmar, Zhengqi Li, Richard Zhang, Jun-Yan Zhu, Srinivasa Narasimhan, Eli Shechtman, Yotam Nitzan

AI 速读 基于摘要

作者提出 vid2vid-long,利用输入视频中的 patch 级对应关系检索并复用历史生成结果,以在保持实时性的同时提升长程时序一致性。

cs.CV · cs.AI · cs.GR · cs.LG

查看原文摘要

Interactive video-to-video applications require real-time generation while maintaining long-range temporal consistency. However, recent methods achieve speed by restricting attention to a fixed-length causal window. This limits long-range consistency whenever relevant history falls outside the context window. To address this limitation, we introduce vid2vid-long, a correspondence-based approach grounded in a simple observation. Video-to-video translation provides an explicit cross-frame reference: the regions that match in the input video should match in the output video too. Concretely, we compute patch-level correspondences in the input, guiding retrieval of previously generated outputs in the corresponding regions, and condition the model on these patches through correspondence cross-attention. Our experiments demonstrate that vid2vid-long consistently improves long-range temporal consistency across recent video models while preserving generation quality and real-time performance.

新论文 · v1arXiv:2611.17294

Metal Sandbox:面向 Apple Silicon 上 GPU 编码智能体的隔离执行与命令调度

Metal Sandbox: Isolated Execution and Command Scheduling for GPU Coding Agents on Apple Silicon

Haozhe Wang, Lina Chen, Fanqi Wan, Qi Han, Yinmin Zhang, Zheng Ge, Daxin Jiang, Junchi Yan

AI 速读 基于摘要

提出 Metal Sandbox 基础设施,通过隔离文件访问、原生命令执行与跨 Mac 的命令级调度,减少 GPU 编码智能体 rollout 中的 GPU 空闲并提升命令吞吐。

cs.LG · cs.AI · cs.CL · cs.DC

查看原文摘要

On-device inference requires kernels that make effective use of local accelerators. Efficient training and evaluation of models that generate Apple Metal kernels benefit from native macOS tools and concurrent agent sessions. These sessions alternate between model requests, development commands, and GPU execution, leaving GPU capacity idle for much of a rollout. We present Metal Sandbox, infrastructure that combines restricted per-instance file access, native command execution, and command-level scheduling across interconnected Macs. Each agent retains its workspace and private development environment. Parallel commands can run concurrently, while serial commands share one execution slot per node; eligible waiting commands can migrate to available Macs and return results to the original agent. Integration with Harbor supports task execution, automatic verification, and rollout collection through a common workflow. Controlled experiments on four Mac mini M4 nodes achieve $1.68\times$--$2.05\times$ gains in command throughput under concentrated demand. Sixteen static agent traces give an estimated $2.14\times$ sustained-throughput gain for four sessions per node versus one, assuming continuously replenished sessions and unchanged mean durations. Replaying these measured traces under dynamic scheduling reduces mean tool waiting by 18.8% and batch elapsed time by 22.3%, assuming unchanged phase durations. Metal Sandbox and its Harbor integration are open-source on GitHub.

版本更新 · v2arXiv:2610.35748

基于贝尔曼锦标赛的离策略评估模型选择

Model Selection for Off-Policy Evaluation via Bellman Tournaments

Lars van der Laan, Vasilis Syrgkanis, Nathan Kallus

AI 速读 基于摘要

提出成对贝尔曼验证(PBV)方法族,将离策略评估中的模型选择与超参数调优转化为计算留出样本平均值的惩罚性贝尔曼锦标赛,并给出有限样本 oracle 不等式。

stat.ML · cs.LG · econ.EM

查看原文摘要

Model selection and hyperparameter tuning pose a central challenge in off-policy evaluation (OPE) because estimation errors in fitted $Q$-functions and occupancy ratios cannot be directly evaluated using held-out transition data. Existing Bellman-residual-based validation methods often require auxiliary regressions, while many minimax-based methods require optimization over separate critic classes. We propose pairwise Bellman validation (PBV), a family of penalized Bellman tournament methods that reduces validation to computing held-out sample averages. PBV constructs critics from pairwise candidate differences, on the log scale for occupancy ratios, and selects the candidate with the smallest worst-case penalized score. This construction approximates oracle critics given by $Q$-function errors and log ratios of candidate to true occupancy ratios, whose Bellman and adjoint Bellman moments control estimation error. Critic penalties account for approximation error under candidate-class misspecification. We establish finite-sample oracle inequalities relative to the best available candidate, even under candidate-class misspecification. For $Q$-function selection, unweighted PBV avoids importance weighting but requires a coercivity condition on a quadratic form induced by the Bellman operator. Importance-weighted PBV (IW-PBV) uses marginalized importance weighting to exploit Bellman contraction under the target-policy occupancy measure, avoiding this condition. For occupancy-ratio selection, adjoint PBV (A-PBV) exploits KL contraction of the adjoint Bellman operator to obtain oracle guarantees under the offline data law. On Hopper and DeepOPE, unweighted PBV is competitive with LSTD-Tournament, often achieving higher accuracy on Hopper, while importance weighting can further improve performance under controlled overlap.

新论文 · v1arXiv:2611.17191

最大化LoRA适配器容量利用率以缓解学习-遗忘权衡

Maximizing Capacity Utilization of LoRA Adapters for Mitigating the Learning-Forgetting Trade-off

Tomohiro Sawada, Kartik Goyal

AI 速读 基于摘要

作者提出一种无需SVD的Rényi-2有效秩正则项,通过提升LoRA适配器的有效秩来改善学习与遗忘之间的权衡。

cs.LG · cs.CL

查看原文摘要

Low-Rank Adaptation (LoRA) often underperforms full fine-tuning, especially in heterogeneous and continual-learning settings in which substantial forgetting occurs. In general, it suffers from an undesirable learning-forgetting trade-off across diverse fine-tuning settings. We identify a potential contributor: LoRA adapters, especially high-rank ones, frequently fail to realize the available capacity afforded by the configured rank. Specifically, we find that standard LoRA updates have effective rank far below their configured rank, limiting how broadly the update energy is distributed. Therefore, we propose training mechanisms that optimize the original objective while maximizing adapter effective rank. Our main method adds a simple, stable, differentiable, and SVD-free Rényi-2 effective-rank regularizer to the language-modeling loss. We also connect capacity maximization to norm-bounded updates. In mixed-domain rank sweeps on three models evaluated with multiple random seeds, a penalty weight of $λ=0.01$ lowers mean Wiki perplexity at every tested rank of at least $16$ relative to unpenalized LoRA. Mean training perplexity improves or increases by at most $0.02$ in all but one model-rank comparison. Single-task and scheduling experiments further show that the balance between learning and retention depends on the configuration. We also observe that several LoRA variants in the literature also suffer from the identified capacity issue, and our approach provides a complementary axis of improvement to LoRA-based parameter-efficient fine-tuning. These results suggest that effective rank is not only a post-hoc diagnostic of adapter quality, but a trainable objective for improving the learning-forgetting frontier. Our code is available at https://github.com/tomohiro-sawada/lora-capacity-utilization

新论文 · v1arXiv:2611.17145

利用眼动级联与多层组合融合增强偏好检测

Enhancing Preference Detection using Eye Movement Cascade and Multilayer Combinatorial Fusion

Yuanhong Wu, Mary Tsaryk, Sam Watson, Tahsin Ahmed, Christina Schweikert, D. Frank Hsu

AI 速读 基于摘要

作者报告,在成对面孔比较的眼动数据上,用多层组合融合(MCF)迭代整合多个分类器,可提升偏好预测性能。

cs.LG

查看原文摘要

Understanding how visual attention influences human preference formation is a fundamental problem in consumer behavior and cognitive science. In this work, we investigate how eye movement patterns can be used to predict preference decisions when subjects compare two alternatives. To address this problem, we analyze an eye-tracking dataset, where subjects view pairs of face images and their gaze behavior is recorded throughout the decision process. We model this problem using multiple machine learning classifiers and apply the Multi-layer Combinatorial Fusion (MCF) framework to iteratively combine diverse models. The MCF framework expands models to a large pool of model fusions and then reduces them based on cognitive diversity, repeating this process across layers until diversity diminishes. Experimental results show that MCF significantly improves performance over individual models. The best single model achieves a Pre@k of 0.90, which is improved to 0.9143 after the first layer of MCF, and further increased to 0.9286 in the second layer. This progression demonstrates that the second layer not only surpasses the performance of the first layer but also outperforms the best individual model, highlighting the effectiveness of leveraging diversity through multi-layer fusion.

版本更新 · v2arXiv:2610.08003

基于生成式假设选择的反应式任务导向机器人-人类交接

Reactive Task-Oriented Robot-Human Handovers via Generative Hypothesis Selection

Carmen Scheidemann, Andreea Tulbure, Pascal Burkhard, Marco Hutter

AI 速读 基于摘要

提出 GENESIS-Handover,利用视觉语言模型(VLM)图像生成产生任务特定的手-物交互假设,并实时匹配观测到的人手姿态,以推断合适的交接配置。

cs.RO

查看原文摘要

When humans hand each other objects, they incorporate both geometric and semantic information into this process. For example, passing a knife with the handle towards the recipient, rather than the blade, is both more ergonomic and safer. Recent state-of-the-art methods for task-oriented robot-human handovers have progressed from modeling object geometry to incorporating object affordances. However, they often forgo predicting the explicit, task-specific hand poses a human selects to utilize an object. Since many objects support multiple interaction modalities, e.g., a claw hammer used to strike or pull nails, this variability must be modeled to achieve robust task-oriented handovers. To tackle this, we propose a novel approach, GENESIS-Handover (GENErative HypotheSIS), which leverages VLM image generation to produce a variety of task-specific hand-object interaction hypotheses. These hypotheses are matched in real time to the observed human hand pose, enabling inference of the most suitable handover configuration. By leveraging VLMs as priors of plausible hand-object interactions, the method produces task-conditioned handover strategies for previously unseen object-task pairs. We evaluate the standalone interaction proposal module before deploying the full system on a mobile manipulator. In a user study with 12 participants across five task-object pairs, 83.3% perceived our method to have better task understanding than the previous state of the art.

新论文 · v1arXiv:2611.17123

保留漏洞、消除告警:用自然重写测试 CodeQL 污点追踪的鲁棒性

Preserve the Vulnerability, Break the Alert: Testing the Robustness of CodeQL Taint Tracking with Natural Rewrites

Zhezhen Cao, Weiyuan Ding, Bowen Xu

AI 速读 基于摘要

作者报告,用大语言模型对真实 npm 漏洞做保持漏洞语义的自然重写,可使 CodeQL 的 JavaScript 污点追踪告警消失,说明告警消失并不等于漏洞已修复。

cs.CR · cs.SE

查看原文摘要

Static application security testing (SAST) tools such as CodeQL serve as security gates in continuous integration and code review, and a gate is also read in reverse. When a previously reported alert disappears after a change, developers and the tools around them often take the vulnerability to be gone. That inference holds only if the analyzer is robust to changes that keep the vulnerability. We test this robustness for CodeQL's JavaScript taint tracking with natural, vulnerability-preserving rewrites. A large language model, given only the alert CodeQL exposes and no knowledge of its implementation, rewrites one function along a reported flow as a plausible maintenance change, and we verify by manual audit and controlled experiments that the flaw survives and the alert does not. On 172 flows that CodeQL detects in real npm vulnerabilities, three rewrites per flow silence 26.2% of them, at about USD 0.51 per silenced flow. The same generator, asked only to refactor the same functions with no knowledge of the alert, silences none of them. Every silencing rewrite traces to one of seven gaps at the library-modeling boundary, and 64 of the 70 rewrites cross a gap inside an API CodeQL already models. The largest is the WHATWG URL constructor, which propagates taint to a URL's query components but not to its pathname. The boundary is not specific to CodeQL. 74% of the silencing rewrites also silence an independently built taint analyzer, and 53% escape three analyzers combined. A disappearing alert after an ordinary-looking change is therefore weak evidence that a vulnerability has been fixed, the gaps point SAST developers to narrow and concrete repair targets, and robustness to natural rewrites belongs alongside detection rate in how taint analyzers are evaluated.

版本更新 · 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.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.

版本更新 · v4arXiv:2402.13989

FedADMM-InSa:面向联邦学习的不精确自适应ADMM

FedADMM-InSa: An Inexact and Self-Adaptive ADMM for Federated Learning

Yongcun Song, Ziqi Wang, Enrique Zuazua

AI 速读 基于摘要

提出一种不精确且自适应的FedADMM算法,通过不精确性准则和惩罚参数自适应调整,减少客户端本地计算并提升对超参数的鲁棒性。

cs.LG · cs.CR · cs.DC · math.OC

查看原文摘要

Federated learning (FL) is a promising framework for learning from distributed data while maintaining privacy. The development of efficient FL algorithms encounters various challenges, including heterogeneous data and systems, limited communication capacities, and constrained local computational resources. Recently developed FedADMM methods show great resilience to both data and system heterogeneity. However, they still suffer from performance deterioration if the hyperparameters are not carefully tuned. To address this issue, we propose an inexact and self-adaptive FedADMM algorithm, termed FedADMM-InSa. First, we design an inexactness criterion for the clients' local updates to eliminate the need for empirically setting the local training accuracy. This inexactness criterion can be assessed by each client independently based on its unique condition, thereby reducing the local computational cost and mitigating the undesirable straggle effect. The convergence of the resulting inexact ADMM is proved under the assumption of strongly convex loss functions. Additionally, we present a self-adaptive scheme that dynamically adjusts each client's penalty parameter, enhancing algorithm robustness by mitigating the need for empirical penalty parameter choices for each client. Extensive numerical experiments on both synthetic and real-world datasets are conducted. As validated by some numerical tests, our proposed algorithm can reduce the clients' local computational load significantly and also accelerate the learning process compared to the vanilla FedADMM. The source code is available at https://github.com/DCN-FAU-AvH/FedADMM-InSa.

新论文 · 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.

新论文 · v1arXiv:2611.17003

成熟度²:评估密码敏捷性成熟度模型的成熟度

Maturity$^2$: Assessing the Maturity of Crypto Agility Maturity Models

Leonie Wolf, Robin Leander Schröder, Sebastian Schinzel, Fabian Ising

AI 速读 基于摘要

作者依据既有设计原则评估三个业界驱动的密码敏捷性成熟度模型,发现其普遍缺乏可测量、可复现的评估标准与改进指导。

cs.CR

查看原文摘要

Crypto agility maturity models aim to support organizations in preparing for cryptographic transitions, such as migrating to post-quantum cryptography. Recognizing the importance of measurable maturity, NIST references several such models in its guidance. Given NIST's influence on cybersecurity practice, these models may shape organizational planning and governance mechanisms. However, their design quality has not been systematically evaluated. In this work, we assess three industry-driven maturity models against established design principles. Our analysis reveals recurring weaknesses, particularly the lack of measurable, reproducible assessment criteria and limited prescriptive guidance for improving crypto agility. At the same time, we highlight individual strengths that can assist practitioners in choosing among the models and derive concrete recommendations for strengthening future crypto agility maturity models.

版本更新 · v4arXiv:2509.05724

基于学习误差模型的稳健摊销仿真推断

Robust Amortized Simulation-Based Inference via Learned Error Models

Matthew O'Callaghan, Kaisey S. Mandel, Gerry Gilmore

AI 速读 基于摘要

提出RVNP,用重要性加权自编码器联合学习对模型误设稳健的后验代理与显式误差模型,以弥合仿真到现实的差距。

stat.ML · astro-ph.GA · cs.LG

查看原文摘要

Recent advances in neural density estimation have enabled amortized Bayesian inference for complex stochastic simulators. However, these methods rely on simulators accurately reflecting the true data-generating process and can degrade significantly under model misspecification. We consider the setting where multiple unlabeled observations are available and introduce robust variational neural posterior estimation (RVNP), an amortized Bayesian inference method that uses an importance-weighted autoencoder to jointly learn a misspecification-robust posterior proxy and an explicit error model that captures the simulation-to-reality gap. Our results show that RVNP can recover robust posterior inference in a data-driven and interpretable manner, outperforming previous methods on multiple metrics across misspecified benchmarks.

新论文 · v1arXiv:2611.16881

蛋白质语言模型在不变重标记下无法保持接触预测

Protein Language Models Fail To Capture Contact Predictions Under Invariant Relabeling

Paarth Batra, Aryan Keluskar

AI 速读 基于摘要

作者提出一种基于氨基酸字母表全局双射重标记的诊断框架,发现多种蛋白质语言模型(pLM)的接触图在该变换下崩溃,说明其依赖显式残基身份而非纯共进化统计。

q-bio.QM · cs.AI

查看原文摘要

Protein language models (pLMs) produce highly accurate contact maps from single-sequence inputs. People often take this accuracy as proof that these models implicitly learn invariant coevolutionary statistics, extracting the same signals as classical alignment-based methods like Potts. In this work, we introduce a diagnostic framework around a global bijective relabeling of the amino-acid alphabet. This transformation permutes residue letters while leaving all alignment-level information, column entropies, and pairwise edit distances unchanged. Pseudolikelihood Potts models and inverse-covariance estimators remain invariant under this transformation, but pLMs fail the test. Across multiple architectures (ESM-2, MSA Transformer, AMPLIFY) and model scales (8M to 3B parameters), pLM contact maps collapse under arbitrary relabeling. Using Hamming distance controls and biochemical grouping interventions, we attempt to isolate what likely causes this degradation and find that these models rely on explicit, canonical residue identities (``alphabet anchoring'') rather than pure coevolutionary statistics. Increasing scale makes models more responsive to biochemical classes, but their performance still degrades under relabeling. Our findings show a gap between how pLMs and classical coevolutionary models compute contacts. More broadly, our work shows how diagnostic perturbations that leave classical models provably unchanged can expose hidden representation biases and prevent over-reliance on neural black boxes in biological modeling.

版本更新 · v2arXiv:2610.31996

面向目标结构动态减振的多材料拓扑优化

Multi-Material Topology Optimization for Targeted Structural Dynamic Vibration Attenuation

Bir Bahadur Chaudhary, Bidhan Pandey, Bin Ouyang, Shiguang Deng

AI 速读 基于摘要

提出一种多材料拓扑优化框架,通过新型插值方案、基于界的优化列式和平滑频带约束,解决基于特征频率的减振优化中的数值困难,并系统比较三种动态减振优化列式。

cs.CE

查看原文摘要

Resonance-induced structural vibrations can compromise the performance, reliability, and service life of engineering structures. Multi-material topology optimization (MMTO) offers a promising approach to vibration attenuation by tailoring the spatial distributions of material constituents to optimize structural stiffness, mass, and natural frequencies. However, existing eigenfrequency-based MMTO methods face several challenges, including the need for flexible interpolation of multiple material properties, non-smooth optimization objectives associated with mode switching and repeated eigenvalues, and numerical difficulties in imposing differentiable constraints to exclude natural frequencies from prescribed operating frequency ranges. To address these challenges, we propose a novel MMTO framework for structural vibration attenuation based on several innovations: (1) a novel multivariate weight-based multi-material interpolation scheme to simultaneously represent material stiffness and mass density, (2) a bound-based optimization formulation to improve the smoothness and stability of gradient-based optimization by addressing mode switching, and (3) a smooth frequency-band formulation to smoothly approximate the discontinuous Heaviside function while enabling differentiable frequency-band constraints. Additionally, we systematically investigate and compare three different topology optimization formulations for dynamic vibration attenuation, including maximizing the fundamental eigenfrequency, maximizing the gap between adjacent eigenfrequencies, and excluding natural frequencies from prescribed frequency bands. Furthermore, we present the detailed derivation of analytical design sensitivities for the three formulations.

新论文 · v1arXiv:2611.16831

面向ESG预测的模块化框架:领域特定语言建模与图学习相结合

A Modular Framework for ESG Prediction through Domain-Specific Language Modeling and Graph Learning

Sofia Baiocco, Gianluca Bonifazi, Christopher Buratti, Michele Marchetti, Camilla Mazzoli, Federica Parlapiano, Giulia Quaglieri, Davide Traini 等 10 位作者

AI 速读 基于摘要

提出模块化框架ESGPred,将领域特定语言建模与公司关系图上的图学习结合,用于预测整体ESG评分及其环境、社会、治理三个分项。

cs.AI

查看原文摘要

Environmental, Social and Governance (ESG) scores are increasingly used to evaluate corporate sustainability, supporting investment decisions, ensuring regulatory compliance and assessing risk. However, current ESG evaluations largely rely on proprietary methodologies that often produce inconsistent ratings. This motivates the development of data-driven prediction frameworks. In this paper, we present ESGPred, a modular framework for predicting ESG scores by combining domain-specific language modeling with graph-based learning over a network that models the relationships among the companies being evaluated. In addition to presenting the rationale behind ESGPred and detailing its ESG score prediction process, we show that ESGPred can effectively predict both overall ESG ratings and their individual Environmental, Social, and Governance components. We evaluated ESGPred using a dataset of 5,266 sustainability reports published by 2,134 publicly listed companies between 2020 and 2023. In this evaluation, we used ESG ratings provided by LSEG Data & Analytics as ground truth. Our experimental results demonstrated that integrating graph-based relational learning improves prediction performance over purely text-based baselines.

新论文 · v1arXiv:2611.16816

结果-质量对齐:控制多轮LLM智能体强化学习中依赖长度的轨迹影响

Outcome-Mass Alignment: Controlling Length-Dependent Trajectory Influence in Multi-Turn LLM Agent Reinforcement Learning

Dawei Zhang, Yubin Huangfu, Jessica Fan, Boyu Wei, Likang Wu, Hongke Zhao, Ming He, Zhu Teng

AI 速读 基于摘要

作者提出OMA方法,通过按唯一源轨迹统计结果并控制聚合目标质量,修正多轮LLM智能体逐步分组训练中轨迹展开带来的隐式加权偏差。

cs.CL

查看原文摘要

To keep long interaction contexts tractable, stepwise group-relative training for multi-turn LLM agents materializes each source trajectory into multiple response rows and valid tokens. This expansion creates an outer-accounting problem distinct from within-trajectory credit assignment: row-based outcome statistics can count one episode outcome multiple times, while token-level reduction can assign unequal aggregate objective mass across trajectories. We term these effects outcome-statistics multiplicity and objective-mass imbalance. We introduce Outcome-Mass Alignment (OMA), a two-component method that makes both accounting choices explicit. Outcome Alignment computes outcome statistics over unique source trajectories, while Mass Alignment controls aggregate objective mass after within-trajectory aggregation of optimizer-native token objectives. Neither redesigns the base optimizer's credit assignment, importance ratios, or clipping. Across matched ALFWorld GRPO comparisons at two model scales, where failed trajectories typically expand much more than successful ones, OMA improves matched-horizon endpoint success by 7.0-9.4 percentage points. Ordinary WebShop exhibits weak or reversed expansion-outcome coupling and correspondingly mixed effects, whereas in a success-oriented WebShop setting, WebShop-SOL, OMA improves success nAUC from 0.399 to 0.511. Component ablations and GiGPO and GSPO comparisons further support component separability and cross-optimizer compatibility. These results show that trajectory expansion always defines an implicit weighting rule, but its practical effect depends on how expansion couples to outcomes and optimizer-native updates.

新论文 · v1arXiv:2611.16752

AgriSense: Vision-Language Decision Support and Robotic Intervention in a Virtual Greenhouse Copy title

Lyes Saad Saoud, Oualid Doukhi, Reza Ghorbani, Moussa Ayyash

原文摘要

Autonomous greenhouse management increasingly requires robotic systems that integrate perception, navigation, environmental regulation, and plant-level intervention. This paper presents AgriSense, a framework combining an Isaac Sim virtual greenhouse, a quadruped mobile manipulator, RGB and LiDAR-inertial sensing, environmental control, and supervised vision-language decision support. Frozen DINOv2 and BERT encoders, together with structured environmental inputs, support joint prediction of twelve environmental references, a target zone, and an intervention flag. Checkpoint replay reproduces 41/43 zone decisions. Across five seeds on a source-grouped test set, the full, image-removed, and language-removed configurations each achieve 43/44 correct zone decisions, providing no evidence of incremental multimodal zone-accuracy improvement. The full model achieves mean absolute errors of 0.249 degrees C for temperature, 2.030 percentage points for humidity, and 0.997 percentage points for soil moisture. Sensor-only inputs match full-model zone accuracy, while language-only inputs achieve 68.64%. External real-image benchmarks reveal distribution-shift limitations. Five offline Point-LIO routes yield rigidly aligned trajectory errors of 5.22-17.32 mm. Of 40 virtual-arm targets, 32 satisfy geometric acceptance criteria and eight are rejected at boundaries. Six long-horizon climate cases and fault protocols characterize integration limits. Navigation and integrated treatment rely on simulator-state inputs; physical greenhouse performance and agronomic treatment efficacy remain unvalidated. The contribution is an evaluated decision-support and robotic-intervention framework for a virtual greenhouse.

cs.RO · cs.AI · cs.CV

新论文 · v1arXiv:2611.16750

Interpretable machine learning diagnosis of degradation mechanisms in lead-free $RbSn_{0.5}Ge_{0.5}I_{3}$ solar cells from temperature- and illumination-dependent electrical measurements

Nabanita Sarker, Hafiz Imtiaz

原文摘要

Machine learning coupled with device simulation is widely used to optimize thin-film solar cells, but almost exclusively in the forward direction, from device parameters to predicted performance. The inverse problem encountered after fabrication, namely identifying the mechanism that limits a given device, is still addressed by manual inspection of characterization data. In this work, both directions are examined for lead-free $RbSn_{0.5}Ge_{0.5}I_{3}$ solar cells using approximately 42,000 SCAPS-1D simulations. Replacing the Spiro-OMeTAD hole transport layer with CuI increases the simulated power conversion efficiency from 19.6\% to 21.6\%, almost entirely through the fill factor. Surrogate models trained and tested on a factorial parameter grid substantially overstate their predictive accuracy. An XGBoost regressor attains $R^2 = 0.9997$ on held-out grid points but only 0.58 on independently sampled devices, whereas training on a Latin hypercube design of comparable size restores $R^2 = 0.995$. For the inverse problem, a multi-label classifier identifies which of six degradation mechanisms are present from simulated temperature- and illumination-dependent open-circuit-voltage measurements. It achieves a macro $F_1$ score of 0.938, compared to 0.687 for a calibrated physics-rule baseline. The classifier does not, however, generalize to combinations of mechanisms absent from the training set.

cs.LG · math-ph

新论文 · v1arXiv:2611.16677

Manifold Attracting Flow Matching: Physics-Constrained Sampling via Continuous Geometric Dynamics

Guanyu Chen, Jinchen Wang, Shengze Xu, Xingyu Ren, Tieyong Zeng, Antonios Armaou, Dong Ni

原文摘要

Generating scientific data under previously unseen equality constraints requires satisfying the prescribed constraints without destroying the physical structure learned from data. Existing inference-time approaches often enforce physical constraints by repeatedly correcting predicted endpoints, but such discrete corrections can distort learned generative structure and introduce unstable feedback. In this work, we propose Manifold Attracting Flow Matching (MAFM), which continuously evolves a persistent anchor through an ODE whose dynamics drive it analytically toward the constraint manifold. Specifically, its geometric correction preserves model-guided tangent motion while prescribing the normal motion to contract constraint violations toward the manifold. This construction separates model tracking from constraint attraction and provides theoretical guarantees for residual contraction and local feedback stabilization. Experiments across geometric and partial differential equation benchmarks demonstrate improved generation quality over variant constraint-guided baselines while maintaining low constraint residuals. MAFM provides a flexible framework for coordinating learned physical structure and explicit constraints through controllable sampling dynamics, without retraining the underlying generative model.

cs.LG

版本更新 · v3arXiv:2603.09741

ENIGMA-360: An Ego-Exo Dataset for Human Behavior Understanding in Industrial Scenarios

Francesco Ragusa, Rosario Leonardi, Michele Mazzamuto, Daniele Di Mauro, Camillo Quattrocchi, Alessandro Passanisi, Irene D'Ambra, Antonino Furnari 等 9 位作者

原文摘要

Understanding human behavior from complementary egocentric (ego) and exocentric (exo) points of view enables the development of systems that can support workers in industrial environments and enhance their safety. However, progress in this area is hindered by the lack of datasets capturing both views in realistic industrial scenarios. To address this gap, we propose ENIGMA-360, a new ego-exo dataset acquired in a real industrial scenario. The dataset is composed of 180 egocentric and 180 exocentric procedural videos temporally synchronized offering complementary information of the same scene. The 360 videos have been labeled with temporal and spatial annotations, enabling the study of different aspects of human behavior in industrial domain. We provide baseline experiments for 4 foundational tasks for human behavior understanding: 1) Temporal Action Segmentation, 2) Keystep Recognition, 3) Egocentric Human-Object Interaction Detection, and 4) Video-Grounded Cross-View VQA, showing the limits of state-of-the-art approaches on this challenging scenario. These results highlight the need for new models capable of robust ego-exo understanding in real-world environments. We publicly release the dataset and its annotations at https://fpv-iplab.github.io/ENIGMA-360/.

cs.CV

版本更新 · v3arXiv:2605.07388

A Marine Debris Detection Framework for Ocean Robots via Self-Attention Enhancement and Feature Interaction Optimization

Yuyang Li, Jiashu Han, Yinyi Lai, Wenbin Kang, Zenghui Liu

原文摘要

Marine debris detection for ocean robot is crucial for ecological protection, yet performance is often degraded by low-quality images with blur, complex backgrounds, and small targets. To address these challenges, we propose YOLO-MD, an enhanced YOLO-based detection framework. A Dual-Branch Convolutional Enhanced Self-Attention (DB-CASA) module is designed to strengthen spatial-channel interactions, improving feature representation in degraded images. Additionally, a lightweight shift-based operation is introduced to enhance fine-grained feature extraction for objects of varying scales while maintaining parameter efficiency. We further propose SFG-Loss to mitigate class imbalance and optimization instability via dynamic sample reweighting. Experiments on the UODM dataset demonstrate that YOLO-MD achieves 0.875 precision, 0.822 F1-score, and 0.849 mAP50, outperforming the latest state-of-the-art methods. The effectiveness of this method has also been verified through real-world robotic edge deployment experiments.

cs.CV

新论文 · v1arXiv:2611.16642

Dataset Distillation via Drifting

George Cazenavette, Angelina Quan, Giannis Daras, Antonio Torralba, Vincent Sitzmann

原文摘要

The task of dataset distillation concerns the learning of a small set of synthetic samples that can serve as an effective replacement for a large real dataset when used for downstream tasks. While many solutions have been proposed since the problem's inception, most of them primarily seek to optimize the distilled data with respect to a classifier. In this work, we propose a new distillation method that learns a set of samples such that they directly approximate the per-class data distribution. Specifically, we "drift" our distilled data in the latent space of a feature extractor such that they move both toward the real data and away from each other without using a classification objective. We find that our drifted data cover the real distribution significantly better than existing methods while still serving as powerful training samples for classification. Furthermore, we showcase our method's use as a visualization tool for better interpreting models and extend it beyond images to other modalities. Our work advances the frontier of dataset distillation, offering a novel synthesis method and proposing distribution-based metrics as a complementary evaluation. More broadly, our findings help address the growing need to understand both data and models by uncovering more about how they interact.

cs.LG · cs.AI · cs.CV

新论文 · v1arXiv:2611.16609

A Dual-Branch Graph and Convolutional Network for Interpretable Movement EEG Classification

Maryam Ostadsharif Memar, Behzad Nazari

原文摘要

Decoding upper-limb movements from scalp electroencephalography (EEG) is an important problem for brain-computer interfaces (BCIs), but many deep learning models provide limited insight into the brain regions underlying their predictions. We propose a two-branch architecture that combines an LGGNet-inspired local-global graph branch with an EEGNet-style convolutional branch for movement-versus-rest classification. The graph branch groups 61 EEG electrodes into anatomically informed regions and learns their spatial relationships, providing a direct representation of the regions emphasized by the model. We evaluate the proposed architecture using leave-one-subject-out cross-validation on the Ofner upper-limb movement dataset. The model achieves a mean F1-score of 0.74 +/- 0.06 across subjects. Beyond classification performance, we analyze the learned graph structure to identify the regions with the strongest connectivity. Across all held-out subjects, the highest connectivity is consistently observed in the Parietal Left Low region, corresponding to electrodes P1 and P3. This region is opposite to the performed right-arm movements and lies within the posterior parietal area previously associated with upper-limb movement processing. These results show that incorporating a region-based graph into the decoder can provide an anatomically interpretable representation while maintaining effective movement classification, offering a practical approach toward more transparent EEG-based BCIs.

cs.AI · cs.HC · cs.LG · eess.SP

版本更新 · v2arXiv:2607.01266

Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks

Clemens Kinn, Philipp Petersen

原文摘要

We study binary classification tasks whose decision sets are given by definable sets in o-minimal expansions of the real field. Motivated by the cell decomposition theory of definable sets, we introduce traceable sets that isolate the analytical properties of definable sets used for fast approximation by ReLU neural networks. Under uniform bounds on the number of cells and a suitable extension assumption for the boundary functions, we prove that classifiers can be approximated in $L^p$ up to accuracy $\varepsilon>0$ by ReLU neural networks of size $\mathcal{O}(\varepsilon^{-p(n-1)/m})$, with depth independent of $\varepsilon$ and polynomially bounded weights. This establishes quantitative approximation rates for suitable definable collections in o-minimal structures using ReLU neural networks. Furthermore, the stated approximation rates are also derived for definable maps under similar geometric assumptions on their smoothness domains. We then obtain statistical learning rates for empirical risk minimization with hinge loss over the approximating ReLU neural network classes. For $N$ uniformly distributed samples, the predicted classifiers achieve expected misclassification error of order $N^{-m/(m+n-1)}$ up to an arbitrarily small polynomial loss.

math.LO · cs.LG · math.FA

版本更新 · v2arXiv:2605.10613

Exact Fixed-Point Constraints in Neural-ODEs: Injecting Prior Knowledge into the Network Parameters

Feliciano Giuseppe Pacifico, Duccio Fanelli, Lorenzo Buffoni, Lorenzo Chicchi, Diego Febbe, Raffaele Marino

原文摘要

Neural ordinary differential equations (Neural-ODEs) learn a velocity field from data. Often, however, additional information on the target field is available, such as the location of some of its equilibria or, more generally, its values at given points. We introduce a method to inject this information directly into the parameters of a Neural-ODE, so that a finite set of prescribed fixed points holds exactly throughout training, with no penalty terms and no post-hoc projection. The output matrix is parametrized through the Moore-Penrose pseudoinverse, implemented by a thin QR factorization of the hidden features at the prescribed points. This splits the output matrix into a component determined by the constraints and a free one, which shapes the field away from the prescribed points without altering its values there. As a result, the constrained Neural-ODE remains a universal approximator of the continuous vector fields compatible with the constraints. We test the method on a two-dimensional Lotka-Volterra competition model with four equilibria. In vector field regression, the constrained model keeps the fixed-point residual at single-precision round-off, and its test error is up to about five times lower than that of an unconstrained network of the same architecture. A soft penalty on the equilibria lowers the residual only at the cost of accuracy, and still leaves it at least an order of magnitude above that of the constrained model. Trained to convergence on datasets of increasing size, the unconstrained and penalized networks saturate already on small datasets, while the constrained model keeps improving over a wider range. Close to the equilibria and over long time horizons, the constrained model is the most accurate at every dataset size considered. This also holds when the models are trained on observed trajectories, by backpropagation through the ODE solver.

cond-mat.dis-nn · cs.LG · physics.bio-ph

新论文 · v1arXiv:2611.16495

Verifiable Settlement and Pricing for Local Energy Markets: Architecture and Deployment on Hyperledger Besu

Michele Fabi, Baptiste Leloup

原文摘要

We implement privacy-preserving local electricity exchanges using an automated market maker on the Hyperledger Besu network under QBFT consensus. The proposed protocol operator collects individual electricity positions off-chain and publishes aggregate supply and demand on the blockchain, where smart contracts compute market prices every fifteen minutes. Individual positions remain off-chain; Poseidon2 commitments and UltraHonk zeroknowledge proofs, generated from Noir circuits, verify aggregation, payments, and daily balance updates. The architecture retains community coordination while making financial execution independently auditable. Signed receipts and member-triggered recourse prevent unverified or partial settlement. In a ten-household experiment using simulated US residential profiles, daily settlement uses approximately 19 million gas and produces eight-member proofs in 2.4 seconds. Over four simulated days, local trading covers 34.4% of demand and reduces grid-only costs by 30.5% under assumed tariffs. Numerically computed __-Nash Equilibrium electricity profiles capture 83-88% of the social planner surplus.

cs.CR · cs.GT · q-fin.TR

新论文 · v1arXiv:2611.16487

HeMeR: Heterogeneous Memory Reconciliation for Embodied Agents via Structured KV Reuse

Saehun Chun, Wonje Choi, Jinwoo Jang, Taeyoon Kwack, Honguk Woo

原文摘要

Embodied agents make decisions by combining information from heterogeneous memory modules, including declarative memory for explicit knowledge, procedural memory for learned routines, and working memory for current observations. During interaction, the memory contents required for decision making change with the agent's state, goal, and task progress, while many contents remain shared across consecutive decisions. However, existing memory modules are typically accessed through separate interfaces, so each updated memory context is often processed as a new input to the foundation model. This prevents selective key-value (KV) cache reuse for unchanged memory contents and forces full KV cache recomputation even when much of the memory context remains valid. We introduce HeMeR, an inference framework that performs KV reconciliation between dynamically updated memory contexts and reusable KV states. HeMeR tracks declarative, procedural, and working memory contents across action decisions, preserves KV states for unchanged contents, and reconciles only the KV states affected by memory-content updates. This enables efficient and stable inference as memory contents evolve during interaction. We evaluate HeMeR on ALFWorld, Habitat, and real-world robotic deployments requiring coordinated use of heterogeneous memory contents. In the real-world setting, HeMeR achieves 83.20% task success and reduces per-step inference time from 2.94 to 1.87 seconds compared with MemRL, while preserving compatible KV states as task progress updates the memory context.

cs.AI

新论文 · v1arXiv:2611.16439

HALO: Human-Aligned Data Collection for WhoLe-body MObile Manipulation

Shuai Yang, Fangyi Xu, Yishu Shen, Kecheng Zheng, Yinghao Xu

原文摘要

Learning whole-body mobile manipulation requires demonstrations that coordinate bimanual actions with locomotion across extended workspaces. However, existing interfaces trade off direct robot control, perception and action alignment, and natural operator mobility, making such demonstrations difficult to collect. We introduce HALO, a human-aligned data collection system for whole-body mobile manipulation. The system aligns the operator's perception and action space with the robot while preserving direct physical feedback and natural locomotion. Operators guide the robot end-effectors through kinesthetic teaching and move a low-resistance platform without the deployed mobile base while performing bimanual manipulation. This interface enables more natural whole-body demonstrations, but the close human-robot coupling introduces discrepancies between the demonstration and deployment settings. We address these discrepancies with deployment-aligned demonstration processing, which calibrates and temporally aligns platform motion with the deployed base response and masks and inpaints demonstrator hands in recorded observations. Compared with Mobile ALOHA and VR teleoperation, HALO enables up to 2.9x faster demonstration collection while maintaining comparable or higher success rates. Policies trained with HALO perform precise manipulation tasks, including zip-tie fastening, and achieve a 73.3% success rate on a six-stage long-horizon mobile manipulation task involving repeated coordinated base and arm motion. Project page: https://robbyant-research.github.io/Lingbot-ALOHA/

cs.RO