跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

论文修订列表

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

找到 8,992 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v3arXiv:2410.09512

Indirect Optimal Control for Constructing Libraries of Periodic Trajectories: Application to Bipedal Walking

Maximilian Raff, Kathrin Flaßkamp, C. David Remy

原文摘要

Trajectory optimization is a fundamental tool for generating efficient, dynamically consistent periodic motions, commonly referred to as gaits, in legged locomotion. This paper explores the indirect method of periodic trajectory optimization, emphasizing its application in creating optimal gaits for legged systems and contrasting it with the more common direct method. While the direct method offers implementation flexibility, it is limited by its need for an input space parameterization. In contrast, the indirect method achieves higher accuracy by computing the control input from states and costates along the optimal trajectory. In this work, we tackle the convergence challenges associated with indirect shooting methods by utilizing numerical continuation methods. This is particularly useful for the systematic development of gait libraries. Our contributions include: (1) the formalization of a general periodic trajectory optimization problem that extends existing first-order necessary conditions to a broader range of cost functions and operating conditions; (2) a methodology for efficiently generating optimal gait libraries using single shooting and numerical continuation; (3) a novel approach for reconstructing Lagrange multipliers and costates from passive gaits; (4) a comparative analysis of the indirect and direct shooting methods using a compass-gait walker as a case study, demonstrating the higher accuracy of the indirect method; and (5) demonstrating applicability to the more complex legged robot RABBIT, with ten dynamic states and four inputs. These results establish a systematic indirect optimal control framework for synthesizing families of optimal periodic trajectories in legged locomotion.

cs.RO

版本更新 · v4arXiv:2608.02673

dots.tts.edit: Precisely Controlled Speech Editing with a Continuous Autoregressive Model

Hankun Wang, Bohan Li, Shi Lian, Xiaoyu Gu, Jing Peng, Da Zheng, Yiwei Guo, Colin Zhang 等 10 位作者

原文摘要

Speech editing for content creation requires precise control over both what an edit should do and where it should apply. Free-form natural language provides a flexible interface for expressing edit requests, but its ambiguity may leave the intended operation, parameters, or target region underspecified. We study a semi-formal transcript-grounded edit instruction that specifies operation categories and parameters and binds them to transcript spans or boundaries. This semantic timeline avoids explicit timestamp alignment and provides an externally inspectable contract for compositional edits. We instantiate the interface in dots$.$tts$.$edit, a speech editing model built on a continuous autoregressive speech generation architecture. Four representative speech-creation controls cover lexical content, affective expression, pitch and speaking-rate delivery, and temporal phrasing through text, emotion, prosody, and pause editing. Task-specific data pipelines construct operation- and scope-controlled pairs while retaining source-derived context outside each target region. We further introduce doteBench, a bilingual benchmark that measures precise instruction following, local preservation, and audio quality across the four controls and their composition. Experiments show leading overall instruction following and local preservation across its five editing categories, while audio quality remains comparable to existing open-source systems. Across three Seed-TTS-Eval shards, the model shows negligible differences from the base model in zero-shot TTS recognition error rate and speaker similarity.

cs.SD · cs.AI · cs.CL · eess.AS

版本更新 · v3arXiv:2609.32782

Learning response-aware patient dynamics for respiratory support

Xiaolei Lu, Shamim Nemati

原文摘要

Respiratory support can shape the short-term physiological trajectory of critically ill patients, but patients receiving the same intervention may follow different physiological trajectories. Clinical patient dynamics models typically predict future states from recent physiology and recorded interventions, while physiological change is mainly represented through the predicted future state. We propose a response-aware patient dynamics model that explicitly represents physiological change during autoregressive state updating. The model decomposes predicted physiological change into state-dependent baseline dynamics and respiratory-support-associated deviations, with room air providing a reference for the decomposition. We provide a formal analysis of this reference-anchored formulation. A response pathway encodes the predicted physiological change and uses it to update the latent patient state across the forecast horizon. Across ICU cohorts from two independent institutions, the proposed model achieves comparable overall trajectory prediction to patient dynamics baselines, with more consistent improvements when physiological states are changing.

cs.AI

版本更新 · v2arXiv:2606.10323

Semantic Multi-Agent Intrusion Detection for IoT:Zero-Day and Adversarial Threats with Risk-Aware Reasoning

Saeid Jamshidi

原文摘要

The rapid proliferation of Internet of Things (IoT) devices has enabled unprecedented automation and connectivity, but it has also substantially increased the attack surface, exposing networks to sophisticated cyber threats, including zero-day and adversarial intrusions. Traditional Intrusion Detection Systems (IDS) struggle to generalize to unseen attacks, often require substantial computational resources, and lack interpretability, particularly in resource-constrained and heterogeneous IoT networks. Recent advances, including Deep Learning (DL), open-set detection, and Large Language Model (LLM)-based semantic reasoning, address some of these challenges but typically focus on zero-day and adversarial threats and rarely combine semantic reasoning with multi-agent systems. To overcome these limitations, we propose a semantic multi-agent ID that integrates four specialized agents (e.g., Scout, Mutator, Auditor, and Arbiter) that leverage semantic embeddings and multi-stage probabilistic decision fusion. The Scout induces structured hypotheses from semantic embeddings; the Mutator generates adversarially constrained variants; the Auditor evaluates consistency and filters unreliable outputs; and the Arbiter produces interpretable, risk-aware alerts. Extensive experiments across multiple real-world IoT datasets demonstrate that the proposed system achieves 95.9% overall detection accuracy, reduces false-positive rates to 6.8%, improves zero-day detection to 87.9%, and maintains computational efficiency suitable for edge deployment.

