跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

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

DECODE: Decomposable Environments for COntrolled Sequential-Decision Evaluation

Diego Silva Prado, Bruno Caldas de Souza, Tiago Amaral Penteado de Jesus, Ricardo Guimarães Herrmann, Cristiano Breuel, Cristiano Bevitori Maffia De Oliveira

原文摘要

When a sequential decision system falls short of an optimum, its score does not reveal which modifications would improve its decisions. DECODE is a benchmark for testing such modifications through controlled experiments on planning and available information. Its consumer-credit collections generator provides five partially observed environments that share known dynamics matrices and vary a memory parameter and process noise. The experiments change selected inputs or planning rules while keeping the rest of the solver fixed. Each comparison specifies the solver's state inputs, response inputs and planning horizon. On the deterministic base environment, which was selected for a large gap between six-month and one-month planning with the hidden state, extending planning from one to six months increases the scores of two gradient-boosted solvers by 15 to 17 percentage points of the exact optimum, computed with the hidden state and borrower traits. Even at this horizon, the best graded solver, whose repayment response is fitted on logs, remains 15.6 points below that optimum. In a specified intervention sequence, three changes to its state inputs and their evaluation during search lower its score by 6.3 points, and replacing its fitted repayment model with the true response, evaluated with hidden borrower traits, then raises it by 15.6, a net recovery of nine of those points. Because the intermediate effects are conditional on the repayment model and the order of the changes, they do not uniquely assign the gap to separate causes. Within these limits, DECODE makes hypotheses about solver performance testable through specified interventions under known dynamics and explicit information conditions.

cs.LG · q-fin.RM · stat.ML

版本更新 · v2arXiv:2404.03689

高斯过程学习型模型预测控制教程

A Tutorial on Gaussian Process Learning-based Model Predictive Control

Jie Wang, Youmin Zhang

AI 速读 基于摘要

本教程面向实现,系统讲解高斯过程学习型模型预测控制(GP-MPC),重点给出GP增强预测模型多步均值与协方差传播的逐步推导,并区分仅均值与不确定性感知两类设计。

cs.RO · cs.LG · eess.SY

查看原文摘要

This tutorial provides an accessible and implementation-oriented introduction to Gaussian process learning-based model predictive control (GP-MPC), which combines probabilistic residual modeling with receding-horizon control. Its central tutorial contribution is a detailed, step-by-step derivation of multi-step mean and covariance propagation for GP-augmented prediction models. The derivation shows how commonly used propagation formulas follow from the laws of total expectation and total covariance, and clarifies the roles of the GP posterior mean, GP posterior covariance, uncertain inputs, and query-output cross-covariances. Building on this foundation, the article distinguishes mean-only unconstrained GP predictive control from uncertainty-aware constrained GP-MPC, clarifies regulation and output-tracking formulations, and provides concise implementation and computational-complexity guidance, including practical software-tool references and discussion of the scope of closed-loop guarantees. Mobile-robot path-following examples illustrate mean-only unconstrained implementations, whereas mixed-vehicle platooning illustrates uncertainty-aware constrained GP-MPC with uncertainty-dependent safety-distance tightening. The tutorial is intended to help researchers and practitioners understand, implement, and critically evaluate GP-MPC designs for robotic and autonomous systems operating under modeling uncertainty.

新论文 · v1arXiv:2611.16789

ScrewSense: Mapping the Invisible - Anomaly Detection and Error Classification in Screwdriving Processes

Tobias Lettner, Tatyana Ivanovska, Anwar Al Assadi, Christian Bergler

原文摘要

The growing volume of process data generated by screwdriving systems, combined with advancements in computing power, data storage, and algorithms, is facilitating the application of artificial intelligence in this field. Accurately detecting and classifying screwdriving errors is crucial for ensuring product quality, avoiding costly rework in manufacturing, and supporting sustainability by facilitating the maintenance, reuse, and recycling of screw-connected products. In this context, machine learning approaches offer a promising alternative to traditional monitoring techniques, such as window-based methods or envelope curves. This study examines the use of deep learning techniques for anomaly detection and error classification in screwdriving processes. The data corpus consists of multivariate time series capturing process parameters, such as torque and rotation angle. For anomaly detection, the embedding space of a vector quantized variational autoencoder was analyzed. In terms of error classification, four different model architectures were evaluated. The results demonstrate the effectiveness of anomaly detection and confirm that deep learning models can distinguish between multiple error categories beyond traditional binary classification. This extends the capabilities of conventional monitoring approaches, achieving accuracies of up to 100%. Additionally, real-world data material was examined in order to further demonstrate model robustness. Overall the results indicate strong generalization capability and highlight the practical potential of the developed models for use in industrial screwdriving processes, eliminating the need for expert knowledge in error identification and significantly reducing manual effort and analysis time.

cs.LG · cs.RO · eess.SP

版本更新 · v2arXiv:2610.34390

Controlled Block Proximal Linearized Method for Nonconvex and Nonsmooth Optimization

Weifeng Yang

原文摘要

