跳到正文
研踪PaperTrail

版本更新

查看已发布论文的最新修订,在详情页对照实际观测到的版本。

部分采集异常

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

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

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

论文修订列表

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

找到 8,156 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2610.30086

Orbitol:基于Wyckoff轨道的晶体生成

Orbitol: Crystal Generation on Wyckoff Orbits

Ivan Žugec, Joshua Rosenthal, Ivor Lončarić, Jan-Willem van de Meent, Tin Hadži Veljković

AI 速读 基于摘要

Orbitol 用 Wyckoff 轨道令牌替代原子令牌,在给定空间群下生成满足对称性约束的晶体结构,并用于压电晶体候选筛选。

cs.LG

查看原文摘要

Generative models propose crystalline materials by learning composition and geometry, but unconditional sampling gives no direct control over the space group, which constrains whether responses such as piezoelectricity are symmetry-allowed. We present Orbitol, a crystal generator built on the Crystalite diffusion Transformer that replaces atom tokens with Wyckoff-orbit tokens. Given a space group and a collection of occupied Wyckoff positions, Orbitol generates the atom type and free coordinates of each orbit together with a compatible lattice, so every valid structure is invariant under the operations of the requested group. It generates structures two to three orders of magnitude faster than the symmetry-aware baselines at the evaluated settings. On MP-20, 13.8% of Orbitol's attempts yielded stable or metastable, unique and novel structures that retained the requested space group after relaxation, compared with 10.8% for SGFM, the next best model. We also introduce SPARC, a score that combines retention of the raw detected space group with agreement between the retained-group and training distributions. Finally, we used Orbitol to generate candidates in piezoelectric crystal classes. Of the structures selected by internal screening, 89% passed our density functional theory checks, and 79% also matched no Materials Project or Alexandria entry with the same space group. Their median figure of merit was nine times that of the piezoelectric materials computed in the Materials Project, and 24% of the new candidates ranked in that set's top 10%.

版本更新 · v2arXiv:2605.22817

向量策略优化:为多样性训练以提升测试时搜索

Vector Policy Optimization: Training for Diversity Improves Test-Time Search

Ryan Bahlous-Boldi, Isha Puri, Idan Shenfeld, Akarsh Kumar, Mehul Damani, Sebastian Risi, Omar Khattab, Zhang-Wei Hong 等 9 位作者

AI 速读 基于摘要

提出向量策略优化(VPO),通过面向向量奖励和集合级奖励训练语言模型产生多样化解,以提升推理时搜索效果。

cs.LG · cs.AI · cs.CL · cs.NE

查看原文摘要

Language models must now generalize out of the box to novel environments and work inside inference-scaling search procedures, such as AlphaEvolve, that select rollouts with a variety of task-specific reward functions. Unfortunately, the standard paradigm of LLM post-training optimizes a pre-specified scalar reward, often leading current LLMs to produce low-entropy response distributions and thus to struggle at displaying the diversity that inference-time search will require. We propose Vector Policy Optimization (VPO), an RL algorithm that explicitly trains policies to anticipate diverse downstream reward functions and to produce diverse solutions. VPO exploits that rewards are often vector-valued in practice, like per-test-case correctness in code generation or, say, multiple different user personas or reward models. VPO combines multi-answer prompting with a set-level reward to train the LLM to produce sets of solutions that specialize to different trade-offs in the vector reward space. Across four tasks, VPO matches or beats the strongest scalar RL baselines on test-time search (e.g. pass@k and best@k), with the gap widening as the search budget grows. For evolutionary search, VPO models unlock problems that GRPO models cannot solve at all. As test-time search becomes standard, diversity may need to become the default post-training objective.

版本更新 · v3arXiv:2610.20796

面向健康虚假信息分类与语义检索的隐私保护文本推理

Privacy-Preserving Text Inference for Health-Misinformation Classification and Semantic Retrieval

Jasleen Kaur, Chloé Cachet, Koray Karabina, Jean Belo Klamti, Philippe Lamontagne

AI 速读 基于摘要

作者提出基于CKKS同态加密的隐私保护文本推理框架,用于健康虚假信息分类与语义检索,并报告密文与明文推理指标一致及优化后的检索效率提升。

cs.CR · cs.LG

查看原文摘要

Health-misinformation analysis presents a dual challenge: misleading claims can affect public well-being, while systems designed to detect them may expose sensitive user-submitted text. This motivates privacy-preserving inference for public-health applications in which user queries may contain confidential medical information and trained models and reference databases are maintained on organizational servers. We design a privacy-preserving text inference framework based on CKKS homomorphic encryption for health-misinformation classification and semantic retrieval. The classification pipeline fuses BioBERT embeddings, PCA-reduced MPNet embeddings, and SVD-reduced TF-IDF features, while the retrieval pipeline combines MPNet embeddings with ISCC-SCT semantic fingerprints through late fusion. We evaluate predictive performance and benchmark plaintext versus ciphertext-based execution. The hybrid classifier achieved an accuracy of 0.971 and a macro-F1 score of 0.950, with identical reported metrics under plaintext and ciphertext-based inference. The hybrid late-fusion similarity model achieved a Pearson correlation of 0.8691 with human sentence-pair similarity scores on STS-B. For ciphertext-based retrieval, we evaluated naive and optimized implementations. The optimized implementation uses CKKS single instruction, multiple data (SIMD) packing to compute and return multiple similarity scores together, reducing single-query latency over 7,128 indexed items from 222.028 to 5.168 seconds and communication overhead from 6.11 GB to 2.13 MB. These findings demonstrate the technical feasibility of privacy-preserving text inference for health-misinformation applications and characterize its predictive utility and efficiency trade-offs.

版本更新 · v2arXiv:2610.35195

多层级梯度正则化牛顿法的全局 O(k^{-2}) 收敛性

Global $\mathcal{O}\left(k^{-2}\right)$ Convergence of Multilevel Gradient-Regularized Newton Methods

Nick Tsipinakis, Matthias Voigt

AI 速读 基于摘要

