跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

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

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

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

找到 24,106 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v2arXiv:2607.24409

Accuracy potential of visual localization exploiting high-end street-level imagery

Jonas Meyer, Stephan Nebiker, Pascal Theiler, Norbert Haala

原文摘要

Many applications, such as surveying, autonomous navigation, robotics and augmented reality, require accurate pose information with respect to a reference frame. Visual localization can complement GNSS positioning, whose availability and accuracy are often limited. However, the accuracy potential of visual localization has not yet been systematically investigated against survey-grade requirements, and no publicly available large-scale outdoor dataset provides ground-truth poses accurate enough for such an investigation. We address both gaps. First, we present the FHNW Muttenz dataset. It covers a contiguous 10 km street network, mapped in two mobile mapping campaigns about 1.5 years apart, and comprises high-resolution reference imagery as well as query sequences from four cameras in five scenes. The two campaigns are co-registered to each other with an accuracy of 5 mm. Co-registration of the query images to the reference imagery yields ground-truth poses accurate to 6-9 mm in position and well below 0.1° in orientation. All images are georeferenced with an accuracy of about 2.5 cm. Second, we use this dataset to systematically evaluate sparse feature-based visual localization with a modular pipeline built from established components, using the high-resolution reference imagery directly as the scene representation. For daytime imagery and pre-calibrated cameras, the median pose errors with respect to the reference imagery are 1-5 cm in translation and 0.03-0.1° in rotation. Given an accurately georeferenced scene representation, visual localization not only approaches the accuracy of survey-grade GNSS positioning but also provides full orientation information. The dataset is publicly available at https://fhnw-muttenz-vl-dataset.github.io/

cs.CV · cs.RO

版本更新 · v3arXiv:2605.19823

Smooth Piecewise Cutting for Neural Operator to Handle Discontinuities and Sharp Transitions

Ha Dang, Sebastian Schmidt, Juergen Hesser

原文摘要

Neural operators have achieved strong performance in learning solution operators of partial differential equations (PDEs), but their inherently continuous representations struggle to capture discontinuities and sharp transitions. Existing approaches typically approximate such features within continuous function spaces, often requiring increased model capacity and high-resolution data. In this work, we propose Cut-DeepONet, a two-stage training framework that explicitly models discontinuities while reducing learning complexity. Our approach reformulates the problem via a lifting strategy, partitioning the domain into smooth subregions while representing discontinuities as boundaries in a higher-dimensional space. This separation aligns the operator learning task with the inductive bias of neural networks and avoids directly approximating discontinuities. An additional network predicts input-dependent discontinuity locations for unseen inputs, which are then used to guide the neural operator in generating smooth components within each region. Experiments on benchmark PDEs show that Cut-DeepONet outperforms state-of-the-art methods, even when trained on low-resolution datasets. The method excels on problems with discontinuities and sharp transitions, while using fewer trainable parameters. Our results highlight the benefits of changing the representation of operator learning rather than increasing model complexity.

cs.LG · cs.AI · math.AP · math.DS · stat.ML

新论文 · v1arXiv:2611.09472

ENGRAM: From Agent Experience to Weights through Verified Consolidation

Ruiyi Yang, Zechen Li, Lihuan Li, Du Yin, Hao Xue, Flora D. Salim

原文摘要

Language-model agents use experience through external retrieval and parameter learning. Consolidating stored experience into model weights requires deciding both which experience to train on and when its external records can leave retrieval. Admission based solely on student mastery can exclude useful teacher demonstrations, while removal immediately after training can discard guidance that the model still needs. We introduce ENGRAM, a framework that separates training admission from memory release. A demonstration-aware gate admits skills based on student mastery or sufficient successful teacher demonstrations. The student learns from selected action traces with context from an Engram Trace Graph (ETG). A verification gate then compares the updated model without episodic retrieval against the base model with retrieval on reserved probes. Release requires valid training participation and scores meeting both relative and absolute criteria; records for skills that fail verification remain retrievable. Experiments across interactive and reasoning benchmarks show consistent gains over frozen-weight ETG controls, with ablations supporting demonstration-aware admission and selective adapter activation. A controlled held-out comparison shows that verified release substantially reduces the retrievable footprint while remaining close to retain-all performance and outperforming immediate and budget-matched random release. ENGRAM also improves task performance while reducing input-token usage and model calls. Skill-level verification further reduces retrievable experience through selective archival, retaining external guidance for skills that do not meet the release criteria. Code is available in anonymous.4open.science/r/engram-anonymous.

cs.AI · cs.IR

新论文 · v1arXiv:2611.09470

Consensus-Constrained Dual-Federated Optimization with Client-Side Dynamic Weighting for Distributed Android Device Threat Defense

Mohammad Mashreghi, Mohammad Hossein Badiei, Md. Jalil Piran

原文摘要

