跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

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

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 21,358 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.16149

HyperPage: Learned Page Layouts for Disk-Resident Graph Vector Indexes

Xinyu Zhang, Jingze Li, Baihua Zheng, Weiwei Sun

原文摘要

Disk-resident graph indexes such as DiskANN store each vector with its graph edges as one record on SSD pages. A search needs the page of every record it expands, so its page reads depend on the page layout, that is, which records share a page. Search agents trained with reinforcement learning query one such index run after run, and every graph traversal can be logged with the records it expands. We therefore use the logs of a finished run to lay out the index for a declared memory budget, so later runs read fewer pages. In contrast, existing layouts such as Starling and MARGO are computed from the graph and vectors and use no logs. Learning a layout from logs is challenging, because the logs must stay valid under every layout, the saving depends on what the budget caches, and the best layout is NP-hard to find. Our key observation is that DiskANN-style search routes on in-memory codes and the records it expands, never on their page-mates. As a result, the logged traversals price every layout by replay, and cached records add no page reads. Accordingly, we propose HyperPage, which first builds layouts for the declared budget on the logged traversals of uncached records. It then selects one layout, together with the budget split between hot records and a page cache, by replaying validation steps. In addition, a Lagrangian lower bound shows how far a layout may be from the optimum. We learn from one Search-R1 agent run and test on a later run with a different reward, over 1M and 21M passages. Across seven cache budgets, HyperPage reads 5.2% to 21.2% fewer pages than MARGO, and no compared layout reads fewer. The advantage is largest when the cache is small. For example, at 1% of the 1M index, MARGO needs nearly 3 times the budget to read as few pages. On the 21M index, HyperPage also cuts search time per step by up to 10.4%. The saving holds for a second agent model and a second corpus.

cs.DB · cs.IR

版本更新 · v3arXiv:2606.10314

Synthesizing Human Trajectory Anomalies: An LLM-Driven Framework with Map-Constrained Routing and Sensor Noise Simulation

Yueyang Liu, Joon-Seok Kim, Andreas Züfle

原文摘要

Although the study of human trajectory anomalies is vital for spatial data mining, empirical research remains constrained by the lack of ground-truth datasets. Despite the availability of several real-world and simulated human trajectory datasets, most only include normal mobility patterns and lack annotated anomalies. This limitation primarily arises because anomalous events are rare in the real world and difficult to collect. Furthermore, collecting large-scale mobility data is hindered by strict privacy regulations and acquisition costs. To overcome these limitations and establish an explainable human trajectory anomalies dataset with annotated ground truth, we introduce an end-to-end generative framework designed to synthesize context-aware trajectory anomalies at scale. Unlike existing models, our framework applies real-world physical constraints on baseline simulated trajectories. We employ Large Language Model (LLM) agents to systematically inject semantically meaningful behavioral anomalies such as irregular out-of-distribution check-ins and skipped routine visits. To ensure the spatial validity, the system leverages a map-constrained routing module to recalculate the physical transitions between these LLM agent-modified staypoints. Moreover, to narrow the simulation-to-reality gap, we augment the resulting trajectories with a context-aware spatial noise model, parameterized by environmental and location-specific variables, to emulate heterogeneous GPS sensor degradation. Through this pipeline, our framework produces a CTI & EBI formatted mobility dataset with annotated anomalies, providing a benchmark for downstream spatial data mining tasks.

cs.AI

新论文 · v1arXiv:2611.16148

Calibrated Early Termination with Bounded Optimality Gaps for Constrained Vector Search

Xinyu Zhang, Jingze Li, Baihua Zheng, Weiwei Sun

原文摘要

Vector search over learned embeddings is the retrieval layer of recommendation and retrieval-augmented generation, and many applications cap how many answer items one category may contribute. Graph indexes answer a query by best-first traversal, and where it stops determines its cost and whether its answer is exact. We study early termination for such constrained $k$-nearest-neighbor ($k$-NN) queries, with plain $k$-NN as a special case, and seek the cheapest stopping rule whose answer is exact with probability at least $1-\varepsilon$. Learned early-termination methods instead target average recall, which does not guarantee exact answers. Multiple testing can calibrate any parameterized stopping rule to our target, but it cannot tell how much a better rule with the same risk and observations would save. Answering this needs a lower bound on the optimum of a rule family too large to enumerate, valid for the query population. Our key idea is to declare the observations a rule may use and to consider every rule monotone in them. Risk-constrained stopping then becomes a linear program over an order polytope, whose Lagrangian minimizers form a nested chain of staircase rules computed exactly by dynamic programming. Fixed-sequence binomial tests along this chain calibrate our rule, CaST, whose failure probability is at most $\varepsilon$ with confidence $1-δ$. Lagrangian weak duality bounds the optimum of the declared class from below at all risk levels at once, without a union bound over the rules. On two datasets of one million items each, CaST replayed on logged searches costs at most 1.132 times the class optimum for risk levels from 0.03 to 0.10, at 95% joint confidence per setting. Larger savings thus need a rule outside the class. At a common risk target on held-out queries, CaST is faster than every other calibrated rule we time, which take 4.8% to 45.5% more mean time.

cs.DB · cs.IR · cs.LG

新论文 · v1arXiv:2611.16143

Does a Self-Learning Migration Agent Learn? An Audited Evaluation of Evidence-Graded Experience Memory for Oracle-to-PostgreSQL Migration

Oleg Grynets, Vasyl Lyashkevych, Valeriia Oliferuk, Vladyslav Babenko, Danylo Kovalchuk, Dmytro Kostetskyi

原文摘要