作者提出并分析多层级梯度正则化牛顿法,在保持全空间方法函数值全局 O(k^{-2}) 收敛速率的同时降低计算成本。

math.OC · cs.LG · math.NA

查看原文摘要

We develop and analyze multilevel gradient-regularized Newton methods for unconstrained convex optimization with Lipschitz-continuous Hessians. By computing Newton corrections in lower-dimensional subspaces, the proposed methods aim to reduce computational costs while preserving the global $\mathcal{O}\left(k^{-2}\right)$ convergence rate in function values of the full-space method. To establish this rate for multilevel methods, we introduce a class of row-nested restriction operators that ensures monotonicity of the reduced-gradient norms across levels. Numerical experiments with row-nested operators demonstrate convergence behavior comparable to full-space gradient-regularized Newton, while offering substantial computational savings on large-scale instances.

版本更新 · v4arXiv:2609.11076

SaltBench:一种由裁判门控的协议,用于测量机器可检验软件工作中的方法效应

SaltBench: A Referee-Gated Protocol for Measuring Method Effects in Machine-Checked Software Work

Jason Hickey

AI 速读 基于摘要

提出 SaltBench 协议,用外部机器裁判(证明内核、程序验证器或保留测试集)来测量编码智能体采用“先规格后验证”方法后的成本与通过率变化。

cs.SE · cs.LO

查看原文摘要

SaltBench asks how a machine referee (a proof kernel, program verifier or withheld test suite) changes how a coding agent works. Outcomes are decided outside the agent's toolchain; a wall probed before any scored run isolates the agent from the network, reference solutions and harness; a dated freeze of predictions authorizes each run; a budget stop is a halt, never a failure. Five Rust systems components on a pinned Verus toolchain are each refereed by a withheld test suite. The arms: plain; salt-diet, also instructed to specify and verify its code (a registered reduced rendering of the method); and two arms handed the specification a priori, where the registered sign test at k=4 reached no verdict (3 of 4, p = 0.3125). salt-diet cost more on all five components, by a practical margin: no premium exceeded 2.8879x under either reading of the declared set and the three cheapest sat below 1.4x, a bound of this population and not a promise about larger ones: the premium is near 1 on the smallest components and rises with size. Versions 2 and 3 add the complete pilot matrix: 200 conditions over four models, 181 with a result of record, 16 inexpressible and 3 declared unreached at the cost cap, costed in tokens, dollars and wall time, with no verdict on the arms. Version 3 adds a correctness reading, declared post hoc and registered after every verdict it reads existed and many had been read by its author: 447 cells pass the withheld suite, 40 fail, 10 are censored at a registered budget, 4 are unscorable and 42 are read by condition. salt-diet's pass-rate interval lies wholly below plain's on 8 greenfield and 5 brownfield rows and wholly above it on 2 greenfield rows. It is descriptive, over three cells of record per condition, with no test, and says nothing about whether the method makes code more or less correct. The full record is public.

版本更新 · v2arXiv:2509.23312

GUARD:面向安全传统与学习型机器人控制的敏感度感知不确定性归因

GUARD: Sensitivity-aware Uncertainty Attribution for Safe Traditional and Learning-based Robot Control

Woo-Jeong Baek, Johannes A. Gaus, Jonas Kiemel, Junheon Yoon, Suhan Park, Tamim Asfour, Jaeheung Park

AI 速读 基于摘要

GUARD 将概率核优化与敏感度感知的不确定性归因结合,为传统 MPC 和强化学习控制器提供风险感知的安全裕度与备份轨迹触发机制。

cs.RO

查看原文摘要

This paper presents the framework GUARD (Guided robot control via Uncertainty attribution and probAbilistic kernel optimization for Risk-aware Decision making) that combines a technique from probabilistic state estimation with an uncertainty identification method to derive critical thresholds for robot control algorithms. The first part focuses on complementing a method for probabilistic kernel optimization (PKO) by a sensitivity-aware uncertainty attribution technique. Next, the estimated uncertainties and their sources are forwarded to the robot controllers to adapt safety margins and trigger the initialization of safe backup trajectories. To validate GUARD's applicability and performance, experiments are conducted on a traditional model predictive control (MPC) algorithm and a reinforcement learning (RL) based controller. The results demonstrate that GUARD reduces collision rates by 44-67% in the RL-based evaluation, while decreasing backup policy activation by 50-75% in the medium- and high-uncertainty profiles. In the MPC simulation, GUARD successfully avoids collisions. By unifying the probabilistic kernel optimization algorithm from robot state estimation with the uncertainty estimation method for learning-based control, GUARD brings together traditional techniques and learning for safe and efficient robot applications.

版本更新 · v2arXiv:2601.21471

Designing Service Systems from Textual Evidence

Ruicheng Ao, Hongyu Chen, Siyang Gao, Hanwei Li, David Simchi-Levi

原文摘要

In service system design, it is often the case that the main evidence of system performance appears in textual form, such as customer support transcripts, complaint narratives, and compliance review reports. With the increasing use of large language models (LLMs), these textual trajectories can be converted into low-cost proxy scores that support comparison and optimization of candidate service configurations. However, LLM-based evaluations can exhibit systematic bias and require human audits for correction. To this end, this research studies how to identify the best service configuration with high confidence while minimizing the use of expensive human audits. We formulate the problem as fixed-confidence best arm identification with an always-observed, potentially biased proxy and selectively acquired human-verified outcomes. Moreover, several configurations can run on one case. A human audit can provide a case label that scores all their outputs. We show that sharing this reference and deciding whether to audit after observing proxy scores can each strictly reduce asymptotic identification cost. The selected configurations determine the available proxy scores and verified outcomes, so the proposed algorithm allocates configuration evaluations and subsequent audits jointly. For a specified finite family of data-generating models containing the true law and distinguishing different best configurations, its expected cost asymptotically attains the information-theoretic lower bound. For audits of individual outputs, we develop prediction-powered confidence sequences valid under adaptive auditing and delayed feedback. Numerical experiments on synthetic examples and service datasets show that the proposed algorithms require substantially less human review while maintaining reliable selection.

cs.LG · math.OC · stat.ML