In this paper, we consider multiblock nonconvex and nonsmooth optimization without assuming bounded iterates or coercivity of the original objective. We propose the Controlled Block Proximal Linearized (CBPL) method, whose control potentials establish boundedness while retaining the original objective, constraints and variables. We prove finite length and whole-sequence convergence to an effective critical point of the original objective, where one limiting subgradient annihilates all effective feasible directions. We establish finite total variation of the original objective and block functions, summable original effective residuals, and finite termination and linear or sublinear convergence rates for the original objective values. Scale orthogonality further gives full original criticality and, for homogeneous balancing controls, summable absolute objective errors with an $o(1/K)$ best-iterate bound. We establish a complete degeneracy theory for graph-regularized nonnegative factorizations: scale criticality is equivalent to graph collapse, and full criticality eliminates graph action; our controls prevent this collapse while retaining genuine reconstruction changes. Furthermore, our proposed method provides the practical, simple, and effective schemes for these applications, combining guaranteed convergence with explicit closed-form updates that can be applied directly to solve the original problems. We apply CBPL to graph-regularized sparse nonnegative matrix factorization with $\ell_0$-constraints ($\ell_0$-GSNMF), graph-regularized sparse nonnegative canonical polyadic (CP) decomposition with $\ell_0$-constraints ($\ell_0$-GSNCP), and graph-regularized sparse nonnegative independent-core matrix tri-factorization with $\ell_0$-constraints ($\ell_0$-GSNMTF). Numerical experiments demonstrate effectiveness, convergence and structural control.

math.OC · cs.LG

版本更新 · v3arXiv:2603.18859

RewardFlow: Can Action-Level Reward Be Estimated from State-Graph Topology in Agentic RL?

Xiao Feng, Bo Han, Zhanke Zhou, Jiaqi Fan, Jiangchao Yao, Ka Ho Li, Dahai Yu, Michael Kwok-Po Ng

原文摘要

In agentic tasks such as household assistance and web shopping, large language model (LLM) agents take multiple actions before receiving a final outcome indicating success or failure. For reinforcement learning (RL), this outcome obscures individual actions' contributions: a shopping trajectory may find the right product but fail to complete the purchase. To address this credit-assignment problem, we introduce RewardFlow, which connects multiple trajectories for the same task through shared states (states grouped by task-relevant equivalence or semantic similarity). The resulting directed state graph links observed trajectory segments. Therefore, an action in a failed trajectory may reach a state from which another trajectory succeeds. It propagates reward signals backward from states where the task succeeds, assigning state potentials that decrease with shortest-path distance to success in the graph. Potential differences then reward actions that reduce this distance, bringing the agent closer to success in the graph. These estimated rewards yield action-level advantages that complement trajectory-level advantages from outcome rewards during policy optimization, without a learned process reward model or manual action-level annotations. Experiments on ALFWorld, WebShop, Sokoban, and search tasks show gains over RL baselines across model scales. With 3B policies, graph construction and reward estimation take $1.47$-$2.39$ seconds per training step on ALFWorld, WebShop, and Sokoban (Fig. 1). Code is available at https://github.com/tmlr-group/RewardFlow.

cs.AI · cs.CL · cs.LG

新论文 · v1arXiv:2611.16088

Subsurface schematisation from sparse CPT data using the tabular foundation model TabPFN

Taiga Saito, Fabian Campos Montero, Bruno Zuada Coelho, Ana Martins Teixeira, Stephen Wu, Timo Schweckendiek, Yu Otake

原文摘要

Subsurface schematisation supports geotechnical decisions but remains challenging because sparse site-investigation data leave substantial gaps in information about ground conditions. This study explores TabPFN, a foundation model pretrained on general synthetic tabular data, for this task. Using only grid coordinates and soil behaviour type index observations from sparse cone penetration tests (CPTs), we first reconstruct two-dimensional sections without geotechnical fine-tuning or predefined layer boundaries. We evaluate the approach on synthetic sections and at two field sites in the Netherlands, comparing it with SchemaGAN, a conditional generative adversarial network trained on synthetic geotechnical sections, and with reference interpolation methods. In the baseline comparisons, TabPFN achieved mean errors close to SchemaGAN's on synthetic sections and lower mean errors at both field sites. On synthetic sections, TabPFN's mean absolute error decreased at each tested increase in CPT count, and, under the baseline input setting, its pointwise prediction intervals had mean coverage close to nominal levels. Subsequent fine-tuning on the synthetic sections used to train SchemaGAN improved synthetic test accuracy but increased mean errors at both field sites. These findings indicate that general-purpose tabular foundation models offer a promising route for updating subsurface predictions from sparse and evolving site-investigation data without retraining.

cs.LG · cs.AI

版本更新 · v2arXiv:2605.05871

Retain-Neutral Surrogates for Min-Max Unlearning

Junhao Cai, Dohun Kim, Dowon Kim, Sung Il Choi, Chengjun Jin, Juhyun Park, Changhee Joo

原文摘要

Machine unlearning aims to make a model forget designated training data while retaining performance on the rest. In min-max unlearning, an inner adversary perturbs the model to maximize the forget loss, and the model is updated to minimize the retain loss at the resulting surrogate point. When the forget and retain gradients are positively coupled, the standard perturbation also moves toward higher retain loss, and the retain step begins by recovering that loss. We propose Retain-Orthogonal Surrogate Unlearning (ROSU), which redefines the adversary to admit only perturbations orthogonal to the retain gradient. The one that raises the forget loss fastest has a closed form, and ROSU uses it to set the surrogate point and amplifies it into the forgetting step. Under positive coupling the ROSU surrogate avoids the retain cost that coupling induces in the standard surrogate, and the difference shrinks as the gradients approach orthogonality. ROSU has the smallest accuracy gap to retraining in every vision setting (CIFAR-10, CIFAR-100, Tiny-ImageNet) and is competitive with the baselines on language benchmarks (TOFU, WMDP). The redefinition helps most under high positive coupling. Code is available at https://github.com/unlearn-ml/machine-unlearning.

cs.LG

版本更新 · v3arXiv:2605.07755

Rethinking State Tracking in Recurrent Models Through Error Control Dynamics