Smartphones, smart-home hubs, and wearables are increasingly exposed to sophisticated Android malware, while centralized threat-detection pipelines raise privacy and scalability concerns. Federated learning (FL) enables collaborative model training without collecting raw client data, but partial participation and variation in local model quality can destabilize global optimization. In this article, we propose DW-FedADMM, a federated optimization framework that combines primal-dual coordination with performance-dependent client-side weighting. The dynamic coefficient modulates each participating client's local state before the augmented-Lagrangian update, while the dual variables regulate disagreement between local and global model states. We evaluate DW-FedADMM on three Android malware benchmarks, namely Drebin, Malgenome, and TUANDROMD, with 5, 10, and 15 clients holding IID data shards, partial client participation, and communication budgets of 5 and 10 rounds. Each configuration is repeated with ten random seeds. DW-FedADMM obtains the highest seed-averaged accuracy on Drebin (97.64% +/- 0.20%) and the best mean accuracy in 9 of the 18 dataset-client-round configurations, including 7 of the 9 configurations with a 10-round budget. Pooled over all configurations, it reaches 95.42% accuracy, 94.62% F1-score, 96.06% precision, and 99.45% AUC, compared with 95.32%, 94.51%, 95.56%, and 99.41% for FedADMM, while also giving the lowest mean false-positive rate and the smallest client update norm among the six compared methods. Both primal-dual methods are well ahead of the averaging- and proximal-based baselines on Malgenome and TUANDROMD, where the latter often remain at the majority-class solution when clients are fragmented. The gain of dynamic weighting over FedADMM is most pronounced on Drebin and with the longer communication budget, where it also reduces the variation across seeds.

cs.LG · cs.CR · cs.DC

版本更新 · v2arXiv:2605.20479

Oracle Supervision Transfers for Hyperparameter Prediction in Model-Based Image Denoising

Jianmin Liao, Lixin Shen, Yuesheng Xu

原文摘要

Hyperparameter prediction is a critical practical bottleneck for model-based image denoisers, ranging from classical TV/TGV variational solvers to modern diffusion-based models such as DiffPIR. While existing learned predictors can achieve near-oracle performance, this approach scales poorly: each new configuration conventionally requires its own oracle-labeled training set, and each label requires a hierarchical grid search evaluated against clean ground truth. We therefore ask whether oracle supervision collected on source configurations can transfer to target configurations with few or no target oracle labels. We propose HyperDn, a single configuration-conditioned predictor that pools oracle supervision across source configurations and predicts heterogeneous hyperparameters for new denoiser--noise configurations. In a cross-paradigm experiment, HyperDn transfers from relatively cheap TV/TGV variational sources to more expensive diffusion-based DiffPIR. With only $2$ target oracle labels, it reaches $30.23$\,dB, within $0.90$\,dB of the oracle, and outperforms the $64$-label per-configuration predictor trained from scratch, using $1/32$ as many target labels as that baseline point. Without any target oracle labels, HyperDn also reaches near-oracle PSNR on two unseen mixtures of seen noise types and on transfer from relatively cheap $96\times 96$ source images to $512\times 768$ targets. Together, these results show that expensive oracle supervision for hyperparameter prediction can be transferred from source to new target configurations, reducing the need to rebuild oracle labels for each new denoising configuration.

cs.CV · cs.LG

版本更新 · v2arXiv:2605.16396

Beyond MMSE: Enhancing PnP Restoration with ProxiMAP

Kenta Vert, Giacomo Meanti, Scott Pesme, Michael Arbel, Julien Mairal

原文摘要

Plug-and-Play (PnP) methods for imaging inverse problems replace the proximal operator of the prior, a maximum a posteriori (MAP) denoiser, with a pretrained minimum mean squared error (MMSE) denoiser. MMSE estimates are oversmoothed, motivating recent work to target the MAP with diffusion-model scores. We show that MAP-targeting iterations converge to cartoon-like images with learned scores, but to realistic ones with the exact scores of a Gaussian mixture. The failure thus seems to come from score errors, and it only appears near convergence. We therefore propose ProxiMAP, an iterative MAP approximation that queries the denoiser at the residual noise level of the current iterate. This keeps the denoiser in-distribution and slows the iterations down before they reach the cartoon regime. On deblurring, super-resolution, inpainting, HDR and phase retrieval, replacing the MMSE denoiser with ProxiMAP in DPIR, DiffPIR and DAPS improves perceptual quality in most experiments, sometimes at the expense of PSNR. To make ProxiMAP cheaper, we also propose a one-step distillation and a hybrid schedule that applies it only at the last PnP iteration. In most cases, one or the other retains much of the improvement at a fraction of the cost.

cs.CV · cs.LG

版本更新 · v3arXiv:2601.06262

Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model

Alexandra Dache, Arnaud Vandaele, Nicolas Gillis

原文摘要

Community detection is a fundamental task in data analysis, and block models provide an approach for identifying diverse community structures. The degree-corrected block model (DCBM) is an established model that captures node degree heterogeneity. However, inference methods are computationally costly and sensitive to initialization, while cheaper alternatives, such as spectral or modularity-based approaches, may be less effective at recovering certain non-assortative structures. In this work, we show that DCBM inference can be reformulated as a constrained nonnegative matrix trifactorization problem. Leveraging this insight, we propose a scalable community detection method with a theoretically grounded initialization providing an initial partition for inference algorithms. Our approach is agnostic to network structure and applies to any graph representable by a DCBM. Experiments on synthetic and real-world benchmark networks show that our method achieves community recovery comparable to, and sometimes better than, that achieved by the DCBM inference methods, while being faster: it processes a graph with 100,000 nodes and 500,000 edges in about 30 seconds. Moreover, the initialization significantly improves solution quality. Overall, this work provides a scalable and robust framework for community detection and highlights the benefits of a matrix-factorization perspective for the DCBM.

cs.SI · math.OC · stat.ML

新论文 · v1arXiv:2611.09468

Mechanical Interaction Sensing for Robotic Kiwifruit Handling with an Optoelectronic Soft Suction Cup

Romina Adhami, Ebrahim Shahabi, Alessio Mondini, Samuel M. Youssef, Cosimo Della Santina, Gualtiero Volpe, Barbara Mazzolai

