跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

论文修订列表

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

找到 8,992 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · 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

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

版本更新 · v5arXiv:2607.19305

Riemannian Deep Learning: Modules, Networks, and Geometries

Ziheng Chen

原文摘要

Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations. This thesis develops a unified framework for Riemannian deep learning from three complementary perspectives: reusable neural modules, manifold-specific network architectures, and the design of underlying geometries. It generalizes batch normalization from Euclidean spaces and individual manifolds to broad classes of Lie groups and gyrogroups, and extends multinomial logistic regression from Euclidean space to SPD manifolds and then to general Riemannian manifolds. It further develops neural networks for several important geometric representations, including an unconstrained model of hyperbolic space, Busemann-based hyperbolic learning, and full-rank correlation matrices. Finally, it introduces adaptive and computationally efficient Riemannian metrics on SPD manifolds, including learnable Log-Euclidean geometries and fast, stable Cholesky-based geometries. The proposed methods are supported by theoretical analysis and validated through numerical experiments and applications in vision, signal processing, graph learning, and genomics.

cs.LG · cs.AI · math.DG

版本更新 · v2arXiv:2608.30685

ATLAS: Dual-Horizon Diagnostic Evaluation for Tool-Use Agents in Meituan Xiaotua

Wei Chen, Peilun Zhou, Zhaoyu Hu, Jiajun Chai, Derong Xu, Zhongni Hou, Yufei Zhang, Guojun Yin 等 11 位作者

原文摘要

LLM-based assistants on web-scale service platforms increasingly address local-service needs through multi-step planning and tool use. Under dynamic business conditions and evolving user needs, outcome-level evaluation offers limited evidence of where execution fails or how service drifts across continued interaction. We present ATLAS, a dual-horizon diagnostic evaluation framework for industrial tool-use agents. Within-turn evaluation uses trajectory-wise signals across thinking and reflection, tool and skill execution, and response generation to identify execution failures and unmet capability requirements. Across-turn evaluation uses user-wise signals spanning multiple lifecycles to diagnose failures in maintaining or updating user intent, constraints, and corrections. Fine-grained signals use rule-based checks and LLM judgments with explicit evidence scopes and decision boundaries. To support reliable diagnosis at production scale, LLM judges are calibrated against dynamically maintained references from business logs, and selected judges are distilled into compact diagnostic models. The resulting diagnostic profiles help developers attribute failures, prioritize targeted interventions, and reassess improvements. Applied in Meituan Xiaotuan, a million-scale DAU local-services assistant, ATLAS achieves high diagnostic fidelity across calibrated judges and distilled models. Blinded human auditing and a 14-day online A/B test with nearly two million users per arm confirm that the ATLAS-guided agent improves recommendation relevance, factual reliability, user engagement (+2.84% answer read-through rate), and order volume (+6.13% paid orders), leading to full production deployment.

cs.AI

版本更新 · v3arXiv:2608.19491

Activation-Keyed Momentum: An Anisotropic Momentum Update via the Delta Rule

Euijin Hong, Guannan Qu

原文摘要

Most modern optimizers form their momentum as an exponential moving average (EMA) of past gradients, forgetting every direction at one fixed rate. However, the inputs a deep network sees during training can be highly anisotropic, with a few directions queried frequently while most are seen rarely. Preconditioning methods address this anisotropy by wrapping extra processing around this buffer and leave the momentum update itself unchanged. We propose Activation-Keyed Momentum (AK-Momentum), which builds direction-awareness into the momentum update rule. The gradient of a linear layer splits into an input activation that acts as a $\textit{key}$ and an output-side error that acts as a $\textit{value}$. Keying on that activation, AK-Momentum updates the momentum buffer by the canonical delta rule, so each direction is forgotten at a rate set by how often it appears. We prove that it is a valid momentum, that it applies the input-side curvature correction without matrix inversion, and that it clears stale directions faster than EMA under both a fixed and a drifting optimum. It is a drop-in replacement for the momentum buffer of any optimizer, its coefficient transfers across widths under $μ$P, and its extra compute stays between $22.2\%$ and $25.0\%$ of a gated-MLP block's linear cost with no persistent memory. In FineWeb-Edu pretraining, AdamW with AK-Momentum (AK-AdamW) reaches AdamW's validation loss in up to $46.64 \pm 4.52\%$ fewer steps at 67M and $22.14 \pm 0.81\%$ at 370M over three seeds, and the gain persists at 1B on a Chinchilla-optimal budget. A Muon baseline tuned under the same protocol sits above AK-AdamW at both language-model scales, and the gain holds for SGD, ResNet-18, and ViT-Tiny on CIFAR-10. Training-time diagnostics confirm the predicted mechanism, better gradient tracking and healthier input directions. Code is available at https://github.com/euijinh/AK-Momentum.