Jiwan Chung, Heechan Choi, Seon Joo Kim

原文摘要

The theory of state tracking in recurrent architectures has predominantly focused on expressive capacity: whether a fixed architecture can theoretically realize a set of symbolic transition rules. We argue that equally important is error control, the dynamics governing hidden-state drift along the directions that distinguish symbolic states. We prove that affine recurrent networks, a class of models encompassing State-Space Models and Linear Attention, cannot correct errors along state-separating subspaces once they preserve state representations. Consequently, practical affine trackers do not learn robust state tracking; rather, they learn finite-horizon solutions governed by accumulated state-relevant error. We characterize the mechanics of this failure, showing that tracking remains readable only while the accumulating within-class spread remains small relative to the between-class separation. We demonstrate empirically on group state-tracking tasks that this breakdown is predictable: tracking collapses when the distinguishability ratio crosses the readability threshold. Across trained models, the point of this crossing predicts the horizon at which downstream accuracy fails. These results establish that robust state tracking is determined not only by an architecture's theoretical expressivity but crucially by its error control.

cs.LG · cs.CL

版本更新 · v3arXiv:2508.11682

Re-evaluating Heart Rate Variability Biomarkers for Glucose Sensing: The Impact of Age Normalisation and Subject-Independent Validation

Md Basit Azam, Sarangthem Ibotombi Singh

原文摘要

Heart rate variability (HRV) from electrocardiogram (ECG) signals may indicate glycemic status, but prior studies often combine distinct glucose targets and use validation strategies vulnerable to data leakage. Since HRV declines with age, aging may be confounded with diabetes-related autonomic dysfunction. We tested whether age-dependent HRV normalisation improves glycemic estimation. We analysed ECG features from 43 male patients with type 2 diabetes. Outcomes were glycated hemoglobin (HbA1c; n=29) and fasting blood glucose (FBG; n=38). We used leave-one-subject-out cross-validation, with feature selection and standardisation within each training fold. We compared 20 machine-learning algorithms, six age-adjustment methods, and 20 normalisation parameter combinations. Validation included 500 permutations and bootstrap confidence intervals. Extra Trees regression performed best: R2=0.222 (r=0.476, p=0.009) for HbA1c and R2=0.086 (r=0.344, p=0.034) for FBG. Mean absolute errors were 1.18 percentage points and 2.27 mmol/L, respectively. Permutation testing supported both associations (p=0.002). Contrary to our hypothesis, no age-adjustment method or parameter combination improved performance. Tree ensembles retained positive performance under strict validation, whereas linear models had negative R2 values; neural networks performed poorly. Strict within-fold preprocessing materially changed model performance and revealed potential inflation from conventional validation. Bootstrap 95% confidence intervals were [0.13, 0.82] for HbA1c R2 and [0.10, 0.72] for FBG R2. Although findings support HRV-glycemic associations, performance remains insufficient for standalone clinical use. The study highlights the importance of separating glycemic targets, subject-independent validation, within-fold preprocessing, and comprehensive baselines in non-invasive glycemic monitoring research.

eess.SP · cs.AI · cs.LG

新论文 · v1arXiv:2611.14659

Closing the Loop: Co-Evolving EM for Irregular Time Series Generation in Lifted Representations

Idan Arbiv, Gal Fadlon, Omri Azencot

原文摘要

Regular time-series generation from irregular time series is typically reduced to one-shot imputation: complete each partial sequence once, freeze the completions, and train a generator on the resulting surrogate dataset. We show that this open-loop strategy is structurally flawed. Point imputers collapse ambiguous missing regions to conditional averages, while stochastic imputers become stale as the generator evolves; the binding constraint is therefore iteration, not imputer design. We introduce a co-evolving Monte Carlo EM framework that closes the imputer-generator loop. Each E-step samples missing values from the posterior of the current generator, and each M-step retrains the generator on these completions, preserving unconditional generator training. Since our diffusion prior operates in a lifted 2D representation while observations live in time-series space, we further introduce Posterior Sampling for Lifted Representations (PSLR), which enforces operator-consistent conditioning, uncertainty preservation, and manifold consistency during the E-step. Across ten datasets and four corruption regimes, our method achieves state-of-the-art performance, improving over the strongest baselines by 59% in discriminative score, 15% in predictive score, 73% in Context-FID, and 71% in feature-correlation error. Ablations show that our approach reduces average discriminative score by 73% over single-step baselines, closing most of the remaining gap to the clean-data oracle. Code is available at https://github.com/azencot-group/PSLR.

cs.LG

新论文 · v1arXiv:2611.14126

Hierarchical Graph Representation Learning with Pooling-Induced Substructures

Luca Sbicego, Xiaowen Dong, Dorina Thanou

原文摘要

Hierarchical graph-level tasks that require reasoning over substructures that extend beyond local neighborhoods are posing challenges for standard Graph Neural Networks (GNNs). While graph pooling aims to address this by coarsening graphs into hierarchical representations, existing methods often fail to explicitly preserve the substructures they induce, leading to inconsistent empirical performance. Moreover, evaluating such approaches remains challenging due to the lack of benchmarks with explicit hierarchical structure. We propose Pooled-Substructure-Aware GNNs, an approach to graph pooling that explicitly preserves and processes substructures uncovered by structure-based pooling schemes. We show that this design enhances the expressive power of pooling-based GNNs in the sense of the Weisfeiler-Lehman (WL) test. To enable principled evaluation, we introduce two new synthetic datasets with controllable hierarchical structure and propose a metric to characterize the prevalence of hierarchical patterns in real-world graph-level benchmarks. On tasks with relevant hierarchical structure, our approach outperforms matched pooling baselines, while remaining competitive on structurally simpler benchmarks. Code and datasets are publicly available at https://github.com/lsbicego/PSA-GNN/.

