跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

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

随机语言模型的标度极限

Scaling limit of the Random Language Model

Eric De Giuli

AI 速读 基于摘要

作者在隐藏符号数N趋于无穷、语法温度以固定x=ε̃_d log N趋于零的标度极限下,为随机语言模型建立定量理论,并推导出冻结转变及语言统计规律。

cond-mat.dis-nn · cond-mat.stat-mech · cs.CL

查看原文摘要

We develop a quantitative theory of the Random Language Model (RLM), an ensemble of stochastic context-free grammars, in a scaling limit where the number of hidden symbols $N \to \infty$ while the grammar temperature $\tildeε_d \to 0$ at fixed $x = \tildeε_d \log N$. In this limit, the model admits a controlled description based on a large-deviation principle over rule-usage patterns. A semi-annealed approximation maps the problem to a class of Random Energy Models with nontrivial combinatorics. We show that the RLM exhibits a freezing transition at a critical value $x_c=1/8$, below which rule usage condenses on a subset of preferred rules and language statistics acquire a nontrivial dependence on corpus length. A second characteristic scale at $x=1/2$, associated with the breakdown of Gaussian fluctuations, separates transition and babbling regimes. Across regimes, we derive explicit scaling laws for the number of distinct rules, entropy, and energy, identifying distinct frozen and critical regimes controlled by the interplay of grammar size, corpus length, and temperature. The theory resolves previous ambiguities regarding the existence of a thermodynamic transition and explains the slow approach to the large-$N$ limit as a consequence of the dependence on $\log N$. It further provides a unified framework in which universal statistical properties of language emerge from typical realizations of generative grammars, with implications for both natural language statistics and the behavior of large language models. Heaps' law and Zipf's law are both derived, and the dependence of predictive entropy on context length is rationalized. Comparison with empirical measurements of Heaps' and Zipf's laws yields parameter estimates for real languages.

版本更新 · v3arXiv:2512.00775

SAGAS:语义感知图辅助拼接的离线时序逻辑规划

SAGAS: Semantic-Aware Graph-Assisted Stitching for Offline Temporal Logic Planning

Ruijia Liu, Ancheng Hou, Xiang Yin

AI 速读 基于摘要

SAGAS 在离线、无模型、仅有任务无关轨迹片段的设定下,结合可复用潜在可达图与冻结目标条件执行器,为新的 LTL 公式零样本合成并执行代价感知的路径点计划。

cs.RO · eess.SY

查看原文摘要

Linear Temporal Logic (LTL) provides a rigorous framework for specifying long-horizon robotic tasks, yet existing approaches face a trade-off: model-based synthesis relies on accurate labeled transition systems, whereas learning-based methods often require online interaction, task-specific rewards, or specification-conditioned training. We study LTL-specified robotic planning and execution in an offline, model-free setting, where the agent is given only fixed, task-agnostic trajectory fragments, with no dynamics model, task demonstrations, or online data collection. To address this setting, we propose SAGAS, a framework that combines the compositionality of symbolic synthesis with the data-driven reachability structure learned from offline trajectories. SAGAS first learns a reusable latent reachability graph and a frozen goal-conditioned executor from fragmented offline data. For each new LTL formula, it performs task-time semantic graph augmentation to ground state-defined propositions on the learned graph and applies Büchi product search to synthesize a cost-aware accepting prefix--suffix waypoint plan executed by the frozen executor. This separation of learning and planning enables zero-shot generalization to unseen LTL formulas and new predicates supported by the offline data, without task-specific rewards, additional data collection, or policy retraining. Experiments on LTL task suites constructed from OGBench locomotion domains show that SAGAS achieves higher success rates and lower execution costs than baselines on diverse unseen tasks, with further evaluation in OGBench Scene demonstrating its applicability to robotic manipulation.

新论文 · v1arXiv:2611.16905

因子化单侧 Adam 矩:实用且可扩展的 SOAP

Factored One-sided Adam-Moment for Practical and Scalable SOAP

Jaemyung Yu, Byeongho Heo, Sangdoo Yun, Dongyoon Han

AI 速读 基于摘要

作者提出轻量级 SOAP 变体 FOAM,用仅输入侧预条件与因子化 Adam 矩估计,在 LLM 预训练中匹配 SOAP/Muon 的验证损失,同时将优化器状态减半并达到 Muon 级实际耗时。

cs.LG

查看原文摘要

Second-order optimizers (e.g., Shampoo, SOAP) have emerged as compelling alternatives to Adam/AdamW and promise faster per-step convergence than AdamW in transformer training. However, they still remain costly in practice, and even SOAP still pays substantial optimizer-state memory and eigendecomposition overhead. We ask whether the benefits of SOAP can be retained at nearly the efficiency of AdamW. In this paper, we answer yes with a lightweight SOAP variant, Factored One-sided Adam-Moment (FOAM). The path to practical impact is twofold: first, FOAM employs input-only preconditioning, dropping the output-side Kronecker factor to reduce memory and remove one eigendecomposition. The Kronecker structure of the Hessian shows that this is exact for a diagonal output-side curvature and nearly lossless for a near-diagonal one, as we observe empirically. Second, FOAM replaces SOAP's dense rotated second moment with a factored Adam-moment estimator based on row-by-column statistics. Under the K-FAC Fisher assumption with a diagonal output curvature, this estimator exactly recovers SOAP's dense second moment, and we measure only a 15-20% K-FAC violation, with negligible effect on the update. Our empirical results support the claim that FOAM matches strong SOAP and Muon baselines in validation loss across scales of large language model (LLM) pre-training, uses half of SOAP's optimizer state, runs at Muon-class wall-clock time, and retains robustness across a three-fold learning-rate range. The results hold from 124M to 760M parameters, demonstrating that SOAP's gains need not require SOAP's cost. Code: https://github.com/naver-ai/foam