cs.LG · cs.CL · math.OC · stat.ML

版本更新 · v2arXiv:2607.14988

Quantum XYZ Stabilizer Codes

Alessio Baldelli, Davide Orsucci, Francisco Lázaro, Massimo Battaglioni

原文摘要

Stabilizer codes are often constructed within the Calderbank--Shor--Steane (CSS) framework, where two mutually orthogonal binary classical codes define $X$ and $Z$-type stabilizer generators. While this structure is algebraically convenient, additional non-CSS constraints may help suppress low-weight logical operators and improve decoding performance in the finite-length regime. We thus introduce quantum XYZ stabilizer codes, whose parity-check matrix (PCM) is built from three pairwise orthogonal binary PCMs associated with $X$-, $Y$-, and $Z$-type stabilizer generators. A nontrivial point is that an XYZ code instance is not automatically genuinely non-CSS: the same stabilizer group may admit a CSS generating set. We characterize this collapse, obtaining algebraic and rank conditions for deciding when the $Y$-type checks are redundant and when they define genuinely non-CSS stabilizer constraints. We also derive upper and lower bounds on the quantum minimum distance, including bounds for mixed Pauli logical operators. The novel framework includes a known non-CSS topological code, namely the XYZ$^2$ hexagonal code, and yields also sparse finite-length quantum low-density parity-check (qLDPC) constructions from intersecting-subset and quasi-dyadic code families. Simulations under depolarizing code-capacity noise and quaternary belief propagation decoding show that the proposed XYZ qLDPC instances can outperform representative CSS qLDPC instances with similar finite-length parameters.

cs.IT · quant-ph

版本更新 · v2arXiv:2512.03062

FermiGrad-SVD: An LLM Compression Pipeline with Global Rank Selection and Gauge Fixing

Roman Rausch, David Jansen, Sukhbinder Singh, Román Orús

原文摘要

Low-rank factorization of weight matrices is a promising approach to compress large language models (LLMs), but its practical effectiveness depends on allocating ranks across layers and efficiently representing the resulting factors. We introduce three complementary methods for improving SVD-based LLM compression. First, FermiGrad formulates global layer-wise rank allocation as a differentiable optimization problem by replacing discrete singular-value truncation with continuous Fermi gates. Because FermiGrad optimizes only rank parameters over precomputed low-rank factors, it avoids repeated activation decompositions and backpropagation through SVD operations. Second, the Targeted Compressor extends FermiGrad with a task-specific objective that directs limited model capacity toward a selected domain. At 60% parameter density for Llama-3.1-8B-Instruct, SciQ-targeted compression achieves 60% MMLU accuracy, exceeding the reported quantized Dobi-SVD result by 10 percentage points, while deliberately trading performance on unrelated tasks for domain specialization. Third, PivGa provides a lossless secondary compression of low-rank factors by exploiting the gauge freedom in their parametrization. The proposed framework is modular, computationally efficient, and applicable at scale, as demonstrated by compressing Llama-3.3-70B-Instruct to 50% parameter density.

cs.LG · stat.ML

版本更新 · v2arXiv:2610.26442

Exact Compilation and Resource Laws for Hidden Integer Feedback

Ganxuan Yang, Siqi Wen, Shuyan Yu, Jidong Yuan

原文摘要

Hidden rounding carries dependencies through integer memory. We study finite-memory feedback with predictable inputs that differ by one on at most $C$ releases and with every output public. A shared preparation constrains future branches until a sequence of common-input releases synchronizes the conditional registers. Preserving those constraints yields exact finite-law compilation, polynomial in support width for fixed memory and participation budgets, with constructive discrete-Gaussian transfer and calibration. A commitment hierarchy quantifies the loss from releasing dependencies early and becomes exact at depth $mC$ for memory $m$. Strict examples include three levels with one participation and a discrete-Gaussian calibration gap exceeding 0.23. Charging actual preparation time gives a privacy resource law with a square-root remainder and a leading coefficient computable in polynomial bit cost at fixed parameters. Lean refinements cover the first-order privacy analysis and binary value algorithm; separate lemmas check finite-memory algebra and paths. Certificates establish multi-memory calibration and resource effects; workload comparisons include a finite-memory prefix-error lower bound.