cs.LG

新论文 · v1arXiv:2611.14124

CroCoMAE: Cross-modal self-supervised collaborative representation learning for SAR-optical remote sensing data

Vito Recchia, Giuseppe Guarino, Cássio Fraga Dantas, Giuseppina Andresini, Annalisa Appice, Dino Ienco

原文摘要

Remote sensing increasingly captures the Earth's surface through complementary sensors such as SAR and optical, yet ground-truth annotations remain scarce, limiting supervised approaches. Self-supervised learning (SSL) addresses the label scarcity, and cross-modal SSL further exploits the complementarity between co-located sensors, but existing cross-modal frameworks align modalities mostly through global image-level representations or treat them as largely redundant, leaving their fine-grained complementary structure underexploited. We propose CroCoMAE, a cross-modal SSL framework for SAR-optical remote sensing that unifies contrastive learning and masked image modeling within a ViT-based architecture, operating at two complementary levels. At the image level, an intra-modality contrastive loss on the class token yields globally discriminative, augmentation-invariant representations. At the patch level, masked image modeling drives fine-grained per-modality representations, while a cross-modal contrastive objective aligns a shared subspace across SAR and optical patch tokens, leaving the complementary subspace unconstrained to retain modality-specific information. On two SAR-optical benchmarks covering scene classification and semantic segmentation, CroCoMAE improves over uni-modal SSL baselines and outperforms state-of-the-art cross-modal frameworks in most configurations, with gains in both single-modality and multi-modal evaluation across varying label regimes and the largest improvements on semantic segmentation.

cs.CV · cs.LG

新论文 · v1arXiv:2611.14574

The norm, not the labels: training and evaluating finite-element surrogates for stress analysis in the energy norm

Ruifeng Cao, Xidan Song

原文摘要

Finite-element surrogates predict the stresses of a new design in one evaluation, but are usually trained on solutions with a displacement loss and compared by it, although engineering decisions rest on stresses. Application in engineering: stress analysis of perforated plates and solids with cavities, parametric families in which holes concentrate stress. Contribution to artificial intelligence: training and evaluating such surrogates in the energy norm, with or without solutions, and screening their predictions without solutions. For linear elastostatics, minimising the assembled discrete potential energy is exactly supervised regression in this norm: the energy gap of a prediction is the strain energy of its stress error. A displacement loss under-weights the stiff modes that carry the strains. In pre-registered comparisons, changing only the norm of the supervised loss cut a three-dimensional transformer's median energy-norm error 7.5-fold and its median von Mises error 6.1-fold; in two dimensions it more than halved the von Mises error, also on held-out instances. In three dimensions, the transformer trained on the energy alone came within a factor of 1.3 of the energy-norm-supervised one in median energy-norm and von Mises error. It was more accurate than the displacement-supervised one on all five metrics in every seed. Given the stiffness matrix, a Ritz projection was more accurate than the label-free transformer, in the seed means, on every metric but peak stress. No network transferred to a substantially finer mesh. The energy ranks predictions of a load case, and its sign flags those worse than the zero field.

cs.CE · cs.LG

新论文 · v1arXiv:2611.12884

引导数据分配以实现稳健的子群体泛化

Guiding Data Allocation for Robust Subpopulation Generalization

Zhaoying Pan, Yipei Wang, Shenyu Lu, Xiaoqian Wang

AI 速读 基于摘要

作者通过扩展高斯特征模型框架,从理论上刻画不同训练子群体分布下的性能景观,并提出基于梯度的子群体比例调整方向,以更高效地提升调整准确率和最差群体准确率。

cs.LG · cs.CV

查看原文摘要

Machine learning models often achieve high average accuracy in the training data while performing poorly on test data due to subpopulation shift. A common data-centric solution is to enforce balanced subgroup proportions, but full balance can be costly, infeasible, and not always necessary. In this work, we study whether balanced training data is the unique optimal configuration for robust subpopulation generalization. We extend a Gaussian feature-model framework to theoretically characterize the performance landscape across general training subgroup distributions. We show that multiple configurations, including substantially imbalanced ones, can perform comparably to the balanced one. We further derive gradient-based directions for adjusting subgroup proportions to improve adjusted accuracy and worst-group accuracy more efficiently. These findings suggest that strategically allocating data offers a more flexible and principled path to robust performance than simple balancing. The code is available at https://github.com/zhaoyingpan/subpop-data-allocation.

新论文 · v1arXiv:2611.12880

Kolmogorov-Chapman映射:无轨迹学习用于模拟分子动力学

Kolmogorov-Chapman Maps: Trajectory-Free Learning for Simulating Molecular Dynamics

Majdi Hassan, Marta Skreta, Dominique Beaini, Kirill Neklyudov

AI 速读 基于摘要

提出KC-Maps,仅用无轨迹边缘样本和已知漂移扩散系数学习SDE转移核,在肽分子动力学模拟中作者报告其GPU小时数优于经典方法。

cs.LG

查看原文摘要

