跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

论文修订列表

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

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

List Recovery for Random Low-Rate Linear Codes

Isaac M Hair, Amit Sahai

原文摘要

We show that random linear codes of fixed dimension $d$ over sufficiently large prime fields have nearly optimal output list size for list recovery. Fix an error fraction $0<α<1$ and $0<\varepsilon<1$. For all sufficiently large block lengths $n$, with probability at least $1-\varepsilon$, the following holds simultaneously for every input list size $\ell\le 2^{δn/\log n}$, where $δ>0$ depends only on $α,\varepsilon$, and $d$. Given any list of $\ell$ symbols at each coordinate, at most $(1+\varepsilon)\ell/(1-α)$ codewords agree with the lists in at least $(1-α)n$ coordinates. Our proof adapts the colored-graph and determinant arguments of Matousek, Privetivy, and Skovron for reconstructing planar point sets from their projections. We also prove that the range of input list sizes is nearly optimal. There is a constant $c=c(α,\varepsilon)>0$ such that, for every linear code of dimension at least two over a sufficiently large prime field $\mathbb{F}_p$ and every $2^{cn}\le\ell\le p$, there are lists of size $\ell$ and a set of more than $(1+\varepsilon)\ell/(1-α)$ codewords, each of which agrees with those lists in every coordinate. The main results of this paper were discovered by ChatGPT 5.5 Sol using harness components from the UCLA Moonshot Harness Project, in response to a less optimal result found by the authors. See the end of the introduction for a discussion.

cs.IT

版本更新 · v3arXiv:2605.12938

CRePE: Curved Ray Expectation Positional Encoding for Unified-Camera-Controlled Video Generation

Seonghyun Jin, Youngmin Kim, Sunwoo Park, Jong Chul Ye

原文摘要

Camera-conditioned video generation requires positional encoding that remains reliable under changes in camera motion, lens configuration, and scene structure. However, existing attention-level camera encodings either provide ray-only camera signals or rely on pinhole camera geometry, limiting their applicability to general camera control under the Unified Camera Model, including wide-angle and fisheye lenses. To address this limitation, we propose Curved Ray Expectation Positional Encoding (CRePE). CRePE represents each image token as a depth-aware positional distribution along its source ray, providing a Unified Camera Model-compatible positional encoding that naturally captures the curved-ray geometry of wide-angle and fisheye cameras. CRePE is implemented through a Geometric Attention Adapter added to frozen video DiTs, injecting token-wise scene-distance information into selected attention layers and stabilizing it with pseudo supervision from a monocular geometry foundation model. This design leads to more stable camera control with competitive video quality in camera-conditioned video generation under the Unified Camera Model, and the resulting model transfers zero-shot to real fisheye and diverse pinhole videos. Controlled positional-encoding ablations show improvements over a RayRoPE-style endpoint approximation, demonstrating the effectiveness of curved-ray-aware positional encoding, particularly for non-pinhole cameras. Furthermore, by extending the same positional-encoding pathway to external geometry control through Radial MixForcing, CRePE supports external radial-map control for scene-geometry-conditioned generation and source-video motion transfer beyond camera control. Project page: https://crepe-neurips2026.github.io/; code: https://github.com/jinotter3/CRePE.

cs.CV · cs.AI · cs.LG

版本更新 · v3arXiv:2602.08616

Breaking the Grid: Distance-Guided Reinforcement Learning in Large Discrete Action Spaces

Heiko Hoppe, Fabian Akkerman, Wouter van Heeswijk, Maximilian Schiffer

原文摘要

Reinforcement Learning (RL) is increasingly applied to large-scale decision-making problems like logistics, scheduling, and recommender systems, but existing algorithms struggle with the curse of dimensionality in such large discrete action spaces. We propose Distance-Guided Reinforcement Learning (DGRL), combining Sampled Dynamic Neighborhoods and Distance-Based Updates to enable efficient RL in problems with up to $10^{36}$ actions. Unlike prior methods, DGRL performs stochastic volumetric exploration and transforms policy optimization into a stable regression task, decoupling gradient variance from action space cardinality. On structured tasks, DGRL provably guarantees local value improvement. DGRL naturally handles action spaces without regular semantic structure and hybrid continuous-discrete action spaces. We demonstrate performance improvements of up to 66% against state-of-the-art benchmarks across regularly and irregularly structured environments, while simultaneously improving convergence speed and computational complexity.

cs.LG · cs.AI

版本更新 · v2arXiv:2605.21699

X-Token: Projection-Guided Cross-Tokenizer Knowledge Distillation

Sharath Turuvekere Sreenivas, Adithyakrishna Venkatesh Hanasoge, Mingyu Yang, Ali Taghibakhshi, Saurav Muralidharan, Ashwath Aithal, Pavlo Molchanov

原文摘要

Cross-tokenizer knowledge distillation allows a student to learn from teachers with incompatible vocabularies while preserving its tokenizer and inference architecture. Existing logit-based methods either supervise only the observed token or match full distributions through strict token partitions and heuristic ranking. We identify two limitations: an uncommon-token failure, where task-critical tokens outside the shared vocabulary are suppressed, and over-conservative matching, where exact string equality discards useful correspondences. We propose X-Token, which addresses both through a sparse projection initialized from tokenizer-level string rules and optionally refined during distillation. P-KL removes the partition and projects the student distribution into the teacher vocabulary; H-KL retains the hybrid loss while relaxing matching through the projection. A token-coverage audit guides the choice between them, and both extend naturally to heterogeneous teachers. Across Llama, OLMo, and Gemma students, X-Token achieves the highest average accuracy in all four teacher-student settings among all evaluated cross-tokenizer methods. Complementary teachers provide a further 1.30-point gain, and both variants are faster than the evaluated cross-tokenizer baselines in matched profiling.