新论文 · v1arXiv:2611.16903

基于Dempster-Shafer理论的不确定性感知量子机器学习

Uncertainty-aware quantum machine learning based on Dempster-Shafer theory

Marie Kempkes, Jakob Spiegelberg, Evert van Nieuwenburg, Vedran Dunjko

AI 速读 基于摘要

作者提出一个基于Dempster-Shafer理论的量子分类框架,让参数化量子电路直接从数据中学习对标签集合的置信度分配,从而表达预测不确定性。

quant-ph · cs.LG · stat.ML

查看原文摘要

A large body of work in quantum machine learning has centered on characterizing the expressivity and performance of quantum models. In contrast, little attention has been paid to the reliability of predictions beyond average performance measures such as accuracy. In this work, we introduce an uncertainty-aware quantum classification framework based on Dempster-Shafer theory. This theory allows to express uncertainty through weights assigned not only to individual classification labels but to sets of labels. We introduce a training strategy that enables parameterized quantum circuits to learn such assignments directly from data. This provides an efficient way to prepare the corresponding quantum states and enables the application of different post-processing strategies. In particular, it offers a practical setting for quantum Dempster-Shafer fusion procedures with polynomial resource requirements, even when the corresponding mass functions are defined over exponentially many subsets. Overall, our work represents a step toward enabling quantum models to express uncertainty about their predictions, thereby extending the evaluation of quantum models beyond predictive performance alone.

新论文 · v1arXiv:2611.16902

面向量子软件的非功能需求到超参数翻译:基于大语言模型的方法

Non-Functional Requirements to Hyperparameter Translation for Quantum Software via LLMs

Joseph G. Bronyah, Nasir U. Eisty

AI 速读 基于摘要

作者用540条合成与18条真实用户故事评测七种大语言模型,将自然语言非功能需求翻译为量子程序执行参数,并与确定性启发式基线比较语义准确率与执行结果。

cs.SE

查看原文摘要

Quantum software engineering (QSE) lacks validated approaches for translating natural-language non-functional requirements (NFRs) into execution parameters such as shots and transpiler optimization levels. Existing methods emphasize semantic similarity rather than execution outcomes. We evaluate seven large language models (LLMs) against a deterministic heuristic baseline using 540 synthetic and 18 real-world user stories. We assess semantic accuracy and execution outcomes, including time, cost, top-state probability, and two-qubit gate exposure, through Qiskit/Aer simulations. All LLMs significantly outperformed the heuristic in semantic accuracy, achieving 55.6 to 83.3 percent on real-world stories compared to 16.7 percent for the heuristic. However, no LLM demonstrated statistically significant superiority over others on the real-world dataset. Speed- and cost-oriented configurations reduced execution time and cost, but fidelity improvements were not supported. Some failures resulted from provider safety refusals rather than translation errors. Our findings demonstrate the potential of LLMs as middleware for NFR-to-configuration translation in QSE, while emphasizing execution-based validation, human oversight, and careful interpretation of model differences.

新论文 · v1arXiv:2611.16901

边式图对齐

Edge-wise Graph Alignments

Akbar Davoodi, Christoph Flamm, Daniel Merkle, Peter F. Stadler

AI 速读 基于摘要

该文提出用E-图表示图,将最大公共边子图问题转化为最大诱导子E-图问题,从而统一边式图对齐与多图对齐的定义,并给出共识图概念。

cs.DS · math.CO

查看原文摘要

Pairwise graph ``alignments'', usually defined as maximum common subgraphs, have been considered in many application domains, including the comparison of molecular structures. Most commonly, the problem is formulated as maximum common induced subgraph (MCIS) or maximum common edge subgraph (MCES) problems. Sometimes these formulations are restricted to connected common subgraphs. Common subgraph problems readily generalize to more than two input graphs. However, this concept is fundamentally distinct from the notion of multiple sequence alignments. Abstractly, alignments are defined as super-structures from which the individual input objects are recovered via structure-preserving projections. While the mathematical construction readily applies to common induced subgraphs, it does not fully encompass the common edge subgraph problem, which is the variant more commonly employed in cheminformatics applications. In order to consistently define multiple edge-based alignments of graphs we represent a graph $G$ as E-graph $(E,\mathscr{V})$, where $E$ is the edge set of $G$ and $\mathscr{V}$ is the set of sets of incident edges. This representation implicitly encodes the vertices in terms of edge data. Alignments of E-graphs are themselves E-graphs that contain the input (E-)graphs as subgraphs. Maximum edge subgraphs correspond to maximum induced sub-E-graphs, and they can thus be computed using a slightly modified version of the VF2 algorithm without the need to switch from graphs to line graphs. Furthermore, multiple alignments of (E-)graphs yield a natural definition of a consensus graph that is ``on average'' present in the input without having to be a subgraph of every (and in fact of any) input graph.

新论文 · v1arXiv:2611.16889

面向工作负载代表性的控制流剖析

Control-Flow Profiling for Workload Representativeness

Mahesh Madhav

AI 速读 基于摘要

提出一种基于地址键控的控制流剖析方法与工具套件,直接从已编译未修改的二进制评估代理工作负载对目标动态执行行为的代表性。

cs.PF · cs.AR

查看原文摘要