原文摘要

Robotic handling of delicate fruit benefits from compliant contact and quantitative sensing of the mechanical interaction at the end-effector. This study investigates an optoelectronic soft suction cup with a kiwifruit-specific bicomponent design for estimating interaction forces during contact with real fruit. During known-contact intervals, the optical signals accurately estimate interaction force on fruits excluded from model training: the best shallow network achieves grouped out-of-fold pooled R-squared = 0.968 +/- 0.005 (MAE = 0.138 N), with a median per-fruit held-out R-squared = 0.973 (MAE = 0.134 N). A simple monotonic mapping from the mean optical response alone achieves R-squared = 0.925 +/- 0.005, showing that substantial force-related information is already present in the optical response. Leave-one-collection-day-out validation remains strong (R-squared = 0.955 +/- 0.031), supporting robustness across acquisition sessions. As an exploratory secondary analysis, binary Soft/Firm classification from compression-test reference labels achieves moderate balanced accuracy (approximately 0.705) under grouped held-out-fruit validation, while finer three-class grading shows limited performance.

cs.RO

新论文 · v1arXiv:2611.09466

Symmetry Breaking over Multiway Channels

Raymond Zhang, Richard Combes, Sheng Yang

原文摘要

Identical users running the same algorithm must often break their symmetry and agree on distinct roles, as in leader election, naming, and resource allocation. We study anonymous symmetry breaking over a discrete memoryless multiway channel invariant under permutations of its $J$ users: each user observes only a private output and must choose a number in $\{1,\dots,J\}$, and the symmetry is broken if the $J$ numbers are distinct. Using a Rényi change of measure, we derive a finite-blocklength converse on the error probability of every symmetric causal protocol, including adaptive and randomized ones. For achievability, block coding with random names reduces the problem to all-source multicast, for which we derive a Gallager random-coding exponent for every fixed $J$, and a cut-set bound that limits the exponent of the probability that two names coincide or are decoded wrongly. Interactive role controllers instead let the users contend for identifiers directly: we give their exact error probability, an achievable exponent given by a spectral radius when some outputs certify a role, and a floor for finite-state controllers when every output has positive probability, and we introduce generalized musical chairs. On a noisy bandit channel motivated by multiplayer multi-armed bandits, with noiseless collisions and arms of a common mean below one, interactive schemes provably exceed the limit of name decoding, and numerical estimates suggest the same with noisy collisions. For two users, noiseless collisions, one informative arm and a silent arm, the optimal error probability is determined up to a factor of two.

cs.IT

版本更新 · v5arXiv:2510.23254

Optimal In-context Adaptivity and Distributional Robustness of Transformers

Tianyi Ma, Tengyao Wang, Richard J. Samworth

原文摘要

We study in-context learning problems where a Transformer is pretrained on tasks drawn from a mixture distribution $π=\sum_{α\in\mathcal{A}} λ_α π_α$, called the pretraining prior, in which each mixture component $π_α$ is a distribution on tasks of a specific difficulty level indexed by $α$. Our goal is to understand the performance of the pretrained Transformer when evaluated on a different test distribution $μ$, consisting of tasks of fixed difficulty $β\in\mathcal{A}$, and with potential distribution shift relative to $π_β$, subject to the chi-squared divergence $χ^2(μ,π_β)$ being at most $κ$. In particular, we consider nonparametric regression problems with random smoothness, and multi-index models with both random smoothness and random effective dimension. We prove that a large Transformer pretrained on sufficient data achieves the optimal rate of convergence corresponding to the difficulty level $β$, uniformly over test distributions $μ$ in the chi-squared divergence ball. Thus, the pretrained Transformer is able to achieve faster rates of convergence on easier tasks and is robust to distribution shift at test time. Finally, we prove that even if an estimator had access to the test distribution $μ$, the convergence rate of its expected risk over $μ$ could not be faster than that of our pretrained Transformers, thereby providing a more appropriate optimality guarantee than minimax lower bounds.

stat.ML · cs.LG · math.ST

版本更新 · v2arXiv:2608.29463

Benchmark Contamination: A Taxonomy Organized by Defeated Mitigation

Johanna Angulo, Víctor Yeste, Hector Espinos-Morato

原文摘要

A benchmark score is a joint property of the model, the evaluation harness, the elicitation budget, the sampled population, and contamination status. Leaderboards publish the model and the score, so capability and leakage stay observationally equivalent. Existing taxonomies classify contamination for automated detection, not the question a reporter faces at publication: given the mitigations already applied, which validity threats remain open? We introduce a taxonomy organized by the mitigation each type defeats -- direct, derivative, temporal, distributional, and acquired -- spanning training-time and evaluation-time leakage. Holding out a private test set closes the first alone. The fifth is acquired during the evaluation itself; because it is a property of one run, it must be recorded with the reported score rather than with the benchmark release. We operationalize it as a four-field disclosure protocol in which "unknown" is a valid entry, released under CC BY 4.0 with a JSON Schema, a validator, and worked examples. Two coders external to the design team applied a pre-registered instrument to 41 documents. Per-variable linear-weighted $κ$ runs from 0.00 to 0.35 (median 0.21) over 29 main-pass documents against a single-coder test-retest ceiling of 0.84, collapsing under the class skew the registration anticipated; pooling raises it to 0.46 through chance correction rather than better agreement. Two variables fall below the prevalence-robust threshold registered in advance: strata reporting and the acquired type introduced here. Disagreement concentrates on when a variable applies rather than on what a document states. Elicitation budgets are reported in 13% of documents, and no document addresses all five types. The contribution is the taxonomy, the score-side artifact that follows from it, and a pre-registered measurement of instrument reliability and current disclosure.

