跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 22:25 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 22:25最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

论文修订列表

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

找到 8,559 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 22:18(北京时间)
版本更新 · v3arXiv:2602.08557

Combining Constrained Sampling and Reinforcement Learning for Manipulation

Marc Toussaint, Cornelius V. Braun, Armand Jordana, Sayantan Auddy, Eckart Cobo-Briesewitz, Denis Shcherba, Tilman Burghoff, Justin Carpentier

原文摘要

Training manipulation policies in contact-rich settings is a core challenge in robotics. While Reinforcement Learning (RL) has demonstrated its strength in such settings, it may struggle to sufficiently explore and discover complex manipulation strategies. To address this, we combine two basic ideas: First, designing appropriate reset strategies (the start state distribution of episodes) has shown promise in improving RL exploration and effectiveness. Second, while model-based approaches to finding trajectories through manipulation are hard, recent work showed that model-based approaches to sampling states on constrained manifolds can be highly efficient. Based on these observations, we propose a novel state sampler that enables efficient goal-conditioned RL in complex contact-rich manipulation tasks. Our sampler explicitly takes into account the structure of contact in order to provide a rich covering of diverse contact modes. By combining constrained sampling resets with projected interpolation and curriculum learning, our novel approach outperforms RL without constrained sampling and alternative reset methods, and effectively trains universal, prehensile and non-prehensile manipulation policies in contact-rich whole-body and in-hand settings. See the project page https://www.user.tu-berlin.de/mtoussai/26-CSRL/ for videos and full source code access.

cs.RO

版本更新 · v3arXiv:2608.24275

RePolicy: Learning to Select and Apply Safety Policies for Agent Safeguards

Houcheng Jiang, Boxuan Zhang, Qiyong Zhong, Junfeng Fang, Xiang Wang, Xiangnan He

原文摘要

Agent safeguards must determine whether an agent's behavior violates the safety rules of the current task, environment, and user. Because these rules vary across contexts, a safeguard needs to select the relevant policy before judging the behavior. Existing policy-aware safeguards can apply a supplied policy, but generally assume that the correct policy is already known. They therefore do not learn how to select a policy from a library, even though an incorrect choice can lead to an incorrect safety judgment. We introduce RePolicy, a safeguard that jointly learns policy selection and safety assessment. Given an agent trajectory and a set of candidate policies, RePolicy selects the policy that best matches the situation, applies its requirements, and predicts whether the behavior is safe. We construct PolicyTraj-20K, a dataset of more than 20,000 agent trajectories annotated with applicable policies, safety labels, and explanations. We train RePolicy with supervised demonstrations followed by reinforcement learning, while randomizing policy order, identifiers, and distractors to reduce shortcut learning. Across six agent-safety benchmarks and 19 baselines, RePolicy-4B achieves leading overall safety-detection performance and improves policy-selection accuracy. These results show that safeguards can learn which safety requirements to use for assessing agent behavior.

cs.AI · cs.CL

版本更新 · v2arXiv:2603.29381

Parameterized Algorithms for Computing MAD Trees

Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein, Camille Richer

原文摘要

We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem which is known to be NP-hard. While approximation algorithms and polynomial-time algorithms for some graph classes are known, the parameterized complexity of the problem has not been investigated so far. We start a parameterized complexity analysis with the goal of determining the border of algorithmic tractability for the MAD tree problem. To this end, we provide a linear-time algorithm for graphs of constant modular width and a polynomial-time algorithm for graphs of bounded treewidth; the degree of the polynomial depends on the treewidth. That is, the problem is in FPT with respect to modular width and in XP with respect to treewidth. Moreover, we show that it is in FPT when parameterized by vertex integrity, by maximum leaf number, or by an above-guarantee parameter. We complement these algorithms with NP-hardness on split graphs.

cs.DS

版本更新 · v2arXiv:2610.36078

Learning on-the-fly quasi-stationarity diagnostics from low-dimensional surrogates

Noé Blassel

原文摘要

Accelerated dynamics methods, such as parallel replica dynamics, require estimates of the decorrelation time, after which a process trapped in one of its metastable states is distributed according to the quasi-stationary distribution (QSD). In a method proposed by Binder, Lelièvre and Simpson, decorrelation times are defined by coupling a particle approximation of the non-linear conditioned probability flow of the process with MCMC-inspired diagnostics. We explore an alternative to MCMC diagnostics, based on coarse-graining of non-linear probability flows and simulation-based inference. We first develop a coarse-graining framework for killed Markov jump processes conditioned on survival, proving uniform-in-time, non-asymptotic estimates approximating the non-linear probability flow of the true process by the non-linear flow of a surrogate process, defined with a collective variable. The framework does not assume reversibility of the true process, and also gives bounds which scale explicitly in an adiabatic regime. Motivated by these results, we then construct a quasi-stationarity diagnostic using simulation-based inference: a recurrent neural network (RNN), trained on particle approximations of non-linear effective flows, estimates posterior probabilities of decorrelation. The learned diagnostic is then transferred to collective-variable traces of high-dimensional particle approximations. We investigate the behavior and robustness of this diagnostic on a set of numerical experiments, comparing it to the MCMC diagnostic of Binder et al.\ on both synthetic examples and a molecular system, in and out of its training prior distribution. When its prior assumptions hold, the RNN diagnostic outperforms the MCMC diagnostic in ROC analysis, is less conservative, fails less often, and has an interpretable decision threshold.