Stochastic differential equations (SDEs) describe stochastic processes across a wide range of scientific domains, including physics, biology, and finance. Although individual numerical integration steps are inexpensive, observing meaningful events or transitions can require millions of sequential steps, resulting in substantial wall-clock simulation time and poor hardware utilization. Deep learning offers an alternative by amortizing many integration steps into a single neural network forward pass, potentially enabling much faster simulation. However, existing supervised approaches typically require long simulated trajectory data, which restricts their applicability. In this work, we introduce Kolmogorov-Chapman Maps (KC-Maps), a method for learning the transition kernel of an SDE that relies only on the trajectory-free marginal samples together with the known drift and diffusion coefficients. Given an initial time and state of a process, KC-Maps models its distribution integrated to any given time, corresponding to the weak solution of the SDE. To recover the correct dynamics, KC-Maps satisfies two key properties: (i) it satisfies the boundary conditions, which we incorporate directly into the neural network architecture, and (ii) it respects the Kolmogorov--Chapman equation, which provides an efficient training objective. We empirically demonstrate that KC-Maps learns to integrate the dynamics of peptide molecular systems and outperforms classical molecular dynamics in terms of GPU-hours.

版本更新 · v3arXiv:2512.01067

更差的力可带来更好的结构:机器学习原子间势的轨迹级微调

Worse Forces Can Lead to Better Structures: Trajectory-Level Fine-Tuning of Machine Learning Interatomic Potentials

Evan Dramko, Yizhi Zhu, Aleksandar Krivokapic, Geoffroy Hautier, Thomas Reps, Christopher Jermaine, Anastasios Kyrillidis

AI 速读 基于摘要

作者报告通过对弛豫轨迹反向传播并直接优化最终结构,可在力预测误差上升的同时显著降低结构误差,说明力精度与下游弛豫精度可能朝相反方向发展。

cond-mat.mtrl-sci · cs.AI · cs.LG

查看原文摘要

Machine learning interatomic potentials (MLIPs) are commonly trained and evaluated by their ability to reproduce first-principles energies and forces. Practical value, however, is often determined by downstream processes such as structural relaxation. Much of MLIP literature is motivated by the expectation that improving force accuracy will produce correspondingly better downstream behavior. Although this expectation is natural, it may not hold in practice due to model inaccuracies. Here, we demonstrate that force accuracy and relaxation accuracy can be driven in opposite directions. Starting from pretrained MLIPs, we differentiate through relaxation trajectories and optimize the the final structures. This intervention produces increases in force-prediction errors while substantially reducing structural errors. Importantly, this represents a trade-off between two aspects of physical fidelity: the learned forces become less faithful to first-principles forces, while the resulting relaxed structures become more faithful to first-principles predictions. Rather than observing a discrepancy between local quality and downstream performance, we demonstrate that this discrepancy can be induced through optimization. Our findings suggest that MLIPs need not be optimized as approximations of first-principles forces, but can instead learn task-specific vector fields that guide relaxation trajectories toward more accurate final structures. By propagating supervision through complete relaxation trajectories, our framework captures dependencies between successive predictions that are absent when structure--force pairs are treated independently. More broadly, these results demonstrate that conventional force metrics can provide an incomplete assessment of downstream performance and highlights the importance of evaluating scientific machine-learning models within computational workflows.

版本更新 · v2arXiv:2611.08608

AutoPYara: Next-Gen YARA Rule Generator for Malware Family Clustering

Mabon Ninan, Nhat Nguyen, Soumyajyoti Dutta, Sidharth Anil, Marcus Botacin

原文摘要

Millions of malware variants threaten users daily, such that clustering these samples is key for fast incident response. AutoYara is the current state-of-the-art for automatic YARA rule generation, but the task remains challenging on realistic datasets, where intra-family diversity and noisy clustering can degrade rule quality. We present AutoPYara, a solution armored with: (1) precise cluster centroid selection based on similarity hashing, and (2) an improved heuristic for estimating subclusters within a malware family using historical VirusTotal data. We implement AutoPYara as an open-source Python package (pip install autopyara) to support reproducibility and practical use. We show that AutoPYara, (1) increases rule coverage by 14 percentage points; (2) reduces variance by 7.1 percentage points, comparing the average variance AutoPYara exhibits to that of AutoYara; and (3) improves threat-hunting accuracy by 10%. AutoPYara produces robust and effective YARA rules than prior automatic approaches in practical settings.

cs.CR · cs.LG

版本更新 · v2arXiv:2609.08277

Adaptively Incorporating Directional Hints into Zeroth-Order Optimization

Alexander Ryabchenko, Jian Qian, Wenlong Mou

原文摘要

We study zeroth-order optimization of nonconvex functions with the aid of directional hints, which are cheap but potentially inaccurate approximations of the true gradient direction, given by linear subspaces at each iteration. To leverage these hints adaptively while maintaining robustness to their quality, we introduce Control-Variate Zeroth-Order Descent (CV-ZOD), a new framework that refines the classical zeroth-order gradient estimator with a control variate that can be set based on the directional hints. We first show that the oracle algorithm that optimally sets the reference vector and step size at each iteration achieves a convergence rate that interpolates between the first-order $O(1/T)$ rate and the zeroth-order $O(d/T)$ rate, depending on the quality of the hints along the trajectory. We then develop a practical variant of CV-ZOD that achieves the same oracle guarantee up to logarithmic factors, without any prior knowledge of the hint quality. We validate the method empirically on simulation-based scientific optimization tasks, demonstrating sustained progress on nonconvex landscapes where zeroth-order descent is slower and existing guided methods stall as guidance deteriorates.

cs.LG · math.OC

版本更新 · v2arXiv:2412.17330

EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis

Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde

原文摘要