cs.LG · cs.CL

版本更新 · v2arXiv:2604.10479

Expanding Codes with Polynomial Stretch

Isaac M Hair, Amit Sahai

原文摘要

We give a polynomial-stretch, constant-arity counterpart to the expanding-code construction of Blasiok, Lou, Rosen, and Sudan (FOCS 2026). For every constant $\varepsilon\in(0,1/2)$, we construct binary matrices with $n$ columns and polynomially many rows, each of weight $k=O(\varepsilon^{-6})$, such that the union of the supports of any set of at most $n^{1-\varepsilon}$ rows has size at least $(1-\varepsilon)k$ times the number of rows. Nevertheless, a polynomial-time test accepts every codeword (generated by the columns of this matrix) corrupted in at most a $1/2-\varepsilon$ fraction of its coordinates, while rejecting a uniformly random vector with high probability. We give two applications. First, we obtain a family of (nearly lossless) constant locality expanders on which Goldreich's pseudorandom generator with the XOR-MAJ predicate can be distinguished from uniform in polynomial time, well within the small-bias parameter regime and the hard regime for known algebraic-immunity/annihilator attacks and algebraic-degree linearization attacks described by Applebaum and Lovett (STOC 2016, SICOMP 2018). Second, we obtain public key encryption from either the constant-noise $k$XOR conjecture over random graphs or the Goldreich conjecture with XOR-MAJ over random graphs, together with a new planted-hypergraph conjecture. We prove low-degree lower bounds for the planting conjecture, providing evidence for subexponential hardness, and give lower bounds against dimension tests based on coordinatewise products (Schur products) of public-code vectors. The PKE schemes and lower bounds were discovered by the authors. The code construction was discovered by Codex / ChatGPT 6 Astra Ultra using harness components from the UCLA Moonshot Harness Project, in response to a general strategy suggested by the authors. See the end of the introduction for a discussion.

cs.CR

版本更新 · v3arXiv:2603.00963

Stabilizing Policy Optimization via Logits Convexity

Hongzhan Chen, Tao Yang, Yuhua Zhu, Shiping Gao, Xiaojun Quan, Ting Yao

原文摘要

While reinforcement learning (RL) has been central to the recent success of large language models (LLMs), RL optimization is notoriously unstable, especially when compared to supervised fine-tuning (SFT). In this work, we investigate the stability gap between SFT and RL from a gradient-based perspective, and show that the convexity of the SFT loss with respect to model logits plays a key role in enabling stable training. Our theoretical analysis demonstrates that this property induces favorable gradient directionality during optimization. In contrast, Proximal Policy Optimization (PPO), a widely adopted policy gradient algorithm utilizing a clipped surrogate objective, lacks this stabilizing property. Motivated by this observation, we propose Logits Convex Optimization (LCO), a simple yet effective policy optimization framework that aligns the learned policy with an optimal target derived from the original RL objective, thereby emulating the stabilizing effects of logits-level convexity. Extensive experiments across multiple model families show that our LCO framework consistently improves training stability and outperforms conventional RL methods on a broad range of benchmarks.

cs.LG · cs.CL

版本更新 · v3arXiv:2605.25326

Perceive-then-Plan: Layout-as-Policy for Monocular 3D Scene Layout Estimation

Junwei Zhou, Yu-Wing Tai

原文摘要

Building structured 3D scene layouts from a single image requires reconciling visual observations with physical and spatial constraints, a challenge that is difficult to address with direct prediction alone. In this work, we formulate monocular 3D layout estimation as a perceive-then-plan problem with vision-language models, where a Perceiver first grounds the 3D objects and then a Planner iteratively refines the scene hypothesis through actions that improve physical plausibility while preserving consistency with the input image. We propose Layout-as-Policy (LaP), which casts the planning stage as a policy learning problem: 3D layouts are represented as structured states, and refined via discrete actions such as translation, rotation, and rescaling. Starting from an observation-aligned initialization with the geometry-enhanced Perceiver, the LaP Planner is trained to produce action sequences that progressively resolve geometric inconsistencies and enforce realistic spatial relations. To enable effective learning, we combine supervised trajectory initialization with preference-based optimization, allowing the model to learn corrective behaviors without requiring explicit reward engineering. This formulation transforms layout estimation from a one-shot prediction task into an iterative refinement process, enabling better handling of global constraints and complex object interactions. Experiments demonstrate that our approach produces layouts that are more physically coherent and better aligned with visual observations, while naturally supporting downstream tasks such as scene editing and manipulation.

cs.CV

版本更新 · v2arXiv:2611.04614

Policy Network Diffusion

Jiate Liu, Deheng Ye

原文摘要

Diffusion models have shown remarkable progress in AI-generated content, including images and videos. In this paper, we explore whether diffusion models can generate the parameters of policy networks in reinforcement learning (RL), and whether the generated policies exhibit generalization capabilities. To achieve this, we propose Diffusion-based Conditional Policy Network Parameter Generation (DPPG), which consists of a Transformer-based autoencoder and a task-conditioned diffusion model. The autoencoder achieves a high compression rate by patchifying network parameters, while the task-conditioned diffusion model generates corresponding parameters conditioned on different environments. Our experiments demonstrate that, with a single unified DPPG model, we can synthesize high-quality policies across a diverse set of tasks from different environment domains, including Classic Control, Atari games, and MuJoCo. Additionally, our method can generate networks with a larger number of parameters compared to previous approaches. Furthermore, we find that in previously unseen environments, DPPG can generate parameters that achieve faster convergence and reach competitive performance, showcasing the potential future applications of parameter generation via diffusion.