stat.ML · cs.LG · math.PR

版本更新 · v2arXiv:2510.05071

Adaptive Modular Retrieval-Augmented Framework for Cross-Domain Image Classification

Debojyoti Ghosh, Soumya K Ghosh, Adrijit Goswami

原文摘要

Effective image classification in real-world scenarios requires models capable of capturing both local features and global context, while adapting to the evolving complexity of the input. This paper presents a hybrid deep learning system named AMR-Net (Adaptive Modular Retrieval Network) for adaptable image classification in environmental and industrial contexts. The proposed model integrates ResNet-based local feature extraction and Vision Transformer-based global representation learning with an FAISS-based memory retrieval module for contextual enhancement. Furthermore, AMR-Net has an adaptive modular extension mechanism to dynamically enhance network capacity when validation performance plateaus during training. The proposed framework was evaluated using a ten-class waste classification dataset and the Kolektor Surface Defect Dataset 2 (KolektorSDD2), achieving classification accuracies of 97.15% and 99.80%, respectively. Experimental results demonstrate that AMR-Net consistently outperforms mainstream convolutional and transformer-based approaches while maintaining robust cross-domain generalization. Component-wise ablation studies show that global attention (ViT), retrieval-based contextual learning (FAISS), and adaptive modular growth each provide complementary and partially overlapping contributions to overall performance, with global attention contributing the largest individual gain. The proposed architecture is a scalable and flexible solution for image classification challenges characterized by data unpredictability, class imbalance, and dynamic feature distributions.

cs.CV

版本更新 · v2arXiv:2610.32794

Consommé: Conditioned Token Merging for Split Inference

Man Ngo, Jan S. Rellermeyer

原文摘要

Split inference partitions a Vision Transformer between a resource-constrained edge device and a server. However, transmitting intermediate tokens across the communication channel is costly. Deploying fine-tuned backbones to every endpoint becomes expensive as well. We study token reduction for split inference under a frozen backbone, where only a small adapter is shipped. We observe that the CLS token plays a dual role: it acts as the global summary the receiver needs for classification, and it serves as a signal on which patches to keep. We propose Consommé, a method utilizing both characteristics. There, an information bottleneck compresses the CLS token into a compact latent which is transmitted in place of the full CLS token and conditions a learned patch gate merging patches into exactly $k$ tokens via soft assignment. It reaches any budget in a single step, thus escaping the per-layer cap of bipartite matching (BPM). On DeiT-S/T, it leads all methods at aggressive token budgets and remains operable at shallow splits where BPM cannot operate, while matching fine-tuned methods at gentle budgets at a fraction of their deployment cost.

cs.CV

版本更新 · v2arXiv:2610.24005

PACE: Pareto-Adaptive Compression for Efficient Native MLLMs

Lei Tian, Chunzheng Zhu, Kai Wu, Yifan Zhang, Haihua Yang

原文摘要

Native multimodal large language models (native MLLMs) jointly encode visual and linguistic sequences within a unified autoregressive Transformer, emerging as a promising paradigm for multimodal understanding. Unlike conventional ViT-based MLLMs relying on external vision encoders, ViT-free native MLLMs tokenize pixel patches directly, potentially suffering severe visual token redundancy. A pilot study confirms this: unlike ViT-based models that degrade under compression, ViT-free MLLMs tolerate aggressive compression with near-lossless or even improved performance. Yet existing compression methods target ViT-based settings, leaving native MLLMs, which stand to gain the most, unexplored. To close this gap, we introduce an analysis pipeline centered on token discriminability and cross-dimensional heterogeneous redundancy, revealing that (i) redundancy is distributed independently and heterogeneously along height and width axes, and (ii) early-layer visual tokens are indiscriminable and uniformly redundant. Guided by these findings, we propose PACE (Pareto-Adaptive Compression for Efficient Native MLLMs), the first visual token compression framework tailored for native MLLMs with Multimodal-RoPE. Leveraging dimensional decoupling of positional encoding, PACE decomposes attention into two orthogonal spatial saliency estimates along height and width, gated by a positional attention signal, yielding direction-aware importance with negligible overhead. It further casts token budget allocation as Pareto optimization over performance preservation, inference efficiency, and spatial coverage, jointly identifying optimal compression depths and retention ratios. Experiments show PACE maintains near-lossless performance at only 25%-50% visual token retention, even improving several benchmarks, while delivering over 2x FLOPs reduction.

cs.CV · cs.AI

版本更新 · v3arXiv:2411.04852

Conformalized Credal Regions for Classification with Ambiguous Ground Truth