Many approaches to program synthesis perform a combinatorial search within a large space of programs to find one that satisfies a given specification. To tame the search space blowup, previous works introduced probabilistic and neural approaches to guide this combinatorial search by inducing heuristic cost functions. Best-first search algorithms ensure to search in the exact order induced by the cost function, significantly reducing the portion of the program space to be explored. A key limitation of existing best-first search algorithms is that they slow down over time: the delay between outputting successive programs grows with the number of programs already generated. We ask whether best-first search algorithms with constant delay exist. We design Eco Search, a new best-first bottom-up search algorithm. It combines the cost tuple representation of Bee Search with the per non-terminal data structures of Heap Search, thanks to a new frugal expansion strategy, and it uses bucket queues instead of priority queues, which is possible because the costs stored in each queue always lie in a window of constant width. We prove that Eco Search is the first constant-delay best-first search algorithm for pre-generation cost functions. Experimentally, we evaluate Eco Search on two classic program-synthesis benchmarks (DeepCoder and FlashFill) and observe that Eco Search solves 12% to 70% more tasks than its predecessors, and reaches the number of tasks they solve 1.6 to 3.2 times faster. This shows that constant delay can be achieved for best-first search in program synthesis, and that it makes a difference in practice.

cs.LG · cs.AI · cs.PL

新论文 · v1arXiv:2611.12131

One-Shot Federated Graph Learning via High-Fidelity Proxies and Transferability-Guided Collaboration

Jia Jiang, Zihan Tan, Wenke Huang, Bin Yang, Mang Ye

原文摘要

One-shot Federated Graph Learning (OFGL) has emerged as a communication-efficient paradigm for federated graph learning under strict bandwidth constraints, compressing collaboration into a single transmission round. Nevertheless, this extreme setting suffers from a fundamental Single-Transmission Bottleneck, which limits both the quality and utility of exchanged knowledge. First, while existing methods attempt to distill private graphs into shareable proxies, their aggressive one-shot compression inherently triggers a fidelity crisis. This compression distorts local graph topology and semantics across clients, leading to externalized knowledge underexpression. Second, although the server aggregates these proxies to update global models, current integration schemes suffer from transferability agnosticism. The server cannot reliably identify cross-client collaboration potential, thus resulting in integrated knowledge underutilization. To tackle these dual challenges, we propose FedHFT, an effective One-Shot Personalized Federated Graph Learning (OPFGL) framework that addresses this bottleneck from two perspectives, namely High-Fidelity Knowledge Externalization and Transferability-Ware Knowledge Integration. We use Fidelity-Driven Proxy Refinement to preserve client-side knowledge fidelity, and Transferability-Steered Personalized Collaboration to enable adaptive server-side collaboration. The superiority of FedHFT is validated through extensive experiments on both homophilic and heterophilic graphs. The code is available at https://github.com/Jumpy-Juice/FedHFT.

cs.LG

新论文 · v1arXiv:2611.11997

HyInv Technical Report

Haowei Lin, Cai Zhou, Xiangxin Zhou

原文摘要

Inverse folding designs amino-acid sequences for a given protein backbone, and screening needs many candidates that are both diverse and well folded. We present HyInv, a 1.96-million-parameter backbone-conditioned graph network with an encoder-decoder architecture, trained by Hyra 2.0, the research agent developed by our team: pretrained with random-order autoregressive sequence modeling, followed by structure-reward reinforcement learning. At inference, a grouped draft-and-rewrite sampler that uses separate draft and rewrite temperatures improves refolding TM-score at matched diversity. An optimized implementation with BF16 numerics designs 128 sequences for a 402-residue backbone in 50.6 ms on a single NVIDIA H20 GPU, about 52 times faster than the reference sampler, and an exact FP32 path that returns the reference sequences is 8.7 times faster. Across five benchmark datasets and seven dataset-predictor combinations, HyInv reaches a higher average scTM than all ten external baselines at comparable or higher sequence diversity, with large margins over ProteinMPNN and ProteinZero V2. The same default setting supports de novo backbones, pocket-constrained libraries, enzyme redesign with the catalytic site kept, and loop redesign. We have released our code and model at https://github.com/Tencent-Hunyuan/Hyra-results/tree/main/AI4Science/hyinv.

cs.LG · q-bio.BM

新论文 · v1arXiv:2611.11989

MUTE: Multi-Level Alignment Uncoupling Against Talking-Head Exploitation for Voice Protection

Donghyun Kim, Jin Hong, Seungmin Kim, Dain Kim, Junseok Kwon, Daeseon Choi

原文摘要

Talking-head generation models, which synthesize realistic facial animations from audio, are increasingly vulnerable to misuse in multimodal deepfake scenarios. Protecting such systems remains challenging, as talking-head models fundamentally rely on precise audio-visual alignment, while effective audio protection methods remain largely underexplored. In this work, we propose MUTE, an audio protection framework that uncouples the underlying audio-visual alignment through a multi-level strategy. Specifically, MUTE combines (1) Alignment-level Disruption, which directly perturbs cross-modal attention to disrupt structural alignment, and (2) Representation-level Degradation, which perturbs temporal audio embeddings to degrade their representations. To improve robustness, perturbations are constrained in the STFT domain to high-energy regions, making them resistant to post-processing, denoising, and adaptive attacks. An optional speaker-level objective further mitigates potential bypass via TTS-based resynthesis. Extensive experiments demonstrate that MUTE consistently degrades lip synchronization across both white-box and black-box talking-head models while preserving perceptual audio quality. The proposed method remains effective under real-world transformations and can be combined with image-based approaches to provide stronger multimodal protection. The source code and project page are available at https://github.com/jindl465/MUTE.

cs.SD · cs.CV · cs.LG

版本更新 · v2arXiv:2611.02267