Do large language model (LLM) migration agents learn from accumulated experience, or do apparent gains reflect retrieval and reference reuse? We evaluate an evidence-graded agent for Oracle-to-PostgreSQL migration across four studies. On 1,833 documentation-derived source-reference pairs, persistent memory improved reference conformity (RC) over a no-memory baseline by 0.015 [0.004, 0.025], while policy adaptation added no gain (-0.004 [-0.010, 0.001]). An audit found that 264 of 367 held-out units (72%) shared a PostgreSQL reference with training, and the memory effect on the 103 leak-free units fell to 0.002 [-0.008, 0.011]. A model-free nearest-target copy baseline scored RC 0.222, outperforming all LLM systems (at most 0.163). A reference-grouped split reduced copying to 0.119; a rerun on 374 units in 118 independent target groups found no statistically distinguishable memory effect (0.005 [-0.003, 0.017]) and no policy effect. A separate Oracle-grounded evaluation on 216-224 real PL/SQL units showed that 10-22% of PostgreSQL-accepted units were behaviorally incorrect; a human-gated fix cycle increased demonstrably correct units from 98/216 to 167/224. A write-back study showed a 54% decline in retrieval margin as the knowledge base grew from 12 to 1,200 entries. We derive six evaluation rules that distinguish cross-task learning from reference leakage, copying, metric artifacts, and unstable feedback.

cs.LO · cs.DB · cs.SE

版本更新 · v2arXiv:2602.04004

StraTyper: Automated Semantic Type Discovery and Multi-Type Annotation for Dataset Collections

Christos Koutras, Juliana Freire

原文摘要

Understanding dataset semantics is crucial for effective search, discovery, and integration pipelines. To this end, column-type annotation (CTA) methods associate columns in tabular datasets with semantic types that accurately describe their contents, using pretrained deep learning models or Large Language Models (LLMs). However, existing approaches have important limitations. First, they require users to specify a closed set of semantic types either during training or inference, which hinders their application to domain-specific datasets where predefined type vocabularies often lack adequate coverage and specificity. They also assume that each column is associated with a single semantic type, an assumption that does not hold for many real-world datasets. Lastly, while proprietary LLMs have shown effectiveness for CTA, they incur high monetary costs and produce inconsistent outputs across similar columns, leading to type redundancy that degrades downstream applications. To address these challenges, we introduce StraTyper, a cost-effective method for column type discovery (CTD) and multi-type annotation (CMTA) in dataset collections. StraTyper eliminates the need for predefined semantic labels by employing LLMs to discover types tailored to the target dataset collection. Through strategic column clustering, controlled type generation, and iterative cascading discovery, StraTyper balances type precision with annotation coverage while minimizing LLM costs. Our experimental evaluation, both manual and LLM-assisted, on real-world dataset collections demonstrates that StraTyper discovers accurate types for both numeric and textual data, achieves substantial cost savings over commercial LLMs, and effectively handles multi-typed columns. We further show that StraTyper's annotations improve downstream tasks, including join discovery and schema matching, outperforming LLM-only baselines.

cs.DB

版本更新 · v2arXiv:2609.13219

Planning as Dynamics Relaxation: Hippocampal Recurrent Network Realizes Optimal Goal-Directed Navigation

Yuhang He, Junfeng Zuo, Tianhao Chu, Si Wu

原文摘要

Neural correlates of the cognitive map are well documented, yet how a neural circuit turns a stored map into an obstacle-avoiding route remains unclear. Here we show that a hippocampal network with appropriate recurrent connections achieves optimal goal-directed navigation through its own relaxation dynamics. The recurrent weights represent the transition probabilities between the locations the neurons encode, walls are reflected by vanishing weights, and behavioral-timescale synaptic plasticity (BTSP) writes this connectivity during goal-free exploration. When a goal is recalled, a top-down current clamps the goal neuron and the population relaxes into a goal-locked activity field. We prove that this field is the desirability field of a linearly-solvable Markov decision process: the relaxed state is the exact optimum of a stated control problem, the KL-regularized objective of Todorov, and the optimal next-step distribution is carried by the branch synaptic currents. The identity extends to directed transitions, and a weak-cost limit returns the Green's function of the recurrent Laplacian. A place-tuned readout converts the field's log-gradient into a direction of travel, and the same synapses answer a predictive query when the source is placed at the current location. Simulations on mazes with complex obstacles show near-shortest routes, an identity that survives a thousand-fold range of recall amplitude, the loss of 80% of place cells, and tens of thousands of states, low-rank updates of every plan after a local change, and a transient that is anytime: the local action is ready long before the field converges. We hope this offers a general circuit principle for planning in abstract cognitive maps beyond spatial navigation.

q-bio.NC · cs.AI

版本更新 · v6arXiv:2603.13373

Ethical Fairness in Ubiquitous Health Sensing without Known Attributes

Shaily Roy, Harshit Sharma, Daniel A. Adler, Srijan Sen, Tanzeem Choudhury, Asif Salekin

原文摘要

Wearable and mobile sensing models infer health and well-being in everyday life, yet strong average performance can conceal failures for particular people, contexts, or devices. Existing fairness methods often require sensitive attributes during training, although such attributes may be unavailable, privacy-sensitive, or restricted. Moreover, they may reduce disparities by degrading performance for some subgroups, violating the ethical principle of non-maleficence. We present FLARE (Fisher-guided LAtent-subgroup learning with do-no-harm REgularization), to our knowledge the first attribute-free framework to operationalize beneficence, non-maleficence, and justice in ubiquitous sensing. FLARE uses Fisher information to regularize loss curvature and combines representation, loss, and curvature signals to discover latent performance strata. It then trains a separate model for each stratum using do-no-harm regularization and validation-controlled parameter sharing. We also introduce BHE (Benefit, Harm-Avoidance, Equity), a metric suite for evaluating ethical fairness beyond statistical parity. Across four physiological, behavioral, and clinical sensing datasets, FLARE achieves the highest mean subgroup F1 on every dataset. It is the only evaluated method that improves mean subgroup performance without degrading any evaluated subgroup and the only one that reduces disparity across all 15 evaluated sensitive attributes. Although some baselines achieve larger average disparity reductions, each harms at least one subgroup. Post-hoc analyses on two datasets show that the discovered strata are only weakly aligned with recorded attributes and identify a recurrent within-person state that participant-level attributes cannot capture. Label-free routing and inference take at most 8.1 ms per sample on a smartphone and 10.5 ms on a Raspberry Pi, supporting real-time on-device deployment.