Michele Caprio, David Stutz, Shuo Li, Arnaud Doucet

原文摘要

An open question in \emph{Imprecise Probabilistic Machine Learning} is how to empirically derive a credal region (i.e., a closed and convex family of probabilities on the output space) from the available data, without any prior knowledge or assumption. In classification problems, credal regions are a tool that is able to provide provable guarantees under realistic assumptions by characterizing the uncertainty about the distribution of the labels. Building on previous work, we show that credal regions can be directly constructed using conformal methods. This allows us to provide a novel extension of classical conformal prediction to problems with ambiguous ground truth, that is, when the exact labels for given inputs are not exactly known. The resulting construction enjoys desirable practical and theoretical properties: (i) conformal coverage guarantees, (ii) smaller prediction sets (compared to classical conformal prediction regions) and (iii) disentanglement of uncertainty sources (epistemic, aleatoric). We empirically verify our findings on both synthetic and real datasets.

stat.ML · cs.LG

版本更新 · v2arXiv:2609.27392

Handling Complex Interference Compositionally: A Concurrent Garbage Collector Case Study

Nisansala P. Yatapanage

原文摘要

Rely/Guarantee is a well-known verification technique for reasoning about concurrent programs. However, for some algorithms, devising suitable rely and guarantee conditions is challenging, due to the strong interference exhibited in these algorithms. The Ben-Ari concurrent garbage collector is an algorithm where the complex interactions between the components prevent the construction of compositional rely and guarantee conditions. This paper investigates an approach for verifying the Ben-Ari algorithm, which enables reasoning to be performed in a more compositional manner in cases where compositional reasoning would not otherwise be possible. This is accomplished by reasoning that a given property holds for all instances of a particular variable and then instantiating the variable to the local variable required. As well as providing a reasoning approach which is more compositional, the result is the identification of the core property required of a component, thus enabling a deeper understanding about the reasons why the algorithm works correctly. This helps to reveal the reasons why the rely/guarantee approach does not work directly for some problems.

cs.LO

版本更新 · v2arXiv:2606.04310

Latent Anchor-Driven Test Generation for Deep Neural Networks

Bin Duan, Matthew B. Dwyer, Guowei Yang

原文摘要

Deep Neural Networks (DNNs) are increasingly being deployed in security-critical and safety-sensitive applications, which makes rigorous testing essential to identify and mitigate model weaknesses. Existing DNN testing approaches explore either the input space or a learned latent space. While latent-space generation can better maintain plausibility than direct input-space mutation, current methods still face a trade-off among exploration controllability, failure diversity, and seed-relative semantic drift. To overcome these limitations, we propose Latte, a black-box testing framework that generates semantically proximate, diverse, and fault-revealing test cases by leveraging the latent space. Specifically, Latte encodes each input seed with a pre-trained VQ-VAE and performs a seed-centered, one-step latent mutation along directions defined by anchors sampled from alternative classes, followed by quantization and decoding back to the input space. This explores local neighborhoods around each seed within the learned latent manifold, resulting in a larger number and broader diversity of oracle-triggering prediction discrepancies under the same budget. We evaluated Latte on 5 datasets and 10 DNN models in single-model and multi-model testing scenarios. Across the evaluated datasets and models, Latte improves fault exposure and behavioral diversity under matched testing budgets. Under the single-model setting, it also maintains low seed-relative semantic drift with respect to the source seeds.

cs.LG · cs.SE

版本更新 · v4arXiv:2608.27906

Design the Feedback, Not Just the Reward: Environments for Open-Ended Reinforcement Learning

Rui Jin, Jikai Chen, Chengyue Yu, Yihan Chen, Hao Zhou, Demin Zhu, Kaichen Yang, Dong Wang 等 10 位作者

原文摘要

Reinforcement learning has advanced large language models on tasks with reliable verifiers, where checking an outcome provides a clear basis for reward. Extending this approach to open-ended tasks requires environments that can both evaluate complex, partially successful outputs and turn these judgments into effective learning guidance. We propose a reinforcement learning framework built around a training environment that integrates human domain knowledge with model reasoning. Human domain knowledge, encoded in rubrics, anchors evaluation to task intent, while model reasoning combined with hierarchical rewards distinguishes complex open-ended outputs and links diagnosed failures to likely responsible output regions. Furthermore, these diagnostic attributions guide token-level weights in the GRPO objective, thereby translating the ambiguous notion of success in open-ended tasks into concrete guidance for policy optimization. We instantiate this framework in interactive web application generation, a representative open-ended generation task. The resulting model achieves an average pass rate of 41.25\% on MiniAppBench and 76.19\% on ArtifactsBench. Ablation studies show the contributions of individual components, while additional out-of-distribution evaluations support transferable gains without degrading performance on other evaluated tasks.

cs.AI

版本更新 · v2arXiv:2608.11886

Testing Deep Learning Library APIs via Cross-Framework Differential Fuzzing