Overcoming Demand Censoring through Randomization for Risk-Sensitive Newsvendor Learning

Zhengchao Wang, Nam Ho-Nguyen

原文摘要

We study online newsvendor learning with bounded demand, censored observations, and convex nonlinear shortage costs. Because stockouts can conceal the shortage magnitudes needed by gradient-based algorithms, we use randomized ordering to construct unbiased subgradient estimates. We characterize admissible randomization distributions within this framework and develop an online inventory policy that combines the resulting subgradient estimates with gradient-based updates. Our regret analysis quantifies the cost of randomization via the estimation variance and an additional loss term. We characterize the randomization distributions that minimize this objective. For piecewise-linear shortage costs, the optimal distribution is computed through a linear-time recursion; for costs with bounded curvature density, it is characterized by a scalar ordinary differential equation. The policy achieves expected regret of $O(T^{2/3})$ against the best fixed order in hindsight over $T$ periods. Under independent demand and suitable curvature of expected losses, the bound improves to $O(\sqrt{T})$. Matching minimax lower bounds establish rate optimality over the corresponding classes with a fixed marginal-cost bound. Both rates extend to nonperishable inventory under uniformly positive conditional expected demand. Numerical experiments on synthetic and retail data show improvements over alternative policies using censored observations.

cs.LG · math.OC

版本更新 · v2arXiv:2605.12190

Information-Theoretic Generalization Bounds for Sequential Decision Making

Futoshi Futami, Masahiro Fujisawa

原文摘要

Information-theoretic generalization bounds based on the supersample construction are a central tool for algorithm-dependent generalization analysis in the batch i.i.d. setting. However, existing supersample conditional mutual information (CMI) bounds do not directly apply to sequential decision-making problems such as online learning, streaming active learning, and bandits, where data are revealed adaptively and the learner evolves along a causal trajectory. To address this limitation, we develop a sequential supersample framework that separates the learner filtration from a proof-side enlargement used for ghost-coordinate comparisons. Under a row-wise exchangeability assumption, the sequential generalization gap is controlled by sequential CMI, a sum of roundwise selector--loss information terms. We also establish a Bernstein-type refinement that yields faster rates under suitable variance conditions. The resulting bounds specialize to online learning, streaming active learning with importance weighting, and stochastic multi-armed bandits.

stat.ML · cs.LG

新论文 · v1arXiv:2611.11149

ZarrFM: A Canonical Tensor Storage Architecture for EEG Foundation-Model Pretraining

Dheeraj Chintapalli, Sunkalp Chandra

原文摘要

Statistical models for brain-computer interfaces (BCIs) increasingly require large, heterogeneous EEG corpora, yet existing datasets vary in sampling rates, channel layouts, window lengths, and storage formats, creating substantial preprocessing and I/O overhead. We propose ZarrFM, an execution-oriented representation that complements BIDS by storing a corpus as a single Zarr v3 hierarchy with indexed metadata, canonical channel spaces, explicit masks, hash-stable subject splits, verified event tables, and block-aligned sharding. On real PhysioNet recordings and synthetic corpora, we compare ZarrFM with EDF, FIF, NPY, HDF5, and Parquet. Across 200 recordings, its two-level index reduces metadata queries from 601 requests to 14. Preserving native signal codes reduces storage from 42.4 MB/hour in EDF to 22.7 MB/hour, while block-aligned sampling reaches 3,131 windows/s, up to 11 times faster than Parquet. Reads remain bit-identical across independent Zarr implementations, and concurrent failure-injected appends recover without data loss. These results show that ZarrFM can provide a compact, interoperable, and execution-efficient storage layer for large-scale EEG pretraining.

cs.LG

版本更新 · v3arXiv:2602.22586

TabDLM: Free-Form Tabular Data Generation via Joint Numerical-Language Diffusion

Donghong Cai, Jiarui Feng, Yanbo Wang, Da Zheng, Yixin Chen, Muhan Zhang

原文摘要

Synthetic tabular data generation has attracted growing attention due to its importance for data augmentation, foundation models, and privacy. However, real-world tabular datasets increasingly contain free-form text fields (e.g., reviews or clinical notes) alongside structured numerical and categorical attributes. Generating such heterogeneous tables with joint modeling of different modalities remains challenging. Existing approaches broadly fall into two categories: diffusion-based methods and LLM-based methods. Diffusion models can capture complex dependencies over numerical and categorical features in continuous or discrete spaces, but extending them to open-ended text is nontrivial, since they model each column as a continuous value or one of a closed set of categories, whereas text lives in an exponentially large sequence space. In contrast, LLM-based generators naturally produce fluent text, yet their discrete tokenization can distort precise or wide-range numerical values, hindering accurate modeling of both numbers and language. In this work, we propose TabDLM, a unified framework for free-form tabular data generation via a joint numerical-language diffusion model built on masked diffusion language models (MDLMs). TabDLM models textual and categorical features through masked diffusion, while modeling numerical features with a continuous diffusion process through learned specialized numeric tokens embedding; bidirectional attention then captures cross-modality interactions within a single model. Extensive experiments on diverse benchmarks demonstrate the effectiveness of TabDLM compared to strong diffusion- and LLM-based baselines. Our code is available at https://github.com/ilikevegetable/TabDLM.

cs.LG · cs.AI · cs.CL

版本更新 · v2arXiv:2608.12037

Clustered Randomized Smoothing for Stochastic Prediction Functions

Eduardo Figueiredo, Frederik Mathiesen, Julian Schumann, Jens Kober, Arkady Zgonnikov, Luca Laurenti

原文摘要