cs.CY · cs.AI · cs.LG

新论文 · v1arXiv:2611.16139

Temporal Context-Aware Spam Detection Using Transformer-Based NLP Models

Fariz Zeynalov, Razim Mammadli

原文摘要

Spam detection is usually treated as single-message classification, ignoring behavioral patterns that emerge across sequences of messages from the same sender. We study outbound SMS spam detection at the carrier level, where the goal is to predict at send time whether a carrier will flag a message as spam. Using a proprietary production database of 43,741 outbound SMS messages with UTC transmission timestamps and carrier delivery statuses, we report three sets of results. On an 8,749-message held-out test set, a TF-IDF + logistic regression baseline reaches AUC-ROC 0.8721, and a text-only DeBERTa-v3-base classifier reaches AUC-ROC 0.9011 and F1 0.8412. A deployed DistilBERT model augmented with inter-message temporal features reaches accuracy 0.8238, spam-class F1 0.8382, and recall 0.9128 at threshold 0.5 on a separate, class-balanced 20,000-message production evaluation set; these results are not directly comparable with the held-out test results. We also describe TemporalBertSpam, an architecture that encodes each sender's message history with a causal Transformer, and outline the same-split evaluation needed to measure its contribution.

cs.CL · cs.LG

新论文 · v1arXiv:2611.16138

Individually Fair Facility Location

Rajni Dabas, Samir Khuller, Milind Maiti

原文摘要

We study individually fair facility location, where each client must connect to an open facility within a prescribed radius and the objective is to minimize total opening and connection cost. We show that preserving the radii changes the approximability of metric facility location fundamentally. For every fixed radius violation below three, no deterministic polynomial-time algorithm achieves a sublogarithmic cost factor unless $\mathrm{P}=\mathrm{NP}$. The hardness holds with uniform opening costs and uniform radii. It contradicts the strict-fairness constant-factor guarantee recently claimed by Liu, Xu, and Zhang [Theory of Computing Systems, Vol. 70 (2026)]. We then establish a positive result for arbitrary client radii. We give a randomized polynomial-time algorithm that has cost at most $1.725$ times the strictly fair optimum and serves every client within three times its fair radius (in the Appendix we show how this can be de-randomized). We use the approach of Byrka, Srinivasan and Swamy [IPCO 2010]. The facility-location radius factor three is therefore optimal among deterministic polynomial-time algorithms with constant cost factor, unless $\mathrm{P}=\mathrm{NP}$. Experiments on real-world data indicate that the worst case radius bound is rarely realized in practice: the algorithm serves over 99.8% of clients within their stated radius, and never beyond 1.5 times it. Our code is available at https://github.com/milindmaiti/IFFL_Implementation.

cs.DS · cs.CC

版本更新 · v2arXiv:2602.19931

Expanding the Role of Diffusion Models for Robust Classifier Training

Pin-Han Huang, Shang-Tse Chen, Hsuan-Tien Lin

原文摘要

Incorporating diffusion-generated synthetic data into adversarial training (AT) has been shown to substantially improve the training of robust image classifiers. In this work, we extend the role of diffusion models beyond merely generating synthetic data, examining whether their internal representations, which encode meaningful features of the data, can provide additional benefits for robust classifier training. Through systematic experiments, we show that diffusion models offer representations that are both diverse and partially robust, and that explicitly incorporating diffusion representations as an auxiliary learning signal during AT consistently improves robustness across settings. Furthermore, our representation analysis indicates that incorporating diffusion models into AT encourages more disentangled features, while diffusion representations and diffusion-generated synthetic data play complementary roles in shaping representations. Experiments on CIFAR-10, CIFAR-100, and ImageNet validate these findings, demonstrating the effectiveness of jointly leveraging diffusion representations and synthetic data within AT.

cs.LG · cs.CV

新论文 · v1arXiv:2611.17388

Time-Consistent Evaluation of Hierarchical Code Graphs for SWE Agents

Xianpeng, Sun, Tian Yu, Haonan Sun, Sheng Ma, Qincheng Zhang, Lifei Rao, Jie Li 等 11 位作者

原文摘要

Evaluating repository-aware software engineering (SWE) agents requires strict separation between pre-existing repository knowledge and future code evolution, yet standard benchmarks frequently suffer from temporal contamination and prompt-level solution leakage. Building on the time-consistent benchmark protocol of Sun (2026), we enforce strict zero-leakage isolation across DragonFly in C++ and React in JavaScript/TypeScript, locking repository snapshots and knowledge graphs at historical cutoff commits $T_0$ and evaluating 100 post-$T_0$ pull requests across four prompt granularities: Minimal, Concise, Contextual, and Guided. Under this zero-leakage protocol, we conduct a matched evaluation of three context-augmentation regimes: (1) an unaugmented Baseline, (2) a flat syntax-level Tree-sitter AST graph, and (3) ServiceExplorer, a deterministic two-level hierarchical dependency graph capturing Level-1 system/package containers and Level-2 architectural modules. Across 7,200 paired evaluations spanning six foundation models across the MAI-Code Flash, Claude, and GPT-Sol families, ServiceExplorer consistently outperforms both Baseline and Tree-sitter AST across every model, repository, and prompt granularity ($+15.6\%$ to $+86.2\%$ relative $F_1$ lift, $p < 10^{-4}$), while tripling exact full-PR localization on DragonFly. Crucially, equipping an efficiency-tier or prior-generation model with ServiceExplorer consistently surpasses the unaugmented Baseline $F_1$ of the next-generation model across all evaluated families.