cs.CR

版本更新 · v2arXiv:2610.22225

Safe and Fuel-Efficient Motion Planning for Lunar Propulsive Drones

Elena Wittemyer, Grace Gao

原文摘要

Propulsive drones are a promising new technology for generating high-resolution terrain models of the Moon. In future lunar missions, propulsive drones will complete a series of hops across the lunar surface while capturing images with downward-facing cameras. We present an autonomous motion planning framework that uses a vision-guided optimal control strategy for performing safe, efficient hops between specified waypoints. The drone plans parabolic hops between waypoints generated by a global-level planner; if a nominal waypoint is unsafe or unreachable, the drone then completes a diversion maneuver to safely land. To evaluate the validity of potential landing sites, we develop a custom semantic segmentation model for identifying obstacles from aerial images, and we introduce an approach for rapidly calculating reachable terrain. We then use model predictive control (MPC) to robustly track hop trajectories that guide the drone towards safe landing sites. We test the optimal hop planner in a high-fidelity lunar simulation environment. Our results demonstrate that our unified motion planning framework yields safe, fuel-efficient hop trajectories which can be tracked rapidly and with low error via MPC.

cs.RO

版本更新 · v2arXiv:2610.33745

POD-RoPE: Rotary Position Encoding over Physical Observation Distributions for Embodied AI

Xiaodi Huang, Zilin Wang, Jinpeng Liu, Pengchuan Xiao, Zhenlei Shao, Zhang Zhang

原文摘要

Embodied perception requires positional representations that capture both physical geometry and the spatial and temporal extent of observations. We introduce POD-RoPE (Physical Observation Distribution RoPE), which represents token observation footprints as distributions over camera centers, viewing directions, and sampling times. Under independent sampling, expected rotations encode relative relationships between distributions; when each distribution collapses to a single address, the construction recovers pointwise RoPE. The same rotation statistics support Q/K matching and coherence-dependent V/O transformations, allowing observation geometry to guide both information selection and content aggregation. Per-token pre-aggregation avoids increasing sequence length or processing pairs of observation nodes. We evaluate POD-RoPE across four robot policy architectures, simulation and real-world manipulation, and complementary reconstruction, depth-estimation, and novel-view-synthesis tasks. Integrating POD-RoPE into Fast-WAM improves mean success from 91.83% to 92.88% across all 50 RoboTwin 2.0 tasks, and from 32.5% to 52.5% on two real-robot tasks on Sharpa North. Controlled reconstruction ablations support the contributions of distribution encoding and V/O transformations. In H20 model-block benchmarks, POD-RoPE achieves median forward-plus-backward speedups of $1.91\times$ over P-RoPE and $5.34\times$ over RayRoPE, with a median latency overhead of 17.4% over Standard RoPE. These results support physical observation distributions as an effective and computationally efficient basis for geometry-aware attention.

cs.RO · cs.AI

版本更新 · v3arXiv:2603.28421

Learning unified control of intrinsic nonlinear spin dynamics in atomic qudits for magnetometry

C. Z. Cao, J. Z. Han, M. Xiong, M. Deng, L. Wang, Q. Liu, X. Lv, M. Xue

原文摘要

Generating and preserving metrologically useful quantum states is a central challenge in quantum-enhanced metrology. In low-field atomic magnetometry with multilevel atoms, the nonlinear Zeeman (NLZ) effect is both a resource and a limitation. It can generate internal spin squeezing within a single atomic qudit, but under fixed readout it also rotates and distorts the measurement-relevant quadrature, limiting the usable metrological gain. The problem is further complicated by the time dependence of both the squeezing axis and the nonlinear evolution itself. Here we show that reinforcement learning can transform NLZ dynamics from a source of readout degradation into a sustained metrological resource. Using only experimentally accessible low-order spin moments, a trained agent identifies a unified control policy for this class of intrinsically nonlinear sensing dynamics. We illustrate the approach in the \(f=21/2\) manifold of \(^{161}\mathrm{Dy}\), where the learned policy rapidly prepares strongly squeezed internal states and stabilizes more than \(4\,\mathrm{dB}\) of fixed-axis spin squeezing under continuous NLZ evolution. Including state-preparation overhead, the learned protocol yields a single-atom magnetic-field sensitivity of \(13.9\,\mathrm{pT}/\sqrt{\mathrm{Hz}}\), approximately \(3\,\mathrm{dB}\) beyond the standard quantum limit. Our results establish learning-based control as an experimentally feasible route for converting unavoidable intrinsic nonlinear dynamics in multilevel atomic sensors into operational metrological advantage.

quant-ph · cs.AI

版本更新 · v2arXiv:2609.02677

Eliciting ESG Preferences for Reinforcement Learning-Based Portfolio Optimization

Giovanni Dispoto, Marcello Restelli, Carmine Ventre

原文摘要

Modern portfolio management increasingly demands a balance between traditional risk-adjusted returns and strict Environmental, Social, and Governance (ESG) mandates. Current Reinforcement Learning (RL) approaches typically optimize for a single ESG provider, neglecting the significant divergence in rating methodologies across the industry and the unintuitive nature of manually weighting conflicting objectives. This paper addresses these limitations by formulating ESG-aware portfolio optimization as a Multi-Objective Reinforcement Learning (MORL) problem that simultaneously incorporates ratings from three distinct ESG agencies. To bridge the gap between high-dimensional algorithmic trade-offs and human decision-making, we integrate a Preference Elicitation framework using Gaussian Processes. This system enables practitioners to align the RL policy behavior with their preferences through intuitive pairwise comparisons of candidate portfolios based on their Sharpe ratios and aggregate ESG scores. We systematically evaluate our framework by employing prompt-conditioned LLMs as synthetic preference oracles under varied regional conditions and assess how the methodology adapts to heterogeneous investment behaviors and sustainability preferences. The experiments demonstrate feasibility in a controlled synthetic setting and characterize sensitivity to oracle and prompt design.