cs.CR · cs.AI · cs.CL · cs.LG

版本更新 · v2arXiv:2605.14276

Training-Free Generative Sampling via Moment-Matched Score Smoothing

Zhenyu Yao, Daniel Paulin

原文摘要

Diffusion models generate samples by denoising along the score of a perturbed target distribution. In practice, one trains a neural diffusion model, which is computationally expensive. Recent work suggests that score matching implicitly smooths the empirical score, and that this smoothing bias promotes generalization by capturing low-dimensional data geometry. We propose moment-matched score-smoothed overdamped Langevin dynamics (MM-SOLD), a training-free interacting particle sampler that enforces the target moments throughout the sampling trajectory. We prove that the one-particle marginal of the ideal constrained Gibbs equilibrium converges, as the number of particles grows, to a Gibbs--Boltzmann density obtained by exponentially tilting the naive score-smoothed target. Its mean and covariance match the training GMM, even for rank-deficient data. We additionally establish sampling consistency, statistical target-error bounds for bounded data, and consistency of a safeguarded BAOAB-based tilting estimator. Experiments on 2D distributions and latent-space image generation show that MM-SOLD enables fast, robust, latent sampling on CPUs using fixed pretrained autoencoders, with sample fidelity and diversity competitive with neural diffusion baselines.

stat.ML · cs.LG

版本更新 · v2arXiv:2609.16732

When Agents See Differently: Exposing UI Desynchronization Threats in Mobile Agents

Heng Li, Fulin Zhao, Zhe Geng, Zhiyuan Yao, Wei Yuan, Xiapu Luo

原文摘要

Mobile agents may act on interface content that users cannot see or easily notice, making their actions harder to oversee. We characterize this gap as human-agent UI desynchronization and investigate how attackers can exploit it through perturbations embedded in applications before deployment. Beyond accessibility metadata, we identify two mechanisms that expose misleading cues to screenshot-based agents: content rendered in display-occluded regions under compatible device configurations, and low-contrast text that remains encoded in screenshots but is difficult for users to notice. We develop an automated framework that searches application-specific perturbation strategies, optimizes their content using representative tasks, and realizes the perturbations in deployable applications. The perturbation content remains fixed at runtime and requires neither access to future user instructions nor detection of agent use. Using a benchmark of 546 tasks across 13 applications, we evaluate five mobile-agent frameworks and three backbone models. The attacks achieve average misleading rates of 77.4% in static observation-space evaluation and 67.2% in dynamic application-level evaluation, where success denotes selection of an attacker-designated decoy control. We invited 195 participants to assess the perceptibility of our visual perturbations and found that none spontaneously noticed the low-contrast text. These findings expose a security gap between human-visible interfaces and agent-observable representations, showing that inconspicuous application content can redirect delegated actions even without runtime adaptation.

cs.CR

版本更新 · v3arXiv:2605.31318

Generalized Intention Modeling in Multi-Agent Reinforcement Learning

Mateusz Odrowaz-Sypniewski, Jasmine Bayrooti, Ajay Shankar, Amanda Prorok

原文摘要

Modeling an opponent's intent is critical for effective decision-making in non-cooperative, competitive, and general-sum multi-agent reinforcement learning. Existing opponent modeling methods encode intent using an embedding derived from episode information chosen a priori, such as the opponent's next action or a future environment state, and use this to guide the ego-agent's behavior. These approaches assume that the chosen information is universally representative of intent; however, we show empirically that this is not the case as intentions are often task- and environment-dependent. To address this, we introduce a task-adaptive opponent modeling framework that learns a performance-driven mixture of multiple intent representations. We further introduce a new intention representation that maximizes mutual information with the ego-agent's future returns, thereby capturing opponent information that is most directly relevant to performance. Our approach consistently matches or exceeds the performance of state-of-the-art baselines across diverse tasks and yields insights into when and why different opponent modeling strategies succeed.

cs.LG · cs.MA

版本更新 · v2arXiv:2602.04144

OMG-Agent: Toward Robust Missing Modality Generation with Decoupled Coarse-to-Fine Agentic Workflows

Ruiting Dai, Zheyu Wang, Haoyu Yang, Yihan Liu, Chengzhi Wang, Zekun Zhang, Zishan Huang, Jiaman Cen 等 9 位作者

原文摘要

Data incompleteness severely impedes the reliability of multimodal systems. Existing reconstruction methods face distinct bottlenecks: conventional parametric/generative models are prone to hallucinations due to over-reliance on internal memory, while retrieval-augmented frameworks struggle with retrieval rigidity. Critically, these end-to-end architectures are fundamentally constrained by Semantic-Detail Entanglement -- a structural conflict between logical reasoning and signal synthesis that compromises fidelity. In this paper, we present \textbf{\underline{O}}mni-\textbf{\underline{M}}odality \textbf{\underline{G}}eneration Agent (\textbf{OMG-Agent}), a novel framework that shifts the paradigm from static mapping to a dynamic coarse-to-fine Agentic Workflow. By mimicking a \textit{deliberate-then-act} cognitive process, OMG-Agent explicitly decouples the task into three synergistic stages: (1) an MLLM-driven Semantic Planner that resolves input ambiguity via Progressive Contextual Reasoning, creating a deterministic structured semantic plan; (2) a non-parametric Evidence Retriever that grounds abstract semantics in external knowledge; and (3) a Retrieval-Injected Executor that utilizes retrieved evidence as flexible feature prompts to overcome rigidity and synthesize high-fidelity details. Extensive experiments on multiple benchmarks demonstrate that OMG-Agent consistently surpasses state-of-the-art methods, maintaining robustness under extreme missingness, e.g., a $2.6$-point gain on CMU-MOSI at $70$\% missing rates.