cs.SE · cs.AI

版本更新 · v3arXiv:2610.19148

Program Learning with Verifiable Rewards: Distilling Expert Traces into Programs

Vishvesh Bhat, Muhammad Ahmed Mohsin, Asad Aali

原文摘要

Small language models struggle with tool-use tasks that require following multi-step procedures. Whether these failures reflect limited capability or missing procedural knowledge remains unclear. We introduce Program Learning with Verifiable Rewards (PLVR), which distils expert traces into reusable programs without updating model weights. Frontier models turn recurring operations in the traces into typed primitives and rules, and search assembles them using reference actions and training-task checks. A small frozen model executes the primitives, with deterministic verifiers checking their outputs. The resulting program guides a student's reasoning or checks its proposed actions. We evaluate the same program across students on $τ^2$-Bench Retail and Telecom and LiveMCPBench, using synthetic training tasks and unseen benchmark test tasks. On Telecom, PLVR raises an 8B model's success rate from 43.0% to 91.2%, while larger students reach up to 94.4%, compared with 57.9% for the best baseline. On Retail and LiveMCPBench, PLVR is competitive with the best baselines, although tool search remains more dependent on the student model. These results support program learning as a way to transfer expert procedures across frozen models, trading additional inference computation for more reliable tool use.

cs.AI · cs.SC

新论文 · v1arXiv:2611.16126Apple ML Research

Split-and-scale Latent 3D Representations

Dorian Chan, Muhammed Kocabas, Xiaoming Zhao, Oncel Tuzel, Jen-Hao Rick Chang

原文摘要

Latent 3D representations have significantly expanded the capabilities of modern shape modeling, enabling compact encoding of 3D scenes and supporting powerful 3D generative models. Despite this progress, current representations struggle to capture the fine details of complex objects, fundamentally limited by the capacity of their latents. However, scaling latent capacity at training time is computationally expensive and often infeasible under memory limits, and naively increasing the number of latents at inference fails to make effective use of the added capacity. In this paper, we address both challenges with \textit{split-and-scale}, a method that effectively expands latent capacity at inference while keeping training cost tractable. Our key observation is that by representing 3D scenes as continuous functions of 3D coordinates, a single pretrained tokenizer can be applied at inference to arbitrarily small sub-regions of a scene, allocating the same latent capacity to a smaller spatial extent and thus capturing far higher detail. We validate this insight by conducting extensive ablations to study the trade-offs between compute, memory, latent capacity, and reconstruction quality, demonstrating our inference-time scaling method achieves quality competitive with much larger models that exceed single-GPU memory limits. We further demonstrate that split-and-scale supports high-quality generative modeling, training an autoregressive 3D generator that performs competitively with state-of-the-art baselines.

cs.CV

新论文 · v1arXiv:2611.16122

Intent-Aware Protection for AI Agents

Fady Copty, Neta Haiby, Max Braitmaiere, Julia Korsunsky

原文摘要

AI agents increasingly access enterprise data, invoke powerful tools, and act with limited human oversight. Existing security defenses primarily detect prompt injection, harmful outputs, or suspicious behavior, but do not determine whether an agent remains faithful to the purpose for which it was deployed. An action may contain no attack pattern and stay within granted permissions while still violating the agent's role, organizational constraints, or purpose. We introduce Intent- Aware Security, a framework that treats trusted agent intent as a first-class security object. We define Intent Preservation and Intent Drift, and operationalize them through an Intent Profile: an agent-specific representation extracted from organizational, role, and developer intent. We further introduce an Intent-Aware benchmark of 887 validated samples across 35 agents, built by a generation procedure that fixes ground-truth labels before LLM realization, and four Intent Profile-based protections: pre-execution detection, post-execution detection, input alignment, and system-prompt hardening. Across all evaluations, Intent Profile-based protection outperforms all profile-free baselines on the primary metric. On our benchmark, it raises four-class acro-F1 from 45% to 79% (Out-of-Scope F1 from 8% to 76%). On more than 10,000 executed AgentDojo trajectories, where ground truth comes from environment state, profile-based post-execution detection reaches 0.949 AUROC versus AlignmentCheck 0.909, 0.897 with raw agent configuration and 0.843 without context. Profile-based input alignment improves protection success by 7 points over DataFilter with a comparable benign utility. These results suggest that an agent's intended purpose can serve as a useful security reference for detecting and mitigating deviations from its deployed role and operational boundaries.

cs.CR

版本更新 · v2arXiv:2608.23983

Sensorless strain-bounded grasping of fruit

Yusei Shuto, Danilo Vasconcellos Vargas

原文摘要

Robotic post-harvest handling must hold produce without bruising it, yet fruit stiffness varies several-fold with ripeness, so no fixed grip force suits every item. We instead bound compression strain using only the encoder and motor effort of a servo gripper. Given a strain bound $\varepsilon$ and a stiffness floor $k_{\min}$ set once per crop and gripper, the controller estimates object size $\hat{D}$ at contact, refines stiffness $\hat{k}$ conservatively by probing, and stops at $\hat{F} = \varepsilon \hat{k} \hat{D}$, keeping true strain below $\varepsilon$ with high probability above a quantified contact-detection floor. In simulation, where fixed force thresholds either drop heavy objects or damage soft ones, the proposed controller carries 92% of objects within its operating range with 0.3% damage. On cherry and medium tomatoes, setting $\varepsilon$ above the detection floor scaled the stop force threefold across fruit sizes, carrying all fruits while reducing markings on cherry tomatoes from 8/10 to 1/10; on medium tomatoes both marked 3/6.