q-fin.PM · cs.CE · cs.LG

版本更新 · v4arXiv:2603.25184

Train at Moving Edge: Online-Verified Prompt Selection for Efficient RL Training of Large Reasoning Model

Jiahao Wu, Ning Lu, Shengcai Liu, Kun Wang, Yanting Yang, Baijiong Lin, Chen Jason Zhang, Li Qing 等 9 位作者

原文摘要

Reinforcement learning (RL) has become essential for post-training large language models (LLMs) in reasoning tasks. While scaling rollouts can stabilize training and enhance performance, the computational overhead is a critical issue. In algorithms like GRPO, multiple rollouts per prompt incur prohibitive costs, as a large portion of prompts provide negligible gradients and are thus of low utility. To address this problem, we investigate how to select high-utility prompts before the rollout phase. Our experimental analysis reveals that sample utility is non-uniform and evolving: the strongest learning signals concentrate at the ``learning edge", the intersection of intermediate difficulty and high uncertainty, which shifts as training proceeds. Motivated by this, we propose HIVE (History-Informed and online-VErified prompt selection), a dual-stage framework for data-efficient RL. HIVE utilizes historical reward trajectories for coarse selection and employs prompt entropy as a real-time proxy to prune instances with stale utility. By evaluating HIVE across multiple math reasoning benchmarks and models, we show that HIVE yields significant rollout efficiency without compromising performance.

cs.LG · cs.AI

版本更新 · v3arXiv:2610.00391

Interpretable Synthetic Medical Tabular Data Generation for Clinical Decision Support Using Fuzzy Cognitive Maps

Michael Vasilakakis, Dimitris K. Iakovidis

原文摘要

Synthetic medical tabular data generation has become essential for developing and validating computer-based medical systems (CBMSs) when real clinical data is restricted due to privacy, ethical, or data availability limitations. Existing probabilistic and deep generative models often lack interpretability and fail to preserve clinically meaningful dependencies, limiting their suitability for safety-critical applications. This paper proposes a novel application of Fuzzy Cognitive Maps (FCMs) in a framework for synthetic medical tabular data generation with explicit causality and privacy preservation. Clinical features are described using linguistically interpretable fuzzy sets, and inter-feature dependencies are encoded as FCM edge weights computed from fuzzy set intersections. Synthetic patient records are generated by propagating randomly initialized linguistic activation vectors through the FCM until convergence, followed by defuzzification to produce clinically coherent numerical values. The approach natively handles mixed data types, and domain constraints common in health records. Experimental evaluation on UCI medical benchmark datasets demonstrates competitive performance under a Train-on-Synthetic-Test-on-Real (TSTR) protocol. The proposed method achieves accuracy of up to 0.81 and AUROC of up to 0.90 on the Heart Disease dataset, matching or exceeding TVAE and Gaussian Copula baselines while running exclusively on CPU. Fidelity metrics including KS Complement (up to 0.91) and Correlation Similarity (up to 0.95) confirm strong statistical coherence, and DCR Baseline Protection scores consistently exceed those of TVAE, confirming adequate privacy guarantees. These results demonstrate that causally grounded, interpretable fuzzy modeling offers a computationally efficient and transparent alternative to deep generative models for trustworthy synthetic data generation in CBMSs.

cs.LG · cs.AI

版本更新 · v3arXiv:2512.21320

Adaptive Allele-Haplotype Incidence Indexing for Pangenome Queries: Representation, Reconstruction, and Benchmarking

Roberto Garrone

原文摘要

Population-scale analysis of phased genetic variants requires both allele-carrier retrieval and ordered haplotype context. We examine H1, an adaptive allele-haplotype incidence-row index, and H2, a canonical edge-path representation derived from a fixed, nonoverlapping variant catalog. We prove conditional reconstruction of abstract H2 walks and distinguish this property from unrestricted equivalence to genomic variation graphs. A completed local notebook experiment used a chromosome 1 interval (20-22 Mb), 200 diploid individuals, 24,921 SNV/indel records, and 45 SVTYPE-annotated records. For 24,966 extracted nonreference rows across 400 haplotypes, the serialized H1 incidence-row files occupied 0.872 MiB with a simple adaptive layout and 1.126 MiB with a custom Roaring-like layout, versus 1.190 MiB for a bitmap-payload baseline; a whole-file Zstandard archive of the adaptive layout occupied 0.207 MiB. For a separately constructed nonoverlapping SNV projection containing 22,727 sites, indexed H2 edge sequences occupied 75,130,882 bytes in a raw format and 5,156,418 bytes with context-Huffman encoding (14.57-fold reduction). Carrier-equivalence and graph-adjacency assertions passed in the notebook, but full crosscallset phasing, nucleotide-level SV reconstruction, and comparison with production indexes remain unresolved. The measurements establish a restricted implementation feasibility result, not superior end-to-end pangenome compression.

q-bio.GN · cs.DB · cs.DS

版本更新 · v2arXiv:2608.28665