cs.AI · cs.LG

版本更新 · v2arXiv:2601.01501

Advanced Global Wildfire Activity Modeling with Hierarchical Graph ODE

Fan Xu, Wei Gong, Hao Wu, Lilan Peng, Nan Wang, Qingsong Wen, Xian Wu, Kun Wang 等 9 位作者

原文摘要

Wildfires, as an integral component of the Earth system, are governed by a complex interplay of atmospheric, oceanic, and terrestrial processes spanning a vast range of spatiotemporal scales. Modeling their global activity on large timescales is therefore a critical yet challenging task. While deep learning has recently achieved significant breakthroughs in global weather forecasting, its potential for global wildfire behavior prediction remains underexplored. In this work, we reframe this problem and introduce the Hierarchical Graph ODE (HiGO), a novel framework designed to learn the multi-scale, continuous-time dynamics of wildfires. Specifically, we represent the Earth system as a multi-level graph hierarchy and propose an adaptive filtering message passing mechanism for both intra- and inter-level information flow, enabling more effective feature extraction and fusion. Furthermore, we incorporate GNN-parameterized Neural ODE modules at multiple levels to explicitly learn the continuous dynamics inherent to each scale. Through extensive experiments on the SeasFire Cube dataset, we demonstrate that HiGO significantly outperforms state-of-the-art baselines on long-range wildfire forecasting. Moreover, its continuous-time predictions exhibit strong observational consistency, highlighting its potential for real-world applications.

cs.LG

版本更新 · v3arXiv:2510.02789

Align Your Query: Representation Alignment for Multimodality Medical Object Detection

Ara Seo, Bryan Sangwoo Kim, Hyungjin Chung, Jong Chul Ye

原文摘要

Medical object detection suffers when a single detector is trained on mixed medical modalities (e.g., CXR, CT, MRI) due to heterogeneous statistics and disjoint representation spaces. To address this challenge, we turn to representation alignment, an approach that has proven effective for bringing features from different sources into a shared space. Specifically, we target the representations of DETR-style object queries and propose a simple, detector-agnostic framework to align them with modality context. First, we define modality tokens: compact, text-derived embeddings encoding imaging modality that are lightweight and require no extra annotations. We integrate the modality tokens into the detection process via Multimodality Context Attention (MoCA), mixing object-query representations via self-attention to propagate modality context within the query set. This preserves DETR-style architectures and adds negligible latency while injecting modality cues into object queries. We further introduce QueryREPA, a short pretraining stage that aligns query representations to their modality tokens using a task-specific contrastive objective with modality-balanced batches. Together, MoCA and QueryREPA produce modality-aware, class-faithful queries that transfer effectively to downstream training. Across diverse modalities trained altogether, the proposed approach consistently improves AP with minimal overhead and no architectural modifications, offering a practical path toward robust multimodality medical object detection.

cs.CV · cs.AI · cs.LG

版本更新 · v2arXiv:2609.11431

LLMs as Post-hoc Auditors of Physiological Plausibility in Symbolic Regression: A Clinician-Evaluated Case Study

Jorge López-Varela, J. Ignacio Hidalgo, José-Manuel Muñoz, Omar Costilla-Reyes, Esther Maqueda, Jesus Moreno-Fernandez, Tomás González-Vidal, J. Manuel Velasco 等 9 位作者

原文摘要

Genetic programming and its variants, such as grammatical evolution, are widely used in symbolic regression to derive mathematical expressions from multivariate data. In addition to predictive accuracy, models are appreciated for their potential to provide interpretability, offering explicit equations that relate input variables to outcomes. However, achieving interpretability and plausibility remains challenging, as evolved models may be complex or scientifically inconsistent. In this study, we explore whether large language models (LLMs) can assist in improving the interpretability of symbolic regression models generated by evolutionary computation methods. Building on our previous work on estimating body fat percentage using grammar-based genetic programming, we investigate LLMs as post-processing tools to analyze and rank evolved expressions by interpretability and physiological plausibility. Four symbolic expressions are analyzed by three LLMs over three repeated runs, and the resulting interpretations and rankings are assessed by a panel of three clinicians. Across the three LLMs, comparative model-ranking outputs received more favorable clinician assessments than isolated term-level interpretations. However, the LLMs also produced physiologically and mathematically questionable explanations, indicating that they are better suited to comparative auditing under expert oversight than to autonomous validation.

cs.AI

版本更新 · v2arXiv:2610.36727

Finite Fields: Root Sets, Frobenius, and Algebraic Structure

Hongfeng Wu, Li Zhu

原文摘要

This monograph develops finite field theory through root sets, Frobenius orbits, trace duality, and cyclic modules, with applications to polynomial constructions and algebraic coding theory. Root-set descent and linearized polynomials connect field extensions, normal bases, invariant subspaces, and linear recurrences. Cyclotomic cosets link additive symmetries and local phase data with polynomial composition, factorization, and compatible lifting. Low-degree subfield representations and relative traces lead to root-block recovery, while return maps on root fibers organize constructions of irreducible polynomials. Coding applications include duality, distance bounds, Fourier support, and syndrome decoding. Character sums yield trace-norm distributions, the primitive normal basis theorem, and recurrences for extension-field sums and curve point counts. The final chapter constructs finite fields as residue fields of unramified p-adic extensions and relates Teichmuller representatives and Hensel lifting to cyclotomic orbits, periodic digit expansions, Witt carries, coefficient valuations, and Newton slopes. The emphasis throughout is on explicit proofs and reusable connections between field structure, orbit structure, and linear dependence.

