跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-15 08:18 — 2026-11-16 08:18(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

找到 91 篇论文 · 按版本更新时间排序上轮扫描起点 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.14518

面向基础检测模型:EM-DETR 中基于示例的定位

Toward Foundation Detection Models via Example-Based Grounding in EM-DETR

Sheethal Bhat, Bogdan Georgescu, Awais Mansoor, Florin C. Ghesu, Sasa Grbic, Andreas Maier

AI 速读 基于摘要

作者提出用学生-教师训练策略整合标注空间异构的多域医学图像数据集,并将示例驱动的 EM-DETR 扩展为多域联合学习,以构建面向病灶检测的基础模型。

cs.CV · cs.AI

查看原文摘要

DeepLearning (DL)-based Computer-Aided Diagnostic (CAD) systems have shown great promise in supporting clinicians, but their performance heavily depends on the availability of large, well-annotated datasets. In medical lesion detection, the scarcity of comprehensive, stan dardized annotations and the heterogeneity of existing datasets limit the development of robust foundation models. In this work, we introduce a novel approach to building a multi-domain foundation model for le sion detection by integrating diverse medical image datasets annotated for both anatomical structures and abnormalities. We first propose a student-teacher training strategy to effectively combine datasets with heterogeneous label spaces, mitigating catastrophic forgetting, and im proving feature learning. In addition, building on our previously pro posed example-based EM-DETR framework, we adapt it to jointly learn from multiple domain-specific datasets, enabling fine-grained, example driven detection across modalities. Our model achieves state-of-the-art (SOTA) results, with image-level AUC scores exceeding previous SOTA by 1% point on four key findings in CXRs. We achieve a leading mAP50 in CXRs and mammography, surpassing EM-DETR trained on a single dataset by 2-3% points. This approach paves the way for scalable foundation models in medical imaging that leverage heterogeneous data while maintaining robust and generalizable performance.

新论文 · v1arXiv:2611.14476

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

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

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

AI 速读 基于摘要

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

cs.CV

查看原文摘要

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

新论文 · v1arXiv:2611.14459

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

When does text encoding matter for language modeling?

Eugene Jang, Catherine Arnett, Terra Blevins

AI 速读 基于摘要

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

cs.CL

查看原文摘要

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

新论文 · v1arXiv:2611.14451

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

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

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

AI 速读 基于摘要

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

cs.CV · cs.GR

查看原文摘要

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

版本更新 · v2arXiv:2607.01128

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

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

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

AI 速读 基于摘要

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

cs.LG · math.NA

查看原文摘要

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

新论文 · v1arXiv:2611.14420

OnlyAct:从基础模型中提取动作表示以构建世界模型

OnlyAct: Extracting Action Representations from Foundation Models for World Models

Runjia Li, Minghao Chen, Junyu Xie, Philip Torr, Andrea Vedaldi, Tomas Jakab

AI 速读 基于摘要

作者提出一种无需动作标签的对比式适配方法,从预训练基础模型 V-JEPA 2 的帧对嵌入中提取动作表示,并尽量剥离场景信息,用于动作条件视频世界模型。

cs.CV

查看原文摘要

Video world models promise general-purpose interactive simulators, but their training is limited by action supervision: action labels are scarce, fragmented across incompatible specifications, and do not scale with the unlabeled video pretraining corpus. A common workaround jointly trains an action encoder to compress consecutive frames into a latent action and a decoder to reconstruct the next frame from the previous frame and that latent, forcing the latent to capture only new information. This has two limitations: learning the action space from scratch can limit generalization to unseen domains, and the bottleneck trades expressiveness for separation, with tighter settings losing nuance and looser ones risking scene leakage under domain shifts. We argue for a different starting point: rather than learning actions from scratch, we start from a pretrained foundation model (V-JEPA 2), whose embeddings of a frame pair already carry substantial action information after large-scale, diverse video pretraining. The remaining challenge is to extract the action while discarding the scene. We propose a label-free contrastive adaptation framework that pulls together frame pairs sharing the same motion under a different scene and pushes apart pairs from the same scene with different motion, reshaping the geometry of the pretrained space without imposing a reconstruction bottleneck. We introduce a unified evaluation protocol along three axes (action expressiveness, scene invariance, and action-conditioned video generation quality) across robot manipulation, camera navigation, game, and driving benchmarks, most of which are unseen during adaptation. Compared with annotation-free latent-action methods, our representations are substantially more expressive while matching their scene invariance, and they yield world models that transfer demonstrated actions to new scenes more faithfully.

版本更新 · v2arXiv:2605.10852

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

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

Samuel German

AI 速读 基于摘要

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

cs.FL

查看原文摘要

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

新论文 · v1arXiv:2611.14272

面向异步疫情暴发的跨区域疫情预测联邦学习

Federated Learning for Cross-Regional Epidemic Forecasting with Asynchronous Outbreaks

Ruibin Liu, Francisco Fernandes, Xuanfeng Li, Zige Liu, André Salgado, Chitin Hon, Zifeng Yang, Arlindo Oliveira 等 9 位作者

AI 速读 基于摘要

作者报告,在广东、澳门和葡萄牙的异步COVID-19疫情中,用联邦学习训练LSTM做短期预测,精度接近集中式训练且保持数据本地化。

cs.LG

查看原文摘要

Objective: Epidemic outbreaks are often asynchronous across regions, yet collaborative forecasting is hampered by privacy laws and heterogeneous public health interventions. We developed and evaluated, as a proof of concept, a federated learning (FL) framework for cross-regional COVID-19 forecasting under asynchronous outbreaks among Guangdong, Macau, and Portugal, while maintaining data sovereignty. Methods: Using daily case data from WHO and China CDC for the three regions, whose outbreaks were asynchronous and interventions heterogeneous, we trained Long Short-Term Memory networks via FL for short-term forecasting, benchmarked against localized and centralized training using Root Mean Square Error, Mean Absolute Error, and Symmetric Mean Absolute Percentage Error. All experiments used the Flower FL framework with consistent hyperparameters across sites. Publicly available, aggregated case-count data were used so that the centralized benchmark could be computed as a reference. Results: The dataset comprised 1,233 daily observations (411 days) of new confirmed COVID-19 cases from November 24, 2021, to January 8, 2023. The earlier Omicron wave in Portugal supplied transmission dynamics that improved forecasts in the later-onset regions of Macau and Guangdong. The FL model achieved a normalized Root Mean Square Error of 0.028, an 88.3% improvement over the local model (0.240) and comparable to the centralized model, with network overhead mainly determined by model size and aggregation rounds. Conclusion: FL achieved short-term forecasting accuracy close to centralized training while maintaining data residency, with acceptable overhead. Leveraging asynchronous outbreaks across regions may offer a practical path to privacy-preserving collaborative forecasting, though prospective validation is required.

版本更新 · v2arXiv:2508.08807

面向节点与超边的高效属性超图嵌入

Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges

Yiran Li, Gongyao Guo, Chen Feng, Jieming Shi

AI 速读 基于摘要

提出 SAHE,统一学习属性超图中节点与超边的嵌入,并通过高阶相似度与近似优化兼顾质量与效率。

cs.SI

查看原文摘要

An attributed hypergraph comprises nodes with attributes and hyperedges that connect varying numbers of nodes. Attributed hypergraph node and hyperedge embedding (AHNEE) maps nodes and hyperedges to compact vectors for use in important tasks such as node classification, hyperedge link prediction, and hyperedge classification. Generating high-quality embeddings is challenging due to the complexity of attributed hypergraphs and the need to embed both nodes and hyperedges, especially in large-scale data. Existing solutions often fall short by focusing only on nodes or lacking native support for attributed hypergraphs, leading to inferior quality, and struggle with scalability on large attributed hypergraphs. We propose SAHE, an efficient and effective approach that unifies node and hyperedge embeddings for AHNEE computation, advancing the state of the art via comprehensive embedding formulations and algorithmic designs. First, we introduce two higher-order similarity measures, HMS-N and HMS-E, to capture similarities between node pairs and hyperedge pairs, respectively. These measures consider multi-hop connections and global topology within an extended hypergraph that incorporates attribute-based hyperedges. SAHE formulates the AHNEE objective to jointly preserve all-pair HMS-N and HMS-N similarities. Direct optimization is computationally expensive, so we analyze and unify core approximations of all-pair HMS-N and HMS-N to solve them simultaneously. To enhance efficiency, we design several non-trivial optimizations that avoid iteratively materializing large dense matrices while maintaining high-quality results. Extensive experiments on diverse attributed hypergraphs and 3 downstream tasks, compared against 11 baselines, show that SAHE consistently outperforms existing methods in embedding quality and is up to orders of magnitude faster.

新论文 · v1arXiv:2611.14246

SinkState:面向高效混合LLM服务的循环状态即时SVD

SinkState: On-the-Fly SVD of Recurrent States for Efficient Hybrid LLM Serving

Haolin Jiang, Weihang Li, Zhongzhu Zhou, Jinwen Pan, Santosh Pandey, Hang Liu

AI 速读 基于摘要

作者提出SinkState,利用线性注意力状态的低秩特性,在推理过程中对循环状态做自适应低秩存储与即时SVD,以降低混合LLM服务的内存占用和解码开销。

cs.LG

查看原文摘要

Hybrid models combine softmax attention with linear attention, which compresses history into fixed-size recurrent states to balance model quality and inference efficiency. However, linear attention has not pushed this compression to its limit: we find that the queries, keys, and values of linear layers concentrate in a stable, low-dimensional subspace, a phenomenon we call the linear attention sink, so each state is effectively low-rank, with a rank that varies across states. Yet existing serving systems keep these redundant states dense, reading and rewriting them in full at every decoding step, so their memory traffic grows with the batch size and dominates the decoding cost. Thus SinkState stores each recurrent state in an adaptive low-rank form throughout inference with buffered updates and a local SVD restricted to the top subspace. SinkState further consolidates the remaining components asynchronously on the CPU. On four hybrid models with Mamba-2 and Gated DeltaNet (GDN) layers, from 4B to 120B parameters, SinkState reduces the peak memory of recurrent states by up to 2.6x (1.9x on average) and speeds up decoding by up to 1.58x (1.25x on average) over Mamba-SSM and FLA, while maintaining accuracy.

新论文 · v1arXiv:2611.12843

快速但不稳定信道下的争用解决

Contention Resolution with a Fast-but-Fickle Channel

Umesh Biswas, Vini Chaudhary, Shafqat Hasan, Maxwell Young

AI 速读 基于摘要

研究在一条可靠慢信道与一条可被不可预测驱逐的快速信道之间调度数据包,提出随机算法 RACE,在保持渐近最优延迟的同时控制切换开销。

cs.DC

查看原文摘要

The contention-resolution problem studies how $n$ devices share a communication channel without centralized coordination. Classical models typically assume a single continuously available channel and focus on minimizing total completion time. However, modern wireless systems increasingly rely on shared spectrum, where access may be abruptly revoked by incumbent users. Motivated by this setting, we study contention resolution with two channels: a reliable slow channel and a faster channel that can be intermittently disabled by unpredictable eviction periods. Moving a batch of packets from the slow channel to the fast channel incurs a unit cost, while evictions from the fast channel impose a larger per-packet penalty. Our goal is to achieve asymptotically optimal latency while minimizing switching overhead relative to an optimal offline algorithm that knows the eviction schedule. We present Randomized Adaptive Channel Exploitation (RACE), a randomized algorithm that exploits the fast channel when available while maintaining progress on the slow channel during disruptions. When the fast channel has rate $ρ\in \bigl[Ω(\log n), O(\sqrt n)\bigr]$ and a sufficiently large constant-factor resource augmentation, RACE achieves an $O(1)$ competitive ratio for expected latency. RACE's expected switching-cost competitive ratio relative to any optimal-latency offline algorithm OPT is $O(ρ+\sqrt{n/m})$, where $m \geq 1$ is the number of fast-channel availability intervals used by OPT. We also prove a worst-case $Ω(\sqrt n)$ switching-cost competitive ratio for latency-competitive randomized algorithms, and a separate $Ω(ρ)$ switching-cost competitive-ratio lower bound. These lower bounds hold even with fixed constant-factor augmentation on both channels.

版本更新 · v2arXiv:2611.08420

论分子表示的局限性

On the limitations of molecular representations

Acer Blake, Charlotte M. Deane, Fergus Imrie

AI 速读 基于摘要

系统评估表明,当前最先进的分子嵌入模型在捕捉图结构、3D 形状和 ADMET 终点相似性方面并不优于指纹或理化描述符,而经典指纹本身也存在表示不唯一等实质局限。

cs.LG

查看原文摘要

Molecular representations such as fingerprints and learned embeddings play a central role in cheminformatics and small-molecule machine learning. They serve as the primary input for a diverse array of tasks, including clustering, dataset splitting, and virtual screening, yet their evaluation is often limited to downstream model performance on narrow benchmark tasks. We carried out a systematic investigation of the quality of molecular representations, finding that none of the state-of-the-art molecular embedding models capture graph structure, 3D shape, or ADMET endpoint similarity better than fingerprints or physicochemical descriptors. However, classical fingerprints also revealed their own material limitations. For example, we show that depending on the representation, between 225M and $\sim$4B molecules have non-unique representations in the 10.8B Enamine REAL database, with implications for virtual screening. Our findings provide an insight into the current limitations of molecular representations, outlining future research directions for the development of more robust encodings of small molecules.