Understanding Temporal Semantic Stability in Open-Vocabulary UAV Perception through Metric 3D Fusion

Saurbh Singh Jamwal

原文摘要

Recent open-vocabulary segmentation models have significantly advanced semantic perception for UAVs, for aerial and remote-sensing imagery, yet predictions from moving platforms can remain temporally inconsistent across repeated observations of the same physical scene. While semantic segmentation is typically evaluated on single images, temporal reliability remains less explored despite its importance for long-horizon robotic perception. In this work, we investigate temporal semantic stability by associating frame-wise predictions with persistent world-space locations through metric 3D fusion. We introduce a voxel-level evaluation framework that jointly characterises final semantic agreement, Semantic Belief Drift (SBD), Observation Persistence (OP), and semantic uncertainty from accumulated evidence. Experiments on UAVid-3D-Scenes reveal substantial frame-wise semantic variation and show that high aggregate world-space agreement can overstate temporal stability when many locations have limited repeated-observation support. Persistence-stratified analysis shows that recurrent voxels expose substantially greater semantic disagreement, while higher-persistence voxels exhibit lower direct consecutive semantic-evidence divergence. This behaviour is observed across two segmentation backbones and remains consistent under variations in voxel resolution, geometric association, and temporal sampling density. Overall, conditions that reduce world-space recurrence can increase apparent aggregate stability, demonstrating that semantic consistency must be interpreted together with observation support. Our findings establish observation persistence as an essential conditioning variable for evaluating long-horizon semantic reliability and provide a framework for analysing temporal semantic behaviour beyond image-level prediction.

cs.CV · cs.RO

版本更新 · v2arXiv:2504.05515

How Do Solidity Versions Affect Vulnerability Detection Tools? An Empirical Study

Gerardo Iuliano, Davide Corradini, Michele Pasqua, Matteo Cicalese, Mariano Ceccato, Dario Di Nucci

原文摘要

Smart contract vulnerabilities pose significant security risks to the Ethereum ecosystem, driving the development of automated tools for detection and mitigation. Smart contracts are written in Solidity, a rapidly evolving programming language that continues to add features and improvements to enhance smart contract security. New versions of Solidity change the compilation process, potentially affecting how tools interpret and analyze smart contract code. We use Solidity as a case study to investigate a broader problem in software analysis: whether tool effectiveness remains stable as the underlying programming language and execution environment evolve. In this continuously evolving landscape, we investigated the compatibility of detection tools with different Solidity versions. More specifically, we analyzed detection tools by empirically assessing (i) their crash resilience, (ii) their detection effectiveness, and (iii) their execution time across different versions of Solidity. We collected 2,500 real-world smart contracts to construct a balanced wild dataset and created a separate injected-vulnerability dataset comprising 270 contracts. We extended SmartBugs, a framework that enables the execution of vulnerability detection tools for Solidity, adding 11 new tools. Results indicate that most tools are crash-resilient to version 0.4. However, 20% of the evaluated tools have been updated to remain compatible. Tool performance varies across Solidity versions and is affected by Solidity changes; execution time is higher in version 0.4.x, which was used for evaluation. We present a list of Solidity changes that affect tool performance and offer actionable takeaways for both researchers and practitioners.

cs.SE

版本更新 · v2arXiv:2606.09255

Who Is the Agent Talking To? Participant-Aware Role Switching for Embodied Student-Support Dialogue

Iro Samuel, Filip Janik, Ewa Olton, Robert Smales, Harris Spratt, Shea Tait, Md Zia Ullah, Yanchao Yu

原文摘要

We present RPO-PDT, an embodied conversational agent that adapts its conversational role to the current participant. It acts as a Per- sonal Development Tutor (PDT) when supporting students and as a simulated student when faculty rehearse tutoring strategies. Voluntary closed-set participant verification informs a confidence- controlled role manager: stable enrolled-faculty matches activate the Student role, while enrolled students and unmatched partici- pants use the default PDT role and uncertain observations cause no transition. The system combines Furhat interaction, Rasa or- chestration, institutional retrieval, safeguarding, and LLM-based generation. User control is preserved through manual role override, consent-based facial enrolment, temporary interaction identifiers, and explicit retention or deletion of enrolled profiles. The demon- stration exposes both role-switching behaviour and these privacy controls in interaction.

cs.RO

版本更新 · v3arXiv:2609.18866

Hamming Ideals and Grobner Bases for ISD-like Syndrome Decoding

Roberto La Scala, Marco Marchesin, Sharwan K. Tiwari

原文摘要

We investigate an algebraic approach to the Syndrome Decoding Problem, based on a reformulation of the Hamming weight constraint and its integration with the Information Set Decoding paradigm. We begin with a systematic analysis of the Hamming variety, deriving its defining equations in terms of elementary symmetric functions. Since these equations may have high degree, we exploit convolution identities for elementary symmetric functions, together with factorizations based on Lucas' identity, to derive an equivalent formulation with auxiliary variables and equations of bounded degree. Building on this modeling, we generalize the ISD paradigm through an ISD-like decoding strategy, implemented by the GBDecode algorithm, in which only a subset of an information set is fixed. This approach reduces the size of the combinatorial search space at the cost of solving the associated multivariate nonlinear systems. To handle this algebraic component, we employ the MultiSolve algorithm, which replaces a single Grobner basis computation with a collection of computations on simpler systems, obtained by exhaustively assigning a varying number of indeterminates over the finite field. This provides a tunable balance between combinatorial search and algebraic solving. We evaluate the resulting approach experimentally on instances of the Syndrome Decoding Problem for random binary linear codes, using parameters corresponding to the NIST Security Category 1 parameter set of the Classic McEliece cryptosystem. The experiments assess the feasibility of this combinatorial-algebraic approach and provide insights into the practical behavior of Grobner basis techniques within an ISD-like decoding framework.