Bin Duan, Ruican Dong, Naipeng Dong, Dan Dongseong Kim, Guowei Yang

原文摘要

Deep learning libraries underpin many safety- and reliability-critical applications, yet existing API-level testing techniques often rely on intra-library properties or CPU--GPU differential oracles and may miss defects that behave consistently across hardware backends. We present Xamt, a cross-framework differential fuzzing approach for deep learning library APIs. Xamt constructs and tests execution-validated groups of APIs intended to implement equivalent operations across seven libraries. It uses explicit API aliases and parameter-role normalization to construct candidate correspondences and validates them through pairwise execution and a group-level behavioral check on canonical ordinary inputs. The resulting groups are explored using variance-guided differential fuzzing with ordinary, boundary, and non-finite inputs. Crash and inconsistency oracles flag executions exhibiting abnormal termination or inconsistent outputs for subsequent reproduction and analysis. Across the seven libraries, Xamt constructs 676 execution-validated groups containing 2,563 matched APIs. Among these, Xamt identifies 72 independently reproduced discrepancy cases, including 4 crash cases and 68 output inconsistencies. Among the 72 developer reports, 25 have been confirmed, including 23 that have been fixed.

cs.SE

版本更新 · v2arXiv:2512.11345

Symmetry-Aware Steering of Equivariant Diffusion Policies: Benefits and Limits

Minwoo Park, Junwoo Chang, Jongeun Choi, Roberto Horowitz

原文摘要

Equivariant diffusion policies (EDPs) combine the expressivity of diffusion models with the generalization and sample efficiency afforded by geometric symmetries. While steering these policies with reinforcement learning (RL) offers a promising fine-tuning mechanism beyond demonstration data, directly applying standard (non-equivariant) RL ignores the symmetries that EDPs are designed to exploit, leading to sample inefficiency and instability. We theoretically establish that the diffusion process of an EDP is equivariant, inducing a group-invariant latent-noise MDP which is well-suited for equivariant diffusion steering. Building on this, we introduce a principled symmetry-aware steering framework and compare standard, equivariant, and approximately equivariant RL strategies across tasks with varying degrees of symmetry. While we identify the practical boundaries of strict equivariance under symmetry breaking, exploiting symmetry during the steering yields substantial benefits---enhancing sample efficiency, preventing value divergence, and achieving strong policy improvements even when EDPs are trained from extremely limited demonstrations.

cs.LG · cs.RO

版本更新 · v3arXiv:2603.10726

CacheSolidarity: Preventing Prefix Caching Side Channels in Multi-Tenant LLM Serving Systems

Panagiotis Georgios Pennas, Konstantinos Papaioannou, Marco Guarnieri, Thaleia Dimitra Doudali

原文摘要

Large Language Models (LLMs) rely on optimizations like Automatic Prefix Caching (APC) to accelerate inference. APC works by reusing previously computed states for the beginning part of a request (prefix), when another request starts with the same text. While APC improves throughput, it introduces timing side channels: cache hits are faster than misses, creating observable latency differences. In multi-tenant systems, attackers can exploit these differences to infer sensitive information, e.g., by incrementally reconstructing another user's request by observing hit/miss patterns. Current defenses take a sledgehammer approach: they disable APC and cache sharing, isolating users, and sacrificing efficiency for regular users. This paper presents CacheSolidarity, a system that secures multi-tenant LLM serving systems against APC side channels without sacrificing performance and efficiency. CacheSolidarity monitors cache reuse across users, flags suspicious sharing, and selectively isolates prefixes, restricting their reuse only when necessary. Evaluation shows that CacheSolidarity enables up to 70% higher cache reuse and 30% lower inference latency compared to existing user-isolation defenses. CacheSolidarity's lightweight design demonstrates how LLM serving can be secured without sacrificing performance or incurring unbearable overheads.

cs.CR · cs.DC · cs.LG

版本更新 · v3arXiv:2607.01671

Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem

Wen Fang, Xianxian Li, Jun Liu, Jie Luo, Yongxin Tong, Ke Xu

原文摘要

We study self-reference and solution independence in Boolean $K$-SAT as a finite analogue of Gödel incompleteness. Independence is defined through factorial moments of the solution count. Constant-width random formulas fail this criterion due to correlations among overlapping assignments. At a covering threshold, logarithmic-width random CNFs have a Poisson solution count, with positive probabilities of unsatisfiability and unique satisfiability. Replacing a redundant clause by one falsified by the unique solution yields an unsatisfiable companion preserving the unsigned incidence graph. For every permitted local view of a good uniquely satisfiable formula, an unsatisfiable companion preserves that view. Irreducibility defeats deterministic and bounded-error evaluators using $N^c$ clause queries, for fixed $0<c<1$. It establishes a local information obstruction, not an unrestricted time lower bound. For fixed $δ>0$, transcripts of $N^{1-δ}$ queries leave $N-o(N)$ bits of witness entropy. On typical support graphs, expansion yields linear Resolution width, linear PC/PCR and SOS degree, and exponential proof size. Bounds hold for semantic Cutting Planes under a partition condition and for Positivstellensatz with bounded product width, uniformly over unsatisfiable support-preserving signings. Structural evidence and the limits of acceleration strategies motivate the self-referential $K$-SAT exhaustive-search hypothesis (SRK-ESH): no uniform deterministic algorithm deciding the promise family achieves a fixed proportional saving in the exponent. This dual-evidence criterion combines intrinsic hardness mechanisms with algorithmic evidence. We interpret this hypothesis as a quantitative projection of the Gödel-style local--global gap. The information obstruction constrains quantum local observation and statistical learning from bounded local information.