cs.LG

版本更新 · v2arXiv:2607.07625

Embedded Blockchain Infrastructure Management (eBIM): A RISC-V-Empowered Hardware--Software Co-Design Framework Towards Trustworthy Blockchain

Qinglin Yang, Yuan Liu, Yaoyao Zhang, Boya Wang, Zongjian You, Chunming Rong, Zhihong Tian

原文摘要

Blockchain systems are shifting from decentralized ledgers for digital assets to general-purpose trust infrastructures for verifiable computation, decentralized physical resources, and automated infrastructure management. However, deploying these systems through third-party Blockchain-as-a-Service (BaaS) offerings may introduce dependencies involving operational control, confidentiality, and infrastructure governance. Meanwhile, blockchain execution and verification impose demanding requirements on cryptographic processing, isolation, and reproducibility. RISC-V offers an open, extensible instruction set architecture that enables co-design of software execution environments and domain-specific security hardware. Inspired by the embedded identity and provisioning model of an embedded subscriber identity module (eSIM), this survey proposes embedded Blockchain infrastructure management (eBIM) as a conceptual hardware-software co-design framework that organizes existing RISC-V-enabled technologies into a hardware-anchored blockchain infrastructure stack. We systematically review RISC-V-based smart-contract execution, trusted execution environments, zero-knowledge virtual machines, and cryptographic acceleration, and analyze their relationship to blockchain requirements, including deterministic execution, verifiability, extensibility, and secure key management. Based on this evidence, we distinguish currently demonstrated capabilities from the proposed eBIM integration vision and identify major open challenges, including system-level benchmarking, blockchain-oriented cryptographic extensions, TEE security, post-quantum migration, and deployable hardware-software co-design. The survey provides an architectural reference for researchers and designers investigating open and verifiable blockchain infrastructure.

cs.CR · cs.AR

版本更新 · v3arXiv:2609.18275

Witness Encryption via Prime-Order Generic Groups

Isaac M Hair, Amit Sahai

原文摘要

For every constant $c > 0$, we unconditionally construct witness encryption for NP in the classical generic cyclic group model with the following properties. For SAT instances of size $n$, encryption runs in time poly$(n)$, and any satisfying assignment can be used to decrypt in poly$(n)$ time with correctness error $2^{-n}$. If no satisfying assignment exists, every generic adversary making at most $n^{(\log n)^c}$ group queries has distinguishing advantage at most $n^{-(\log n)^c}$. Along the way, we give the first superconstant-factor NP-hardness of approximation result for homogeneous MinRank under randomized polynomial-time reductions. We obtain a gap of $(\log n)^c$ for any prescribed constant $c>0$, even when YES instances are required to have a rank-one matrix of the form $\mathbf u\mathbf v^T$ where $\mathbf v$ is a 0/1 vector. The main results of this paper were discovered by Codex / ChatGPT 6 Astra Ultra using harness components from the UCLA Moonshot Harness Project, in response to a general strategy for witness encryption suggested by the authors. See the end of the introduction for a discussion.

cs.CR

版本更新 · v2arXiv:2605.23892

Good Token Hunting: A Hitchhiker's Guide to Token Selection for Visual Geometry Transformers

Shuhong Zheng, Michael Oechsle, Erik Sandström, Marie-Julie Rakotosaona, Federico Tombari, Igor Gilitschenski

原文摘要

Visual geometry transformers have become powerful architectures for multi-view 3D reconstruction, enabling joint prediction of multiple 3D attributes in a feed-forward manner. However, their computational cost grows quadratically with the input sequence length due to the global attention layers inside these models. This limits both their scalability and efficiency. In this work, we address this challenge with a simple yet general strategy: restricting the number of key/value tokens that each query interacts with during global attention. To achieve effective token selection, we introduce a two-stage framework. First, an inter-frame selection step operates at the frame level to identify frames that should be preserved. Second, an intra-frame selection step further discards more redundant tokens within the selected frames. Our analysis highlights the advantage of a diversity-based strategy for inter-frame selection, which ensures broad coverage of the scene. For intra-frame selection, we show that layer-aware sparsification is necessary, with the selection process guided by the entropy of the global attention pattern. Our approach offers a superior speed-accuracy trade-off compared to existing solutions. Extensive experiments show that it accelerates visual geometry transformers by over 85% for scenes with 500 images while maintaining, or even improving, baseline performance, which hints that how our token selection strategy can play a crucial role in future applications of visual geometry transformers. Our project website is available at https://zsh2000.github.io/good-token-hunting.github.io.

cs.CV · cs.AI · cs.GR · cs.LG · cs.RO

版本更新 · v5arXiv:2509.03738

Mechanistic Interpretability with Sparse Autoencoder Neural Operators

Bahareh Tolooshams, Ailsa Shen, Anima Anandkumar

原文摘要