cs.CR · cs.SC · math.AC

版本更新 · v2arXiv:2509.00728

A Survey on Open Dataset Search in the LLM Era: Retrospectives and Perspectives

Pengyue Li, Sheng Wang, Hua Dai, Zhiyu Chen, Zhifeng Bao, Brian D. Davison

原文摘要

High-quality datasets are typically required for accomplishing data-driven tasks, such as training medical diagnosis models, predicting real-time traffic conditions, or conducting experiments to validate research hypotheses. Consequently, open dataset search, which aims to ensure the efficient and accurate fulfillment of users' dataset requirements, has emerged as a critical research challenge and has attracted widespread interest. Recent studies have made notable progress in enhancing the flexibility and intelligence of open dataset search, and large language models (LLMs) have demonstrated strong potential in addressing long-standing challenges in this area. Therefore, a systematic and comprehensive review of the open dataset search problem is essential, detailing the current state of research and exploring future directions. In this survey, we focus on recent advances in open dataset search beyond traditional approaches that rely on metadata and keywords. From the perspective of dataset modalities, we place particular emphasis on example-based dataset search, advanced similarity measurement techniques based on dataset content, and efficient search acceleration techniques. In addition, we emphasize the mutually beneficial relationship between LLMs and open dataset search. On the one hand, LLMs help address complex challenges in query understanding, semantic modeling, and interactive guidance within open dataset search. In turn, advances in dataset search can support LLMs by enabling more effective integration into retrieval-augmented generation (RAG) frameworks and data selection processes, thereby enhancing downstream task performance. Finally, we summarize open research problems and outline promising directions for future work. This work aims to offer a structured reference for researchers and practitioners in the field of open dataset search.

cs.IR · cs.DB

版本更新 · v3arXiv:2607.26232

Image Forgery Detection under Generative and Composited Background Replacement: A Benchmark with Processing-Matched Controls

Bugra Alperen Uluirmak, Rifat Kurban

原文摘要

Consumer tools can now keep the subject of a photograph and replace, relight or edit everything behind it. Such edits place genuine people and objects in scenes they were never in, yet involve processing--resampling, harmonization, diffusion autoencoders--that also occurs in benign workflows. We introduce BG-REAL, a benchmark of 25,624 images built from 2,485 Open Images photographs with a dominant subject and real donor scenes. Each recipient is edited by donor compositing, learned harmonization, generative background inpainting, foreground-conditioned relighting and local background edits, and is paired with authentic controls that share the processing but not the semantic edit; all images of a recipient share file format and JPEG quality. Three generators (including FLUX.1 Fill), scene categories and subject classes are held out. Seven detectors published between 2022 and 2026 reach zero-shot AUROCs of at most 0.745 and have no useful operating point: manipulation localisers mark the preserved subject instead of the replaced background, and a detector of AI-generated images flags most authentic images passed through a diffusion autoencoder. After fine-tuning, the strongest detectors reach an AUROC of about 0.95, while re-implemented background-forgery detectors remain below 0.80. Controls show that full-background replacements by the training generators are detected from the edit itself, whereas local edits and SDXL and FLUX edits remain hard, and that full-background localisation largely reduces to subject segmentation. A model-agnostic training objective that uses the controls improves detection on unseen subjects for one detector and on local edits for another without changing in-distribution accuracy. The data are released.

cs.CV

版本更新 · v2arXiv:2610.24501

HiPPO Functional Memory: Coordinate-Queryable Attention for Irregular Time Series

Zhaodong Guo, Haoyun Feng

原文摘要

Irregular time series require models to answer temporal queries at arbitrary coordinates, yet existing approaches typically retain observation-dependent representations that must be repeatedly resolved for each query. We introduce HiPPO Functional Memory (HiPPO-FM), a functional-memory attention operator that compiles an irregular history into a reusable coordinate-addressable state. Instead of storing observation-indexed tokens or latent trajectories, HiPPO-FM writes observations into a fixed-rank functional space and performs direct coordinate evaluation through matched functional geometry. Kernel-smoothed HiPPO coordinates and Gram-based readout define a shared write/read mechanism, while observed-support self-attention enables content-dependent representations before compression. We characterize the induced finite-dimensional query space and derive an error decomposition separating functional geometry approximation from learned-memory mismatch. Across continuous-coordinate reconstruction, irregular representation learning, real-world extrapolation, and event-sequence prediction, HiPPO-FM consistently improves strong irregular time-series baselines, achieving strong reconstruction accuracy on Spiral, competitive performance across 20 UEA datasets, improved real-world extrapolation, and superior results on several irregular event benchmarks. After encoding, the compact functional state can be reused across different query sets without reprocessing the observation history.

cs.LG

版本更新 · v2arXiv:2604.09540

A Co-Design Approach to Physically-Informed Molecular Docking for Quantum Annealers

Francesco Micucci, Matteo Barbieri, Gabriella Bettonte, Domenico Bonanni, Anita Camillini, Anna Fava, Daniele Gregori, Andrea R. Beccari 等 9 位作者

原文摘要