cs.RO

版本更新 · v4arXiv:2404.03604

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice

Shuo Sun, Rajan Udwani, Zuo-Jun Max Shen

原文摘要

We consider assortment and inventory planning problems with dynamic stockout-based substitution effects, and without replenishment, in two different settings: (1) Customers can see all available products when they arrive, a typical scenario in physical stores. (2) The seller can choose to offer a subset of available products to each customer, which is more common on online platforms. Both settings are known to be computationally challenging, and the current approximation algorithms for the two settings are quite different. We develop a unified algorithm framework under the MNL choice model for both settings. Our algorithms improve on the state-of-the-art algorithms in terms of approximation guarantee and runtime, and the ability to manage uncertainty in the total number of customers and handle more complex constraints. In the process, we establish various novel properties of dynamic assortment planning (for the MNL choice model) that may be useful more broadly.

math.OC · cs.DS

版本更新 · v3arXiv:2508.16731

COSMO-Bench: A Benchmark for Collaborative SLAM Optimization

Daniel McGann, Easton R. Potokar, Michael Kaess

原文摘要

Recent years have seen a focus on research into distributed optimization algorithms for multi-robot Collaborative Simultaneous Localization and Mapping (C-SLAM). Research in this domain, however, is made difficult by a lack of standard benchmark datasets. Such datasets have been used to great effect in the field of single-robot SLAM, and researchers focused on multi-robot problems would benefit greatly from dedicated benchmark datasets. To address this gap, we design and release the Collaborative Open-Source Multi-robot Optimization Benchmark (COSMO-Bench) -- a suite of 24 datasets derived from a baseline C-SLAM front-end and real-world LiDAR data. Data DOI: https://doi.org/10.1184/R1/29652158

cs.RO

版本更新 · v4arXiv:2602.22545

SFL-Net: Dependence-Regularized Latent Pathways for Multi-Contrast MRI-to-tau-PET Synthesis and Component Attribution

Agamdeep S. Chopra, Caitlin Neher, Tianyi Ren, Juampablo E. Heras Rivera, Hesamoddin Jahanian, Mehmet Kurt

原文摘要

Structural MRI-to-tau-PET synthesis estimates molecular imaging patterns from indirect anatomical correlates. We present SFL-Net, a vector-quantized architecture with shared, T1-specific, FLAIR-specific, and joint-input latent pathways. Dependence regularization differentiates these pathways, while latent-derived structural conditioning supports decoding without direct encoder-decoder feature skips. We evaluated SFL-Net and capacity-matched VAE, VQ-VAE, U-Net, and SPADE-U-Net variants using 605 training and 83 internal validation subjects pooled from ADNI-3 and OASIS-3. SFL-Net achieved the lowest raw PET MAE and MSE and the highest PSNR among the implemented models, while SPADE-U-Net variants performed better on several SUVR and staging metrics. Exact coalitional Shapley attribution assigned the largest average marginal contribution to the joint-input pathway, with substantial variation across subjects. These contributions describe decoder dependence under latent replacement and retained structural conditioning; they do not establish identifiable information-theoretic synergy or the incremental benefit of combining MRI contrasts. Predictions showed dynamic-range compression at higher tau burden, and several staging metrics were close to a constant Stage 1 reference. SFL-Net provides a framework for structured latent-component interrogation in multi-input image synthesis, linking architectural pathways to reconstruction behavior.

cs.CV · cs.AI

新论文 · v1arXiv:2611.16116

Robo-SWE: An Executable Issue-Resolution Dataset Mined from Robot Software Repositories

Vahid Haratian, Vahid Ansari, Mohammadhossein Malmir, Alois Knoll

原文摘要

Coding agents are evaluated mostly on general-purpose software, but domain-specific systems require domain-aware evaluation. Robot software is a particularly challenging case: Robot Operating System 2 (ROS 2) packages have their own build tools, simulators and learning frameworks are built on physics engines, and behavior that depends on timing and hardware is hard to test. We present Robo-SWE, a dataset of 236 executable issue-resolution tasks mined from merged pull requests in 28 public robotics repositories in four domains: ROS 2 systems, simulation and physics engines, robotics algorithm libraries, and robot-learning frameworks. Each task contains the original issue text, a container recipe for the repository at the commit before the fix, the developers' fix, and the developers' tests, which fail before the fix and pass after it in repeated offline runs. The dataset also keeps a provenance ledger of all 1,567 candidate pull requests, with the stage each reached and the reason for every rejection, and, as a first use, 3,540 graded attempts by five coding-agent setups with recorded patches and 3,529 available trajectories. Across three runs per primary setup, resolve rates range from 45.8% for Claude Sonnet 5.5 to 56.5% for Claude Opus 5.5; GPT-6.1 Sol reaches 54.1% at maximum effort and 52.5% at medium effort, and GPT-6 Astra 51.4%. GLM-5.3 resolves 46.2%, and Kimi K3.1 Pro 43.9%. The tasks are validated by execution; verification of their fairness by human reviewers is future work. The dataset and public leaderboard are available online.

cs.SE · cs.RO

新论文 · v1arXiv:2611.16114

ADAPT: Agentic Diff-Aware Patch Testing for Pull Requests

Vahid Haratian, Atakan Akar, Eray Tüzün

原文摘要