We introduce sparse autoencoder neural operators (SAE-NOs), a new class of sparse autoencoders that operate in function spaces rather than fixed-dimensional Euclidean representations. We formalize the functional representation hypothesis, where data are explained through sparse compositions of structured functions. Unlike standard SAEs that represent concepts with scalar activations, SAE-NOs parameterize concepts as functions, enabling representations that capture not only a concept's presence, but also how and where it is expressed across the input domain. We achieve this through joint sparsity: concept sparsity selects active concepts, while domain sparsity governs where they are expressed. We instantiate this framework using Fourier neural operators (SAE-FNOs), parameterizing concepts as integral operators in the Fourier domain. This functional and spectral parameterization is particularly advantageous when data exhibit spatial structure across scales or when concepts are frequency-structured. We characterize SAE-FNO on vision data and demonstrate that it learns localized patterns, uses concepts more efficiently, and exhibits stable concept characteristics across sparsity levels. We further show that SAE-FNO adapts to changes in domain size and generalizes across discretizations, operating at resolutions beyond those seen during training, where standard SAEs fail. We also introduce lifting into SAEs and show theoretically and empirically that it acts as a preconditioner that accelerates optimization. Overall, our results show that moving from vector-valued to functional parameterizations, with concept and domain sparsity, extends SAEs from representing concept presence to modeling structured concept expression, highlighting the importance of parameterization.

cs.LG · cs.AI · eess.SP · stat.ML

版本更新 · v2arXiv:2605.12297

EgoEV-HandPose: Egocentric 3D Hand Pose Estimation and Gesture Recognition with Stereo Event Cameras

Luming Wang, Hao Shi, Jiajun Zhai, Kailun Yang, Kaiwei Wang

原文摘要

Egocentric 3D hand pose estimation and gesture recognition are fundamental to understanding hand interactions from first-person observations. Robust perception remains challenging: frame-based cameras suffer from motion blur and limited dynamic range, while event-based approaches face ego-motion interference, monocular depth ambiguity, and limited real-world datasets. We propose EgoEV-HandPose, an end-to-end framework for joint 3D bimanual hand pose estimation and gesture recognition from stereo event streams. Its core module, KeypointBEV, combines sparse 3D joint hypotheses with geometry-aware stereo fusion and iterative reprojection-guided refinement to progressively resolve depth uncertainty and improve pose accuracy. We also introduce EgoEVHands, the first large-scale real-world stereo event dataset for egocentric 3D bimanual hand pose estimation and gesture recognition. Built upon EgoEvGesture recordings, it adds dense 2D/3D hand annotations and comprises 2,498 annotated stereo sequence pairs across 38 gesture classes. Extensive experiments demonstrate that EgoEV-HandPose achieves state-of-the-art performance on EgoEVHands, obtaining a mean per-joint position error (MPJPE) of 30.54mm and a gesture recognition accuracy of 86.87%, significantly outperforming RGB-based stereo and previous event-based methods. The framework exhibits exceptional robustness under low illumination and severe bimanual occlusion. Experiments on DHP19 further demonstrate the cross-dataset and cross-architecture generalizability of the KeypointBEV refinement design. Dataset and code will be released at https://github.com/ZJUWang01/EgoEV-HandPose.

cs.CV · cs.RO · eess.IV

版本更新 · v2arXiv:2605.26111

Squeezing Capacity from Multimodal Large Language Models for Subject-driven Generation

Shuhong Zheng, Aashish Kumar Misraa, Yu-Teng Li, Yu-Jhe Li, Igor Gilitschenski

原文摘要

Subject-driven image generation aims to synthesize new images that preserve the identity of the given subject while following textual instructions. Existing approaches often encode text and reference images separately. This limits cross-modal reasoning abilities and causes copy-paste artifacts. Recent frameworks that connect multimodal models and diffusion models improve instruction following, but largely overlook identity preservation. To address these limitations, we condition diffusion models on Multimodal Large Language Models (MLLMs) that jointly encode text and reference images, and augment it with VAE-based identity conditioning. A novel Dual Layer Aggregation (DLA) module is designed to aggregate multi-level MLLM features for optimal conditioning, and a multi-stage denoising strategy is applied to progressively balance the semantic information from MLLM and fine-detail identity from VAE during inference. Extensive experiments demonstrate that our approach harmonizes multimodal understanding with identity preservation, mitigates copy-paste issues, and achieves superior performance regarding human preference on subject-driven image generation. Our project website is available at https://zsh2000.github.io/squeeze-mllm-subject-gen/.

cs.CV · cs.AI · cs.GR · cs.LG · cs.MM

版本更新 · v2arXiv:2605.27788

Knowing When to Ask: Segment-Level Credit Assignment for LLM Tool Use

Abhijit Kumar, Zoey Wu, Mohit Suley

原文摘要

Humans know when to reach for help e.g. $347 \times 28$ warrants a calculator while $2+2$ does not. Language models do not. Prompt-based approaches can instruct a model when to invoke tools, but this scaffolding does not teach it to recognize the boundary of its own knowledge. RL approaches that assign a single outcome reward to the whole trajectory fare no better: trajectory-level credit cannot isolate which tool call in a successful episode actually helped, nor penalize unnecessary calls. We propose CARL (Competence-Aware Reinforcement Learning), which trains a critic on the model's own rollouts to learn where parametric knowledge suffices and where it needs external help. By decomposing each rollout at natural tool-use boundaries (e.g., code fence delimiters and context block transitions), CARL assigns independent credit to each segment from a single binary outcome, without external judges or step-level annotations. As a result, erroneous tool calls, incorrect extractions, and unnecessary calls each receive appropriately signed advantages. The trained critic captures the model's domain competence: it separates parametrically solvable from tool-dependent questions with AUC 0.93 at 7B. On five benchmarks spanning arithmetic, multi-hop factual QA, and numerical reasoning over financial tables, CARL improves average exact-match accuracy on the three search benchmarks by 6.7 points at 7B and 9.6 points at 3B over the best RL baseline, with the largest gain (+8.3 EM at 7B, +12.5 EM at 3B) on MuSiQue. At 7B, CARL has a 53% lower tool-use rate than Search-R1 PPO on parametrically answerable questions while remaining 9.8 EM points more accurate on them. Gains are largest at small scale: the 3B improvement is $1.4\times$ the 7B improvement, suggesting that knowing when to ask disproportionately benefits models with smaller parametric memory.