Modern stochastic predictors can model rich, multi-modal outcome distributions. However, this expressive power comes with challenges in ensuring robust predictions $-$ a critical requirement in safety-critical domains. Randomized smoothing is a leading technique for improving robustness, particularly against adversarial perturbations. Yet, in stochastic multi-modal regression settings, randomized smoothing often fails due to mode collapse, yielding averaged predictions that do not reflect the underlying distribution. To address this limitation, we propose clustered $α$-smoothing, a framework that (1) partitions noisy samples using an arbitrary clustering algorithm, (2) applies $α$-smoothing locally within each cluster, and (3) combines the resulting predictions into a mixture distribution. By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes. We empirically evaluate our framework on two benchmarks, demonstrating substantial improvements over state-of-the-art methods. In stochastic trajectory prediction on a driving simulator dataset, our approach achieves, on average, a $27\%$ lower Wasserstein distance to the ground-truth distribution compared to $α$-smoothing. In quadrotor control, where modes correspond to distinct feasible paths to a target, our method reduces the collision rate by $90\%$ relative to the state-of-the-art randomized smoothing.

cs.LG · eess.SY

版本更新 · v2arXiv:2610.10520

Distilling Graph Geometry: Knowledge Gap from GNNs to MLPs

Zhewei Chen, Hao Zhu, Jiaojiao Jiang, Ahad N. Zehmakan

原文摘要

GNN-to-MLP distillation aims to retain the predictive accuracy of a message-passing teacher while deploying a graph-free MLP at inference. Existing methods mainly transfer node-wise predictions or use confidence-based reweighting, but they do not specify where the student should preserve the teacher's graph-induced geometry. We show that this omission leads to two spectral failure modes in the student's representation space. On sparse graphs, the student suffers from spectral underfit, missing high-energy teacher directions induced by aggregation. On dense graphs, it suffers from spectral overfit, retaining spurious directions that the teacher has collapsed through aggregation. Motivated by an energy-weighted teacher-student alignment objective, we propose Graph Geometry-aware MLP (G^2MLP), a training-time distillation framework guided by Ollivier-Ricci curvature. Curvature acts as a local proxy for allocating supervision between prediction-level and representation-level alignment. The deployed model is a standard MLP with no graph access at inference. Across node-classification benchmarks, G^2MLP improves over graph-free distillation baselines in most settings, reduces the teacher-student rank gap in both regimes, and transfers to Graph Transformer teachers and link prediction.

cs.LG

版本更新 · v2arXiv:2609.14402

Neural Modal Decomposition: Architectural Priors from Observables

Juho Park, Kaushik Sengupta

原文摘要

Many engineering building blocks behave as multi-port linear time-invariant systems. RF cavities, photonic devices, and superconducting quantum chips, despite their different underlying physics, all share a common mathematical structure for their port-level response. Each entry of the response matrix is a sum of contributions from a small number of intrinsic resonant modes, the pole-residue form. A model capable of predicting such responses for arbitrary geometries and arbitrary port configurations, while simultaneously extracting the underlying eigenmode structure, could therefore offer a design principle potentially applicable across all these domains. We propose a neural framework that learns this modal decomposition end-to-end, supervised only by system-level observables and without supervising the modal parameters themselves. The architecture decomposes into a port-independent pole predictor and two port-dependent coupling predictors whose outputs are combined entry-wise, separating intrinsic from port-dependent features. This factorization yields a single trained model that generalizes to port counts unseen during training, whereas direct regression needs a separate model for each port count, with an output size that grows as $\mathcal{O}(N^2)$. Although the modal parameters are never supervised, the freely parameterized poles converge to the physical resonances, in agreement with poles extracted by the AAA rational approximation algorithm. We instantiate the framework in radio-frequency electromagnetic surrogate modeling. A model trained only on 2-port data accurately predicts $N$-port responses unseen during training.

physics.comp-ph · cs.LG

新论文 · v1arXiv:2611.10359

Spiking Sensory Networks

Lleyton Ariton

原文摘要

Effective sensory reception is critical for survival, yet the computational mechanisms behind how peripheral sensory neurons (SNs) transduce external signals into spiking representations for downstream brain circuits remain to be fully understood. Numerous theoretical frameworks have been proposed to model sensory processing, with Bayesian approaches among the most prominent. However, existing machine learning attempts to apply Bayesian theory to spiking neurons remain largely phenomenological, disconnected from empirical biology, and poorly validated on non-stationary temporal data. Conversely, neuroscientific models often rely on strong inductive experimental biases or explicit kinetic dynamics fit post hoc to match spiking data. Here, we introduce a class of recurrent Poisson VAE models, termed Spiking Sensory Networks (SSNs), that bridge these paradigms by reconciling variational inference with biologically inspired spike transduction for time-varying stimuli. Evaluated on real-world odor plume recordings from locust olfactory receptor neurons (ORNs), SSNs match or exceed the reconstruction fidelity of Spiking Neural Network (SNN) and GLM baselines while exhibiting superior representational characteristics. Furthermore, SSNs are well-suited for neuroscientific investigation, learning empirical in vivo ORN response motifs and exhibiting emergent spike-frequency adaptation under unsupervised reconstruction without manual tuning. Moreover, we theoretically link the recurrent decoding objective to mutual information maximization, and derive a formal thermodynamic lower bound connecting the Poisson Kullback-Leibler regularizer to the excess non-equilibrium metabolic power of biophysical homeostasis. Ultimately, our work synthesizes principles from machine learning theory and empirical neuroscience, providing a viable bridge that concretizes Bayesian models with biological mechanisms.

stat.ML · cs.LG