Molecular docking is a crucial step in computer- aided drug design, involving the identification of ligand poses that are physically plausible within a protein pocket. Recent studies have shown that this problem can be formulated as a geometric weighted subgraph isomorphism, which can then be encoded as a QUBO and thus solved on D-Wave quantum annealers. In this work, we adopt a co-design approach, addressing molecular docking at the formulation and encoding levels, and examining how hardware topology affects solution quality on current quantum annealers. We propose new QUBO formulations that extend the state-of-the-art ones by including van der Waals, Coulomb, hydrogen bonding, and hydrophobic interactions. Experimental results show that incorporating physicochemical terms improves the average docking quality by more than 18% compared to the purely geometric baseline on D-Wave quantum annealers with the Pegasus topology, and by up to 29% on those with the Zephyr topology. The choice of topology, along with an improved encoding design, yields significant gains in embedding efficiency and the number of valid solutions. Our designs reduce the number of physical qubits required by up to 14.5% and decrease the chain break fraction by an order of magnitude, thereby enhancing confidence in the resulting solutions.

cs.ET · q-bio.BM

版本更新 · v3arXiv:2610.30448

Proba: A High-Performance, Low-Traffic Probabilistic Spatial Memory Streaming Prefetcher

Yinting Huang, Jacky Wong, Sam Ainsworth

原文摘要

Spatial Memory Streaming (SMS) prefetchers exploit recurring spatial access patterns across memory regions to predict future accesses. Despite their effectiveness, existing SMS-based designs suffer from coarse control over aggressiveness and limited adaptability to dynamic program behavior and historical patterns. In this work, we present Proba, a feedback-directed SMS-based prefetcher that integrates probabilistic pattern updates, marginal accuracy decision-making, and pattern accumulation over several trigger features to achieve fine-grained accuracy-coverage trade-offs. When accuracy deteriorates, Proba moderates its aggressiveness to prioritize accurate prefetches; conversely, when accuracy rises, it expands its coverage. Proba achieves higher speedups than any other SMS-based prefetcher while being vastly more efficient in DRAM traffic. This culminates in a large performance gap between Proba and other techniques in multicore and DRAM-constrained scenarios without harming single-threaded throughput.

cs.AR

版本更新 · v2arXiv:2610.16132

UniSGR-V2: Stepwise Target-Side Feature Anticipation and Crossing for Generative Recommendation

Jun Yang, Jiasi Chen, Jiawei Sun, Ziyue Guo, Jianan Yan, Tao Luo

原文摘要

Semantic-ID-based generative recommendation unifies retrieval and ranking through autoregressive decoding but differs structurally from discriminative models, which can directly access rich target-item side features. The attributes are compressed into a finite codebook during quantization, while the target item remains undetermined during decoding and its features cannot be looked up. This target-side feature vacuum weakens generation at each semantic-ID level through high conditional entropy and cascading errors, and final ranking through missing target-side feature crossing. Existing methods interact with candidate representations or generate discrete attribute tokens, but none reconstructs a continuous target-side representation inside decoding to support both stepwise generation and ranking. We propose TacGR (Stepwise Target-Side Feature Anticipation and Crossing for Generative Recommendation). Before decoding each codeword, TacGR anticipates a continuous target-side feature vector and crosses it with the semantic prefix and user behavior sequence inside the decoder. The crossed representation conditions current-level generation and is directly used for ranking. Continuous-vector regression risks a learnable target collapsing with its prediction and prediction noise propagating into generation through attention. TacGR addresses these challenges with a semantic-anchoring auxiliary tower and a unidirectional visibility mask, respectively. For extremely long industrial behavior histories, it introduces gated convolutional denoising to suppress noise and adapts the pyramid memory funnel to reduce inference cost. Offline experiments on a large-scale Lazada dataset show significant gains over OneRec, UniRec, and UniSGR. Online A/B testing improves IPV, Order, and GMV by 0.79%, 5.55%, and 3.09%, respectively.

cs.IR

版本更新 · v2arXiv:2604.14222

Adaptive Query Routing: A Tier-Based Framework for Hybrid Retrieval Across Financial, Legal, and Medical Documents

Afshan Hashmi

原文摘要

Retrieval-Augmented Generation (RAG) has become the standard paradigm for grounding Large Language Model outputs in external knowledge. Lumer et al. presented the first systematic evaluation comparing vector-based agentic RAG against hierarchical node-based reasoning systems for financial document QA across 1,200 SEC filings, finding vector-based systems achieved a 68% win rate. Concurrently, the PageIndex framework reported 98.7% accuracy on FinanceBench through purely reasoning-based retrieval. This paper extends their work by: (i) implementing and evaluating three retrieval configurations: Vector RAG, Tree Reasoning, and the proposed Adaptive Hybrid Retrieval (AHR), on a small controlled corpus of financial, legal, and medical documents; (ii) introducing a four-tier query complexity benchmark; and (iii) employing LLM-as-judge evaluation with GPT-4o-mini. Experiments reveal that Tree Reasoning achieves the highest overall score (0.900), but no single paradigm dominates across all tiers: AHR scores highest on cross-reference queries (0.850), all three methods tie on multi-section queries (0.929), and Vector RAG scores highest on the single multi-document query (0.900). Vector RAG has the lowest mean latency (1.61 s against 3.40 s for Tree Reasoning). On the first 50 publicly released FinanceBench questions, using the evidence snippets supplied with the benchmark as the retrieval corpus, Tree Reasoning scores 0.938, Hybrid AHR 0.901, and Vector RAG 0.821. Because the configurations also differ in document access, generation prompts and output length limits, these differences cannot be attributed to retrieval architecture alone. In these preliminary results the adaptive router does not outperform fixed tree reasoning overall (0.845 vs. 0.900); they motivate a larger evaluation of when query-based routing helps, rather than establishing its benefit.