版本更新 · v2arXiv:2607.27042

GPTQ-2D:三次时间复杂度的双边自适应舍入

GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding

Jiale Chen, Torsten Hoefler, Dan Alistarh

AI 速读 基于摘要

作者提出 GPTQ-2D,在保持与 YAQA 相同双边自适应舍入结果的前提下,把误差反馈的计算量从四次降为三次,并给出 GPU 实现与多 Kronecker 因子扩展。

cs.DS · cs.LG

查看原文摘要

Adaptive rounding methods such as GPTQ quantize the weights of a large language model (LLM) one at a time, propagating each rounding error to the weights not yet rounded. YAQA lowers the KL divergence from the original model with two-sided adaptive rounding under a Kronecker-factored Hessian, but its error feedback takes quartic work in the size of a square layer. We present GPTQ-2D, which provably computes the same rounding with cubic work, while still rounding the entries of each anti-diagonal in parallel. Its GPU implementation uses two levels of blocking to improve hardware utilization. We also extend the algorithm to Hessians with any number of Kronecker factors. In our experiments, GPTQ-2D is as accurate as YAQA and cuts the time to quantize Llama-3.1-70B-Instruct on a single NVIDIA RTX A6000 GPU from 8.6 days to 1.6 hours. Source code is available at https://github.com/IST-DASLab/GPTQ-2D.

版本更新 · v2arXiv:2607.01218

状态-预测分离假设

The State-Prediction Separation Hypothesis

Giovanni Monea, Nathan Godey, Kianté Brantley, Yoav Artzi

AI 速读 基于摘要

作者提出将Transformer中“预测下一词元”与“为未来预测存储状态”两种功能分离的假设,并设计双计算流变体进行预训练验证。

cs.CL · cs.AI · cs.LG

查看原文摘要

Transformers use the same forward computation stream to both predict the next token and store useful state for future token predictions. We formulate the state-prediction separation hypothesis: disentangling the two roles yields better language modeling performance. We design a Transformer variant that uses separate computation streams to separate the two functions, and conduct pretraining experiments across various scales. Our experiments show that state-prediction separation consistently offers better data- and compute-efficiency, improving validation loss and outperforming standard Transformers by 2-3 percentage points on average on downstream tasks. We also conduct extensive empirical analysis that rules out potential confounders and demonstrates the fundamental difference in the gradients our design entails.

版本更新 · v2arXiv:2405.00844

A Blockchain-Based Audit Mechanism for Trust and Integrity in IoT-Fog Environments

Ismael Martinez, Abdelhakim Senhaji Hafid, Michel Gendreau

原文摘要

The full realization of smart city technology is dependent on the secure and honest collaboration between IoT applications and edge-computing. In particular, resource constrained IoT devices may rely on fog-computing to alleviate the computing load of IoT tasks. Mutual authentication is needed between IoT and fog to preserve IoT data security, and monetization of fog services is needed to promote the fog service ecosystem. However, there is no guarantee that fog nodes will always respond to IoT requests correctly, either intentionally or accidentally. In the public decentralized IoT-fog environment, it is crucial to enforce integrity among fog nodes. In this paper, we propose a blockchain-based system that 1) streamlines the mutual authentication service monetization between IoT and fog, 2) verifies the integrity of fog nodes via service audits, and 3) discourages malicious activity and promotes honesty among fog nodes through incentives and penalties.

cs.CR

版本更新 · v2arXiv:2610.25395

面向移动相机的透视视频转360°视频的3D驱动框架

A 3D-Driven Framework for Moving-Camera Perspective-to-360° Video Generation

Michael Wakeham, Mrinmoy Kumar Das, Wenqi Wang, Ayush Tewari, Boqing Gong, Deepti Ghadiyaram

AI 速读 基于摘要

提出一种模块化、3D驱动的框架,将移动相机透视视频转360°视频的任务拆分为显式3D重建、全景图像补全与共享3D场景锚定三个组件。

cs.CV

查看原文摘要

Turning a moving-camera perspective video into a 360° video means generating content outside the input frame under several constraints: observations revealed over time must be preserved, unseen regions plausibly completed, and the resulting scene kept consistent as the camera viewpoint changes. Existing methods assign these different requirements to a single conditional video model, requiring them to be jointly learned from panoramic video data. We instead present a modular, 3D-driven framework that distributes these three responsibilities across specialized components, all connected through a shared scene representation. Input observations are reconstructed explicitly in 3D, while a pretrained panoramic image model completes unobserved content from a selected panoramic render. This generated content is lifted into the shared 3D scene, where it remains spatially anchored across camera viewpoints. Without requiring any additional panoramic-video training, our framework achieves state-of-the-art input-view fidelity, perceptual quality, and geometric consistency on a static-scene subset of the Argus evaluation set. These results support our decomposed, 3D-driven formulation as a promising alternative to direct video generation in this setting.

版本更新 · v4arXiv:1601.04794

Concentration Inequalities for Branching Random Walks with Applications to Phase Transitions in CSPs

Changqing Liu, Bo Zhang

原文摘要

A new framework is developed for studying phase transitions in random CSPs, from which a range of new results follows. Motivated by phase transition problems in CSPs, a more general concentration inequality is proved that retains classical sub-Gaussian tails under a mild global linear-growth condition $|S_n| < Cn$, relaxing the bounded-increment assumption to finite exponential moments and requiring neither independence nor the martingale property. We further extend the concentration inequality to branching random walks (BRW), obtaining the first concentration inequality for BRW. As applications, we derive partial differential equations (PDEs) for the $K$-SAT and $q$-COL backbones, yielding new results, including \textbf{(a)} a resolution of the long-standing open question of where $(2+p)$-SAT transition changes from second to first order; \textbf{(b)} rigorous results for $α_d$ in $K$-SAT, which give new lower bounds on the phase transition for 3-SAT (4.0029 vs. 3.51) and 4-SAT (8.360 vs. 7.91); and \textbf{(c)} the prefactor of the 2-SAT critical window.

cs.CC

版本更新 · v4arXiv:2603.21071

面向极少标签前视声呐图像语义分割的协同教师框架