Modern software development relies on pull requests (PRs) that introduce small, targeted code changes. Once merged, these changes should be protected by focused tests that exercise the behavior the PR introduces, yet developers often submit PRs without such tests, leaving the new behavior unguarded against future regressions. Most test generation techniques target entire software units and optimize objectives such as code coverage rather than the behavior a change introduces, and prior diff-aware approaches have had limited success in capturing it. We propose ADAPT (Agentic Diff-Aware Patch Testing), a regression test generation approach that uses an autonomous coding agent to produce change-focused tests for PRs. Given a PR, the agent analyzes the diff between the base and head versions to identify the modified functions and their context, then plans and generates candidate unit tests. A dedicated fail-to-pass (F2P) verification tool runs each candidate on both versions and, after F2P success, reports which executable changed lines remain uncovered; guided by this feedback, the agent iteratively refines its tests. We evaluate ADAPT on the same 426 real-world PRs used by the prior state-of-the-art baseline, with GPT-4o and GPT-5-mini. ADAPT+GPT-4o reaches an F2P rate of 62.0% (264/426), compared with BLAST's reported 35.4% (151/426), while ADAPT+GPT-5-mini reaches 89.9% (383/426). On 137 PRs shared with Change And Cover (ChaCo), ADAPT achieves full patch coverage on 83.9% of PRs, compared with 79.6% for ChaCo, at considerably lower time and cost. A manual evaluation confirms that the F2P-valid tests target each PR's intended change, with mean scores of up to 4.54/5 for importance, 4.35/5 for assertion strength, and 4.49/5 for readability, often covering behavior beyond the developer-written tests.

cs.SE · cs.AI

版本更新 · v2arXiv:2603.01178

riMESA: Consensus ADMM for Real-World Collaborative SLAM

Daniel McGann, Michael Kaess

原文摘要

Collaborative Simultaneous Localization and Mapping (C-SLAM) is a fundamental capability for multi-robot teams as it enables downstream tasks like planning and navigation. However, existing C-SLAM back-end algorithms that are required to solve this problem struggle to address the practical realities of real-world deployments (i.e. communication limitations, outlier measurements, and online operation). In this paper we propose Robust Incremental Manifold Edge-based Separable ADMM (riMESA) -- a robust, incremental, and distributed C-SLAM back-end that is resilient to outliers, reliable in the face of limited communication, and can compute accurate state estimates for a multi-robot team in real-time. Through the development of riMESA, we, more broadly, make an argument for the use of Consensus Alternating Direction Method of Multipliers as a theoretical foundation for distributed optimization tasks in robotics like C-SLAM due to its flexibility, accuracy, and fast convergence. We conclude this work with an in-depth evaluation of riMESA on a variety of C-SLAM problem scenarios and communication network conditions using both synthetic and real-world C-SLAM data. These experiments demonstrate that riMESA is able to generalize across conditions, produce accurate state estimates, operate in real-time, and outperform the accuracy of prior works by a factor >7x on real-world datasets.

cs.RO

新论文 · v1arXiv:2611.16110

Harnessing Environmental Scatterers for Endogenous Target Covertness in 6G ISAC: A New Paradigm for Sensing Security

Yifan Zhang, Boxuan Xie, Mingyang Yang, Ying Liu, Riku Jäntti, Zan Li

原文摘要

Integrated sensing and communication (ISAC) is a cornerstone of 6G networks, enabling simultaneous data transmission and environmental perception. However, the ubiquitous radiation of sensing waveforms introduces a critical security vulnerability where the physical existence and characteristics of targets are continuously exposed to unauthorized wardens. Meanwhile, existing sensing-secure methods primarily focus on degrading a target warden's parameter-estimation accuracy, yet they fail to prevent wardens from detecting the target's physical presence. In this article, we first analyze sensing security threats in ISAC systems and survey existing sensing-secure methods. To address the critical gap, we propose a novel security paradigm termed endogenous target covertness. By intentionally harnessing environmental scatterers, such as known objects, ambient backscatter devices, and reconfigurable intelligent surfaces (RIS), as ghost targets, the proposed scheme ensures a low probability that the warden detects the true target for the true target at the warden. This deliberately renders the true target's existence indistinguishable to the warden, while the legitimate base station can extract the true target's response using prior knowledge of the scatterers. We demonstrate the effectiveness of the proposed scheme through a case study, proving that absolute target covertness can be achieved without consuming dedicated jamming power. Finally, we outline key open challenges and promising research directions to realize truly secure, ubiquitous sensing in future ISAC ecosystems.

cs.CR · cs.CY

版本更新 · v2arXiv:2508.18787

Design, Implementation and Evaluation of a Real-Time Remote Photoplethysmography (rPPG) Acquisition System for Non-Invasive Vital Sign Monitoring

Constantino Álvarez Casado, Sasan Sharifipour, Manuel Lage Cañellas, Nhi Nguyen, Le Nguyen, Miguel Bordallo López

原文摘要

The growing integration of smart environments and low-power computing devices, coupled with mass-market sensor technologies, is driving advancements in remote and non-contact-based physiological monitoring. However, deploying these systems in real-time on resource-constrained platforms introduces significant challenges related to scalability, interoperability, and performance. This paper presents a computationally efficient real-time remote photoplethysmography (rPPG) system, designed to extract physiological signals, such as heart rate, respiratory rate, and oxygen saturation (SpO2), from facial video streams. The system is built on the Face2PPG pipeline, which processes video frames sequentially for rPPG signal extraction and analysis, while leveraging a multithreaded architecture to manage video capture, real-time processing, network communication, and graphical user interface updates concurrently. This design targets continuous operation at 30 frames per second (FPS), with adaptive feedback through a collaborative user interface to guide optimal signal capture conditions. The network interface includes both an HTTP server for continuous video streaming and a RESTful API for on-demand vital sign retrieval. To ensure accurate performance despite limited computational resources, we use a hybrid programming model combining Functional Reactive Programming (FRP) and the Actor Model, allowing event-driven processing and efficient task parallelization. We evaluate HR accuracy on three public datasets (COHFACE, LGI-PPGI, and UBFC-RPPG), and conduct preliminary evaluations of RR on COHFACE and SpO2 on PURE. We also assess the processing time and end-to-end operation of the system on two computers, including live HR and SpO2 agreement with a medical-grade fingertip pulse oximeter across five 10-minute sessions. Our work addresses key challenges in real-time contactless biosignal monitoring.

