跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

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

Token Inflation: How Dishonest Providers Can Overcharge for Large Language Model Usage

Shahinul Hoque, Jinghuai Zhang, Jinyuan Sun, Fnu Suya

原文摘要

Per-token billing is now the standard pricing model for commercial large language models (LLMs), so the honesty of reported token counts directly affects what users pay. We show that this kind of billing is hard to audit by design: providers hide the model, the tokenizer, and the execution to protect their IP, mitigate jailbreaks, and preserve user privacy, which means an auditor can only inspect proofs the provider supplies. The audit therefore reduces to a consistency check on the provider's own reports. We call this a trust paradox: every audit must trust some artifact, but current frameworks trust exactly the ones a provider has the strongest reason to manipulate. We study three recent token auditing frameworks and show that a provider with ordinary commercial capabilities can systematically inflate billed token counts. In the most permissive setting, hidden reasoning usage can be inflated by 1,469% on average without detection. At current frontier reasoning prices, that turns a \$100 honest bill into roughly a \$1,569 bill on the same query. Even when the user can see the full reasoning string, tokenization ambiguity alone still allows 50.85% over-reporting below the detection threshold. These results suggest the problem is not in any specific auditor but in any audit whose evidence comes from the audited party. Restoring honest billing will require verification that ties reported token counts to evidence the provider does not control, such as trusted execution attestation, cryptographic proofs of inference, or third-party re-execution.

cs.CR · cs.AI · cs.CL

新论文 · v1arXiv:2611.10793

Trainability-Simulability Tradeoff in Parameterized IQP-based Reinforcement Learning Policies

André Sequeira

原文摘要

Parameterized instantaneous quantum polynomial-time (IQP) circuits generate distributions conjectured to be hard to sample classically. As reinforcement learning (RL) policies, their $2^n$ measurement outcomes are typically mapped to a smaller action space by a classical decoder. This aggregation can mitigate initialization concentration while making the policy classically simulable. We characterize this tradeoff through the decoder's Fourier--Pauli expansion. Under independent uniform initialization, we express policy variance as an exact sum over groups of nonconstant Pauli components with identical active-generator signatures. Each group contributes its squared aggregate coefficient times $2^{-r}$, where $r$ is the binary rank of its active generators. An inverse-polynomial aggregate coefficient with logarithmic rank prevents exponential policy concentration. Sparse Pauli expansions and contiguous action bins permit efficient classical additive estimation of action probabilities. We introduce a majority decoder combining protected low-weight components with exponentially large exact Fourier support, preserving initialization nonconcentration while excluding polynomial-size enumeration of the exact expansion. Numerical experiments corroborate the variance laws. In ten-qubit CartPole experiments, majority achieves higher returns than recursive parity and the tested local readouts, while higher-weight Pauli sectors contribute an increasing relative share of gradient magnitude during training. A complementary 21-qubit block-chain policy outperforms an extensive pool of fully connected classical neural networks in episode efficiency, even though its bounded-width structure permits efficient classical simulation. These results guide decoder design for quantum and quantum-inspired RL, distinguishing policy nonconcentration, learning performance, and classical simulability.

quant-ph · cs.LG

新论文 · v1arXiv:2611.10792

Zeroth-Order Riemannian Optimization on Fixed-Rank Manifolds for LLM Fine-Tuning

Xinjue Wang, Xiuheng Wang, Yejun Zhang, Sergiy A. Vorobyov, Esa Ollila

原文摘要

Zeroth-order (ZO) optimization estimates descent directions from function values alone, which removes the activation storage required by backpropagation and makes it attractive for memory-efficient fine-tuning of large language models (LLMs). Existing low-rank ZO methods either parameterize the additive update through Euclidean factors with a non-unique representation, or restrict each finite-difference direction to be low-rank. In this work, we propose to constrain each additive update block to a fixed-rank matrix manifold while keeping the pretrained weights frozen, so the learned update remains rank-constrained throughout fine-tuning. On this geometry, we build a Riemannian ZO gradient estimator that projects a random matrix onto the tangent space, normalizes it to correct the scale mismatch induced by projection, and further propose Zeroth-order Riemannian Gradient Descent (ZO-RGD) and its smoothed variant, ZO-RGD-S. We show that the ambient finite difference matches its retracted counterpart, the normalized estimator recovers the Riemannian gradient in expectation, and ZO-RGD converges under trajectory-regularity conditions. Experiments on LLM fine-tuning tasks show that the proposed algorithms are competitive with strong forward-only baselines across model families and tasks, with gains in several settings.

cs.LG · math.OC

新论文 · v1arXiv:2611.10791

Winning Reviews, Losing Discovery? The Co-Evolutionary Game of AI Research and Peer Review

Hongze Liu, Mengru Wang, Zhiyuan Zhang, Yao Liu

原文摘要