Workload characterization in performance engineering often replaces expensive target executions with lower-cost proxies, including reduced datasets, miniapps, and training inputs. Such substitutions require empirical verification that the proxy faithfully exercises the target's dynamic execution behavior. This paper presents an address-keyed control-flow profiling methodology and tool suite designed to evaluate workload representativeness directly from compiled, unmodified binaries. We pair time-ordered basic-block vector (BBV) recurrence analysis with exp-branchprof, an experimental Valgrind tool that captures five orthogonal structural profile families spanning branch direction bias, four-bit global history contexts, dynamic indirect targets, function call transitions, and intraprocedural CFG edges. Our method compares weighted event distributions from two executions of the same binary. It reports support coverage, reference event-mass coverage, distribution distance, entropy-derived quantities, and phase structure, rather than claiming that a single similarity score certifies a proxy. We validate the tool with exact-oracle microbenchmarks across AArch64 and x86-64, covering conditional and inverted exits, calls, returns, direct and indirect jumps, and forked processes. We then apply the workflow to SPEC CPU2017 and CPU2026 train/reference pairs and seven refrate/refspeed pairs. The corpus contains both close matches and cases where a shorter execution reaches much of the same code but misses substantial target, callgraph, CFG, or BBV event mass. The accompanying artifact supports the same analysis for proprietary workload/proxy pairs without requiring raw PC-level profiles to leave the collection environment.

新论文 · v1arXiv:2611.16886

Dafny 中的 LLM 辅助验证

LLM-Assisted Verification in Dafny

Wieger Wesselink, Kees Huizing, Huub van de Wetering

AI 速读 基于摘要

提出一个十步工作流,用 LLM 辅助在 Dafny 中验证复杂算法,并在 37 个算法上评估,包括 Hopcroft-Tarjan 三连通性测试。

cs.LO · cs.AI · cs.SE

查看原文摘要

Formal verification of complex algorithms requires expertise in program specification, invariant construction, mathematical proof, and the management of automated theorem provers. Although large language models (LLMs) can generate program code and proof fragments, reliably developing complete machine-checked verifications remains challenging: it requires an iterative process of constructing and validating specifications and invariants, building proofs, diagnosing solver failures, and optimizing verification performance. This paper presents a systematic ten-step workflow for LLM-assisted verification of scientific algorithms using the Dafny verification system. The workflow integrates algorithm formalization, contract development, empirical invariant validation, proof construction, bottleneck profiling, and resource-driven proof optimization. We applied the workflow using Antrhopic's Claude Opus 5 and Opus 5.5 models, combining LLM-driven development with automated testing and verification feedback, while retaining human oversight for correctness-critical decisions and strategic interventions. We evaluate the approach on 37 complex algorithms from graph theory and labelled transition systems. Notably, we verified the Hopfcroft-Tarjan triconnectivity test, demonstrating that even highly challenging algorithmic verification tasks can be carried out through a structured LLM-assisted workflow. Many of our machine-checked verifications were obtained within hours to a few days of interactive development. Our results suggest that LLM-assisted workflows can shift the role of the human verifier from detailed proof construction toward supervision, specification review, and strategic guidance.

版本更新 · v2arXiv:2605.23628

操纵基准有多难?排行榜鲁棒性的社会选择分析

How Hard Is It to Rig a Benchmark? A Social Choice Analysis of Leaderboard Robustness

Polina Gordienko, Georg Schollmeyer, Frauke Kreuter, Christoph Jansen

AI 速读 基于摘要

将基准特定训练视为选举操纵,分析不同聚合规则下排行榜被操纵的难度,发现平均胜率最难被操纵。

cs.LG

查看原文摘要

Multi-task benchmarks have become a central pillar of machine learning research, yet their growing influence has incentivised benchmark gaming -- strategic actions taken to improve the leaderboard rank of a specific model. Treating datasets as voters and models as candidates, we consider benchmark-specific training -- the inclusion of benchmark data in training -- as a form of election manipulation. For any ordinal benchmark, the problem of choosing datasets to train on so that a target model becomes top-ranked corresponds to shift bribery, a class of manipulation problems from computational social choice. Leveraging this identification, we show that the benchmark-specific training problem is NP-hard under Borda count and mean win rate. Complementing this worst-case perspective, we introduce the instance-level robustness, the minimum number of datasets a model developer must include in training to top a given leaderboard, and derive expressions for it under arithmetic mean, median, mean win rate and pairwise majority. We evaluate these expressions on MMLU under HELM and on BIG-Bench Hard (BBH) under the Open LLM Leaderboard. Across both suites, mean win rate is hardest to manipulate: this gap is clear on BBH (24 tasks, 4507 models), where its median robustness is 22 tasks (92%), compared with 13 (54%) under arithmetic mean and 12 (50%) under median and pairwise majority.

新论文 · v1arXiv:2611.16884

水下声学网络中抗碰撞的全对全广播调度

Collision-Resilient All-to-All Broadcast Scheduling in Underwater Acoustic Networks

Guoliang Weng, Enqi Zhang, Lizhao You, Deqing Wang, Liqun Fu

AI 速读 基于摘要

针对具备抗碰撞物理层的水下集群,作者提出神经网络接收模型并嵌入MILP与两阶段ACO启发式,以优化全对全广播调度。

cs.NI

查看原文摘要

This paper studies all-to-all broadcast scheduling for underwater swarms with collision-resilient physical layers that can decode asynchronously overlapping packets. Propagation-aware collision-free schedulers coordinate packet arrivals but do not account for this reception capability. We first design a data-driven neural reception model that captures per-interferer power and timing effects. The model improves prediction accuracy over SINR baselines while admitting an exact mixed-integer linear programming (MILP) formulation. The resulting neural-network-embedded MILP (NN-MILP) optimizes transmission times while explicitly encoding schedule-dependent overlaps and the predictor's inference, enabling globally optimal scheduling for small-scale instances. For larger networks, a two-stage ant colony optimization (ACO) heuristic combines low-cost transmission-order search with neural-aware timing refinement. Simulation results show that ACO shortens broadcast rounds compared with existing schedulers. It approaches the NN-MILP optimum on small-scale instances while supporting larger networks at substantially lower computational cost.

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