math.NT · cs.IT

新论文 · v1arXiv:2611.09458

Left-Right-Consistent Iterative Stereo Matching via Cross-Injection

Manuel Knott, Diogo Luvizon, Daniel Scharstein, Elias Vansteenkiste

原文摘要

State-of-the-art stereo matching models predominantly predict the disparity of only the left (reference) view. However, applications such as per-eye AR/VR rendering, novel view synthesis, or two-view depth fusion require disparity for both views, and need those two maps to agree. The usual workaround of running the network a second time on the horizontally flipped and swapped pair gives two independent predictions that can be inconsistent, especially on transparent surfaces, in textureless regions, and at occlusion boundaries. We introduce cross-injection (CI), a lightweight extension for iterative (refinement-based) models that can be added to any pretrained left-only iterative matcher. It couples the two passes by injecting the explicit, signed left-right inconsistency as an additional input cue at every step of the refinement stage. We empirically show that CI substantially reduces left-right disagreement on every benchmark (more than halving it on Booster for FoundationStereo), while largely preserving sharp object boundaries. Furthermore, using two state-of-the-art stereo matching models, we show that CI also reduces the single-view disparity error, making it a worthwhile extension even if only left disparity is needed.

cs.CV

版本更新 · v2arXiv:2611.07165

Structural Conditional Independence Test via Neural Quantile Resolution

Khoa Nguyen, Bao Duong, Thin Nguyen

原文摘要

Conditional independence testing is difficult when dependence is weak, localized, or expressed through distributional changes rather than a global mean shift. Existing tests usually return a scalar statistic or p-value, which can detect rejection but gives limited resolution about where the conditional law changes. We propose QRCIT, a quantile-resolution conditional independence test that compares P(X | Z) and P(X | Y, Z) through an amortized quantile deformation. A lightweight residual quantile-flow model first learns the baseline conditional quantile law and then learns the additional deformation induced by Y, yielding both a calibrated global test statistic and an inspectable deformation field over context and quantile level. We also introduce the Structural Dependency Benchmark (SDB), which evaluates real-world-inspired dependence structures, such as context-local, tail-only, sign-reversing, moving-ridge, and mean-neutral patterns. Across synthetic PNL and SDB benchmarks, QRCIT improves detection of structured alternatives while maintaining empirical Type-I control. Increasing quantile resolution consistently improves merged-SDB power, and the local-rescue strategy sharpens detection when dependence is concentrated in structural regions. On Sachs, METABRIC breast cancer, and CCLE/PLX4720, QRCIT provides competitive real-data performance and interpretable deformation patterns. These results support quantile-resolved conditional-law deformation as a practical framework for testing and diagnosing structured conditional dependence.

cs.LG

新论文 · v1arXiv:2611.09457

Definitions, Label Names, or Demonstrations? Auditing What Governs LLM Annotation

Viraj Mishra, Shubham Gupta, Dhruv Gupta, Yuehong Cassandra Tai, Qunhua Li

原文摘要

Large language models (LLMs) are increasingly used to annotate social-science texts, but high accuracy does not establish that they apply researcher-supplied category definitions: predictions may instead reflect prior associations with category labels or labeled demonstrations. We introduce a counterfactual audit that reassigns definitions among output labels, distinguishing adherence to supplied definitions from preservation of a dataset's original mapping. Across three political-text datasets, models rarely follow reassigned definitions, and standard fine-tuning strengthens the original mapping without reliably increasing definition adherence. We then study retrieval-augmented annotation. Retrieving the nearest training examples generally outperforms retrieving examples separately within each category despite using fewer demonstrations. On the two tasks with substantial gains, direct \(k\)-nearest-neighbor classification recovers 74--93\% of the improvement, indicating that neighborhood labels provide much of the predictive signal. Relabeling fixed demonstrations redirects predictions, whereas aligning demonstrations with reassigned definitions substantially increases adherence to the new mapping. Thus, accuracy-improving interventions need not increase codebook adherence; definitions, category labels, demonstrations, retrieval, and training data should be aligned and validated jointly.

cs.AI

版本更新 · v3arXiv:2608.13545

LittleLearner: Language Models Under Pedagogically Controlled Knowledge Exposure

Fanfei Li, Jana Zeller, Manuel Prada-Corral, Thaddäus Wiedemer, Prasanna Mayilvahanan, Ryan Cotterell, Wieland Brendel

原文摘要

Modern language models are trained on heterogeneous web-scale text corpora. Consequently, studying knowledge and skill acquisition is difficult, as prior exposure to related content is hard to characterize. To address this challenge, we introduce LittleCurriculum, a curated 88B-token pretraining corpus tailored to U.S. elementary school material, explicitly excluding concepts, facts, and vocabulary taught above Grade 5. Training a 5B-parameter LLM from scratch on LittleCurriculum yields LittleLearner, a model with sufficient language competence for open-ended evaluation, yet with clear knowledge and capability boundaries mapped to interpretable curriculum guidelines. We release LittleCurriculum and LittleLearner as a developmentally restricted sandbox to study how models acquire, represent, and use data under a well-defined training scope. We illustrate the sandbox's utility in a first suite of experiments on injecting new knowledge through post-training and in-context learning. These methods let LittleLearner better utilize existing knowledge, but do not raise out-of-scope capabilities. Our findings underscore the value of this controlled environment for future investigations.