CTFS : Collaborative Teacher Framework for Forward-Looking Sonar Image Semantic Segmentation with Extremely Limited Labels

Ping Guo, Chengzhou Li, Guanchen Meng, Qi Jia, Jinyuan Liu, Zhu Liu, Yu Liu, Zhongxuan Luo 等 9 位作者

AI 速读 基于摘要

提出一种由通用教师与多个声呐专用教师组成的多教师协同框架,通过交替引导与跨教师可靠性评估,在极少标注下提升前视声呐图像语义分割性能。

cs.CV · cs.AI

查看原文摘要

As one of the most important underwater sensing technologies, forward-looking sonar exhibits unique imaging characteristics. Sonar images are often affected by severe speckle noise, low texture contrast, acoustic shadows, and geometric distortions. These factors make it difficult for traditional teacher-student frameworks to achieve satisfactory performance in sonar semantic segmentation tasks under extremely limited labeled data conditions. To address this issue, we propose a Collaborative Teacher Semantic Segmentation Framework for forward-looking sonar images. This framework introduces a multi-teacher collaborative mechanism composed of one general teacher and multiple sonar-specific teachers. By adopting a multi-teacher alternating guidance strategy, the student model can learn general semantic representations while simultaneously capturing the unique characteristics of sonar images, thereby achieving more comprehensive and robust feature modeling. Considering the challenges of sonar images, which can lead teachers to generate a large number of noisy pseudo-labels, we further design a cross-teacher reliability assessment mechanism. This mechanism dynamically quantifies the reliability of pseudo-labels by evaluating the consistency and stability of predictions across multiple views and multiple teachers, thereby mitigating the negative impact caused by noisy pseudo-labels. Notably, on the FLSMD dataset, when only 2% of the data is labeled, our method achieves a 5.08% improvement in mIoU compared to other state-of-the-art approaches.

版本更新 · v3arXiv:2505.15715

超越共情:融合诊断与治疗推理的大语言模型心理健康咨询

Beyond Empathy: Integrating Diagnostic and Therapeutic Reasoning with Large Language Models for Mental Health Counseling

He Hu, Juzheng Si, Qianning Wang, Fei Ma, Fuji Ren, Sicheng Zhao, Yucheng Zhou, Laizhong Cui

AI 速读 基于摘要

作者提出 PsyLLM,通过自动化数据合成将真实心理困扰帖子转化为融合 DSM/ICD 诊断标准与多种治疗框架的多轮咨询对话及推理轨迹,并构建四维评测基准。

cs.CL

查看原文摘要

Large language models (LLMs) hold significant potential for psychological support, capable of generating empathetic responses and simulating therapeutic conversations. However, existing LLM-based approaches often lack sufficient grounding in structured diagnostic reasoning and diverse therapeutic strategies, limiting their effectiveness in complex counseling scenarios. To address these limitations, we propose PsyLLM, the first large language model designed to incorporate diagnostic- and therapeutic-oriented reasoning for mental health counseling. To develop PsyLLM, we design a novel automated data synthesis pipeline that processes real-world mental health posts collected from Reddit, where users frequently express psychological distress and seek community support. The pipeline transforms these posts into multi-turn counseling dialogues and leverages LLMs guided by international diagnostic standards (e.g., DSM/ICD) and multiple therapeutic frameworks (e.g., CBT, ACT, psychodynamic) to generate structured, clinically informed reasoning traces. A rigorous multi-dimensional filtering mechanism further improves the quality and clinical fidelity of the synthesized dialogue data. In addition, we introduce a new benchmark and evaluation protocol, assessing counseling performance across four key dimensions. Our experiments, along with evaluations by professional counseling experts, demonstrate that PsyLLM consistently outperforms various baseline models on this benchmark. Code, data, and models are available at https://github.com/Emo-gml/PsyLLM.

版本更新 · v2arXiv:2610.17237

贪心区域生长:Cutwidth、Pathwidth、流扩展分解等的改进近似算法

Greedy Region Growing: Improved Approximations for Cutwidth, Pathwidth, Flow-Expander Decomposition, and More

Aditya Anand

AI 速读 基于摘要

作者提出一种用于扩散度量线性规划的舍入技术“Greedy Region Growing”,并据此给出 Cutwidth、Pathwidth、有向类比问题、流扩展分解及 Treedepth 的改进近似算法。

cs.DS

查看原文摘要

We give a new rounding technique for spreading-metric linear programs, called Greedy Region Growing, which adapts the classical technique of region growing to min-max graph layout problems and flow-expander decomposition. Using this technique, we obtain state-of-the-art approximation algorithms for several fundamental problems. (1) An $O(\log n)$-approximation for Cutwidth and Pathwidth, improving upon the previous bound of $O(\log n\exp(O(\sqrt{\log\log n})))$ due to Bansal, Katzelnick, and Schwartz (FOCS 2024). This matches the $Ω(\log n)$ integrality gap of the standard LP relaxations. (2) An $O(\log n)$-approximation for their directed analogues, Minimum Storage and Minimum Register Sufficiency on directed acyclic graphs, improving the previous bound of $O(\log^{3/2} n)$. (3) A $φ$-flow-expander decomposition that cuts at most an $O(φ\log n\log\log n)$ fraction of the edges. This improves the $O(φ\log n\exp(O(\sqrt{\log\log n})))$ bound of Bansal, Jambulapati, and Saranurak (ICALP 2026), and is within an $O(\log\log n)$ factor of the graph-theoretic lower bound. The vertex version of our algorithm also gives an $O(\log n)$-approximation for Treedepth. In particular, our results answer several open problems of Bansal, Katzelnick, and Schwartz (FOCS 2024). Technically, we also solve the conceptual question raised by their work: our technique shows how to adapt Seymour recursion to min-max objectives, and constructs $O(1)$-weak local partitions in spreading metrics.

版本更新 · v3arXiv:2611.01993

看清原因:量子与光学图像分类器的精确证据图

Seeing Why: Exact Evidence Maps for Quantum and Optical Image Classifiers

Teerawat Tongloy, Rangsan Jomtarak