读、解析、描述:统一文档解析与视觉元素描述生成

Read, Parse, Describe: Unified Document Parsing with Visual Element Description Generation

Yuheng Chen, Yufan Chen, Zhuojun Cai, Ruiping Liu, Junwei Zheng, Jiale Wei, Di Wen, Weijia Fan 等 11 位作者

AI 速读 基于摘要

提出统一数据集 Read-Parse-Describe 和空间感知增强器,要求模型对页面图像输出包含布局、阅读顺序、文本和视觉元素替代文本的单一页面级解析。

cs.CV · cs.AI

查看原文摘要

Document understanding systems are typically evaluated as separate components via layout analysis, optical text recognition, reading-order prediction, and image captioning. This separation leaves scientific figures, captions, and visual semantics weakly connected, and fails to measure whether a model can produce a single page-level parse that is both structurally faithful and semantically accessible. We introduce Read-Parse-Describe, a unified dataset for document parsing with visual element description generation. Given a page image, models are required to output an ordered list of layout elements containing bounding boxes, semantic labels, reading-order indices, recognized textual content, and alternative text descriptions for visual elements. The benchmark is built from 2,402 documents, comprising 18,163 continuous pages, 125,218 layout elements, and 11,338 visual instances. Besides, we further propose a plug-and-play space-awareness enhancer that reuses multi-layer visual features and injects grid-aware spatial guidance into vision-language tokens for layout-aware generation. Experiments across end-to-end VLMs and pipeline parsers show that existing systems still struggle to jointly recover reading order and visual semantics, while our enhanced model achieves strong joint performance. These results highlight the need to move beyond isolated document parsing modules toward unified models that jointly read, parse, and describe complex documents. The new dataset and code will be made publicly available at https://github.com/yuheng98chen/RPD-Unidoc

新论文 · v1arXiv:2611.16880

向下封闭预言家与秘书问题的紧确界

Tight Bounds for Downward-Closed Prophet and Secretary Problems

Hanrui Zhang

AI 速读 基于摘要

该论文在任意向下封闭可行性约束下,为不同到达顺序和分布假设的在线选择问题建立了渐近紧确的竞争比界。

cs.GT · cs.DS

查看原文摘要

We study online selection problems subject to arbitrary downward-closed feasibility constraints, under different arrival orders, with different distributional assumptions. We establish the following bounds: (1) $Θ(\log^2 n / \log \log n)$ for the standard (adversarial-order) prophet problem, (2) $Ω(\log n)$ for the (Bayesian, random-order) prophet secretary problem, and by extension, for the standard (prior-free, random-order) secretary problem, and (3) $O(\log n / \log \log n)$ for the free-order prophet problem. Together with complementary bounds established in prior work, these results pin down the asymptotically tight competitive ratios for all these variants of prophet and secretary problems subject to downward-closed constraints. Our results refine and reinforce the big-decisions-first principle by Rubinstein and Singla [2026], establishing a superconstant separation between the random-order and free-order models.

新论文 · v1arXiv:2611.16879

上下文图:AI-RAN 中可解释的多智能体决策链

Context Graph: Explainable Multi-Agent Decision Chains in AI-RAN

Xijun Wang, Zhaoyang Liu, Xiang Chen, Howard H. Yang, Chenyuan Feng

AI 速读 基于摘要

提出一种异构有向图“上下文图”,把策略、测量、决策与告警组织成可查询的解释层,用于追踪 AI-RAN 中跨智能体的决策因果链。

cs.NI · cs.AI · cs.IT

查看原文摘要

AI-RAN distributes network control across multiple autonomous agents, namely xApps and rApps operating over shared radio resources. When an alert or degradation appears, operators currently lack a structured way to trace which decision caused it, what context triggered that decision, and how other agents interacted. Existing explainability tools focus on single-model feature attribution or linear event logging, neither of which captures cross-agent decision chains. We propose the Context Graph, a heterogeneous directed graph that organizes policies, measurements, decisions, and alerts into a queryable explanation layer. Its foundational primitive is the Decision-Event node acting as a causal junction, where incoming edges capture triggering context and outgoing edges track downstream consequences that are progressively upgraded through counterfactual verification. Instantiated over existing E2, A1, and O1 data flows, our proof-of-concept demonstrates that compliance and diagnosis queries are resolved at sub-millisecond latency over graphs of tens of thousands of nodes, while reliably distinguishing true causal impacts from spurious correlations.

新论文 · v1arXiv:2611.16878

面向LEO卫星网络业务连续性的拓扑感知切换管理

Topology-Aware Handover Management for Service Continuity in LEO Satellite Networks

Jui-Che Han, Nasir Khan, Siva Satya Sri Ganesh Seeram, Cicek Cavdar

AI 速读 基于摘要

作者提出一种基于PPO的拓扑感知切换框架,利用RSRP、卫星—地面站关联、剩余可见时间和仰角决定切换时机与目标卫星,并在仿真中报告了较高的业务可用性。

cs.NI

查看原文摘要