cs.CC · cs.DS · cs.IT · cs.LO

版本更新 · v2arXiv:2610.13309

NovaSplat: Model-Free 6D Object Pose Estimation via 3D Gaussian Splatting Onboarding and Refinement

Georgios Floros, Evangelos Sartinas, Orestis Vaggelis, Maria Pateraki

原文摘要

6D pose estimation of novel objects without CAD models remains an open challenge: model-free methods must build the object representation from scratch during onboarding and have long trailed their model-based counterparts. We present NovaSplat, a model-free pipeline that closes this gap. From a short smartphone video captured at onboarding, we train a 3D Gaussian Splatting (3DGS) model that serves both as a template source for detection and coarse pose estimation and as a differentiable backbone for pose refinement. Our refiner optimizes the object-to-camera pose with combined photometric and geometric losses under a continuous rotation parametrization free of gradient singularities. On a household-object benchmark, NovaSplat surpasses all model-based methods. On a challenging industrial benchmark with textureless and specular surfaces, it outperforms all model-free competitors while substantially narrowing the gap to model-based ones. We further introduce NovaSplat-Lite, an inference variant that is $3.1\times$ faster at negligible accuracy cost. Code will be made available at https://github.com/POSE-Lab/novasplat .

cs.CV · cs.RO

版本更新 · v3arXiv:2609.11472

BridgeMatch: Conditional Transport Bridges in Matching Matrix Space for 3D Deformable Registration

Qianliang Wu, Yaqing Ding, Guangwei Gao, Weiping Ding, Jin Xie, Jian Yang

原文摘要

Non-rigid point cloud registration depends on accurate correspondences under deformation and partial visibility. Existing coarse-to-fine methods use coarse matches to select regions for fine matching, but incorrect selection can remove valid correspondences before refinement. We introduce \paper, a conditional transport framework that connects coarse correspondence estimation to high-resolution matching. A diffusion model first estimates a coarse matching matrix. We lift the complete estimate to a fine-level source matrix and refine its scores with a geometry-conditioned bridge. We consider two bridge formulations: a deterministic endpoint-parameterized flow and a stochastic paired Brownian bridge with endpoint and noise prediction. At each step, the current matrix provides an alignment for the next prediction. Both models reuse backbone features throughout inference. Experiments on 4DMatch and 4DLoMatch show improved correspondence and non-rigid registration accuracy. The models also transfer to CAPE and DeepDeform without target-domain training. Ablations examine the roles of candidate coverage, source initialization, and refinement budget.

cs.CV

版本更新 · v2arXiv:2610.02057

Optimizing Effective Training Time for Large-Scale Recommendation Systems

Mingming Ding, Ruilin Chen, Yuzhen Huang, Hang Qi, Menglu Yu, San Tan, Damian Reeves, Boris Sarana 等 32 位作者

原文摘要

Lifecycle overhead silently consumes accelerator capacity across large-scale recommendation training fleets. Our largest recommendation workloads process tens of billions train- ing examples per day on thousands of GPUs. Before this work, only 50-60% of their end-to-end wall time advanced training on new data. We present a fleet-scale study of this lifecycle overhead and a set of optimizations spanning the full training stack. We use Effective Training Time (ETT%) as an operational framework to instrument lost time, localize it to independently owned infrastructure components, and expose work repeated across job restarts. This analysis guides optimizations like communication elimination and pipeline overlap during trainer initialization; dynamic-shape handling, autotuning pruning, and reusable Py- Torch 2 compilation caches; asynchronous checkpointing; stan- dalone model publishing; and reductions in recovery cost. We evaluate the optimizations on representative models and measure their impacts in our training fleet. ETT% improves on every benchmark, by 15.5% on average, and reaches 85% on our largest workload. Fleet-wide ETT% rose from about 80% to above 90% after deployment.

cs.IR

版本更新 · v3arXiv:2608.23977

IC-ThermBench: An Open, Progressive Benchmark for Generalizable 2.5D/3D-IC Thermal Learning

David Hang, Wenkai Yang, Kuiye Ding, Haiyang Xin, Jacky Wei

原文摘要