cs.LG · cs.CL

版本更新 · v2arXiv:2605.13716

SkillOps: Managing LLM Agent Skill Libraries as Self-Maintaining Software Ecosystems

Xinyuan Song, Hongji Pu, Liang Zhao

原文摘要

Large language model agents increasingly rely on skill libraries for multi-step tasks, yet these libraries can accumulate persistent defects as skills are added, reused, patched, and linked to changing dependencies. We call this failure mode skill technical debt: library-level defects that may not break a single skill locally but can harm future retrieval, composition, and execution. Existing skill-based agents mainly focus on task-time retrieval, planning, and repair, while library-time maintenance remains underexplored. We propose SkillOps, a method-agnostic plug-in framework for maintaining skill libraries. SkillOps represents each skill as a typed Skill Contract (P, O, A, V, F), organizes skills with a Hierarchical Skill Ecosystem Graph, and diagnoses library health across utility, compatibility, risk, and validation dimensions. Given a raw skill library, SkillOps produces a maintained library that can be used by existing retrieval or planning agents without changing their internal code. On ALFWorld, SkillOps achieves 79.5 percent task success as a standalone agent, outperforming the strongest baseline by 8.8 percentage points with no additional task-time large language model calls. As a plug-in layer, it improves retrieval-heavy baselines by 0.68 to 2.90 percentage points. The current rule-based maintenance implementation uses nearly zero library-time large language model calls or tokens, showing that skill-library maintenance can be added as a low-overhead architectural layer.

cs.SE · cs.MA

版本更新 · v3arXiv:2605.12863

Language-Based Agent Control

Timothy Zhou, Loris D'Antoni, Nadia Polikarpova

原文摘要

This paper introduces language-based agent control (LBAC), a new programming model for agentic applications that brings techniques from programming languages and language-based security to the problem of agent control. In conventional programming, combinations of static typing and runtime enforcement have long been used to guarantee that well-typed programs satisfy user-specified policies, including policies for access control, information flow, data provenance, and more. The key idea behind LBAC is to extend these guarantees to agentic applications by requiring agents to generate programs that are themselves well-typed in the context of the surrounding scaffolding code. Unsafe programs are rejected by the typechecker before execution, allowing policies to apply uniformly across the entire application, including both agent-generated behavior and developer-written scaffolding. At the same time, LBAC preserves substantial expressiveness: agents may perform arbitrary side-effect-free computation and recursively invoke subagents, which retain full tool access subject to the same--or potentially more restrictive--policies. We demonstrate LBAC with three case studies: I/O sandboxing via filesystem capabilities, data provenance, and information-flow control.

cs.PL · cs.AI · cs.CR

版本更新 · v2arXiv:2610.41191

When AI Investigators Cannot Trust Their Tools: Conflict-Aware Evidence Verification for Cyber Threat Investigation

Yuchen Zhang

原文摘要

LLM agents increasingly triage security alerts by combining the outputs of several detection tools, implicitly treating those tools as trustworthy. Unlike prior work on conflicts between a model's knowledge and its context, we study conflicts among the tools themselves: what happens when this machine-generated evidence is conflicting or wrong. On the corrected CIC-IDS2017 dataset, four heterogeneous detectors emit labels and confidences that we corrupt under a threat model varying the number of corrupted tools, the persistence of the corruption, and the confidence attached to wrong outputs. Across open-weight LLMs from 3B to 14B parameters, unverified investigators are fragile: one corrupted detector out of four lowers naive accuracy to .50-.72, three lower every unverified investigator to .13 or less, and honest disagreement alone makes them abstain on up to 63% of flows. We propose Conflict-Aware Evidence Verification (CAV), built from established components: an equal-weight vote that ignores reported confidences, an evidence-conflict gate, and an independent nearest-neighbour trust check that tests the leading candidates. With its prompt frozen before testing, CAV-LLM improves on the naive investigator in every corrupted condition ($p < 0.001$), reaching .84-.88 with three corrupted detectors against at most .08, while calling the LLM on 0.4% of clean traffic. A fixed verification rule is as accurate or better unless most tools are corrupted. When we make the independent channel itself noisy, CAV inherits its errors: it stays ahead when two or more tools are corrupted, but adding the channel as an extra voter is better when at most one is. Verification thus moves trust from the tools to the check, which must be measured and protected in turn.

cs.CR · cs.LG

版本更新 · v11arXiv:2208.00335

Interpretable Machine Learning: Can the EnglishLike Programming Language be the Future of ChatIPC and ChatIPCv2?

Caleb Princewill Nwokocha

原文摘要