Low Earth orbit (LEO) satellites are expected to play a key role in sixth-generation (6G) non-terrestrial networks. The high mobility of LEO satellites necessitates frequent handovers (HOs), posing challenges to service continuity and availability for user equipment. Conventional methods based on handover margin (HOM) and time-to-trigger (TTT) have limited adaptability to time-varying channel conditions and do not explicitly account for the impact of feeder-link and ground station (GS) connectivity on HO interruption time. To address these limitations, this paper develops a topology-aware HO framework based on proximal policy optimization (PPO). The framework uses reference signal received power (RSRP), satellite--GS associations, remaining visibility time, and elevation angles to determine when to initiate an HO and which satellite to select. Simulation results demonstrate that the proposed policy achieves a service availability of 99.32% at a minimum elevation angle of 40 degrees, exceeding that of optimized HOM--TTT (O-HT) and least-delay (LD) satellite selection by 1.67 and 1.41 percentage points, respectively. The policy maintains service availability above 97.52% as the minimum elevation angle increases to 55 degrees, demonstrating its ability to sustain high service availability under stricter elevation constraints.

新论文 · v1arXiv:2611.16877

基于高斯过程的信息路径规划:误差界、算法与基准

Informative Path Planning with Gaussian Processes: Error Bounds, Algorithms, and Benchmarks

Kalvik Jakkala, Jennifer Wakulicz, Donald G. Dansereau, Srinivas Akella, Lantao Liu, Jason M. O'Kane

AI 速读 基于摘要

该论文对基于高斯过程的信息路径规划进行理论分析,论证预测方差是理论上理想的优化目标,并分析 GreedyCover 的近似保证与基准表现。

cs.RO

查看原文摘要

Accurate environmental monitoring relies on Informative Path Planning (IPP) to deploy autonomous systems that maximize information gain. While Gaussian Processes (GPs) provide a robust mathematical foundation for modeling the environment, contemporary IPP approaches remain hindered by heuristic operational constraints and the lack of simultaneous theoretical guarantees for worst-case estimation error and approximation quality. Rather than introducing yet another heuristic, this paper presents a rigorous theoretical analysis of existing error bounds and algorithms to further develop the mathematical foundation for IPP. By evaluating probabilistic and deterministic bounds on reconstruction error, we establish that predictive variance is the theoretically ideal optimization objective for GP-based IPP. Furthermore, we analyze GreedyCover, a recent approach for optimizing predictive variance, and demonstrate that its near-optimal approximation guarantee matches the fundamental hardness-of-approximation limit for the problem. Comprehensive benchmarking confirms that this approach delivers superior estimation accuracy and computational efficiency compared to prominent information-theoretic objectives and optimization methods used in IPP. Finally, this theoretical analysis establishes a rigorous, near-optimal foundation for discrete offline IPP under bounded uncertainty constraints, offering clear and principled guidance for future work in continuous-space and online formulations.

新论文 · v1arXiv:2611.16874

随机核模态分解:信息、不确定性与条件状态推断

Stochastic Kernel Mode Decomposition: Information, Uncertainty, and Conditional Regime Inference

Boumediene Hamzi, Houman Owhadi

AI 速读 基于摘要

sKMD 研究在测量质量变化时模态能量能否保留状态信息,并给出能量充分性的理论条件与实验验证。

stat.ML · cs.CE · cs.LG · math.DS · nlin.PS

查看原文摘要

When do mode energies preserve regime information as measurement quality changes? Stochastic Kernel Mode Decomposition (sKMD) fits joint regime laws on signed KMD mode coordinates and transfers the reference mode posterior to regime probabilities and conditional reconstructions. For centered Gaussian regimes with independently varying known noise variances, fixed coordinate energies retain the full regime posterior precisely when all classes share their cross-covariances and class variances can differ only at isolated vertices of the covariance graph. We extend the characterization to nonzero means and show that freely varying correlated noise forces a fixed linear log-odds decoder to retain the full quadratic feature span even for two distinct centered regimes. At fixed quality, a three-regime example has no sufficient two-energy basis. Its smallest Bayes log-loss gap over bases of condition number at most $κ$ has sharp order $κ^{-1}$. Exact Bayes energy posteriors supply numerical gap estimates for specified bases. Additional bounds relate feature compression, independently learned mode spans and sensor-noise error to log loss. Two controlled experiments with 64 independent panels each show that signed information can improve prediction over energy summaries, while integration gives small gains over strong signed controls and depends on how the competing point rule is calibrated and how accurately observation noise is measured.

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

ACE-CaP-0:经验时代的真实世界代码即策略

ACE-CaP-0: Real-World Code-as-Policies in the Era of Experience

ACE-CaP Team, Changxu Wei, Yunpeng Qing, Guozheng Ma, Bowen Liu, Zexin He, Yilun Kong, Haoming Gu 等 28 位作者

AI 速读 基于摘要

作者提出 ACE-CaP-0 智能体配方,通过“按需演示”与“按需仿真”结合策略修订与经验获取,在八项真实机器人操作任务上以冻结程序实现 92.1% 成功率。

cs.RO

查看原文摘要

Recent advances in frontier models have pushed the boundaries of agentic robot control, enabling agents to perform complex robotic tasks through reasoning and interaction. However, repeated calls to these models during execution can substantially increase task completion time. Code as Policies (CaP) offers a route for coding agents to acquire physical skills through experience and retain them in executable programs, allowing the reasoning invested in development to be reused across runs. Developing reliable code policies while limiting the cost of physical experimentation remains a central challenge. We investigate human guidance as a source of priors for feasible actions and simulation as an auxiliary environment for exploring and testing candidate policies. Our findings favor robot demonstrations available on request and simulation used selectively during real-world policy refinement. These findings inform ACE-CaP-0, an agentic recipe that couples policy revision with experience acquisition through Demonstrations on Request and Simulation on Demand. Across eight real-world manipulation tasks spanning alignment, multi-object handling, and bimanual coordination, the resulting frozen programs achieve 92.1\% success (221/240 trials). Mean execution times across tasks range from 0.97 to 2.27 minutes. The programs execute with runtime perception and control, without a human or coding agent in the loop. These results highlight CaP's potential to turn experience into reliable, reusable physical skills.