Autonomous research systems can produce convincing manuscripts whose scientific value is difficult to verify, while automated reviewers can reward the appearance of completeness. We examine how this gap can become a self-reinforcing threat to the research community. In a two-population evolutionary game, authors choose between acceptance-oriented and exploratory research, and reviewers choose between proxy evaluation and careful assessment. Cheaper acceptance-oriented production can increase review pressure, making proxy assessment more attractive; proxy assessment can in turn strengthen the incentive to produce reviewer-compatible work. We derive conditions under which this feedback sustains a stable regime that rewards publication success while reducing the scientific value of accepted work. An analytical basin boundary explains why the same institutional rules can support either this regime or exploratory research with careful review. Numerical illustrations show how publication counts can conceal scientific loss, how faster adjustment can reinforce existing practices, and why partial reform may fail once the cycle is established. Careful audits and reviewer rewards can reverse the feedback, while temporary support can produce lasting recovery if it moves the community across the basin boundary. The model identifies a warning mechanism rather than forecasting a particular conference: a review system can remain operational and privately rewarding while becoming less effective at supporting discovery. Its institutional implication is to reward independently validated contributions and consequential checking, rather than accelerate paper production and scoring alone.

cs.GT · econ.GN

新论文 · v1arXiv:2611.10789

Generating Diverse and Verified Synthetic Clinical Notes with Labels by Construction

Matthias Lehmann, Madeleine Werthebach

原文摘要

Under strict privacy regulations in the clinical domain, de-identification is necessary to enable the use of clinical data such as for natural language processing. However, we currently lack sophisticated ways to tell which de-identification models actually are suitable. Specifically, we need benchmarks that are challenging, diverse, and clinically plausible, all while ensuring label correctness. To this end, we present SPARCLING, an LLM-based pipeline to generate synthetic discharge letters with character-exact PHI span annotations. Our pipeline combines structured attribute sampling, template generation, and red teaming to obtain diverse PHI-labeled discharge letters. In our experiments, we demonstrate this superior content diversity over existing public datasets. Further, we show SPARCLING's downstream utility as a benchmark to uncover failure modes of de-identifiers in the German clinical domain. Finally, our experiments show that training on our synthetic data can yield more capable de-identifiers than training on the scarce public data alone. Our code is available at https://github.com/Matt00n/phi_discharge_letter_generator.

cs.LG · cs.AI · cs.CL

新论文 · v1arXiv:2611.10787

Trustworthy Recursive Self-Improvement with Statistical Guarantees

Zihe Gao, Zhengling Qi, Yifan Cui

原文摘要

Recursive self-improvement offers a promising path toward AI agents that improve through experience by refining their own harnesses without retraining their underlying large language models (LLMs). Making this self-improvement process reliable, however, requires more than generating new updates: agents must decide which changes are worth keeping. A greedy gate that accepts updates based solely on higher validation scores can mistake an observed gain for genuine progress and lead to performance degeneration, whereas overly conservative statistical gates may reject beneficial updates and hinder performance improvement. We introduce Trustworthy Recursive Updates with Statistical Testing (TRUST), a framework that adapts an online multiple hypothesis testing procedure to control the rate of false evolution across rounds, with an LLM analyzing historical context to help determine how much evidence is required to update the incumbent. Under interpretable assumptions, we prove that TRUST limits the proportion of accepted updates that result in unacceptable performance loss. We further derive a lower bound on the final performance gain. Across the benchmarks HotpotQA, DROP, and APPS with the models DeepSeek-V4-Flash and Qwen-3.8-Flash, TRUST reduces the average ratio of accepted inferior updates from the greedy gate's 45.59% to 2.78%, while achieving higher final scores than the state-of-the-art statistical gate baselines for recursive self-improvement. These findings demonstrate that TRUST strikes a balance between statistical reliability and performance gain in recursive self-improvement.

stat.ML · cs.AI · cs.LG · stat.ME

新论文 · v1arXiv:2611.10785

Proximal Preference Optimization: A Unified Framework for Stable and Reward-Free Alignment

Qisai Liu, Zhanhong Jiang, Zahid Hasan, Soumik Sarkar

原文摘要

We introduce a proximal preference optimization framework that unifies the implicit reward formulation of Direct Preference Optimization (DPO) with the trust-region stability of Proximal Policy Optimization (PPO). Our framework yields two complementary algorithms. P$^2$O (Proximal Preference Optimization) introduces a clipped importance ratio directly into the DPO preference margin, producing a reward-model-free algorithm that supports safe dataset reuse, bounded policy divergence, and monotonic preference improvement guarantees. PKTO (Proximal Kahneman-Tversky Optimization) extends P$^2$O by replacing the DPO margin with KTO's prospect-theoretic utility margins, adding a self-regulating adaptive baseline that tightens the effective trust region as the policy drifts, and an asymmetric weighting that handles imbalanced or asymmetric preference datasets. We provide a unified theoretical analysis, including Kullback Leibler (KL) trust-region bounds, a policy-improvement lower bound, and convergence guarantees under multi-epoch proximal updates. Empirically, P$^2$O and PKTO match or exceed DPO and KTO in alignment quality while maintaining better stability under repeated dataset reuse across multiple LLMs on three preference benchmarks. The code base is available here.

cs.LG · cs.AI

版本更新 · v3arXiv:2609.36882

Less Supervision, Better Generalization: Weakly Supervised Fake Region Localization in Diffusion-Edited Images

Junhee Lee, Donghyeon Jeon, Taeoh Kim, Beomyoung Kim, MyeongAh Cho

原文摘要