The development of interpretable machine learning requires more than the ability to produce predictions accompanied by explanations. It requires computational systems whose internal representations, decision procedures, constraints, and execution paths can be inspected, reproduced, and modified by humans. This paper investigates whether EnglishLike, an English-like, object-oriented programming language implemented in C++17, could provide the symbolic programming and execution foundation for the ChatIPC and its subsequent implementation, ChatIPCv2. The investigation is based on a comparative examination of the publicly available ChatIPC.cpp and ChatIPCv2.cpp implementations in the PCNTechnologyEnterprise Hugging Face repository, together with the EnglishLike 2.2 implementation available in the associated project materials. ChatIPC combines incrementally learned token-transition relationships with dictionary derived semantic information, part-of-speech information, Jaccard similarity, grammatical heuristics, repetition penalties, and deterministic candidate selection. ChatIPCv2 introduces a different generation strategy based on token identifiers, historical-context bitsets, multi-depth graph exploration, n-gram backoff, and parallel candidate evaluation. EnglishLike provides a complementary computational abstraction: a structured language for expressing declarations, functions, classes, interfaces, control flow, and executable rules. Its compiler, bytecode verifier, and virtual machine provide a potentially useful foundation for representing and executing symbolic reasoning procedures.

cs.LG

版本更新 · v2arXiv:2604.03787

Dimension-Free Sinkhorn for Optimal Transport: Bypassing Extremal Costs

Kun He

原文摘要

The Sinkhorn--Knopp (SK) algorithm is a cornerstone method for matrix scaling and entropically regularized optimal transport (EOT). Despite its empirical efficiency, existing bounds for achieving marginal accuracy $\varepsilon$ deteriorate severely in the presence of extreme entries, bottlenecked either by the global maximum regularized cost $η\|C\|_\infty$ (where $η$ is the regularization parameter and $C$ the cost matrix) or the matrix's minimum-to-maximum entry ratio $ν$. These bounds may be overly sensitive to rare extreme entries that do not dominate the overall matrix structure. We identify a broad structural regime in which the dependence on the magnitude of global extreme entries can be circumvented. For EOT, we introduce well-boundedness, a local mass property that captures the row- and column-wise bulk structure of the underlying matrix while maintaining robustness against scattered entrywise outliers. We prove that, governed by this structural condition, SK converges to the target transport plan for a problem of dimension $n$ in $O(\log n + \log(1/\varepsilon))$ iterations. This complexity bound is independent of the maximum regularized cost $η\|C\|_\infty$. A computationally negligible pre-scaling step eliminates this dimensional dependence, reducing the iteration complexity to a strictly dimension-free $O(\log(1/\varepsilon))$. Beyond EOT, we establish a sharp phase transition for general $(\boldsymbol{u},\boldsymbol{v})$-scaling governed by a critical matrix density threshold. We prove that when a matrix's density exceeds this threshold, the iteration complexity is strictly independent of $ν$. Conversely, when the density falls below this threshold, the dependence on $ν$ becomes unavoidable; in this sub-critical regime, we construct instances where SK requires $Ω(n/\varepsilon)$ iterations.

cs.DS · cs.LG

版本更新 · v3arXiv:2602.11674

Benchmark Health Index: A Systematic Framework for Benchmarking the Benchmarks of LLMs

Longyuan Zhu, Hairan Hua, Linlin Miao, Wei Wang, Bing Zhao

原文摘要

Large Language Models (LLMs) are advancing rapidly, yet the benchmarks used to measure this progress are becoming increasingly unreliable. Score inflation and selective reporting have eroded the authority of standard benchmarks, leaving the community uncertain about which evaluation results remain trustworthy. We introduce the Benchmark Health Index (BHI), a pure data-driven framework for auditing evaluation sets along three orthogonal and complementary axes: (1) Capability Discrimination, measuring how sharply a benchmark separates model performance beyond noise; (2) Anti-Saturation, estimating remaining headroom before ceiling effects erode resolution and thus the benchmark's expected longevity; and (3) Impact, quantifying influence across academic and industrial ecosystems via adoption breadth and practice-shaping power. By distilling 106 validated benchmarks from the technical reports of 91 representative models in 2025, we systematically characterize the evaluation landscape. BHI is the first framework to quantify benchmark health at a macro level, providing a principled basis for benchmark selection and enabling dynamic lifecycle management for next-generation evaluation protocols.

cs.AI

版本更新 · v2arXiv:2602.12413

Soft Contamination Means Benchmarks Test Shallow Generalization

Ari Spiesberger, Juan J. Vazquez, Nicky Pochinkov, Tomáš Gavenčiak, Peli Grietzer, Gavin Leech, Nandi Schoots

原文摘要

Training on benchmark test items is a classic way to overestimate generalization to unseen problems. Standard decontamination methods miss semantic duplicates (SemDs): training items equivalent in content to a test item, but distant in string space. We call training on such items soft contamination; when the resulting gains extend to held-out items of the same benchmark (but not to related benchmarks), we call the result shallow generalization. We first embed Olmo 3's entire post-training dataset and search it for SemDs of benchmark items; we then finetune Olmo 3 and Qwen models on natural and synthetic semantic duplicates. We find (1) that soft contamination is widespread: the Olmo corpus contains SemDs of 76% of the CodeForces test set and 100% of MBPP's; (2) that finetuning on SemDs of a benchmark raises accuracy on its held-out items by up to 22pp in controlled experiments and 10-11pp at realistic contamination rates, though the effect varies across benchmarks; (3) that the gains from training on SemDs mostly do not transfer to conceptually similar benchmarks, i.e. we find shallow generalization; (4) that finetuning on items with similar embeddings that are not SemDs produces no such gain, indicating that the mechanism is not mere topical similarity; and (5) that at realistic contamination rates, soft contamination can raise held-out performance about as much as exact duplicates (or more). Benchmark gains here are therefore confounded - in a way that standard decontamination does not address.

cs.LG · cs.AI

版本更新 · v2arXiv:2604.16423

Shifting the Gradient: Understanding How Defensive Training Methods Protect Language Model Integrity