cs.CV

新论文 · v1arXiv:2611.16107

Trained on What Screen Readers Cannot Read: Accessibility Debt in the GUI Corpora Behind Computer-Use Agents

Obada Kraishan, Kulsawasd Jitkajornwanich

原文摘要

Computer-use agents learn to operate mobile interfaces from corpora of captured screens and accessibility trees. The same trees are what a screen reader consumes, so an agent trained on them inherits whatever labelling gaps the underlying applications carry. This paper measures one of those gaps, content-description coverage, in two Android corpora: Rico, collected in 2017, and AndroidControl, collected in 2024. Across 17,373,614 interface elements, 17.74% of the Rico elements that need a content description under our coding rule carry one, against 57.27% in AndroidControl. The difference of 39.5 percentage points holds under five alternative coding rules and when whole apps are resampled. It describes two datasets that also differ in app selection, capture method and platform version; it does not measure change over time. Input controls are the least labelled role in both corpora (2.20% and 27.21%, or 30.99% in AndroidControl if hint text counts as a name). Descriptions in the older corpus are also five times more likely to be placeholders (10.25% against 1.95%), so the difference is not an artefact of developers typing filler. Resolving 26,205 task actions to the elements they touched shows that, among tappable graphics with no text, demonstrations operate elements described 9.0 points more often than the others on the screens they visit, about 3.5 points of it from the choice of element within a screen. That is a selection effect inside the benchmark. A two-coder reliability check (kappa = 0.91 and 0.96) and the full pipeline accompany the paper.

cs.HC · cs.AI

版本更新 · v2arXiv:2603.00140

Steering Away from Memorization: Reachability-Constrained Reinforcement Learning for Text-to-Image Diffusion

Sathwik Karnik, Juyeop Kim, Sanmi Koyejo, Jong-Seok Lee, Somil Bansal

原文摘要

Text-to-image diffusion models are susceptible to memorization, revealing a fundamental failure to generalize beyond the training set. Current mitigation approaches often sacrifice image quality or prompt alignment to reduce memorization. To address this, we propose Reachability-Aware Diffusion Steering (RADS), an offline-trained, sampling-time control framework that mitigates memorization while maintaining generation fidelity. RADS models the diffusion denoising process as a dynamical system and learns a policy-conditioned reachability value function that estimates future memorization risk along the denoising trajectory. This motivates a constrained reinforcement learning (RL) formulation, where a policy learns to steer the trajectory away from memorization via perturbations in the caption embedding space. Empirical evaluations show that RADS achieves a stronger empirical Pareto frontier between generation diversity (SSCD), quality (FID), and alignment (CLIP) compared to state-of-the-art inference-time baselines. Crucially, RADS applies the learned controller during sampling time, separating memorization mitigation from the pretrained model. Our website is available at: https://s-karnik.github.io/rads-memorization-project-page/.

cs.CV · cs.AI · cs.LG

新论文 · v1arXiv:2611.16103

Low Probability of Target Detection in Wireless Sensing by Harnessing Reconfigurable-antenna based Reflectors

Yifan Zhang, Zhentian Zhang, Jantti Riku, Yichuan Wang, Xingwang Li, Tuo Wu

原文摘要

In this paper, we introduce low probability of target detection (LPTD) as a new security objective for wireless sensing systems, where the existence of a target is concealed from passive wardens. Unlike conventional communication security and covert communication, LPTD aims to protect the sensed target itself from malicious detection, rather than concealing transmitted signals or communication activities. Specifically, we propose a reconfigurable-antenna-based reflector-assisted target covertness scheme, where passive reflectors deployed around the target are harnessed as artificial scattering sources to confuse the warden. By adjusting their reflection coefficients, these reflectors reshape the local scattering environment and mask the target-induced echo. We then analyze the warden's optimal detection strategy and derive the false-alarm and missed-detection probabilities, followed by a closed-form expression for its minimum total detection error probability. Numerical results validate the analysis and show that sufficient cooperation among reflectors can increase the warden's minimum total detection error probability to approximately 0.94--0.96, making target detection close to random guessing.

cs.CR

新论文 · v1arXiv:2611.16100

Hiding a Gap Does Not Close It: The Price of Removing the Mean Group Contrast from Learned Models of Learning Dynamics

Sosthène Bidojesussi Hounzinhin, Ahmed Ratnani, Abdeladim El Akri

原文摘要

Adaptive tutors use models learned from student data, and a common fairness remedy erases the group signal from these models. We turn the cost of this remedy into an audit tool. Building on mean-parity regression, we give the minimum extra error, relative to the best predictor, of removing the mean group contrast from a predictor that cannot use the group, $p_0p_1Δ^2/R^2$, and the exact cost of any correction built from an estimated group model, which, for the best predictor, is never below this minimum. A three-stage audit (fit on training units, announce the cost on validation units, test on independent units) estimates this cost before the correction is used. In a controlled study, the price can be large even when the state predicts the group poorly. On three real data sets, erasing the group from a learned model of learning dynamics predicts almost no gap where one is observed. In a selected knowledge-tracing network, erasing the hidden state leaves most of the gap; a correction of the prediction removes it at an extra Brier score of 0.021 on average. On Eedi, with the network selected on separate units, the audit accepted the announced cost in all five splits, the measured cost fell inside the announced interval in all five, and the gap reduction transferred to new classes in four; on new ASSISTments schools the audit abstains. In a tutoring simulator, the objective and the help budget matter more than the erasure, and floors on each group's knowledge separate narrowing a gap from levelling down. Hiding a gap in a model does not close it.