Localizing AI-edited regions is essential for interpretable forensic analysis, but remains challenging due to subtle and spatially distributed artifacts that are misaligned with semantic or object boundaries. Existing approaches rely on pixel-level supervision from controlled editing pipelines, which is difficult to scale and can introduce misleading signals: artifacts frequently extend beyond annotated regions, while out-of-mask pixels are treated as authentic. This limits models' ability to capture transferable evidence and generalize across generators and datasets. To address these issues, we propose ReGFLoW, a Reconstruction-Guided Fake Localization framework under Weak supervision, which is the first weakly supervised approach for diffusion-edited fake region localization. ReGFLoW requires only real/fake labels at the image-level and uses diffusion reconstruction errors as dense spatial guidance to inject them into both feature and score spaces. Furthermore, by artifact-centric multiple instance learning, ReGFLoW utilizes localized diffusion evidence without relying on semantic-affinity or boundary-based pseudo-mask priors. Extensive experiments show competitive cross-generator localization, while ReGFLoW outperforms all evaluated fully supervised baselines when evaluation includes both partially edited and fully synthetic images and in cross-dataset tests, without target-domain adaptation.

cs.CV

新论文 · v1arXiv:2611.10781

EEGFaceSem: An EEG Benchmark with Paired Generative Latents for Semantic Visual Modeling

Jun Ma, Michiel M. Spapé, Keith M. Davis, Tuukka Ruotsalo

原文摘要