AI 速读 基于摘要

作者提出一种可在量子芯片或光学实验台上直接测量的精确证据图(BEM),把线性量子/全光图像分类器的类别概率超出无信息份额的部分,精确分解到编码振幅上。

quant-ph · cs.LG · physics.optics

查看原文摘要

When an image classifier decides, we can usually only estimate why. For quantum and all-optical classifiers that act linearly on amplitude-encoded pictures up to the measurement, with no trained classical network before or after them, each class's Born probability above its no-information share, $P_g - b_g$, splits exactly into contributions of the encoded amplitudes, shown as Born evidence maps (BEM). The split itself follows from known results on quadratic forms: with the transmitted light held fixed, it is what Integrated Gradients from a zero baseline and the Shapley value give. What we add is a way to measure it on the hardware that classifies, from class probabilities on a quantum chip or, in simulation, from camera frames on a lens bench, with no gradient circuit and no light sent backwards; a $g\times g$ map takes $1 + 2g^2$ runs. Deleting the 5% of pixels with the highest evidence drops accuracy from 73% to 9% (one seed), as occlusion and gradient $\times$ input do, while plain gradients remove much less. The classifiers share one architecture, a Fourier-plane mask followed by a brickwall circuit on qubits or by phase plates on a lens bench, read by a fixed Born headroom readout with no trained parameter; centring each picture on its own mean lets dark features count as much as bright ones. In simulation, four phase plates at one wavelength reach 72.3% on Caltech-10 colour photographs. On IBM's ibm_kingston, with the mask computed classically before approximate loading, 300 test pictures were classified at 37.7% against 10% chance (56.3% in exact simulation), and $2\times2$ maps of the filtered input of 30 test pictures drawn at random in advance, measured on the chip, agreed with the exact ones ($r = 0.88$; standard estimator 0.82). The maps also revealed a shortcut in the data; as the trim that removed it was chosen on test pictures, the Caltech-10 results are exploratory.

版本更新 · v2arXiv:2611.05445

LIBRA:可执行工具库的程序化归纳

LIBRA: Programmatic Induction of Executable Tool Libraries

Zekai Li, Zhenke Liu, Yonghao Li, Junhan Liu, Xulong Xiao, Jiapeng Zhang

AI 速读 基于摘要

LIBRA 通过让 LLM 提出工具调用契约,并在沙箱中验证这些组合,把扁平工具目录构建成可执行工具库,从而改善多工具任务的检索。

cs.SE · cs.AI · cs.IR

查看原文摘要

Large language model agents increasingly retrieve tools from large catalogs, yet most retrievers rank each tool independently by request similarity. For multi tool tasks, this recovers the goal matching tool while omitting prerequisite tools required by the workflow. We introduce LIBRA, a framework for Library Induction by Runtime Assembly that turns a flat tool catalog into an executable tool library. An LLM proposes per tool contracts of candidate invocations, reusable outputs and state changes, and success conditions; LIBRA then tests these compositions in a sandbox and retains the relations supported at runtime. Constructed before user queries, the library requires no dependency annotations, tool use trajectories, or task specific training, and supports both one-shot and agentic retrieval. On AppWorld, BFCL, and SciToolEval, LIBRA improves one-shot Recall and NDCG over the same dense retriever by 7.9 and 3.7 percentage points on average. Within ToolReAGt, it yields corresponding gains of 4.5 and 2.9 points after ten retrieval iterations.

版本更新 · v2arXiv:2606.29325

伪随机态的通用副本数放大

Generic Number-of-Copies Amplification for Pseudorandom States

Zvika Brakerski, Miri Zenilman

AI 速读 基于摘要

作者报告可将仅抗单副本区分器的量子伪随机态(1-PRS)在无额外假设下放大为任意多项式 t 副本安全的 t-PRS。

quant-ph · cs.CR

查看原文摘要

We show that any quantum pseudorandom state that is secure against single-copy distinguishers, i.e. a $1$-PRS, can be amplified to $t$-copy security, i.e. to a $t$-PRS, without additional assumptions, for any polynomial $t$ in the security parameter. Prior work (Ananth and Goldin, CRYPTO 2026) was only able to show this for a restricted class of $1$-PRS constructions, namely ones whose generators only use a small number of ancilla qubits. Technically, we show that by carefully accounting for the randomness that is used in the construction, and using quantum extractors, it is possible to eliminate an ancilla register of any length and obtain a meaningful $t$-PRS outcome.

版本更新 · v5arXiv:2501.18158

大语言模型用于加密货币交易分析:比特币案例研究

Large Language Models for Cryptocurrency Transaction Analysis: A Bitcoin Case Study

Yuchen Lei, Yuexin Xiang, Tsz Hon Yuen, Andreas Deppeler, Qin Wang, Kim-Kwang Raymond Choo

AI 速读 基于摘要

该论文提出三级分析框架与LLM4TG图表示、CETraS采样方法,评估五个大语言模型在真实比特币交易图上的节点信息提取、图特征识别与地址分类能力。

cs.CR · cs.LG

查看原文摘要

Cryptocurrency transaction analysis often relies on black-box machine learning models that achieve high predictive performance but offer limited interpretability of transaction behaviors. This paper investigates the capabilities of large language models (LLMs) in analyzing real-world Bitcoin transaction graphs through a three-level framework: foundational metrics, characteristic overview, and contextual interpretation. To address token constraints, we introduce LLM4TG, a compact, human-readable graph representation, and CETraS, a connectivity-enhanced graph sampling algorithm. Experiments across five LLMs show that node-level information extraction achieves over 98.50% accuracy on most metrics, while meaningful graph characteristics are identified in up to 95.00% of responses. For address classification with limited labeled examples, top-1 accuracy reaches 50.49% using raw graphs, while top-3 accuracy reaches 72.43% using engineered features. These findings demonstrate the potential of LLMs for transaction graph analysis while revealing limitations in global graph reasoning, precise address classification, and explanation reliability.

版本更新 · v2arXiv:2606.26718

基于潜在ODE的心室全心动周期运动建模:从电影MRI到心衰风险预测