新论文 · v1arXiv:2611.16871

DPA:面向高度异构数据的去中心化原始平均与准全局动量

DPA: Decentralized Primal Averaging with Quasi-Global Momentum for Highly Heterogeneous Data

Diyako Ghaderyan, Stefan Werner

AI 速读 基于摘要

提出去中心化原始平均算法DPA及其单轮通信变体DPA-1G,利用准全局动量缓解数据异构带来的优化困难,并在理论上给出收敛界与线性加速条件。

cs.LG · cs.AI

查看原文摘要

Decentralized training of deep learning models keeps training data local and supports on-device learning over networks. In realistic scenarios, heterogeneity across agents' local data poses an optimization challenge and can severely degrade test accuracy, especially on sparse communication graphs. Building on recent advances in centralized primal averaging, we propose Decentralized Primal Averaging (DPA), a decentralized learning algorithm that combines primal averaging with a local quasi-global momentum buffer. DPA maintains three coupled sequences for optimization, gradient evaluation, and output averaging, while using consecutive mixed iterates to construct a network-aware momentum direction without transmitting an auxiliary tracking variable. For smooth nonconvex objectives, we establish a convergence bound for DPA and identify conditions for linear speedup in the number of agents for sufficiently many iterations. We also introduce DPA-1G, a variant that uses one communication round per iteration and matches the per-iteration communication cost of DSGD-style baselines. Experiments following the GUT decentralized image-classification benchmark show that DPA compares favorably with DSGD, gradient tracking, QG-DSGDm, momentum tracking, and QG-GUTm across datasets, architectures, topologies, and heterogeneity levels, with the largest gains under high heterogeneity on sparse rings. At the same total communication cost, both DPA variants achieve higher mean test accuracy than the best baseline on CIFAR-10 and CIFAR-100 with ResNet-20. Our code is publicly available.

版本更新 · v3arXiv:2606.25832

MiniOpt:有限资源下通过推理建模与求解通用优化问题

MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources

Ke Zhao, Zixiang Di, Hong Qian, Xiang Shu, Yaolin Wen, Qitao Shi, Bingdong Li, Xingyu Lu 等 12 位作者

AI 速读 基于摘要

MiniOpt 是一种轻量级优化专用大语言模型,通过“推理到建模与求解”范式和两阶段 RLVR 训练,在有限参数与数据下提升跨优化结构的泛化能力。

cs.LG · cs.AI

查看原文摘要

Achieving strong optimization generalization across diverse optimization problems while requiring limited training resources remains a challenging problem for optimization-oriented large language models (LLMs). Existing learning-based methods, however, typically require large-scale supervised data, expensive intermediate step verification, and extensive computational resources, while exhibiting limited optimization generalization across diverse optimization structures. In this paper, we propose \textsc{MiniOpt}, a lightweight optimization-specialized LLM trained through a reasoning-to-model-and-solve paradigm and a two-stage training framework with reinforcement learning with verifiable rewards (RLVR). MiniOpt encourages structure-oriented optimization learning by reinforcing the completeness of optimization formulations and optimization outcomes. Extensive experiments on eight optimization benchmarks demonstrate that MiniOpt consistently outperforms existing learning-based optimization models while requiring substantially fewer parameters and training data. To further understand optimization generalization, we introduce a complementary parameter-decoupled evaluation protocol that disentangles optimization structure understanding from numerical parameter processing. The results reveal that MiniOpt preserves optimization capability under parameter-decoupled settings significantly better than previous optimization-specialized models, suggesting that its performance gains primarily originate from stronger optimization structure understanding. These findings demonstrate an effective pathway toward efficient and generalizable optimization-specialized LLMs. The code is available at https://github.com/Hsiang-1/MiniOpt.

版本更新 · v2arXiv:2611.14433

基于准循环码与Construction X的GF(7)、GF(8)和GF(9)上的新线性码

New linear codes over GF(7), GF(8) and GF(9) from quasi-cyclic codes and Construction X

Sebastian Cochinescu

AI 速读 基于摘要

作者报告利用准循环码与Construction X在GF(7)、GF(8)、GF(9)上构造出若干最小距离比Grassl已知最优线性码表下界大1的线性码。

cs.IT

查看原文摘要

We present linear codes with parameters [88,8,64]_7, [90,8,65]_7, [98,7,75]_8, [97,8,72]_8, [44,7,31]_9, [97,8,71]_7, [85,6,67]_8 and [78,8,56]_7. Each has a minimum distance one larger than the lower bound listed in Grassl's tables of best known linear codes; codes with parameters [89,8,64]_7, [96,8,71]_8, [95,8,70]_8, [94,8,69]_8, [77,8,55]_7 and [86,6,68]_8 follow. Seven of the eight codes are obtained from a quasi-cyclic code and a vector that is constant on each block, by Construction X with a repetition code. The remaining one, the [90,8,65]_7 code, is obtained from the first by appending two coordinates. The parameters and all weight counts were obtained by exhaustive enumeration, and a short program that repeats these computations is included.

新论文 · v1arXiv:2611.16849

受限交表示与禁用模式

Constrained intersection representations and forbidden patterns

Laurent Feuilloley, Michel Habib, Amalia Sorondo

AI 速读 基于摘要

研究几何交图类与禁用有序模式图类之间的关系,并给出二者可相互刻画与不可相互刻画的结果。