cs.IR · cs.AI

版本更新 · v3arXiv:2606.11846

SheafStain: Sheaf-Theoretic Schrödinger Bridge for Spatially and Biologically Coherent Virtual Staining

Hyeongyeol Lim, Hongjun Yoon, Eunjin Jang, Daeky Jeong, Won June Cho, Hwamin Lee

原文摘要

Current virtual staining approaches offer the potential for time- and cost-efficient biomarker quantification in cancer diagnostics and prognostics. However, patch-wise inference for gigapixel whole-slide images fails to maintain spatial continuity, yielding artifacts that cause catastrophic mismatches with ground-truth images. Although pathology Vision Foundation Models (VFMs) offer rich representations, their self-attention causes varying global contexts to produce inconsistent embeddings for the same physical region. We formalize and validate this "context contamination" as a sheaf-theoretic problem where these embeddings form a presheaf whose sections disagree on overlaps, so no global section restricts to them. To address this, we propose SheafStain, a new approach that reinterprets VFM features as sheaf-like sections for spatially and biologically coherent virtual staining. Specifically, SheafStain integrates class and patch tokens into a Schrödinger Bridge framework as sheaf-like sections. While the class token anchors biological consistency, patch tokens form a per-position spatial map. A feature space from a single VFM encoder pretrained on Hematoxylin \& Eosin and Immunohistochemistry supervises both input conditioning and output stain alignment. Departing from prior work that evaluates on isolated $256 \times 256$ patches and either random-crops or resizes the $1024 \times 1024$ ground truth, we translate at $256 \times 256$ and evaluate on the stitched $1024 \times 1024$ outputs across HER2, ER, PR, and Ki-67. SheafStain demonstrates promising results against six prior methods while mitigating patch-boundary stitching artifacts. Code is available at https://github.com/deepnoid-ai/SheafStain.

cs.CV

版本更新 · v2arXiv:2510.02982

oRANS: Online optimisation of RANS machine learning models with embedded high-fidelity data generation

Daniel Dehtyriov, Jonathan F. MacArt, Justin Sirignano

原文摘要

Deep learning (DL) has shown promise for flow simulations, but progress is constrained by the scarcity of high-fidelity training data, which is costly to generate and limited to few flow conditions. Closures trained offline on such data tend to overfit and fail to generalise to new regimes. We introduce an online optimisation framework for DL-based Reynolds-averaged Navier-Stokes (RANS) closures. Training data is generated by a simulation at direct numerical simulation (DNS) resolution embedded in a subdomain of the RANS domain. The RANS solution supplies boundary conditions to the embedded simulation, which provides the mean velocity and turbulence statistics used to update the closure, which thereby adapts to the target flow without precomputed datasets. The approach is developed on the stochastically forced Burgers equation and on turbulent channel flow at $Re_τ=180$, 270, 395 and 590 with embedded domain lengths $1\leq L_0/L\leq 8$, and is then applied to spanwise-rotating channel flow at $Ro_b=0.15$ and $0.5$, a flow in which the Coriolis force vanishes from the equations of a linear eddy-viscosity closure. Online-optimised RANS models outperform offline-trained and literature-calibrated closures with modest embedded subdomains, and in the rotating channel recover the rotation-induced asymmetry from non-rotating inflow turbulence and a rotation-blind closure. The learned coefficients are interpretable, recovering near-wall damping and, under rotation, the collapse of the eddy viscosity on the stabilised side. Performance degrades when boundary contamination dominates or domains are too short to capture low-wavenumber modes. This framework provides a route to data-adaptive machine learning closures without large precomputed training datasets.

physics.flu-dyn · cs.LG

版本更新 · v2arXiv:2610.36910

Nothing Left Behind: Embedding Retrieval and Language Model Screening for High Recall Evidence Search

Giuliano Martinelli, Abelardo Carlos Martinez Lorenzo, Satvik Garg, Linxi Wang, Riccardo Orlando, Piriyakorn Piriyatamwong, Samuel Paul Fraiberger

原文摘要

AI systems that ground their answers from retrieved documents usually need only a few relevant passages, but applications such as systematic reviews and legal discovery need nearly all of them, because their conclusions rest on the full body of evidence. These applications have traditionally searched with curated taxonomies, which can only find what their vocabulary describes. We compare taxonomy-based retrieval with an alternative neural retrieval based on sentence embeddings and followed by language model screening in ImpactAI, an evidence synthesis application built on 7,354 randomized trials. Measured against the studies included in 29 systematic reviews, the share of studies found rises from 45% to 85%, and the screening model agrees with human annotators as well as annotators agree with each other. This gain comes at a cost in speed: at the median, retrieving and screening evidence for a query takes 77 seconds, against 6 seconds for taxonomy retrieval. The results suggest finding evidence with embeddings, organizing it with taxonomy labels, and setting how many candidates to screen according to the time available for each query.

cs.CL

版本更新 · v2arXiv:2602.06600

Echoes as Anchors: Probabilistic Costs and Attention Refocusing in LLM Reasoning

Zhuoyuan Hao, Zhuo Li, Wu Li, Fangming Liu, Min Zhang, Jing Li

原文摘要