A latent ODE approach to full-cycle biventricular cardiac motion modeling from cine MRI

David Brüggemann, Ekaterina Krymova, Firat Özdemir, Jochen von Spiczak, Sebastian Kozerke, Samia Mora, Robert Manka, Mathieu Salzmann 等 9 位作者

AI 速读 基于摘要

作者提出一种结合心率感知神经常微分方程与图网格自编码器的潜在动力学模型,将双心室全心动周期电影MRI运动编码为连续潜在轨迹,并检验其偏离协变量条件先验能否预测新发心力衰竭。

cs.AI · cs.CV

查看原文摘要

Cardiac magnetic resonance imaging (CMR) captures rich spatiotemporal information about ventricular structure and motion, but conventional risk models use only a few image-derived indices from selected cardiac phases. We present a latent dynamical model that encodes bi-ventricular anatomy and full-cycle cine motion as a continuous latent trajectory, using heart-rate-aware neural ordinary differential equation (ODE) dynamics and a graph-based mesh autoencoder to reconstruct anatomically consistent 3D+t ventricular motion. A covariate-conditioned prior defines the expected end-diastolic latent state, and a Cox proportional hazards model tests whether deviations from this prior predict incident heart failure. We studied 72,386 UK Biobank participants without baseline cardiovascular disease, including 367 incident heart failure events. In a held-out evaluation subset, adding the latent score to refitted pooled cohort equations improved the stratified C-index from 0.704 to 0.785, compared with 0.764 for seven established cardiac markers. Compared with non-graph and non-ODE approaches, the proposed model gave the best trade-off between reconstruction fidelity, generative realism, and downstream prognostic performance. These results suggest that continuous full-cycle modeling of ventricular motion provides informative cardiac phenotypes beyond conventional CMR summaries, while external validation in more representative patient cohorts is required before clinical risk-prediction use.

版本更新 · v2arXiv:2604.15279

面向混合HPC-量子系统电路切割的波次调度

Wave-Based Dispatch for Circuit Cutting in Hybrid HPC-Quantum Systems

Ricard S. Raigada-García, Josep Jorba, Sergio Iserte

AI 速读 基于摘要

提出DQR运行时框架,把电路切割产生的片段作为一等可调度单元,在HPC-量子混合环境中实现波次式并发调度与片段级故障转移。

cs.DC

查看原文摘要

Hybrid High-performance Computing (HPC)-quantum workloads based on circuit cutting decompose large quantum circuits into independent fragments, but existing frameworks tightly couple cutting logic to execution orchestration, preventing HPC centers from applying mature resource management policies to Noisy Intermediate-Scale Quantum (NISQ) workloads. We present DQR (Dynamic Queue Router), a runtime framework that bridges this gap by treating circuit fragments as first-class schedulable units. The framework introduces a backend-agnostic fragment descriptor to expose structural properties without requiring execution layers to parse quantum code, a wave-based coordinator that achieves pipeline concurrency via non-blocking polling, and a production-ready implementation on the CESGA Qmio supercomputer integrating both QPUs local on-premises (Qmio) and remote cloud (IBM Torino) backends. Experiments on a 32-qubit Hardware-Efficient Ansatz (HEA) circuit demonstrate not only makespan improvements over a monolithic CPU baseline but also transparent per-fragment failover recovery-specifically rerouting tasks from the local QPU to classical simulators upon encountering hardware-level incompatibilities-without pipeline restart. For deeper circuits, the coordination residual accounts for only 5% of the total execution time, highlighting the framework's scalability. These results show that DQR enables HPC centers to integrate NISQ workloads into existing production infrastructure while preserving the flexibility to adopt improved cutting algorithms or heterogeneous backend technologies.

版本更新 · v2arXiv:2609.35670

具有常数最大最小份额保证的期望真实机制

Truthful-in-Expectation Mechanism with Constant Maximin-Share Guarantee

Mengfan Ma, Biaoshuai Tao, Fangxiao Wang

AI 速读 基于摘要

作者提出一种期望真实(TIE)的随机分配机制,利用基数估值信息,在每次实现中都保证每位代理人至少获得其截断比例份额(TPS)的 1/6,从而也至少获得其最大最小份额(MMS)的 1/6。

cs.GT

查看原文摘要

We study the truthful and fair allocation of $m$ indivisible goods to $n$ strategic agents with additive valuations. Babaioff, Feige, and Manaker Morag (FOCS~2026) gave a randomized mechanism that uses only the agents' rankings of the goods, is truthful-in-expectation (TIE), and guarantees every agent $1/(H_{n-1}+2)=Θ(1/\log n)$ of her maximin share (MMS) in every realized allocation, where $H_{n-1}$ is the $(n-1)$th harmonic number; this is nearly the best possible with rankings alone. They conjectured that cardinal information allows TIE mechanisms to achieve a constant ex-post MMS guarantee. We confirm this conjecture: our TIE mechanism gives every agent at least $1/6$ of her truncated proportional share (TPS), and hence of her MMS, in every realized allocation. Moreover, the mechanism is ex-ante envy-free and can be implemented in polynomial time as an explicit lottery over at most $m(n-1)+1$ allocations.

版本更新 · v2arXiv:2511.12451

CCMP:面向高维特征选择的类条件多重共线性剪枝

CCMP: Class-Conditional Multicollinearity Pruning for High-Dimensional Feature Selection

Abdullah Al Bashit, Prakash Nepal, Lee Makowski

AI 速读 基于摘要

提出类条件多重共线性剪枝(CCMP),通过在每个类别内迭代剔除高度相关特征对中的一个特征,实现高维科学测量数据的特征选择,并给出剪枝误差的理论界。

eess.IV · cs.LG

查看原文摘要