cs.DM · math.CO

查看原文摘要

We study the interplay between two types of graph classes: the ones defined by intersections of geometric objects and the ones defined by the absence of a substructure. More precisely, we study intersection graphs that are grounded, that is, the objects lie above a horizontal line that they touch, and ordered graphs with forbidden patterns, that is, ordered graphs that avoid a set of ordered induced subgraphs. These two approaches are fundamentally different, but it is known that several interesting graph classes have both types of characterizations, and we aim to understand whether this is a general phenomenon. Our contributions are the following. First, we identify a family of patterns on four vertices and a natural hierarchy of intersection graphs of strings whose classes are nicely interleaved. This raises hopes to prove connections between the two perspectives. Second, we dampen these hopes by proving that a class of (ordered) intersection graphs that we study cannot be characterized by a finite set of forbidden patterns. Third, we show a dual impossibility result: there exists a pattern-defined class of our hierarchy that admits no intersection representation, if we require this representation to be closed under natural operations such as translation and scaling. However, it turns out that if we allow slightly more exotic intersection representations, then we can find one for this pattern-defined class.

新论文 · v1arXiv:2611.16844

局部性与干扰的交汇:无线电多播中的结构与调度

Locality Meets Interference: Structure and Scheduling in Radio Multicasting

Qin Xin

AI 速读 基于摘要

研究未知位置、允许消息聚合的同步无线电网络中多点到多点多播的调度方案,结合距离二着色、几何信息与随机传输给出多种完成时间界,并讨论扩展与反例。

cs.DC · cs.DS

查看原文摘要

We study multipoint-to-multipoint multicasting in synchronous radio networks with unknown participant locations and unrestricted message aggregation. Let $n$ be the network size, $k$ the number of participants, and $d$ their hop diameter. A supplied distance-two coloring with $C$ colors yields completion within $(C-1)d+1$ slots and at most $nk$ transmissions. In unit disk graphs, coordinates, one-hop neighbor data, and a common degree bound $Δ_0$ suffice for a $15(Δ_0+1)$-color schedule. A known fixed separation bound permits optimal deterministic $Θ(d)$ completion from coordinates alone. Without geometric data, strong selectivity gives $O(d\min\{n,(Δ_0+1)^2\log n\})$ slots when $n$ is known. Independent random transmission gives $O((Δ_0+1)(d+\log(k/η)))$ slots with failure probability at most $η$; for fixed $Δ_0$, this simplifies to $O(d+\log(1/η))$. A star construction shows that the logarithmic term is necessary for this random rule when the degree grows. We extend color schedules to fixed deletions and subgraphs connected over bounded windows of cycles. Separate conditional reductions preserve additive costs under diameter guessing and control parameter-table and cluster preprocessing. Finally, a counterexample shows that pruning and reranking a breadth-first tree can destroy interference-free delivery. For one-hop designated delivery with receiver degree at most $b$, we prove that the optimal schedule length equals the chromatic number of an associated conflict graph and is at most $2b-1$, with matching examples.

新论文 · v1arXiv:2611.16840

Kosmo-GFM:一个可生产部署的几何基础模型

Kosmo-GFM: A Production-Ready Geometry Foundation Model

Sheng Tang, Shengzhe Wei, Tiancheng Chen, Wenhua Jin, Xinyang Lu, Tinghao Jiang, Shuoxuan Feng, Yupeng Liu 等 32 位作者

AI 速读 基于摘要

提出集几何基础模型、位姿优化引擎与重建监督于一体的场景重建系统,并在多个基准上报告了深度、位姿与动态点误差方面的优势。

cs.CV

查看原文摘要

We present Kosmo-GFM, a scene reconstruction system that integrates a geometry foundation model (GFM), a pose optimization engine (PoseEngine), and reconstruction-derived supervision from KosmoWorld. GFM predicts camera parameters, depth, cross-view correspondences, and dynamic 3D points from images and videos. PoseEngine combines these predictions with geometric optimization to recover scene-level camera poses and geometry for downstream 3D and 4D Gaussian Splatting. KosmoWorld generates images and geometric supervision from reconstructed real-world scenes to improve GFM's geometric predictions. On the Sparse and Medium subsets of SpatialBench, GFM achieves the lowest absolute relative depth error and the highest relative-pose AUC at 5 degrees among the compared methods. It also achieves the lowest mean endpoint errors for dynamic points and scene flow across the five evaluated datasets. Across 34 scenes completed by all compared reconstruction systems, PoseEngine achieves the highest scene-averaged pose AUC at thresholds of 1, 3, and 5 degrees, with a cumulative runtime of 14.07 hours, approximately 20% of GLUEMAP's 69.67 hours. PoseEngine Flash provides a further accuracy-efficiency trade-off, with a measured mixed-precision runtime of 2.62 hours, approximately 4% of GLUEMAP's runtime. Separate scaling experiments show generally favorable trends with increased data, model computation, and training budgets. These results support the use of learned geometric priors within a scene-level reconstruction pipeline.

版本更新 · v3arXiv:2510.01712

ActiNet:基于自监督深度学习的手腕加速度计活动强度分类开源工具

ActiNet: An Open-Source Tool for Activity Intensity Classification of Wrist-Worn Accelerometry Using Self-Supervised Deep Learning

Aidan Acquah, Shing Chan, Aiden Doherty

AI 速读 基于摘要

作者提出并评估了开源工具ActiNet,结合自监督ResNet与HMM平滑,用于手腕加速度计的活动强度分类,性能优于随机森林基线。

cs.LG

查看原文摘要