Standardized benchmarks are fundamental to reliable progress in AI for EDA, including learning-based thermal modeling. However, existing thermal prediction studies often rely on different datasets, simulators, data splits, preprocessing pipelines, and metrics, while most datasets and implementations remain unavailable, making fair and reproducible comparison difficult. We introduce IC-ThermBench, an open and progressive benchmark that combines established 3D-IC steady-state, transient, and industrial package tasks with a new 50,000-sample 2.5D chiplet extension designed to evaluate progressively broader represented physical variation and cross-package OOD transfer. Five Generalization Scopes cover 3D-IC fixed-design prediction, Within-Family Generalization under layout, material, and boundary-condition variation, and Cross-Package OOD transfer to unseen package systems. We evaluate eight representative baselines under common data, splits, labels, and metrics. Performance degrades gradually from S2 to S4 as represented physical support broadens, but Cross-Package OOD produces a much sharper degradation: the best RMSE and MAE increase from 1.216 and 0.938~K at S4 to 15.99 and 15.00~K at S5, respectively. With only 10 labeled samples per OOD case, target-domain adaptation reduces the best MAE to 2.60~K. IC-ThermBench further provides a unified generation, training, inference, and evaluation pipeline, enabling reproducible and fair comparison of existing and new thermal predictor.

cs.CE

版本更新 · v2arXiv:2312.11206

GAnnET: A principled approach to automatically annotating charge stability diagrams

Brian Weber, Justyna P. Zwolak

原文摘要

Gate-defined semiconductor quantum-dot (QD) arrays are a promising platform for quantum computing. However, their large configuration spaces and inherent measurement noise make device tuning time consuming and difficult to scale. Although machine-learning (ML) approaches for automated tuning have proliferated rapidly, a fair comparison of methods remains limited by inconsistent metrics and a lack of standardized labeled datasets. Here, we introduce Geometry-Informed ANNotator for Electrostatic Topologies (GAnnET), a physics- and geometry-informed algorithm that automatically generates probabilistic state labels for charge stability diagrams (CSDs) of double-QD systems. GAnnET constructs local geometric models of CSD structure and combines them into a global state map with calibrated confidence, eliminating the need for manual annotation. We validate GAnnET on simulated and experimental CSDs and demonstrate consistent labeling suitable for ML training and benchmarking. By enabling reproducible annotation of experimental data, GAnnET supports community benchmarking and scalable automated QD operation.

cond-mat.mes-hall · cs.CV · quant-ph

版本更新 · v2arXiv:2610.09554

Reliability of LLM Judges for Evaluating Entity Alignment

Vaibhava Lakshmi Ravideshik, Mayank Kejriwal

原文摘要

Entity Alignment (EA) identifies equivalent entities across knowledge graphs and is critical for knowledge base integration and ontology merging. Evaluating EA systems at scale requires expensive expert annotation, making systematic assessment across diverse domains practically infeasible. LLM-as-judge evaluation offers a potentially scalable alternative, yet its reliability for structured prediction tasks like EA remains unstudied. We present the first systematic benchmarking study across three frontier models, three datasets, and four EA systems, using perturbation bias diagnostics, meta-evaluation across all dataset--judge--prompt combinations, and counterfactual label-flip tests. We identify anchor bias, a failure mode in which judges invert discrimination when the system's decision label is visible. Judge discrimination collapses under label-exposing prompts (J-ROC-AUC 0.12--0.87), while a label-free protocol recovers near-ceiling capability on distinctive-name datasets (0.98--1.00 for NeuSymEA) and significant recovery on biomedical pairs (0.93--0.95). Counterfactual label flips show that the visible label causally shifts scores by more than 2 points in 53--99% of pairs (FSR), with sensitivity growing with model capability, a pattern we call the frontier model paradox: stronger judges are more label-sensitive, not less, yet also better label-free predictors. The direction of the shifts is mixed, so we report this as an observed pattern. A blinded two-annotator human evaluation (102 pairs, Cohen's $κ$ = 0.902) provides a gold-label reference. We release the first biomedical EA benchmark (MeSH--SNOMED CT, 15K pairs) and a reproducible auditing framework for LLM judge reliability in EA. Code and data are available at https://github.com/vaibhavalakshmiravideshik/llm-as-a-judge-entity-alignment.

cs.AI

版本更新 · v3arXiv:2609.33308

SweepSketch: Detecting Carpet-Bombing Attacks Before They End

Yutong Yan, Sijia Du, Haowei Wang, Bo Yang

原文摘要

Carpet-bombing DDoS attacks spread traffic almost uniformly across a destination prefix, keeping each host below alarm thresholds while exhausting prefix-level resources; spoofed sources make source-side evidence unreliable. Existing detectors either decide on windows of seconds, alarming only at window boundaries, or depend on supervised training, so short attacks often end before the first alarm. We present SweepSketch, a destination-anchored, per-packet sketch detector that keeps no source-side state, needs no training, and alarms while the attack is still in progress. Its core is a tagged self-cleaning windowed HyperLogLog (T-HLL) that turns uniformity testing into one event per distinct destination per window; per-packet cumulative-sum (CUSUM) decisions and dual exponentially weighted moving average (EWMA) gates form the decision chain. The reference state occupies 512 KB, and a bit-exact C++ implementation reaches 13.2 Mpps per core. On attacks lasting only 0.5 s, it raises its first alarm before the attack ends in 95.6% of attacks; on real captures, 49.3% alarm within the first second; static and mixed-traffic F1 both reach 0.991. SweepSketch is deployed in two hardware forms: a Tofino2 program carries the complete per-packet state chain and places the final gates on the control plane, while a DPU micro-engine keeps the entire decision chain in the fast path.