Satchel Grant, Victor Gillioz, Jake Ward, Thomas McGrath

原文摘要

Defensive training methods such as positive preventative steering (PPS) and inoculation prompting (IP) offer surprising results through seemingly similar processes: both add trait-inducing objects to large language models (LLMs) during training, and both defend the LLM against acquiring the trait. The success of these methods raises the questions: how do they work, and are they doing the same thing? We provide behavioral and mechanistic analyses of PPS and IP, using the acquisition of an ``evil'' persona by Qwen2.5-7B-Instruct as an in-depth case study and replicating key measurements across six traits and four models. Behaviorally, neither method operates through a purely associative mechanism, and both methods prevent trait acquisition; but PPS can also substantially reduce pre-existing trait expression, whereas IP does so only modestly. Mechanistically, PPS induces a concentrated change in the activation gradient and shifts the signal along the trait direction from amplifying to attenuating, whereas IP changes the gradient more diffusely and shifts it close to zero along the trait direction. Gradient manipulations show that the direction of this component is causally relevant to trait acquisition, although it is one effect rather than a complete account of either defense. We then show that IP lowers the next-token prediction loss on trait-expressing data, whereas PPS can raise it at the intensities at which it defends; we show how this analysis raises the possibility that the loss changes and the gradient shift are two summaries of the same training signal rather than completely separate mechanisms. Together, our results show that PPS and IP are not interchangeable, and they highlight open questions about a complete mechanistic picture.

cs.LG · cs.AI

版本更新 · v3arXiv:2602.05214

Disentangled Representation Learning via Flow Matching

Jinjin Chi, Taoping Liu, Mengtao Yin, Ximing Li, Yongcheng Jing, Jialie Shen, Leszek Rutkowski, Dacheng Tao

原文摘要

Disentangled representation learning aims to capture the underlying explanatory factors of observed data, enabling a principled understanding of the data-generating process. Recent advances in generative modeling have introduced new paradigms for learning such representations. However, existing diffusion-based methods encourage factor independence via inductive biases, yet frequently lack strong semantic alignment. In this work, we propose a flow matching-based framework for disentangled representation learning, which casts disentanglement as learning factor-conditioned flows in a compact latent space. To enforce explicit semantic alignment, we introduce a non-overlap (orthogonality) regularizer that suppresses cross-factor interference and reduces information leakage between factors. Extensive experiments across multiple datasets demonstrate consistent improvements over representative baselines, yielding higher disentanglement scores as well as improved controllability and sample fidelity.

cs.LG

版本更新 · v2arXiv:2610.34045

Minimax Regret for Sobolev Kernel-Based Reinforcement Learning

Haichen Hu, David Simchi-Levi

原文摘要

We study the minimax regret rate for episodic kernel-based reinforcement learning, where the expected reward and transition density belong to a Sobolev reproducing kernel Hilbert space (RKHS), with continuous state and action spaces, and adversarial initial states. For Sobolev smoothness parameter $ν>0$, state dimension $d_S$, and action dimension $d_A$, we prove that the minimax expected regret over $T$ episodes is $\widetildeΘ(T^{\max\{e_A,e_B\}})$, where $e_A=\frac{ν+d_A}{2ν+d_A}$, $e_B=\frac{ν+d_A+3d_S/2}{2ν+d_A+2d_S}$ with the other model parameters fixed. The two exponents reflect the distinct difficulties of action selection and learning across states. We introduce Sobolev Optimal Value Iteration (\texttt{SOVI}), which attains this rate from observed rewards and transitions. For fixed smoothness and reference-kernel lengthscale, its regret bound has a prefactor polynomial in the state-action dimension $d=d_S+d_A$, horizon $H$, reward and transition RKHS norm bounds $B_r,B_p$, and the norm-comparison factor $Λ$, up to logarithmic factors; $Λ=1$ for normalized Matérn kernels. The algorithm separates initial action selection from continuation-value estimation and combines local polynomial approximation with the shared RKHS structure of the approximation errors. Our matching upper and lower bounds determine the optimal dependence on the number of episodes for Sobolev kernel-based reinforcement learning regret minimization. Thus, we partially address the open problem in Vakili(2024) under Sobolev kernel RL.

cs.LG · math.ST · stat.ML

版本更新 · v2arXiv:2610.22100

When the next byte's type is fixed: why entropy patching skips computed values under tight budgets

Nicolás Vera Zúñiga

原文摘要

The Byte Latent Transformer (BLT) runs a large model once per patch and starts patches where a small model's next-byte entropy is high. Under tight budgets this rule skips computed values, such as the number after "= " in math. On BLT-1B at inference we trace the miss to the cue before a value: when the preceding bytes fix the next byte's type, the patcher's entropy is capped near log2 10 bits, close to a 10% budget's threshold. Entropy then starts a patch at 0% of values after a dollar sign and 19% after "= "; writing "is " instead of "= " raises the 19% to 66%. Version 1's two-byte lookup table, motivated by LZ novelty, acts as a learned detector of cues that tend to precede new values in its fitting text: on the solutions rewritten as prose it covers every value after a dollar sign and none after a plain space, and its margin over entropy falls from +42.1 to -8.9 points, partly because prose gives entropy more starts per value. In BLT-style models trained from scratch (1M-50M parameters, 128-byte context, 3 seeds per rule) and scored by teacher-forced exact match on answer spans, the table beats entropy at 50M by 36.8 points on computed results and 29.6 on final answers, which mostly copy the last computed result. A hand-written marker rule is not distinguishable from the table at 1M and 12M; its 50M control was not run. At 1M and 12M the table ran on a T4 GPU in fp16 and the baselines on an A40 in bf16; at 50M all ran on the A40. End to end, no 1M-50M model solves more than 2 of 100 GSM8K problems. A label-free probe of BLT-1B's patcher finds prose values, mostly after a dollar sign, but costs final answers. In six domains, no rule we tested beat entropy on exact match of whole words and numbers in more than one domain. The positive findings concern tight budgets on cue-formatted text. This version corrects version 1; the work is closed, with no venue intended.