cs.LG

新论文 · v1arXiv:2611.16099

CupOFMoCA: Coupled Objective-Guided Discrete Flows for Molecular Conjugate Assembly

Ruoxi Rosie Zhang, Ziang Li, Jiatao Gu, Pranam Chatterjee

原文摘要

Molecular conjugates, including PROTACs and peptide-drug conjugates (PDCs), derive their function from the joint behavior of multiple coupled components, yet most generative approaches design these components independently and combine them only after generation. Such staged pipelines ignore cross-component dependencies and often produce conjugates that are chemically invalid, fall outside empirical conjugate distributions, or lose function upon assembly. In this work, we introduce Coupled Objective-Guided Discrete Flows for Molecular Conjugate Assembly (CupOFMoCA), a discrete generative method that enforces cross-component chemical constraints during conjugate generation. CupOFMoCA restricts guided updates to chemically feasible conjugate states and reweights local transitions using molecular design objectives. Across three PDC systems, coupled generation achieved 100% conjugation validity among valid peptides and increased valid yield over matched post-hoc filtering, with comparable predicted binding scores across the full valid sets. In three-seed evaluations of three PROTAC systems, CupOFMoCA achieved the highest assembly validity on two systems and generated more assembly-valid molecules per second than the evaluated baselines. We further evaluated the generated PROTACs with post-hoc DegradeMaster scoring and explicit-solvent molecular dynamics, supporting their predicted activity and conformational properties. Together, these results establish CupOFMoCA as an efficient generator of molecular conjugates, supporting therapeutic development via coordinated control of assembly and molecular properties.

q-bio.BM · cs.LG

新论文 · v1arXiv:2611.16098

VISTA: View-Independent micro-Doppler Reconstruction with Multistatic ISAC

Jacopo Pegoraro, Marco Canil, Aurora Peloso, Jesus O. Lacruz, Xitao Gong, Richard A. Stirling-Gallacher, Michele Rossi, Joerg Widmer

原文摘要

The micro-Doppler (uD) spectrum provides detailed characteristics of target movement, making it highly valuable for applications such as target classification and human activity recognition. However, traditional Integrated Sensing And Communication (ISAC) systems are highly view-dependent and limited by blind spots and angle dependencies. Existing approaches rely on either configuration-specific solutions or data-driven models. The former results in poor generalization when device deployments or target orientations change, while the latter requires acquiring extensive multi-view datasets, which is time-consuming and not always feasible. To address these limitations, in this work we propose VISTA, a novel method for reconstructing the uD spectrogram in an absolute coordinate frame, yielding view-independent Doppler features that are invariant to the spatial distribution of ISAC nodes. We formulate the uD estimation as a sparse reconstruction problem that jointly leverages measurements from all ISAC receivers. This is solved using a modified Orthogonal Matching Pursuit (OMP) algorithm, which iteratively alternates between jointly selecting candidate velocity vectors across all receivers (RXs) and independently estimating the complex channel gain amplitudes for each RX. Our results show that, provided sufficient spatial diversity, VISTA successfully reconstructs the targets' absolute uD spectrograms with a median error \leq 0.69 m/s for speeds \leq 15 m/s.

cs.AR

新论文 · v1arXiv:2611.16096

The Ultimate Karp-Lipton Collapse

Edward A. Hirsch, Ilya Volkovich

原文摘要

Karp and Lipton proved that if $NP\subseteq P/poly$, then $PH$ collapses. A long line of work pushed the collapse to smaller classes. In particular, Chakaravarthy and Roy obtained two such collapses, to (apparently) incomparable classes $O_2^P$ and $P^{prMA}$. We united them earlier by a collapse to the input-oblivious version $P^{prOMA}$ of $P^{prMA}$, which is contained in both; and, jointly with Williams, to a slightly smaller class. Two other deepest known collapses are to $ZPP^{ONP}$ (following from Köbler and Watanabe) and to $OL_2^P$ (proved in this paper). We unite the three collapses by a collapse to a class contained in all of them. We use a three-stage computational model OGTD (oblivious generator-tester-decoder): a polynomial-time generator with an oracle computes an advice string from $1^n$, a tester certifies it, and a polynomial-time decoder uses it (it is the only one that sees the actual input). Let $OM$ be the class of OGTD languages defined by a restricted version of $prOMA$ as the generator's oracle, by a co-$ONP$ tester, and a $P$ decoder. We show that it is contained in the three collapse classes above and prove that $PH$ collapses to $OM$ under $NP\subseteq P/poly$. The collapse also holds for an unambiguous version of $OM$. All these input-oblivious collapse classes lie in $P^{prSBP}$, and so do even the non-input-oblivious versions $P^{prMA}$, $L_2^P$ and $S_2^P$: we prove that $P^{prS_2^P}\subseteq P^{prSBP}$. This strengthens the containment $S_2^P\subseteq P^{prAM}$ of Chakaravarthy and Roy and our earlier containment $L_2^P\subseteq P^{prSBP}$. The proof unites the Goldreich-Wigderson-type procedure of Chakaravarthy and Roy with our earlier approximate-counting technique. Its input-oblivious counterpart concerns $O_2^P$, the first collapse class of Chakaravarthy and Roy: every language in $O_2^P$ has polynomial-size circuits constructible in $FP^{prSBP}$.

cs.CC