cs.CR

版本更新 · v7arXiv:2602.03901

NeuroPareto: Calibrated Acquisition for Costly Many-Goal Search in Vast Parameter Spaces

Rong Fu, Chunlei Meng, Haoyu Zhao, Kun Liu, Simon James Fong

原文摘要

The pursuit of optimal trade-offs in high-dimensional search spaces under stringent computational constraints poses a fundamental challenge for contemporary multi-objective optimization. We develop NeuroPareto, a cohesive architecture that integrates rank-centric filtering, uncertainty disentanglement, and history-conditioned acquisition strategies to navigate complex objective landscapes. A calibrated Bayesian classifier estimates epistemic uncertainty across non-domination tiers, enabling rapid generation of high-quality candidates with minimal evaluation cost. Deep Gaussian Process surrogates further separate predictive uncertainty into reducible and irreducible components, providing refined predictive means and risk-aware signals for downstream selection. A lightweight acquisition network, trained online from historical hypervolume improvements, guides expensive evaluations toward regions balancing convergence and diversity. With hierarchical screening and amortized surrogate updates, the method maintains accuracy while keeping computational overhead low. Experiments on DTLZ and ZDT suites and a subsurface energy extraction task show that NeuroPareto consistently outperforms classifier-enhanced and surrogate-assisted baselines in Pareto proximity and hypervolume.

cs.LG · cs.NE

版本更新 · v3arXiv:2605.11012

Inverse Design of Metainterfaces towards Static Friction Control: Beyond the Hertzian Limit

Jacopo Bilotto, Arnav Singhal, Joaquin Garcia-Suarez, Gaëtan Cortes, Lucas Fourel, Jean-François Molinari

原文摘要

Programming the static friction of mechanical interfaces is critical for soft robotics, haptics, and precision gripping. Static friction is governed by the real contact area, and standard rough surfaces exhibit a linear area-load scaling inherent to classical models, severely restricting their functional range. Here, we propose a framework for the inverse design of tribological metainterfaces engineered for programmable contact behaviors. By utilizing general axisymmetric asperities, we unlock nonlinear macroscopic responses unattainable by standard Hertzian contacts. To solve the inverse problem, we embed a fully differentiable contact mechanics engine within a neural network and a quadratic optimizer. We leverage regularized physical gradients to automatically discover non-standard topographies that reproduce complex target contact laws, with only a few asperities in unit cells. The predicted designs are validated against high-fidelity Boundary Element Method (BEM) simulations. By front-loading computational costs during training, the neural surrogate yields near-instantaneous design inference, bypassing the bottlenecks of traditional multi-start optimization. This framework bridges data-driven optimization and rigorous physics, offering a scale-invariant pathway for the high-throughput discovery and real-time control of functional tribological surfaces.

cond-mat.soft · cs.LG

版本更新 · v2arXiv:2510.09177

Distributionally robust approximation property of neural networks

Mihriban Ceylan, David J. Prömel

原文摘要

The universal approximation property uniformly with respect to weakly compact families of measures is established for several classes of neural networks. To that end, we prove that these neural networks are dense in Orlicz spaces, thereby extending classical universal approximation theorems even beyond the traditional $L^p$-setting. The covered classes of neural networks include widely used architectures like feedforward neural networks with non-polynomial activation functions, deep narrow networks with ReLU activation functions and functional input neural networks.

stat.ML · cs.LG · math.FA · math.PR

版本更新 · v4arXiv:2407.10247

Strategic Integration of Artificial Intelligence in the C-Suite: The Role of the Chief AI Officer

Marc Schmitt

原文摘要

The integration of Artificial Intelligence (AI) into corporate strategy has become critical for organizations seeking to maintain competitive advantage in the digital age. Although organizations increasingly rely on AI as a strategic and organizational resource, existing C-suite roles remain only partially equipped to govern, integrate, and leverage it coherently at the enterprise level. Organizations vary in their responses. Some create a dedicated Chief AI Officer (CAIO), others extend existing mandates into hybrid roles, and still others coordinate AI through federated structures. This paper develops a role-design theory to explain this variation. I identify three properties that distinguish AI systems from earlier cross-cutting enterprise technologies, distributed accountability for judgment, upstream governance, and non-stationarity, and three configurations through which organizations respond: concentrated extension, distributed extension, and role creation. Four propositions specify when a dedicated CAIO emerges, what form an organization's response takes, when the role is effective, and how configurations evolve. Drawing on the first archival census of executive AI leadership, I find that the role has diffused sharply since 2023, that role creation and mandate extension are advancing in near parity, that adoption concentrates where digital leadership structures already exist, and that executive tenures contradict practitioner accounts of a transient role. The paper contributes to research on executive leadership, AI governance, and the design of AI-driven organizations.