cs.CR

版本更新 · v3arXiv:2606.08339

Floating-point autotuning with customized precisions

Xinye Chen, Fabienne Jézéquel, Thibault Hilaire

原文摘要

Reduced-precision arithmetic offers significant opportunities to improve performance, memory usage, and energy efficiency in numerical applications, provided that numerical accuracy is preserved. This work investigates automated precision tuning through customized floating-point formats with user-defined exponent and significand sizes, enabling the emulation of emerging low-precision formats and the exploration of non-standard precision configurations within a unified mixed-precision framework. The proposed methodology, implemented in the PROMISE precision autotuning tool, combines numerical validation with a systematic search to generate program variants that satisfy user-defined accuracy requirements. To address the computational cost of this exploration, a containerized benchmarking framework supports parallel execution across multiple algorithms and parameter configurations. The approach is evaluated on a suite of numerical programs, including linear solvers and applications from the Rodinia benchmark. Results show that a substantial proportion of variables can be safely reduced to lower precision while preserving accuracy, indicating that standard double precision is often over-provisioned. These findings highlight the potential of automated precision tuning to derive efficient mixed-precision configurations tailored to application-specific accuracy requirements.

cs.MS · math.NA

版本更新 · v7arXiv:2602.00667

zkCraft: Prompt-Guided LLM as a Zero-Shot Mutation Pattern Oracle for TCCT-Powered ZK Fuzzing

Rong Fu, Jia Yee Tan, Ziyu Kong, Shuning Zhang, Xianda Li, Kun Liu, Simon Fong

原文摘要

Zero-knowledge circuits enable privacy-preserving and scalable systems but are difficult to implement correctly due to the tight coupling between witness computation and circuit constraints. We present zkCraft, a practical framework that combines deterministic, R1CS-aware localization with proof-bearing search to detect semantic inconsistencies. zkCraft encodes candidate constraint edits into a single Row-Vortex polynomial and replaces repeated solver queries with a Violation IOP that certifies the existence of edits together with a succinct proof. Deterministic LLM-driven mutation templates bias exploration toward edge cases while preserving auditable algebraic verification. Evaluation on real Circom code shows that proof-bearing localization detects diverse under- and over-constrained faults with low false positives and reduces costly solver interaction. Our approach bridges formal verification and automated debugging, offering a scalable path for robust ZK circuit development.

cs.CR · cs.SE

版本更新 · v2arXiv:2608.28941

A GPU-Accelerated Blocked Adaptive Randomized Range Finder Based on an Implicit Householder QR Decomposition

Carolin Penke, Andreas Herten

原文摘要

Low-rank methods can reduce the memory and computational requirements of deep neural network training in approaches such as GaLore. Randomized range finders offer an attractive alternative to singular value decompositions, particularly when the required rank is determined adaptively from a prescribed approximation tolerance. We introduce a blocked adaptive randomized range finder based on a Householder QR decomposition and an optimized hybrid CPU--GPU implementation. Numerical experiments show that it preserves orthogonality and approximation accuracy in regimes where block Gram--Schmidt without reorthogonalization becomes unstable. The blocked formulation exposes matrix--matrix operations and enables overlap of CPU panel factorization with GPU updates. On an NVIDIA GH200, the overlapped implementation reduces the runtime for the largest tested matrix from 9.91 s on the CPU to 0.407 s. The method provides a stable and efficient building block for low-rank approximation on heterogeneous systems with applications in computational science and engineering.

math.NA · cs.MS

版本更新 · v4arXiv:2602.12446

Model checking with temporal graphs and their derivative

Binh-Minh Bui-Xuan, Florent Krasnopol, Bruno Monasson, Nathalie Sznajder

原文摘要

Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or as a single graph where each edge is associated with a specific set of time instants where the edge is alive. For static graphs, Courcelle's Theorem asserts that any graph problem expressible in monadic second-order logic can be solved in linear time on graphs of bounded tree-width. We propose the first adaptation of Courcelle's Theorem for monadic second-order logic on temporal graphs that does not explicitly rely on a parameter proportional to the lifetime, or defined as the maximum number of time-edges incident with any vertex which in the worst case is higher than the lifetime. We then introduce the notion of derivative over a sliding time window of a chosen size, and define the tree-width and twin-width of the temporal graph's derivative. We exemplify its usefulness with meta-theorems with respect to a temporal variant of first-order logic. The resulting logic expresses a wide range of temporal graph problems including a version of temporal cliques, an important notion when querying time series databases for community structures.