cs.CL · cs.LG

版本更新 · v2arXiv:2606.08914

Vibe Visualizing: How Visualization Novices Try (and Fail) to Generate and Interpret Visualizations with Conversational AI

Sam Yu-Te Lee, Yun-Hsin Kuo, Chifang Chou, Matthew Ward, Xiwei Xuan, Kwan-Liu Ma

原文摘要

Conversational AI lowers technical barriers to generating and interpreting visualizations. People without visualization training or practical experience can therefore perform these tasks, but may lack the expertise needed to evaluate the resulting charts and interpretations. Through a study with 20 visualization novices, we examine conversation logs from 60 sessions with ChatGPT and develop a codebook that characterizes participant and AI behaviors in AI-assisted visualization. Paired with interview transcripts and survey responses, we derive three themes under outcome quality, AI non-compliance, and trust, verification, and repair. An exploratory role analysis identifies two session-level roles distinguished by user initiative and associated with different failure patterns. A comparative analysis with Gemini and Claude further reveals distinct system-specific behaviors. Based on these findings, we derive five design recommendations for AI-assisted visualization design and discuss implications for visualization literacy, human-AI roles, accountability, and agentic visualization.

cs.HC

版本更新 · v4arXiv:2208.03784

CoVault: Secure, Scalable Analytics of Personal Data

Roberta De Viti, Isaac Sheff, Noemi Glaeser, Baltasar Dinis, Rodrigo Rodrigues, Bobby Bhattacharjee, Anwar Hithnawi, Deepak Garg 等 9 位作者

原文摘要

There is growing awareness that the analysis of personal data, such as individuals' mobility, financial, and health data, can provide significant benefits to society. However, liberal societies have so far refrained from such analytics, arguably due to the lack of secure analytics platforms that scale to billions of records while operating in a very strong threat model. We contend that one fundamental gap here is the lack of an architecture that can scale (actively-)secure multi-party computation (MPC) horizontally without weakening security. To bridge this gap, we present CoVault, an analytics platform that leverages server-aided MPC and trusted execution environments (TEEs) to colocate the MPC parties in a single datacenter without reducing security, and scales MPC horizontally to the datacenter's available resources. CoVault scales well empirically. For example, CoVault can scale the DualEx 2PC protocol to perform epidemic analytics for a country of 80M people (about 11.85B data records/day) on a continuous basis using one core pair for every 30,000 people.

cs.CR · cs.DC

版本更新 · v2arXiv:2601.16906

The Trajectory Alignment Coefficient in Two Acts: From Reward Tuning to Reward Learning

Calarina Muslimani, Yunshu Du, Kenta Kawamoto, Kaushik Subramanian, Peter Stone, Peter Wurman

原文摘要

The success of RL is fundamentally tied to having a reward function that accurately reflects the task objective. Yet, designing reward functions is time-consuming and prone to misspecification. To address this, our first goal is to understand how to support RL practitioners in specifying reward functions. We leverage the Trajectory Alignment Coefficient (TAC), a metric that evaluates how closely a reward function's induced preferences match those of a domain expert. To test whether TAC provides meaningful support, we evaluated its impact in a user study where practitioners designed reward functions for Lunar Lander. We found that iterative TAC feedback allowed participants to design more performant reward functions while reporting lower cognitive workload than unguided reward design. However, the study also underscored that manual reward design, even with TAC, remains labor-intensive. This motivated our second goal: to learn a reward model that maximizes TAC directly. Specifically, we propose Soft-TAC, a differentiable approximation of TAC that can be used as a loss function to train reward models from human preferences. Our theoretical analysis guarantees that under Soft-TAC optimization: (1) the optimal reward function belongs exclusively to the set of human-aligned reward functions, and (2) this optimal reward remains invariant whether trained on clean or noisy preference data. Empirically, we first evaluate reward models trained with Soft-TAC across three robotic tasks, demonstrating that they consistently match or outperform those trained with the Cross-Entropy loss. Next, we evaluate Soft-TAC in the GT7 driving simulator, and find that Soft-TAC-trained reward models more successfully capture preference-specific driving styles. Ultimately, this work demonstrates that TAC can serve as both a practical tool for guiding reward design and a reward learning objective in complex domains.

cs.LG · cs.HC

版本更新 · v2arXiv:2610.24184

Multi-author style detection with stylistic embeddings

Man-Ling Sung, Chak Fai Li, Damianos Karakos, Fred Bernardin, Brian Ulicny

原文摘要

We investigate the use of Large Language Models (LLMs) in multi-author style change detection. Using off-the-shelf LLMs or supervised fine-tuning solely within the target domain fails to yield effective features; for this reason, we propose cross-domain transfer learning with LLM-based embeddings fine-tuned for authorship verification. We fine-tune Mistral-7B embedding model and compare it with DeBERTa, used in the state-of-the-art (SOTA) systems in PAN-25 multi-author writing style analysis challenge. Results show that DeBERTa and Mistral excel in different user-generated text scenarios. We exploit this diversity by combining both embeddings, leading to more effective style change detection.

cs.CL