The use of accurate and reliable open-source human activity recognition (HAR) models on passively collected wrist-accelerometer data is essential in large-scale epidemiological studies that investigate the association between physical activity and health outcomes. While self-supervised learning has generated considerable excitement in improving HAR, the extent to which these models, coupled with hidden Markov models (HMMs), would make a tangible improvement to classification performance and the effect this may have on the predicted daily activity intensity compositions is unknown. Using up to 24 hours of wrist-worn accelerometer data from 151 CAPTURE-24 participants (aged 18-91, mean age 42, 66% female), we trained the ActiNet model, consisting of HARNet, a self-supervised, 18-layer, modified ResNet-V2 model, followed by hidden Markov model (HMM) smoothing, to classify labels of activity intensity. The performance of this model, evaluated using 5-fold stratified group cross-validation, was then compared to a baseline random forest (RF) + HMM, established in existing literature. Differences in performance and classification outputs were compared with different subgroups of age and sex within the CAPTURE-24 population. The ActiNet model was able to distinguish labels of activity intensity with a mean macro F1 score of 0.80 and a mean Cohen's kappa score of 0.85. This exceeded the performance of the RF + HMM, trained and validated on the same dataset, with mean scores of 0.76 and 0.80, respectively. The improvements in performance were consistent across subgroups of age and sex. These findings encourage the use of ActiNet for the extraction of activity intensity labels from wrist-accelerometer data in future epidemiological studies.

版本更新 · v2arXiv:2609.04325

显微镜即掩膜:冷冻电子断层扫描前向模型中的特权视角与标签

The microscope is the mask: privileged views and labels from a cryo-ET forward model

Bogdan Toader, Kiarash Jamali, Tanmay A. M. Bharat, Sjors H. W. Scheres

AI 速读 基于摘要

利用冷冻电子断层扫描前向模型生成的配对视角和模拟特权信息训练自监督模型CARNIVAL,在真实断层图像分类与检测任务中无需微调即优于对比学习基线。

cs.CV · cs.LG · math.OC

查看原文摘要

We explore the use of simulated data for training a model for protein annotation in crowded cryo-electron tomography volumes reconstructed from images collected at limited tilt angles and severely corrupted by the measurement operator. Firstly, we leverage the corruptions imposed by the forward model to generate domain-specific augmented paired views of the exact same scene for an invariance objective integrated into the LeJEPA self-supervised training framework. Secondly, we use additional information from the simulation pipeline such as the positions and identity of proteins in the simulated volumes to inform the architecture of the model and the loss function, so that semantic information is localised at protein positions in the resulting dense feature volume. The resulting model, CARNIVAL, is evaluated without finetuning on classification and detection tasks in real tomograms, using a benchmark dataset containing multiple protein types and two tomogram processing types. We show that CARNIVAL outperforms a state-of-the-art model trained using a contrastive objective on simulated data but without forward model-based paired views or privileged information.

新论文 · v1arXiv:2611.16835

基于多重着色的显式编辑纠错码

Explicit Edit Codes via Multicoloring

Huiling Xie, Zitan Chen

AI 速读 基于摘要

作者利用编辑混淆图的素数多重着色构造显式 q 元码,可纠正至多 t 个插入、删除与替换的任意组合,冗余达到 Levenshtein 存在性界的主项。

cs.IT · cs.DM · cs.DS

查看原文摘要

For any fixed integers $q\ge2$ and $t\ge1$, we construct explicit $q$-ary codes of length $n$ that correct any combination of at most $t$ insertions, deletions, and substitutions, with redundancy at most $2t\log_q n+O_{q,t}(\log\log n)$ $q$-ary symbols. This matches the leading redundancy term of Levenshtein's classical existential bound. Building on the standard graph-coloring approach, we use a prime-based multicoloring of the edit-confusion graph to assign multiple colors to each $q$-ary word of length $m<n$. Appending a short, edit-protected representation of an assigned color to the length-$m$ word yields a length-$n$ codeword. The choice among the assigned colors carries additional message information, thereby reducing the redundancy. The construction admits deterministic encoding and decoding in $\widetilde O_{q,t}(n^{6t+2})$ and $\widetilde O_{q,t}(n^{7t+2})$ time, respectively.

新论文 · v1arXiv:2611.16833

早期引用实践与科学写作中人工智能使用迹象的关联

Earlier citation practices are linked to signs of artificial intelligence use in scientific writing

Hongkan Chen, Yongyuan He, Qingshan Zhou, Yi Bu

AI 速读 基于摘要

作者报告,早期引用行为(引用较旧文献、跨子领域较少、更多重复引用)与后续科学写作中较少出现AI辅助迹象相关,且这种关联在2023年前已存在。

cs.DL

查看原文摘要

As artificial intelligence (AI) becomes more common in scientific writing, some authors show fewer signs of AI assistance than expected across successive periods. We analysed OpenAlex publication histories for 71,133 authors with at least one eligible first-authored English-language publication each year from 2023 through September 2026. Using abstract-based writing scores, we defined resistance as the predicted minus observed share of abstracts classified as AI-assisted. Positive scores indicate fewer such abstracts than expected. Early resistance was positively associated with later resistance, although the share with positive scores fell. Environmental characteristics contributed more than individual characteristics to predicting later scores, although overall predictive power was low. Having a collaborator with a non-positive early score was associated with lower subsequent resistance. Authors with positive mean scores in both 2023-2024 and 2025-2026 cited older work, drew on fewer subfields and more often cited sources they had used before than authors with non-positive mean scores in both periods. These differences were evident before 2023. The adjusted gap in reference reuse rose from 3.24 percentage points before 2023 to 7.95 in 2025-2026. The findings link variation in signs of AI assistance to earlier differences in how scientists used prior work.

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