Electroencephalography (EEG) is widely used to measure brain activity for brain-computer interface applications for its non-invasive nature and high temporal resolution. However, progress in modeling the neural responses to visual semantics has been limited by a reliance on fixed image collections that lack the fine-grained control needed to isolate fine-grained changes in visual features and their relation to perception. In this work, we present EEGFaceSem, a large-scale dataset pairing high-quality EEG with photorealistic face images synthesized from a generative model. We provide the generative latent vector for each stimulus, enabling research into the continuous mapping between a visual latent space and neural representations. Each participant's brain responses were recorded while they attended to specific semantic features (e.g., smiling, hair color) in a rapid serial visual presentation paradigm. The dataset contains EEG signals from 30 participants, totaling 67,200 time-locked EEG recordings. We present benchmarks for single-trial semantic classification under single-subject, cross-subject, and subject-adapted settings, as well as for cross-subject voting that aggregates per-stimulus predictions across participants. We further demonstrate the dataset's unique utility with two complementary applications: deriving semantic directions in the latent space for brain-supervised image editing, and conditioning a generative model on brain-decoded labels for brain-supervised image generation. Our dataset paves the way for advancing brain-computer interfaces (BCI) for semantic-level visual saliency detection and brain-supervised generative modeling. Our dataset and code are openly released at OSF (https://osf.io/2guk3/) and at HuggingFace https://huggingface.co/datasets/yefllower/EEGFaceSem.

cs.LG

版本更新 · v2arXiv:2610.41536

DAPS: Dependency-Aware Premise Selection for LLM Theorem Proving

Zixuan Chen, Wenyuan Jiang, Junling Wang, Mrinmaya Sachan, Yinya Huang

原文摘要

LLM-based theorem proving in Lean 4 has advanced rapidly, but provers are difficult to leverage newly contributed lemmas, because retrieval skews toward popular foundational lemmas, leaving the right premises buried among hundreds of thousands of candidates. Existing neural selectors rank candidates by semantic similarity, with three intrinsic limitations: frequency-skewed retrieval, isolated pairwise ranking, and degradation on out-of-distribution queries such as competition problems and informal language. Given that mathematics is structured by dependencies rather than similarities, we restore this signal to both the training data and the model. We curate two underused dependency resources. We conduct the first systematic mining of 53 Lean Blueprint projects, a previously untapped corpus of 3,805 manually curated informal+formal nodes that capture rare, research-level premises absent from Mathlib4. We further pair it with the extraction of comprehensive, typed, multi-level Mathlib4 dependencies. We then introduce DAPS, a dependency-aware premise selector with a structural neighborhood encoder, a group-level contrastive objective, and a Mathlib-then-Blueprint adaptation procedure. DAPS reaches 78.74 Recall@16 on Mathlib4-Heldout (+11.41 over the strong selector LeanHammer) and widens the margin to 7xrecall on competition-style queries. Downstream, its selected premises raise Goedel-Prover-V2-8B Pass@4 on miniF2F-test from 49.90 to 54.03 and improve all four general-purpose LLMs on the informal IMO-ProofBench (up to +11.4% relative). Project page: https://daps-eth.github.io/.

cs.LO · cs.CL · cs.LG

新论文 · v1arXiv:2611.10778

Passivity-Guaranteed Variable Impedance and Compliance Control via Online Parameter Optimization

Huseyin Tugcan Dinc, Ersin Daş, Nikolas Thelenberg, Christian Ott

原文摘要

Variable impedance control enhances the interaction capability of robot manipulators by adapting impedance parameters online. However, time-varying impedance parameters may inject energy into the system and violate passivity, particularly when tasks demand rapid stiffness changes. Existing methods address this by increasing damping or limiting the stiffness profile, which often degrades the dynamic response. In this work, we propose a quadratic programming-based parameter optimization framework that guarantees passivity by modulating the desired inertia to compensate for energy injected by stiffness variations, while preserving a critically damped system. For the case of diagonal impedance matrices, we optimize the rates of change of inertia and stiffness subject to a passivity constraint formulated as a convex quadratic program. We extend the framework to compliance control, where the desired inertia is coupled to the robot's configuration-dependent inertia matrix. We use an eigendecomposition based on Cholesky factorization to optimize the spectral weights while maintaining passivity. Experiments on the Kinova Gen3 7-degree-of-freedom manipulator validate both methods with human interaction perturbations. Comparisons with an energy tank approach and a nonpassivity-based method demonstrate that the proposed framework achieves less conservative stiffness tracking without requiring an energy reservoir or damping overhead.

cs.RO · eess.SY

版本更新 · v2arXiv:2602.18851

Rank-Aware Spectral Bounds on Attention Logits for Stable Low-Precision Training

Seyed Morteza Emadi

原文摘要

Attention scores in transformers are bilinear forms $S_{ij} = x_i^\top M x_j / \sqrt{d_h}$ whose maximum magnitude governs overflow risk in low-precision training. We derive a rank-aware concentration inequality: when the interaction matrix $M = W^Q W^{K\top}$ has rank $r \ll d$, tail probabilities for $\max_{i,j}|S_{ij}|$ decay as $\exp(-d^{2}α^{2}/(γr))$ rather than $\exp(-dα^{2})$, where $γ> 1$. For transformer attention where $r = d_h$, this yields $8$ to $28\times$ tighter concentration than rank-agnostic bounds in modern architectures. We apply this result to FP8 training, deriving geometry-aware scale factors that provide principled overflow guarantees without observing activations. The method computes per-layer scales from the spectral norm $\|W^Q W^{K\top}\|_2$ via implicit power iteration, includes a grouped query attention formulation that avoids key expansion, and remains compatible with fused attention kernels. Across GPT-2 XL to Llama-2-70B, geometry-aware scaling eliminates overflows in transient scenarios where delayed scaling fails, while achieving comparable downstream MMLU accuracy.

cs.LG · cs.AI

新论文 · v1arXiv:2611.10776

SIExBench: A Benchmark for Automated Repair of Sensitive Information Exposure

Mingming Zhang, Xu Wang, Jian Zhang, Dihao Fan, Xiangxin Meng, Chunming Hu

原文摘要

Modern software systems routinely process credentials, personal records, and other sensitive information. A sensitive information exposure (SIEx) defect makes such information accessible to an unauthorized actor and can cause serious and often irreversible disclosure. However, prior research has focused largely on detecting such exposures rather than repairing the underlying defects, and existing repository-level issue-resolution benchmarks do not specifically target this defect class. We present SIExBench, to our knowledge the first benchmark dedicated to automated repair of SIEx defects. SIExBench contains 161 execution-verified instances from 64 widely used Python and Java repositories, each with an issue report, buggy repository snapshot, developer patch, executable exposure and regression tests, and defect characterization. We evaluate six repair systems with three LLMs, yielding 18 configurations, and systematically analyze their overall effectiveness, performance across defect characteristics, and failure mechanisms. The strongest configuration resolves only 39.1% of the instances, while 40.4% remain unresolved by all 18 configurations. More importantly, 62.1% of unsuccessful attempts produce a valid patch that still leaves sensitive information exposed, making incomplete exposure removal a central challenge. Systems often generate plausible patches and modify relevant code without fully eliminating the exposure, indicating that effective repair must ensure that all relevant paths to sensitive-information exposure are closed. Overall, SIExBench provides a foundation for systematically evaluating and advancing automated repair of sensitive information exposure defects.

cs.SE · cs.CR

版本更新 · v2arXiv:2606.19741

Interpreting Neural Combinatorial Optimization via Evolving Programmatic Bottlenecks

Haocheng Duan, Yuxin Guo, Jieyi Bi, Anqi Xie, Sirui Li, Yining Ma, Cathy Wu

原文摘要

While Neural Combinatorial Optimization (NCO) achieves strong performance, its interpretability remains an open question. In this paper, we introduce Evolving Programmatic Bottlenecks (EPB), the first post-hoc, surrogate-based interpretability method for NCO, which explains a black-box policy by distilling it into an interpretable behavior surrogate. A natural surrogate is a Concept Bottleneck Model (CBM), yet standard concepts are input attributes, whereas NCO is better explained by decision rules that are hard to predefine. EPB thus uses LLMs to evolve a bank of programmatic decision rules as concepts, each producing an action distribution, where a learned state-dependent router then mixes them to form the surrogate action. We optimize EPB through an iterative framework: Block I fixes the bank size and introduces the hybrid textual-numerical gradient descent to jointly optimize the textual programs and the numerical router; Block II adapts the bank size via failure-targeted expansion and redundancy pruning. Extensive experiments demonstrate that the EPB surrogate closely matches the teacher's behavior and solution quality. We then analyze the distilled rules, reveal several NCO decision patterns, and verify the rules' faithfulness to the surrogate's decisions. Moreover, the surrogate allows targeted program edits that improve its generalization beyond the teacher. Our work advances interpretable NCO and establishes EPB as a promising direction for interpreting complex learned decision-making policies.

cs.AI · cs.LG

新论文 · v1arXiv:2611.10774

Same Measurements, Different Velocity Risk: Complementary Rolling-Shutter Readouts under Clock Uncertainty

Lunshuo Tian, Dongheng Liu, Mingwei Ma

原文摘要

Camera rigs with identical measurement budgets can have different velocity estimation rates when exposure timing is uncertain. We establish this distinction for rolling-shutter reconstruction with two calibrated moving anchors, unknown scene points, and independently unknown auxiliary poses and clocks. On the same fixed local physical class near a separated lateral rig, repeated readouts have worst-case squared velocity risk at least of order $σρ_{\mathrm{eff}}$, whereas complementary readouts have minimax risk of order $σ^2$, for a fixed admissible clock displacement $ρ_{\mathrm{eff}}>0$ as the noise standard deviation $σ$ tends to zero. A finite physical compensation path gives the lower bound; a nonlinear velocity inverse proves complementary stability. All motion, structure, pose, and clock nuisances remain unknown. We identify mounting configurations in which both designs become regular and quantify the risk floor induced by metric uncertainty. We quantify full-parameter domains with independent 6-ms clocks and test in-domain reconstruction under paired noise and a depth-offset intervention. Raster studies examine image formation and calibration sensitivity.

cs.CV

版本更新 · v2arXiv:2611.03523

DistDebug-Bench: Can LLM Agents Diagnose Bugs in Distributed Systems?

Yuxuan Jiang, Chenglin Liu, John Rose, Mason Miller, Ruthesh Thavamani, Juntao Wu, Yinwei Huang, Jiahao Xu 等 9 位作者

原文摘要

LLM agents show strong potential in software engineering tasks such as competitive programming and code synthesis. Existing benchmarks, however, largely focus on small-scale settings such as self-contained Python modules, leaving distributed systems, an essential class of production software, under-examined. We introduce DistDebug-Bench, a benchmark for evaluating agents' ability to diagnose complex-system failures at the code level. It curates 120 high-quality real-world bugs from 11 widely used distributed systems, spanning 5 programming languages and 10 failure patterns. Through an extensive evaluation of state-of-the-art LLMs and agents, we identify substantial gaps between current agents and real-world debugging tasks. A recurring gap is tunnel vision due to a lack of explicit reasoning structure and nondeterminism from inconsistent tool-use scope. The benchmark and evaluator are available at https://github.com/OrderLab/distdebug-bench, with agent traces and a leaderboard at https://distdebug.com.

cs.SE · cs.DC · cs.LG

新论文 · v1arXiv:2611.10772

Universal Approximation by Equivariant Message-Passing Graph Neural Networks with a Bilinear Readout

Pingbing Ming, Han Wang

原文摘要

We prove universal approximation for the bilinear-readout equivariant message-passing network (BREMP), a reference architecture for equivariant graph neural network interatomic potentials. Its layers combine equivariant convolutions with affine maps, and its readout forms invariants from products of the equivariant features. We construct a one-layer feature that determines the local environment up to permutations of atoms of the same type. The construction uses spherical harmonic filters of degree no larger than the largest number of neighbors at a common distance from the center. Iterating the construction recovers the environment reachable in as many hops as there are layers, using the same bound on filter degrees at the layer cutoff. The readout approximates every continuous invariant function of the features uniformly on compact sets. Together these give universal approximation of atomic energies at a prescribed physical range using a shorter layer cutoff. We assume that, throughout the admissible class, message passing reaches all neighbors in each physical environment within a common number of layers. Finally, DPA4, an interatomic potential architecture in production use, inherits this result by approximating the BREMP layers constructed in the proof and realizing the bilinear readout.

cs.LG · physics.chem-ph · physics.comp-ph

新论文 · v1arXiv:2611.10771

WorldFoundry: Towards Unified Infrastructure for World Intelligence

Juanxi Tian, Jiadong Hou, Baiang Li, Xin Lin, Zhengbo Jiao, Weijia Zhang, Yeying Jin, Truong Nguyen 等 16 位作者

原文摘要

Visual generative models increasingly blur the line between synthesizing observations and simulating environments. Yet visual plausibility alone does not constitute successful world modeling: compelling outputs may lack persistent state, physical dynamics, or causally consistent responses to interactions. We define a generative world model as a predictive dynamical system that maintains a persistent, history-conditioned representation of an environment, updates that representation in response to actions or interventions, and generates temporally coherent trajectories that reflect outcomes under observed and counterfactual interventions. From this definition, we derive an intelligence-oriented framework spanning perceptual grounding, persistent state modeling, controllable transformation, dynamics-aware prediction, and closed-loop interaction. We present WorldFoundry, open-source infrastructure for reproducible inference and evaluation across video, 3D and 4D, embodied action, and interactive world systems. WorldFoundry unifies model and benchmark discovery, runtime and asset preparation, execution orchestration, artifact management, and interactive visualization, while modality-specific adapters preserve native inputs, execution semantics, output representations, and evaluation protocols. Explicit manifests, durable artifact contracts, and evidence-aware scorecards separate execution readiness from evaluative claims, making each claim traceable to its supporting artifacts. The catalog contains 270 model entries, 74 benchmarks, and 62 registered metric entries, with readiness and execution evidence recorded separately. WorldFoundry enables reproducible comparison of persistent, controllable dynamics across heterogeneous systems, advancing the field from perceptual synthesis toward measurable world intelligence.

cs.CV · cs.AI

新论文 · v1arXiv:2611.10770

How reliable is an embedding of the seabed? Repeat-look measurement of frozen encoders on synthetic aperture sonar

Harold Horsley, Oscar Pizarro, Hayat Rajani, Morten Omholt Alver

原文摘要

Pretrained encoders from self-supervised representation learning are increasingly applied to sonar imagery of the seafloor, where they are evaluated with protocols that take one embedding per target. A target patch of seabed, by contrast, is re-imaged from an alternate look on overlapping survey passes, so each embedding is one measurement of that target. Standard protocols cannot say how consistent those measurements are, or how much of their spread belongs to the patch and how much to the acquisition geometry. We treat this as a measurement-reliability problem. Using a synthetic-aperture sonar (SAS) survey, we measure the repeat-look reliability of embeddings from a frozen natural-image encoder (DINOv3 ViT-S/16). Standard single-look metrics, effective rank, clustering and a linear probe for coral, are all stable to the look, and the probe performs well (AUC 0.93). Yet the repeat-look reliability of the same embeddings is poor, with a distance-based intraclass correlation (dbICC) of 0.20 and nearest neighbours and clusters that barely agree across looks. This contradiction resolves as we find the probe learns a stable direction, whose ICC of 0.60 is 3.0 times that of the full embedding. Variance components, calculated from generalizability theory, attribute under a tenth of the within-cell spread to look acquisition geometry. The rest is cell-specific and cannot be separated without repeat passes at matched geometry. A sonar-pretrained encoder (BenthicDINO) and a classical SAS texture descriptor show the same pattern. For this dataset and the tested representations, uses that depend on patch identity fail, such as cross-pass comparison and retrieval, while uses at the level of habitat type (e.g. coral classification) do not. Because the standard metrics did not detect this, we argue that repeat-look reliability should accompany any evaluation of representations of the seafloor.

cs.CV · cs.LG · stat.AP

新论文 · v1arXiv:2611.10769

Look Ahead: Search-Driven Reasoning in Embodied AI

Ahmed Zeer, Osama Shbib, Muzaffer Kaan Yuce, Himmet Toprak Kesgin, Mehmet Fatih Amasyali

原文摘要

Search allows a robotic policy to evaluate candidate futures before committing to an action. Motivated by test-time planning for vision-language action (VLA) models, we study selective search over action chunks in PushT using a frozen Action Chunking with Transformers (ACT) policy. Beam search generates perturbed alternatives around the policy prediction and scores them through rollouts from cloned simulator states. Across 50 evaluation episodes, beam search raises task success from 0% to 18% and increases average cumulative reward from 39.44 to 103.2. We introduce One Step Ahead (OSA), a gate that simulates the nominal policy chunk and invokes full search only when its predicted coverage drop exceeds a threshold. In the reported ablations, OSA preserves or improves success while reducing runtime by approximately 3x relative to full beam search. Ablations over tree depth, branching factor, beam width, and replanning frequency show that larger search budgets do not consistently improve performance. The results support selective test-time search for action-chunking policies; evaluation on language-conditioned VLAs and physical robots remains future work.

cs.AI

新论文 · v1arXiv:2611.10768

BlenderFORGE: Framework for Optimizing Reactive 3D-Graphics Editing Ability of MLLMs

Zilin Guo, Tianrui Zhang, Yi Rong, Yichen Liu, Yuxin Guo, Jingcheng Ni, Lewei Lu, Zehuan Wu 等 9 位作者

原文摘要

Multimodal Large Language Models (MLLMs) have shown promise as interactive agents, yet precise, programmatic 3D graphics editing remains difficult to train because existing systems largely rely on closed-source model APIs and lack deterministic, state-verifiable execution environments. We present BlenderFORGE, a trainable data-environment-optimization framework for open-weight MLLM agents that edit explicit Blender scenes through Blender Python (bpy) code generation. BlenderFORGE targets four fundamental state-verifiable editing task families: object placement, shape-key editing, lighting adjustment, and material modification. It integrates three components: (1) a scalable perturbation-based data generation pipeline built from curated assets and large-scale 3D scene repositories; (2) an isolated Blender Sandbox for deterministic code execution, structured state export, and closed-loop reward computation; and (3) a two-stage training pipeline that uses offline teacher trajectories for cold-start Supervised Fine-Tuning (SFT) and sandbox-computed rewards for multi-turn tool-agentic Reinforcement Learning (AgentLoop-RL). Experiments across the four task families show that the resulting open-weight Qwen3-VL-8B and Qwen3.5-9B BlenderFORGE agents substantially improve over their base models and achieve competitive performance with several zero-shot proprietary MLLM baselines on selected metrics. Additional cross-benchmark evaluations and camera-reframing experiments provide evidence of transfer beyond the original training setting.

cs.AI

版本更新 · v2arXiv:2602.05339

Consistency-Preserving Concept Erasure via Unsafe-Safe Pairing and Directional Fisher-Weighted Adaptation

Yongwoo Kim, Sungmin Cha, Hyunsoo Kim, Jaewon Lee, Donghyun Kim

原文摘要

With the increasing versatility of text-to-image diffusion models, the ability to selectively erase undesirable concepts (e.g., harmful content) has become indispensable. However, existing concept erasure approaches primarily focus on removing unsafe concepts without providing guidance toward corresponding safe alternatives, which often leads to failure in preserving the structural and semantic consistency between the original and erased generations. In this paper, we propose a novel framework, PAIRed Erasing (PAIR), which reframes concept erasure from simple removal to consistency-preserving semantic realignment using unsafe-safe pairs. We first generate safe counterparts from unsafe inputs while preserving structural and semantic fidelity, forming paired unsafe-safe multimodal data. Leveraging these pairs, we introduce two key components: (1) Paired Semantic Realignment, a guided objective that uses unsafe-safe pairs to explicitly map target concepts to semantically aligned safe anchors; and (2) Fisher-Weighted Initialization for DoRA, which initializes parameter-efficient low-rank adaptation matrices using unsafe-safe pairs, encouraging the generation of safe alternatives while selectively suppressing unsafe concepts. Together, these components enable fine-grained erasure that removes only the targeted concepts while maintaining overall semantic consistency. Extensive experiments demonstrate that our approach achieves the best overall trade-off among baselines, providing effective concept erasure while preserving structural integrity, semantic coherence, and generation quality.

cs.CV · cs.LG

版本更新 · v3arXiv:2608.22007

The Communication Map of a Transformer

Richard Zhe Wang

原文摘要

The components of a transformer communicate by writing to and reading from a shared residual stream, and the mechanistic interpretability literature has mapped these connections by hand, one circuit at a time. We present the communication map, which charts every potential communication channel from the geometry of the model's weights alone. Its unit of analysis is the whole transformer rather than the individual head or circuit. Every ordered writer-reader pair, across all 18 connection classes from head-to-head to neuron-to-neuron, receives a coupling coefficient that generalizes the composition score of Elhage et al. (2021), with an exact chance level. The census finds that 70-89% of head pairs are oriented far from chance, some coupled strongly and others actively avoiding each other. The map recovers the known induction circuits blind from the strongest head-to-head couplings and groups the heads into communities, and ablating one such community destroys the model's in-context copying. As an application, we pool the coupling coefficients of every head to identify a two-dimensional residual stream subspace, distinct from those found by activation PCA or outlier dimensions, whose deletion abolishes induction in six models up to Pythia-6.9B. We release the map, the statistical machinery, and the intervention suite.

cs.LG · cs.CL

版本更新 · v2arXiv:2605.31463

PithTrain: A Compact and Agent-Native MoE Training System

Ruihang Lai, Hao Kang, Haozhan Tang, Akaash R. Parthasarathy, Zichun Yu, Junru Shao, Todd C. Mowry, Chenyan Xiong 等 9 位作者

原文摘要

Mixture-of-Experts (MoE) has become the dominant architecture for frontier language models. To meet this demand, production frameworks have built optimized MoE training stacks over years of engineering effort. Yet evolving these stacks for new architectures and system optimizations remains expensive. With the rise of AI coding agents, they could automate parts of training-framework development and accelerate this evolution. But applying them to these existing frameworks carries hidden costs, invisible to today's throughput-only evaluations. We name this missing dimension agent-task efficiency (ATE): the cost of using coding agents to understand, operate, and extend a framework. Grounded in four agent-native design principles, we build PithTrain, a compact, agent-native MoE training framework supporting pretraining, supervised fine-tuning, and reinforcement learning. We further introduce ATE-Bench, covering real-world training-framework tasks. Our evaluation shows PithTrain achieves throughput competitive with production frameworks and higher agent-task efficiency on ATE-Bench. On new-feature tasks, PithTrain uses up to 62% fewer Agent Turns than Megatron-LM, and up to 44% and 64% less Active GPU Time than Megatron-LM and TorchTitan, respectively.

cs.LG · cs.AI · cs.CL · cs.DC

版本更新 · v2arXiv:2610.10520

Distilling Graph Geometry: Knowledge Gap from GNNs to MLPs

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

原文摘要

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

cs.LG

版本更新 · v3arXiv:2507.03617

EMERGE: A Benchmark for Updating Knowledge Graphs with Emerging Textual Knowledge

Klim Zaporojets, Daniel Daza, Edoardo Barba, Ira Assent, Roberto Navigli, Paul Groth

原文摘要

Knowledge Graphs (KGs) are structured knowledge repositories containing entities and relations between them. In this paper, we study the problem of automatically updating KGs over time in response to evolving knowledge in unstructured textual sources. Addressing this problem requires identifying a wide range of update operations based on the state of an existing KG at a given time and the information extracted from text. This contrasts with traditional information extraction pipelines, which extract knowledge from text independently of the current state of a KG. To address this challenge, we propose a generic and extensible pipeline that pairs textual passages with the KG edit operations they induce on a given KG snapshot. We instantiate this pipeline on the Wikidata knowledge graph and the English Wikipedia corpus to create EMERGE, a dataset of 233K Wikipedia passages associated with a total of 1.19 million KG edits across seven yearly Wikidata snapshots from 2019 to 2025. Our experimental results highlight key challenges in updating KG snapshots based on emerging textual knowledge, particularly in integrating knowledge expressed in text with the existing KG structure. We further show that KG access substantially improves executable updates and enables triple deprecation. These findings position EMERGE as a benchmark for developing methods that keep KGs up to date with emerging textual knowledge. The dataset (https://huggingface.co/datasets/klimzaporojets/emerge-benchmark) and code (https://github.com/klimzaporojets/emerge) are publicly available.

cs.CL

新论文 · v1arXiv:2611.10766

New Classes of CCZ-Inequivalent APN Functions with Boomerang Uniformity One in Odd Characteristic: Differential and Boomerang Spectra

Namhun Koo, Soonhak Kwon

原文摘要

Let $q=p^n>3$ be an odd prime power and let $g:\F_q\to\F_q$ be an even perfect nonlinear (PN) function with $g(0)=0$. We construct almost perfect nonlinear (APN) functions $G_{λ,M}(x)=g(x)+M(x)+λ(x^{q-1}-1)$, where $λ\in\F_q^*$, $-λ\notin g(\F_q)$, and $M$ is an $\F_p$-linearized permutation polynomial. These one-point modifications of $g+M$ have boomerang uniformity one, the smallest possible value for APN functions in odd characteristic. We give complete differential and boomerang spectrum formulas and obtain closed-form evaluations for selected constructions based on Coulter--Matthews monomials and Dembowski--Ostrom polynomials. For $q>7$, comparison of differential spectra establishes CCZ-inequivalence to all APN monomial families listed in the paper and every APN binomial in the original Ness--Helleseth family or its extension by Zeng et al. We characterize CCZ-equivalence within our construction, showing that any two linearly inequivalent even PN functions over the same field yield CCZ-inequivalent APN functions. We obtain three pairwise CCZ-inequivalent APN functions with boomerang uniformity one over $\F_{p^{15\ell}}$ for every $\ell\ge1$, six over $\F_{p^{120r}}$ for every $r\ge1$, and unbounded numbers of such classes in characteristic three. We further prove that CCZ-equivalence and EA-equivalence coincide for functions at Hamming distance at most $m$ from a PN function, provided that $m(m+1)<q-q/p$. We also show that all our APN functions have the maximal possible algebraic degree $n(p-1)$. Finally, we exhibit both CCZ-equivalent and CCZ-inequivalent APN pairs with boomerang uniformity one at Hamming distance one.

cs.IT · cs.CR

新论文 · v1arXiv:2611.10765

Cascading Circle Loss: Order-Preserving Contrastive Learning for Graded Legal Retrieval

Rayane Kimouche, Ahmed Touila

原文摘要

This paper introduces Cascading Circle Loss (CasCL), a contrastive learning framework for legal retrieval tasks with graded relevance. CasCL combines an InfoNCE objective for positive-negative separation with a cascade of ranking boundaries that model ordered relevance levels between queries and legal clauses. The framework also includes a negative-aware self-paced optimization mechanism and a relevance gain weighting strategy to improve ranking quality. Experiments on legal passage retrieval benchmarks show that CasCL consistently outperforms existing methods, including InfoNCE, Circle Loss, MNRL and Margin MSE, across both binary retrieval and graded ranking metrics.

cs.CL

新论文 · v1arXiv:2611.10764

BAPLe++: Cross-Model Transferability and Prompt-Level Defense of Backdoors in Medical Foundation Models

Ufaq Khan, Umair Nawaz, Satyajit Tourani, Awais Rauf, Fahad Shamshad, Asif Hanif, Rao Muhammad Anwer, Muhammad Haris Khan 等 9 位作者

原文摘要

Medical foundation models (Med-FMs) are increasingly adapted to clinical tasks through prompt learning, which tunes a small set of prompt tokens while the backbone remains frozen. Recent work has shown that this efficiency introduces a vulnerability: jointly optimizing learnable prompts and an imperceptible noise trigger during few-shot adaptation implants a backdoor that leaves clean performance intact but steers triggered inputs to an attacker-chosen class. Since prompts are compact and readily shared, this raises two questions: whether a backdoored prompt remains effective on a different Med-FM, and whether it can be repaired without retraining the backbone. We address both in BAPLe++. First, we present the first study of cross-model transferability of prompt-based backdoors, quantified by two proposed metrics, Clean Accuracy Difference (CAD) and Backdoor Accuracy Difference (BAD). Second, we propose DePLe (Defense via Prompt Learning), which uses the infected prompt as a fixed anchor and learns a new prompt on a small clean set that preserves the clean task while diverging from the compromised embedding region. Experiments on four Med-FMs and six chest X-ray and histopathology datasets show that backdoors transfer across models, but asymmetrically and in a dataset-dependent manner. Compared with four training-free input transformations, DePLe reduces backdoor accuracy more consistently while preserving, and in several settings improving, clean accuracy. Our code can be accessed on https://github.com/Ufaqkhan/Baple-Plus-Plus

cs.CV · cs.AI · cs.LG

版本更新 · v3arXiv:2606.14095

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs

Tianhao Wu, Matthew Zurek, Weina Wang, Qiaomin Xie

原文摘要

We study the sample complexity of learning in average-reward weakly-coupled Markov decision processes (WCMDPs) and Restless Bandits (RBs) under a generative model. Naive reduction to a tabular MDP leads to high complexity bounds as the state-action space is exponentially large in the number of arms $N$. By exploiting the weakly coupled structure, we show that near-optimal policies can be learned with sample and computational complexities that are polynomial in $N$. Specifically, we analyze the plug-in approach, which applies an efficient planning algorithm to an empirical model estimated from data. For fully heterogeneous WCMDPs, we establish the first finite-sample PAC guarantee with polynomial complexity and an $O(1/\sqrt{N})$ optimality gap. For homogeneous RBs, we further prove that a smaller optimality gap is achievable under mild structural assumptions. A primary technical contribution is a novel Lyapunov-based analysis framework. Unlike classical approaches that rely on the difficult-to-control bias function, our framework uses an explicitly constructed Lyapunov function along with a drift transfer technique between the true and empirical models. A key step of independent interest in our framework is a fine-grained perturbation analysis for the underlying linear programming (LP) relaxation, which provides a general tool for analyzing LP-based policies and weakly-coupled systems.

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