Recent work improves reasoning in large reasoning models (LRMs) by test-time scaling through self-consistency and parallel thinking, adding generic "thinking tokens", or presenting the question twice, as in re-reading (RE2). However, these approaches either inject task-agnostic tokens or mandate heuristics that do not explain, and often ignore, the spontaneous repetition that many LRMs exhibit at the head of their long chain-of-thought (CoT). In this work, we analyze and harness the model's tendency to restate the question, dubbed Echo of Prompt (EOP), as a front-loaded, compute-shaping mechanism, which can be viewed as self-generated prompt repetition inside the reasoning trace rather than in the input. Specifically, we formalize its probabilistic cost by casting echo removal as rejection-based conditioning, and define the Echo Likelihood Gap $Δ\mathcal{L}$ as a computable proxy linking early repetition to likelihood gains and downstream accuracy. We find that (1) in a causal intervention, reinserting an echo into failed GSM8K traces raises exact match by 7.9-10.4 points for two reasoning models but not for a non-reasoning base model; and (2) in length- and suffix-controlled likelihood analyses and layer-wise attention studies conducted to show that EOP's benefits go beyond verbosity, EOP increases answer to answer-prefix attention in middle layers, consistent with an attention refocusing mechanism. Building on these findings, we develop Echo-Distilled SFT (ED-SFT) to instill an "echo-then-reason" pattern through supervised finetuning, and training-free Echoic Prompting (EP) to re-ground the model mid-trace. We evaluate on GSM8K, MathQA, Hendrycks-MATH, AIME24, and MATH-500 under identical decoding settings and budgets, and find consistent gains over baselines, including thinking-token insertion. Our code is publicly released at https://github.com/hhh2210/echoes-as-anchors.

cs.CL

版本更新 · v2arXiv:2610.18564

Observation Quality in DSM-Assisted Aerial Localization: A Benchmark and Base-Anchored Uncertainty Calibration

Pengyu Yin, Jie Pan, Junxiang Tan, Mengqi Fu, Kun Cheng, Yifan Liu

原文摘要

Aerial map matching provides position observations for navigation, but a position error alone does not determine how an observation should be weighted. We define five benchmark tasks: position availability and agreement, grouped error structure, predictive uncertainty, controlled updates, and temporal accumulation. We use digital-surface-model-assisted localization to test whether base-anchored uncertainty calibration improves the weighting of unchanged position estimates. The method combines propagated image and map sensitivities with the second moment of a compact configuration subset relative to the reported position. Scale is fitted using separate position references without local surface-height ground truth. Thirteen covariance models are evaluated on two held-out query sets from locations represented in the calibration data. Using reference residuals, we compare the method with a constant full-matrix baseline. With all localization failures included, the method reduces the normalized position-update risk, averaged equally across locations, by 7.70% on 728 conditions and 5.46% on a separate 142 conditions under an independent prior. On the primary set, the equal-location average negative log likelihood on reference residuals improves by 2.571 nat. At these seen locations, exploratory base-only quality calibration and conditional-addition controls leave the incremental update benefit of configuration disagreement unresolved. Navigation benefit and real temporal accumulation remain untested.

cs.CV

版本更新 · v2arXiv:2603.16510

Simplified Algorithms and Improved Bounds for Motion Planning

Sarita de Berg, Joachim Gudmundsson, Peter Kramer, Christian Rieck, Sampson Wong

原文摘要

We investigate coordinated motion planning (CMP) for unit square robots in the plane under the $L_1$ metric. Given two arrangements of $k$ robots, we seek a movement schedule minimizing one of three objectives: the Min-Sum objective (sum of distances), the Min-Makespan objective (latest time of arrival) and the Min-Exposure objective (a new objective). For Min-Sum and Min-Makespan, we provide a simplified approach and improved bounds, compared to Eiben, Ganian and Kanj (SoCG 2023). To this end, we partition the configuration space based on the relative ordering of the robots. This leads to a simple and efficient framework to discretize the search space. Our results extend to several settings in the plane, including convex robots in convex domains and vertex robots in rectangular grids. Finally, we apply our results to the new Min-Exposure objective. Given a set of polygonal regions that provide cover, the task is to find a schedule with minimal elapsed time during which at least one robot is not fully covered. We give an $\mathcal{O}(n^4\log n)$ time algorithm that computes exposure-minimal schedules for $k=2$ robots, and an XP algorithm for arbitrary $k$.

cs.CG

版本更新 · v4arXiv:2601.22118

Defining Operational Conditions for Safety-Critical AI-Based Systems from Data

Johann Maximilian Christensen, Elena Hoemann, Frank Köster, Sven Hallerbach

原文摘要

Artificial Intelligence (AI) has been on the rise in many domains, including numerous safety-critical applications. However, for complex systems in the real world, defining the underlying environmental conditions in which the AI-based system must operate---the Operational Design Domain (ODD)---is extremely challenging. This often results in an incomplete description of the ODD, which contrasts with the requirements of many domains for certifying AI-based systems. Traditionally, the ODD is created in the early stages of the development process, drawing on sophisticated expert knowledge and related standards. This paper presents a novel method for defining the ODD a posteriori from previously collected data using a multidimensional kernel-based representation. This approach is validated through both synthetic benchmarks and a real-world aviation use case. Moreover, the paper defines similarity of two ODDs if they generate the same outputs up to Lebesgue-null input sets and proves convergence in volume of the calibrated representation under the stated assumptions. The novel, safety-by-design, deterministic kernel-based ODD representation is derived fully automatically, given documented assurance inputs, permutation-stable, bounded by construction, and, under affine-equivariant per-dimension normalization, invariant to the choice of units. Utilizing the proposed ODD representation supports future certification of data-driven, safety-critical AI-based systems.

cs.AI