In high-dimensional scientific measurements, many features in a single sample often capture the same underlying physical attributes, producing severe multicollinearity. Supervised feature selectors fit on the entire dataset, so a feature can be informative for classification overall while still redundant with another feature in the same class. Class-conditional selectors, by contrast, trade some accuracy for a narrower, per-class view, since they never see data outside one class, but this lets new classes be added without refitting the whole model. They still cannot determine, however, which feature to drop from a correlated group. To close this gap, we propose classconditional multicollinearity pruning (CCMP), which iteratively prunes one feature from every highly correlated pair, per class. Four theoretical guarantees establish explicit bounds on the error induced by pruning under stated assumptions. Across four benchmark datasets spanning spectroscopic and hyperspectral imaging modalities, CCMP retains as few as 42 of 1531 features (3%) and as many as 60 of 145 (41%), outperforms every classconditional baseline, and remains competitive with supervised methods.

版本更新 · v3arXiv:2506.03757

Fisher-Rao 几何中的 PPO

PPO in the Fisher-Rao geometry

Razvan-Andrei Lascu, David Šiška, Łukasz Szpruch

AI 速读 基于摘要

作者在 Fisher-Rao 几何下推导更紧的策略代理目标并提出 FR-PPO,给出单调策略改进与次线性收敛的理论保证,并初步验证其可作为 PPO 的即插即用替代。

cs.LG · math.OC

查看原文摘要

Proximal Policy Optimization (PPO) is widely used in reinforcement learning due to its strong empirical performance, yet it lacks formal guarantees for policy improvement and convergence. PPO's clipped surrogate objective is motivated by a lower bound on linearization of the value function in flat geometry setting. We derive a tighter surrogate objective and introduce Fisher-Rao PPO (FR-PPO) by leveraging the Fisher-Rao (FR) geometry. Our scheme provides strong theoretical guarantees, including monotonic policy improvement. In the direct parametrization setting, we show that FR-PPO achieves sub-linear convergence, and for parametrized policies we further obtain sub-linear convergence up to the compatible function approximation error. Finally, although our primary focus is theoretical, we also demonstrate empirically that FR-PPO can be implemented as a drop-in replacement for PPO and achieves performance comparable to PPO across a range of standard reinforcement learning tasks.

版本更新 · v2arXiv:2609.09384

有向安全协调中的网络化可容许性保持控制

Networked Admissibility-Preserving Control for Directed Safe Coordination

Abhinav Sinha, Lohitvel Gopikannan, Shashi Ranjan Kumar

AI 速读 基于摘要

针对固定有根有向图上输入受限的标量智能体,提出网络化可容许性保持控制架构,使各智能体在异构非对称输入界下安全协调进入共同移动输出走廊。

eess.SY · cs.MA · cs.RO · math.DS

查看原文摘要

This paper addresses safe coordination of scalar agents with constrained input dynamics over fixed rooted digraphs. We propose a networked Admissibility-Preserving Control (APC) architecture for a common moving output corridor under heterogeneous asymmetric input bounds, wherein the Admissibility-Preserving Input Realization (APIR) generates the physical inputs. In logarithmic barrier coordinates, the closed-loop dynamics form an exact cascade of exponentially decaying realization errors and directed consensus dynamics. We derive direction-specific compatibility conditions that guarantee uniform corridor and input margins, bounded commands, unique complete solutions, and exponential consensus for compact initial sets. The closed-form expression for the agreement value quantifies the effect of the initial APIR mismatch. Under the corresponding compatibility conditions, partial pinning guarantees safe reference tracking whenever the root component contains at least one informed agent. Simulations illustrate the coordination guarantees.

版本更新 · v3arXiv:2606.28925

面向语言模型智能体系统的集合值路由:WildChat 基准与成本感知评估

Set-Valued Routing for Language-Model Agent Systems: A WildChat Benchmark and Cost-Aware Evaluation

Ananto Nayan Bala, Faisal Muhammad Shah

AI 速读 基于摘要

作者构建了基于 WildChat 的多智能体集合值路由基准,并比较多种路由方法在集合质量与成本效用上的表现。

cs.LG · cs.AI · cs.IR · cs.MA

查看原文摘要

Language-model agent systems must map natural-language requests to one or more specialized agents before planning or tool execution. This decision is often treated as top-1 selection, although compositional requests can require several capabilities and unnecessary dispatch raises cost. We formulate fixed-catalog routing as set-valued language understanding and construct a benchmark of 3,000 WildChat prompts over 12 capability-defined agents. Reproducible schema-guided reference sets are balanced by agent frequency and route cardinality. We compare profile retrieval, multilabel classifiers, a fine-tuned text encoder, and catalog-conditioned zero-shot GPT-4o. Evaluation combines set quality, latency, capability coverage, and ordinal-cost utility. The encoder attains 89.59 F1, compared with 71.79 for linear SVM and 41.51 for GPT-4o, and retains 88.02 F1 under a harder semantic-group split. We further introduce Weighted Agent Routing (WAR), a deterministic post-scoring rule that changes the quality-cost operating point without retraining; Encoder+WAR obtains the best constrained utility. The results show that catalog-specific supervision and explicit set construction are important for multi-agent dispatch, while cost-aware decision layers can complement strong language encoders.

版本更新 · v3arXiv:2608.04457

Eigenius:一个具有认知分层与制度中介推理的类型化知识图谱数据库管理系统

Eigenius: A Typed Knowledge-Graph DBMS with Epistemic Stratification and Institution-Mediated Reasoning

Hans-Martin Will, Allen L. Brown, Matthew Fuchs

AI 速读 基于摘要

Eigenius 是一个开源类型化知识图谱 DBMS,通过将类型系统、存储引擎与集成协议耦合于统一内核,使数据溯源成为结构性不变量,并在 Lean 4 中机械化其元理论。

cs.DB · cs.AI · cs.LO

查看原文摘要