cs.CL · cs.AI · cs.LG

版本更新 · v2arXiv:2511.08326

A Two-Term Ziv-Zakai Bound for Multitarget DoA Estimation in MIMO Radar

Mohammadreza Bakhshizadeh Mohajer, Daniela Tuninetti, Luca Barletta

原文摘要

Multitarget direction of arrival (DoA) estimation is challenging when fluctuating targets are closely spaced: local Cramér--Rao bounds (CRBs) miss global errors, while direct vector Ziv--Zakai bound (ZZB) evaluation is computationally demanding. For colocated multiple-input multiple-output (MIMO) radar with Swerling-II fluctuations and an ordered angular prior, we derive a rigorous two-term Bayesian mean squared error lower bound. A finite separation contribution addresses nonlocal discrimination, while a correction based on the prior averaged Fisher information matrix (FIM) retains target coupling and virtual array geometry. We show that the prior averaged pointwise CRB diverges under unrestricted target spacing when the FIM is nonsingular almost everywhere, although the proposed bound remains finite. Once the averaged FIM is obtained, evaluation avoids displacement optimization and multidimensional binary error integration. The bound supports analysis of snapshot diversity, target spacing, and transmit and receive allocation. Numerical comparison with the vector ZZB shows close agreement at low SNR but greater conservatism at high SNR, quantifying the tradeoff in tightness.

cs.IT

新论文 · v1arXiv:2611.09455

Overview of the ImageCLEFmedical 2026 GANs task: Exploring fingerprint detection, privacy leakage, and synthetic medical image generation

Alexandra-Georgiana Andrei, Mihai Gabriel Constantin, Mihai Dogariu, Dzmitry Karpenka, Yuri Prokopchuk, Ahmedkhan Radzhabov, Dan-Cristian Stanciu, Liviu-Daniel Ştefan 等 11 位作者

原文摘要

The 2026 ImageCLEFmedical GANs Task Exploring Fingerprint Detection, Privacy Leakage, and Synthetic Medical Image Generation continues to investigate privacy and security concerns around using patient data to generate synthetic medical images, now in its fourth edition. This edition introduces three complementary subtasks: the first extends prior editions by asking participants to detect which real images were used in training a Generative Adversarial Network to produce given synthetic outputs; the second is a novel subtask requiring participants to identify which latent vector produced each synthetic image, probing the faithfulness and reversibility of the latent-to-image mapping; the third asks participants to generate privacy-preserving CT slices, quantifying the trade-off between image fidelity and patient privacy. Ground-truth annotations and benchmark datasets of real and GAN-generated lung CT slices are provided for all subtasks. Evaluation is based on Cohen's Kappa for Subtask 1, matching accuracy for Subtask 2, and a combination of FID and Privacy Preservation Score (PPS) for Subtask 3. Overall, 37 teams registered for the task, with 10 teams submitting runs across subtasks and 6 teams submitting working notes papers. This paper presents an overview of the task setup, datasets, evaluation metrics, and summarises the approaches and results of participating teams.

cs.CV

新论文 · v1arXiv:2611.09454

From LoRA to Language: Recovering Skill Documents from Adapters

Saranya Dintakurthy Swadha, Pavan C Shekar, Arpit Jain, Aswanth Krishnan

原文摘要

Agent skills are short documents that teach a language model how to handle a class of tasks. To save context, these documents are increasingly compiled into low-rank adapters (LoRA), which keep the behaviour but lose the text: an adapter is hard to read, edit, audit or move to another model. We ask whether the skill document can be written back from the adapter and its frozen base model, and we score each recovered document by the share of the original's key instructions it states and by the tasks it solves. Reading the weights alone recovered little with the methods we tried; a learned map from weights to text passed on about one bit of the document. Running the adapter worked much better. The Executing Writer, a small writer trained on top of the adapted model, recovers 39-44% of the key instructions of held-out skills, against 1.3-1.5% with another skill's adapter, and on adapters fitted to 41 external skills its documents restore 85-91% of the original's task gain. These strongest results are on adapters whose training stored the document; adapters trained on behaviour alone are much harder for trained writers (1-2% of instructions). For these adapters we test an agent that runs the base and adapted models and writes a skill from where they differ. On ALFWorld its skills recover 58-71% of a LoRA's gain and carry over to models that cannot load the LoRA, lifting Llama-3.1-8B from 5% to 55%. Whether such a skill comes from the adapter depends on what the adapter learned: when its behaviour cannot be guessed, the adapter is the source; when it can, a reward loop without the adapter does as well.

cs.LG · cs.AI · cs.CL

新论文 · v1arXiv:2611.09451

Scalable BLE Channel Sounding Localization with Ranging-Assisted PDoA

Jorg Wieme, Eli De Poorter, Jeroen Hoebeke

原文摘要