cs.DS · cs.LO

版本更新 · v2arXiv:2607.13498

Factorized Spectral Representations for Reinforcement Learning

Junyi Wu, Dan Li

原文摘要

Learning a compact model of the world from interaction data is central to sample-efficient deep reinforcement learning. Spectral representation methods have become the leading paradigm for representation learning in continuous control by taking a matrix view of the transition kernel, with state-action pairs on one side and next states on the other, and learning a low-rank factorization through self-supervised contrastive objectives. We take this view one step further. The transition kernel is naturally a three-mode tensor over states, actions, and next states, and a CP decomposition gives one feature map per mode. We propose FaStR, which fits this decomposition with a noise contrastive objective, producing separate state, action, and next-state encoders that together form a single spectral representation. The factored form yields a smaller hypothesis class, and the sample size needed for representation learning shrinks by a factor that scales with the smaller of the state and action dimensions. Empirically, FaStR delivers its largest gains on high-dimensional locomotion tasks whose dynamics align with the factored structure, and the learned state encoder transfers intact across actuator shift while only the action encoder is retrained.

cs.LG

版本更新 · v3arXiv:2503.02315

Incorporating graph neural network into route choice model

Yuxun Ma, Toru Seo

原文摘要

Route choice models are one of the most important foundations for transportation research. Traditionally, theory-based models have been utilized for their great interpretability, such as logit models and Recursive logit models. More recently, machine learning approaches have gained attentions for their better prediction accuracy. In this study, we propose novel hybrid models that integrate the Recursive logit model with Graph Neural Networks (GNNs) to enhance both predictive performance and model interpretability. To the authors' knowldedge, GNNs have not been utilized for route choice modeling, despite their proven effectiveness in capturing road network features and their widespread use in other transportation research areas. We mathematically show that our use of GNN is not only beneficial for enhancing the prediction performance, but also relaxing the Independence of Irrelevant Alternatives property without relying on strong assumptions. This is due to the fact that a specific type of GNN can efficiently capture multiple cross-effect patterns on networks from data. By applying the proposed models to one-day travel trajectory data in Tokyo, we confirmed their higher prediction accuracy compared to the existing models.

cs.LG

版本更新 · v3arXiv:2505.13565

Trustworthy AI and Democracy: A Dual Taxonomy and Operational Framework of Democratic Risks and Contributions

Oier Mentxaka, Natalia Díaz-Rodríguez, Mark Coeckelbergh, Marcos López de Prado, Emilia Gómez, David Fernández Llorca, Enrique Herrera-Viedma, Francisco Herrera

原文摘要

Artificial Intelligence (AI) can undermine and strengthen democratic governance. This paper introduces the AIRD/AIPD framework, a dual taxonomy and operational framework for analyzing AI's democratic risks and conditional contributions. The AI Risks to Democracy (AIRD) taxonomy identifies threats to autonomy, fairness, public discourse, democratic institutions, and trust, while the AI's Positive Contributions to Democracy (AIPD) taxonomy captures AI's potential to enhance efficiency, accessibility, security, informed citizenry, transparency and accountability, inclusive democratic dialogue, and evidence-based policymaking. Grounded in five democratic principles and the seven Trustworthy AI requirements proposed by the European Commission's High-Level Expert Group on AI, the framework connects democratic goals with governance and design mechanisms. It provides an operational process for identifying affected contexts and actors, classifying primary and secondary AIRD/AIPD effects, mapping them to relevant Trustworthy AI requirements, and defining proportionate governance responses and responsible actors. An operational mapping and two worked examples illustrate its application to electoral misinformation and AI-assisted public service allocation. The analysis highlights the transversal relevance of transparency, accountability, fairness, and societal wellbeing, while recognizing trade-offs, implementation costs, differential impacts, institutional capacity, and contextual variation across democratic settings. The framework is conceptual and has not been empirically validated, but it offers a traceable and adaptable basis for research, policy analysis, institutional oversight, and responsible AI design. By connecting democratic diagnosis with governance action, it bridges the gap between normative principles and the operational requirements of trustworthy and democratically legitimate AI.

cs.CY · cs.AI · cs.HC