As "AI Scientists" emerge to drive research via the Model Context Protocol (MCP), systems relying on ephemeral scripts will fail. The sheer scale of stateful, interconnected evidence requires a machine-walkable warranty grounded in a purpose-built database architecture. Eigenius is an open-source, typed knowledge-graph DBMS built on a single premise: answering the audit question ("what do you know, and what is your warranty?") requires a unified kernel. By tightly coupling the type system, storage engine, and integration protocol, Eigenius turns data provenance into a structural invariant rather than a property reconstructed across subsystem boundaries. The kernel rests on three pillars whose metatheory is mechanized in Lean 4: a dependent type theory (EigenTT) separating confluent conversion from ontology subsumption and keeping proof irrelevance axiomatic so distinct warrants remain inspectable; proof-calculus institutions acting as strongly typed integration boundaries; and a content-addressed immutable storage layer. Epistemic status (declared/observed/derived/verified) forms a bounded lattice over a justification logic enforced at commit. Cross-system comorphisms carry explicit axiom policies (Adopt, Discharge, Relativize), transport witnesses at commit, and materialize outputs into the graph, while EigenQL provides a Grothendieck query view across all hosted logics and shared on-chain IRs collapse multi-system translations to identity. Pairing empirical justification logic with an in-process Lean 4 term checker, an end-to-end recomputation of a published Nature study from pinned data discharges all 52 derived conclusions and surfaces four machine-checked discrepancies in the original study.

版本更新 · v2arXiv:2606.13796

递归训练的扩散模型:极限坍缩分布与谱刻画

Recursively Trained Diffusion Models: Limiting Collapse Distribution and Spectral Characterization

Naïl B. Khelifa, Richard E. Turner, Ramji Venkataramanan

AI 速读 基于摘要

作者证明即使分数估计完美、采样精确,反向扩散的提前停止也会使递归训练几何收敛到唯一极限分布,该分布是数据分布不断高斯平滑版本的无限混合,并呈低通滤波效应。

stat.ML · cs.LG

查看原文摘要

Recursive training of generative models on their own outputs can lead to model collapse, a compounding drift away from the true data distribution. Existing theoretical works bound finite-round error accumulation in the context of diffusion models, but two questions remain open:~what distribution does the recursion converge to, and how fast? We answer both, isolating a mechanism distinct from imperfect learning: even with perfect score estimation and exact sampling, the early stopping of the reverse diffusion (required for numerical stability) drives a progressive drift away from the data distribution. We prove that this recursion converges geometrically to a unique limiting distribution, which admits a closed-form characterization as an infinite mixture of increasingly Gaussian-smoothed versions of the data distribution. A Hermite spectral decomposition of this limit reveals that recursive training acts as a low-pass filter: higher-order modes, which encode fine non-Gaussian structure, are attenuated much more strongly than coarse modes. This spectral picture motivates annealed truncation schedules that progressively shrink truncation times across retraining rounds; we prove that any schedule converging to $0$ asymptotically eliminates recursive compounding. Finally, we show our idealized characterization is robust: in the presence of discretization and score estimation errors, the learned distribution remains in a Wasserstein-2 ball around the ideal limit, with mode-dependent contraction rates that contract high-order errors faster than low-order ones. We validate the theory on synthetic Gaussian mixtures and CIFAR-10.

版本更新 · v3arXiv:2602.01828

显微镜下的双曲图神经网络:几何与任务对齐的作用

Hyperbolic Graph Neural Networks Under the Microscope: The Role of Geometry-Task Alignment

Dionisia Naddeo, Jonas Linkerhägner, Nicola Toschi, Geri Skenderi, Veronica Lachi

AI 速读 基于摘要

作者提出除图本身是否双曲外还需考察任务是否与双曲几何对齐,并据此重新审视 HGNNs 的优势条件。

cs.LG

查看原文摘要

Many complex networks exhibit hierarchical, tree-like structures, making hyperbolic space a natural candidate wherein to learn representations of them. Based on this observation, Hyperbolic Graph Neural Networks (HGNNs) have been widely adopted as a principled choice for representation learning on tree-like graphs. In this work, we question this paradigm by proposing the additional condition of geometry--task alignment, i.e., whether the metric structure of the target follows that of the input graph. We start by empirically showing that HGNNs can recover low-distortion representations when supervision explicitly rewards metric preservation and proceed by theoretically analyzing a controlled regression setting in which a linear readout benefits from representations whose geometry is aligned with the target metric. Finally, by relying on both predictive performance and embedding distortion, we further show that HGNNs gain an advantage on link prediction, a naturally geometry-aligned task, whereas this advantage largely disappears on standard node classification benchmarks. Overall, our findings shift the focus from only asking "Is the graph hyperbolic?" to also questioning "Is the task aligned with hyperbolic geometry?", showing that HGNNs consistently outperform Euclidean models under such alignment, while their advantage vanishes otherwise.

版本更新 · v3arXiv:2601.15738

EvoDR:基于大语言模型进化调度规则的动态柔性装配流水车间调度

EvoDR: Evolving Dispatching Rules via Large Language Model for Dynamic Flexible Assembly Flow Shop Scheduling

Junhao Qiu, Haoyang Zhuang, Fei Liu, Jianjun Liu, Qingfu Zhang

AI 速读 基于摘要

提出 EvoDR 框架,利用大语言模型生成并协同进化调度规则,以应对带多产品交付、齐套供应与机器级柔性的动态柔性装配流水车间调度问题。

cs.NE

查看原文摘要

Dynamic flexible assembly flow shop scheduling with multi-product delivery, often with kitting supply and machine-level flexibility, can be found in many applications. It is difficult to design rules manually for it. Genetic programming (GP) has been used to automatically generate dispatching rules, enabling responsive scheduling while meeting high responsiveness demands. However, GP methods are dependent on fixed terminal sets and have poor interpretability. In this work, we develop an evolving dispatching rules framework (EvoDR) that leverages the semantic understanding and generation capabilities of large language models to achieve cross-domain integration of rule design and scheduling knowledge. In our proposed framework, multi-stage assembly supply decisions are modeled as priority sorting of directed edges based on heterogeneous graphs. A dual-expert co-evolution mechanism is proposed, which allows LLM-A to generate code and LLM-S conduct scheduling analysis and reflection. Guided by improvements in hybrid evaluation, adaptive rules that fit dynamic features are continuously evolved. Experimental results show that EvoDR can achieve lower average tardiness than other automatically designed state-of-the-art approaches. It also outperforms expert-designed competitors across 480 instances over 24 distinct scenarios with varying resource configurations and disturbance levels, and EvoDR demonstrates robust adaptability across diverse operating conditions.