Bluetooth Channel Sounding (CS) enables accurate phase-based ranging, but multi-anchor localization requires sequential ranging exchanges that limit scalability and increase measurement latency. This paper proposes Ranging-Assisted Phase Difference of Arrival (RA-PDoA), a scalable BLE localization architecture combining one active anchor performing a standard two-way CS exchange with multiple passive receive-only anchors observing the same transmissions. A channel-recovery framework is derived that enables passive anchors to reconstruct a channel response suitable for super-resolution delay estimation, allowing multipath-robust ranging without participating in a two-way exchange. Coarse arrival-time information is further used to bound the position estimate and reject inconsistent range solutions. A comprehensive evaluation characterizes the impact of multipath propagation, body shadowing, synchronization requirements, oscillator impairments, anchor placement, and deployment inaccuracies, thereby quantifying the practical infrastructure requirements for scalable BLE localization. Simulation results in modeled indoor environments show that RA-PDoA reduces the 90th-percentile localization error from 175.3 cm to 95.5 cm under body shadowing while maintaining an airtime requirement independent of the number of anchors. The results demonstrate that a single active ranging link enables scalable and multipath-robust BLE Channel Sounding localization.

eess.SP · cs.NI

新论文 · v1arXiv:2611.09448

Not All Entropy Is Equal: Reward-Conditioned Entropy Allocation in Reinforcement Learning with Verifiable Rewards

Song Yu, Li Li, Zhenming Wu

原文摘要

Policy entropy is widely used to diagnose exploration and collapse in reinforcement learning with verifiable rewards (RLVR), yet its magnitude does not consistently track reasoning performance across optimization objectives. We argue that this ambiguity arises because global token entropy conflates uncertainty in successful and failed trajectories, diversity across correct solution strategies, and variation among realizations of the same strategy. We introduce \textbf{Reward-Conditioned Entropy Allocation (RCEA)}, a hierarchical diagnostic framework that separates complete-trajectory entropy from average token entropy, conditions uncertainty on verifier outcome and process validity, measures correct-solution-mode retention, and connects these population-level quantities to local covariance-driven updates. In controlled sweeps over six RLVR objectives at two model scales, entropy trajectories do not induce a stable ordering of reasoning accuracy. Token entropy is higher for verifier-failed than successful trajectories under both broad separately aggregated estimates and a common-question paired analysis, whose confidence intervals exclude equality at 10 of 12 displayed endpoints. A local covariance approximation predicts the direction of adjacent-checkpoint entropy change in 95.5\% of nonfailed transitions; a reward-stratified endpoint proxy further shows that positive chosen-token covariance is more tail-concentrated within failed prefixes. Every reportable trained endpoint exhibits some contraction in independently audited correct-solution-mode breadth, whose positive association with large-\(k\) coverage remains exploratory. These results show that entropy collapse should be diagnosed by which uncertainty is removed, rather than by global entropy alone.

cs.LG · cs.AI

版本更新 · v2arXiv:2609.04874

A Wavelength Borrowing Architecture for Optical Data Center Networks - Extended Version

Andrea Detti, Chiara Lodovisi, Silvello Betti

原文摘要

The growth of east-west traffic, along with the cost and power consumption of electronic switching, is motivating the integration of a low-power, high-rate, all-optical layer within the data center network. This paper presents a spine-leaf all-optical architecture in which the default wavelength configuration, one wavelength per source--destination leaf pair, can be reconfigured to accommodate unbalanced traffic demand: wavelengths that are unused or lightly loaded at one leaf are borrowed by another leaf with higher demand. This topology-engineering capability is combined with a traffic-engineering scheme, based on two-hop detouring, enabling the control of wavelength load while limiting the amount of detoured traffic. A key feature of the architecture is that its degree of wavelength reconfigurability is set by a single tunable parameter, the borrowing degree $B$, ranging from none to full; performance evaluation shows that performance nearly equal to that of a fully reconfigurable architecture is achieved well below the maximum $B$, saving the complexity of a fully reconfigurable solutions. The optical fabric relies on mature, data-center-grade components, namely AWGs, AWGRs, colorless OXCs, and combiners. The reconfiguration speed and the adopted dynamic control policy make the architecture suitable for network tiers where the traffic varies on timescales of tens of minutes or more, e.g., among groups of racks (pods).

cs.NI

版本更新 · v2arXiv:2608.01855

RADAR Perception for Dynamic Obstacle Avoidance onboard small-scale Quadrotor UAVs

Dnyandeep Mandaokar, Bernhard Rinner

原文摘要

Fast dynamic obstacle avoidance (DOA) on uncrewed aerial vehicles (UAVs) demands not only low-latency control and actuation but also reliable, long-range perception to detect obstacles and estimate their motion in time to maneuver. We present, to the best of our knowledge, the first mmWave RADAR-based perception-and-control system for fast onboard DOA. We derive and analyze latency and spatial bounds that relate sensing range, relative speed, and control delay, yielding sufficient conditions for successful avoidance. We further extend prior latency analyses to include the decision latency of the tracker and trigger to evaluate them per trial. Our computationally efficient system combines a lightweight interacting multiple models (IMM) tracker with a control-barrier functions (CBF) controller that directly outputs evasive accelerations. In 300 throw experiments spanning three object sizes and varying visibility (light and dark), it achieves mean position errors of at most 0.15 m, 0.93m, and 0.87m in the x, y, and z directions, with a similar spread in 90 experiments in smoke. An onboard implementation on a Raspberry Pi 4B demonstrates real-time feasibility with an end-to-end processing latency of approximately 14ms per RADAR frame and a system latency of 75ms from first detection to the avoidance command. The UAV successfully avoided obstacles in all 20 tethered indoor flights and all 39 untethered outdoor avoidance maneuvers across three ball sizes, during both hover and forward flights at up to 5m/s with measured closing speeds up to 14.6m/s.

cs.RO · eess.SY