cs.CY · cs.AI · cs.LG · econ.GN

版本更新 · v2arXiv:2609.24616

From Tokens to Structure: Investigating Visual Attention in Progressive Code Rendering

Xiaotian Su, Jan Brasser, David Robert Reich, Lena A. Jäger, April Yi Wang

原文摘要

AI coding interfaces present generated code either all at once or token-by-token. These rendering strategies reflect model generation rather than how programmers actually read code: selectively, non-linearly, and guided by the structure. We argue that code rendering is a first-class interaction primitive that shapes how programmers read and understand code. To explore this design space, we introduce structured rendering, a technique that reveals code in semantically meaningful chunks derived from its syntactic hierarchy, exposing high-level structure before low-level details. To isolate rendering effects on visual attention, we conducted an eye-tracking study with 53 participants comparing static, character-based, and structured rendering. Our findings show that rendering alters visual attention and reading behavior: dynamic rendering induces fewer but longer fixations and more sustained focus, while structured rendering further guides attention toward semantically meaningful units and supports high-level understanding. We release the anonymized dataset with an interactive demo (https://codegaze.vercel.app/) to support future research.

cs.HC

版本更新 · v3arXiv:2605.09383

Safety-Critical LiDAR-Inertial Odometry with On-Manifold Deterministic Protection Level

Yueqi Zhu, Yan Pan, Chufan Rui, Jiasheng Luo, Bo Zhou

原文摘要

In safety-critical scenarios, the protection level of the autonomous navigation system is crucial for enabling mobile robots to perform safe tasks. However, existing studies on probabilistic navigation systems for robots usually perform offline accuracy evaluations using limited datasets and assume that the results can be applied to unknown real-world environments. As a result, current autonomous mobile robots often lack protection levels for online safety assessment. To fill this gap, we propose a safety-critical LiDAR-inertial odometry (LIO) that provides deterministic protection levels based on a novel on-manifold set-membership filter. By adopting the unknown but bounded assumption, we derive a neat closed-form relationship between point cloud noise and the uncertainty of the estimation from the iterative closest point algorithm. Using this relationship, we design an on-manifold ellipsoidal set-membership filter (OM-ESMF) and implement it within the LIO system. Leveraging the properties of the set-membership filter, our system offers the feasible sets of the estimated locations as the deterministic protection levels, serving as safety references for the robots' downstream autonomous operations. The experimental results show that our system can provide effective deterministic online safety references for diverse robots in various environments.

cs.RO

版本更新 · v3arXiv:2512.10753

Quantifying displacement: an urban expansion consequence via persistent homology

Rita Rodríguez Vázquez, Manuel Cuerno

原文摘要

Population displacement is a housing-related involuntary residential dislocation. It has become increasingly widespread in many cities, particularly in neighbourhoods undergoing rapid economic and demographic change, and measuring it is essential to assess the social consequences of urban transformation and housing market pressures. Despite its relevance, quantifying displacement presents difficulties due to limited replicability across cities and time periods and the need to analyse long time spans: displacement is a gradual process, impossible to capture in one data snapshot. We introduce a novel tool to overcome these difficulties. Using publicly available address change data, we construct four cubical complexes simultaneously incorporating geographical and temporal information of people moving, and analyse using Topological Data Analysis tools. Finally, we demonstrate this method through a 20-year case study in Madrid, Spain. The results demonstrate its ability to reveal patterns consistent with population displacement and identify the neighbourhoods and years potentially affected--patterns not observable from yearly maps of the raw address change data.

cs.CG · cs.SI

版本更新 · v6arXiv:2602.12851

Chimera: Neuro-Symbolic Attention Primitives for Trustworthy Dataplane Intelligence

Rong Fu, Xiaowen Ma, Kun Liu, Wangyu Wu, Ziyu Kong, Jia Yee Tan, Tailong Luo, Xianda Li 等 10 位作者

原文摘要

Deploying expressive learning models directly on programmable dataplanes promises line-rate, low-latency traffic analysis but remains hindered by strict hardware constraints and the need for predictable, auditable behavior. Chimera introduces a principled framework that maps attention-oriented neural computations and symbolic constraints onto dataplane primitives, enabling trustworthy inference within the match-action pipeline. Chimera combines a kernelized, linearized attention approximation with a two-layer key-selection hierarchy and a cascade fusion mechanism that enforces hard symbolic guarantees while preserving neural expressivity. The design includes a hardware-aware mapping protocol and a two-timescale update scheme that together permit stable, line-rate operation under realistic dataplane budgets. The paper presents the Chimera architecture, a hardware mapping strategy, and empirical evidence showing that neuro-symbolic attention primitives can achieve high-fidelity inference within the resource envelope of commodity programmable switches.

cs.NI · cs.AI · cs.CR · cs.LG