跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 02:35 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-15 02:35最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

找到 351 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 02:34(北京时间)
版本更新 · v2arXiv:2404.03689

高斯过程学习型模型预测控制教程

A Tutorial on Gaussian Process Learning-based Model Predictive Control

Jie Wang, Youmin Zhang

AI 速读 基于摘要

本教程面向实现,系统讲解高斯过程学习型模型预测控制(GP-MPC),重点给出GP增强预测模型多步均值与协方差传播的逐步推导,并区分仅均值与不确定性感知两类设计。

cs.RO · cs.LG · eess.SY

查看原文摘要

This tutorial provides an accessible and implementation-oriented introduction to Gaussian process learning-based model predictive control (GP-MPC), which combines probabilistic residual modeling with receding-horizon control. Its central tutorial contribution is a detailed, step-by-step derivation of multi-step mean and covariance propagation for GP-augmented prediction models. The derivation shows how commonly used propagation formulas follow from the laws of total expectation and total covariance, and clarifies the roles of the GP posterior mean, GP posterior covariance, uncertain inputs, and query-output cross-covariances. Building on this foundation, the article distinguishes mean-only unconstrained GP predictive control from uncertainty-aware constrained GP-MPC, clarifies regulation and output-tracking formulations, and provides concise implementation and computational-complexity guidance, including practical software-tool references and discussion of the scope of closed-loop guarantees. Mobile-robot path-following examples illustrate mean-only unconstrained implementations, whereas mixed-vehicle platooning illustrates uncertainty-aware constrained GP-MPC with uncertainty-dependent safety-distance tightening. The tutorial is intended to help researchers and practitioners understand, implement, and critically evaluate GP-MPC designs for robotic and autonomous systems operating under modeling uncertainty.

新论文 · v1arXiv:2611.16789

ScrewSense: Mapping the Invisible - Anomaly Detection and Error Classification in Screwdriving Processes

Tobias Lettner, Tatyana Ivanovska, Anwar Al Assadi, Christian Bergler

原文摘要

The growing volume of process data generated by screwdriving systems, combined with advancements in computing power, data storage, and algorithms, is facilitating the application of artificial intelligence in this field. Accurately detecting and classifying screwdriving errors is crucial for ensuring product quality, avoiding costly rework in manufacturing, and supporting sustainability by facilitating the maintenance, reuse, and recycling of screw-connected products. In this context, machine learning approaches offer a promising alternative to traditional monitoring techniques, such as window-based methods or envelope curves. This study examines the use of deep learning techniques for anomaly detection and error classification in screwdriving processes. The data corpus consists of multivariate time series capturing process parameters, such as torque and rotation angle. For anomaly detection, the embedding space of a vector quantized variational autoencoder was analyzed. In terms of error classification, four different model architectures were evaluated. The results demonstrate the effectiveness of anomaly detection and confirm that deep learning models can distinguish between multiple error categories beyond traditional binary classification. This extends the capabilities of conventional monitoring approaches, achieving accuracies of up to 100%. Additionally, real-world data material was examined in order to further demonstrate model robustness. Overall the results indicate strong generalization capability and highlight the practical potential of the developed models for use in industrial screwdriving processes, eliminating the need for expert knowledge in error identification and significantly reducing manual effort and analysis time.

cs.LG · cs.RO · eess.SP

版本更新 · v2arXiv:2610.34390

Controlled Block Proximal Linearized Method for Nonconvex and Nonsmooth Optimization

Weifeng Yang

原文摘要

In this paper, we consider multiblock nonconvex and nonsmooth optimization without assuming bounded iterates or coercivity of the original objective. We propose the Controlled Block Proximal Linearized (CBPL) method, whose control potentials establish boundedness while retaining the original objective, constraints and variables. We prove finite length and whole-sequence convergence to an effective critical point of the original objective, where one limiting subgradient annihilates all effective feasible directions. We establish finite total variation of the original objective and block functions, summable original effective residuals, and finite termination and linear or sublinear convergence rates for the original objective values. Scale orthogonality further gives full original criticality and, for homogeneous balancing controls, summable absolute objective errors with an $o(1/K)$ best-iterate bound. We establish a complete degeneracy theory for graph-regularized nonnegative factorizations: scale criticality is equivalent to graph collapse, and full criticality eliminates graph action; our controls prevent this collapse while retaining genuine reconstruction changes. Furthermore, our proposed method provides the practical, simple, and effective schemes for these applications, combining guaranteed convergence with explicit closed-form updates that can be applied directly to solve the original problems. We apply CBPL to graph-regularized sparse nonnegative matrix factorization with $\ell_0$-constraints ($\ell_0$-GSNMF), graph-regularized sparse nonnegative canonical polyadic (CP) decomposition with $\ell_0$-constraints ($\ell_0$-GSNCP), and graph-regularized sparse nonnegative independent-core matrix tri-factorization with $\ell_0$-constraints ($\ell_0$-GSNMTF). Numerical experiments demonstrate effectiveness, convergence and structural control.

math.OC · cs.LG

版本更新 · v2arXiv:2606.21103

On the Reachability Problem on Monoid-Labelled Undirected Graphs

Nagashri Krishnakumar, Harshil Mittal, Jayalal Sarma

原文摘要

The labelled reachability problem for undirected graphs with edges labelled by elements of a monoid $M$ (more generally, groupoids or magmas) captures the classes $\sf{L}$ and $\sf{NL}$. Given a graph $G(V, E)$ labelled by $φ~\colon E \to M$, $s,t \in V$ and an accepting subset $F \subseteq M$, the problem asks to test whether there is a walk $P$ from $s$ to $t$ in $G$ where $φ(P) \in F$. Ramaswamy et al. (2019) studied the variant where the accepting element is part of the input for aperiodic monoids and groups. Motivated by the success in designing space-bounded algorithms for the undirected graph reachability problem, we study the labelled reachability problem when the accepting set is also fixed. This reveals finer complexity bounds and dichotomies for the problem based on the monoid and the accepting set. Previous results imply that the problem is in $\sf{L}$ for any finite accepting subset when $M$ is a group or belongs to $\sf{DA}$. We prove the following (for finite monoids): 1) For any monoid $M$, the problem is in $\sf{L}$ when the accepting element is the identity of $M$. If the accepting element is an idempotent, under suitable constraints, the problem is $\sf{NL}$-hard. 2) For any commutative monoid $M$, the problem is in $\sf{L}$ for all $F \subseteq M$. 3) For any $\mathcal{L}(\mathcal{R})$-commutative union-of-groups (UoG) monoid $M$, the problem is in $\sf{L}$ for all $F\subseteq M$. We show deterministic logspace algorithms for UoG monoids that are neither $\mathcal{L}$-commutative nor $\mathcal{R}$-commutative, under certain constraints. 4) For the monoids $\sf{BA_2}$ and $\sf{U}$, we show a dichotomy: for all $F \subseteq M$, the problem is either $\sf{NL}$-complete or in $\sf{L}$. Our results exploit the connection between Green's relations in the UoG monoids and the properties of the product graph (a graph introduced by Ramaswamy et al. (2019)).

cs.CC

新论文 · v1arXiv:2611.16269

FlowIR: Depth-driven Rectified Flow for Resolving Thermal Ambiguity in Infrared Super-Resolution

Xingyue Zhu, Qinyun Mei, Zhexi Min, Yang Zou, Xingyuan Li, Zhiying Jiang, Jinyuan Liu

原文摘要

Distinguishing different heat sources in low-resolution infrared (IR) images is inherently difficult, as multiple thermal emitters often collapse into ambiguous and overlapping responses. Existing super-resolution methods hallucinate structures from such ambiguous 2D evidence, leading to thermal drift, boundary merging, and unreliable restoration under infrared degradations. We propose FlowIR, a depth-driven rectified flow framework that resolves thermal ambiguity by injecting 3D geometric cues into the generation process. Pseudo-3D depth lifting and depth-guided 3D convolutions disentangle overlapping foreground objects, while cluster-wise inter-attention suppresses cross-source feature contamination. A Thermal-Geometry Consistency Loss further enforces geometric alignment during refinement. Built upon a lightweight rectified flow backbone, FlowIR restores IR images in only a few steps, producing sharply separated, degradation-robust, and geometrically faithful high-resolution results.

cs.CV

版本更新 · v3arXiv:2603.18859

RewardFlow: Can Action-Level Reward Be Estimated from State-Graph Topology in Agentic RL?

Xiao Feng, Bo Han, Zhanke Zhou, Jiaqi Fan, Jiangchao Yao, Ka Ho Li, Dahai Yu, Michael Kwok-Po Ng

原文摘要

In agentic tasks such as household assistance and web shopping, large language model (LLM) agents take multiple actions before receiving a final outcome indicating success or failure. For reinforcement learning (RL), this outcome obscures individual actions' contributions: a shopping trajectory may find the right product but fail to complete the purchase. To address this credit-assignment problem, we introduce RewardFlow, which connects multiple trajectories for the same task through shared states (states grouped by task-relevant equivalence or semantic similarity). The resulting directed state graph links observed trajectory segments. Therefore, an action in a failed trajectory may reach a state from which another trajectory succeeds. It propagates reward signals backward from states where the task succeeds, assigning state potentials that decrease with shortest-path distance to success in the graph. Potential differences then reward actions that reduce this distance, bringing the agent closer to success in the graph. These estimated rewards yield action-level advantages that complement trajectory-level advantages from outcome rewards during policy optimization, without a learned process reward model or manual action-level annotations. Experiments on ALFWorld, WebShop, Sokoban, and search tasks show gains over RL baselines across model scales. With 3B policies, graph construction and reward estimation take $1.47$-$2.39$ seconds per training step on ALFWorld, WebShop, and Sokoban (Fig. 1). Code is available at https://github.com/tmlr-group/RewardFlow.

cs.AI · cs.CL · cs.LG

新论文 · v1arXiv:2611.16088

Subsurface schematisation from sparse CPT data using the tabular foundation model TabPFN

Taiga Saito, Fabian Campos Montero, Bruno Zuada Coelho, Ana Martins Teixeira, Stephen Wu, Timo Schweckendiek, Yu Otake

原文摘要

Subsurface schematisation supports geotechnical decisions but remains challenging because sparse site-investigation data leave substantial gaps in information about ground conditions. This study explores TabPFN, a foundation model pretrained on general synthetic tabular data, for this task. Using only grid coordinates and soil behaviour type index observations from sparse cone penetration tests (CPTs), we first reconstruct two-dimensional sections without geotechnical fine-tuning or predefined layer boundaries. We evaluate the approach on synthetic sections and at two field sites in the Netherlands, comparing it with SchemaGAN, a conditional generative adversarial network trained on synthetic geotechnical sections, and with reference interpolation methods. In the baseline comparisons, TabPFN achieved mean errors close to SchemaGAN's on synthetic sections and lower mean errors at both field sites. On synthetic sections, TabPFN's mean absolute error decreased at each tested increase in CPT count, and, under the baseline input setting, its pointwise prediction intervals had mean coverage close to nominal levels. Subsequent fine-tuning on the synthetic sections used to train SchemaGAN improved synthetic test accuracy but increased mean errors at both field sites. These findings indicate that general-purpose tabular foundation models offer a promising route for updating subsurface predictions from sparse and evolving site-investigation data without retraining.

cs.LG · cs.AI

版本更新 · v2arXiv:2605.05871

Retain-Neutral Surrogates for Min-Max Unlearning

Junhao Cai, Dohun Kim, Dowon Kim, Sung Il Choi, Chengjun Jin, Juhyun Park, Changhee Joo

原文摘要

Machine unlearning aims to make a model forget designated training data while retaining performance on the rest. In min-max unlearning, an inner adversary perturbs the model to maximize the forget loss, and the model is updated to minimize the retain loss at the resulting surrogate point. When the forget and retain gradients are positively coupled, the standard perturbation also moves toward higher retain loss, and the retain step begins by recovering that loss. We propose Retain-Orthogonal Surrogate Unlearning (ROSU), which redefines the adversary to admit only perturbations orthogonal to the retain gradient. The one that raises the forget loss fastest has a closed form, and ROSU uses it to set the surrogate point and amplifies it into the forgetting step. Under positive coupling the ROSU surrogate avoids the retain cost that coupling induces in the standard surrogate, and the difference shrinks as the gradients approach orthogonality. ROSU has the smallest accuracy gap to retraining in every vision setting (CIFAR-10, CIFAR-100, Tiny-ImageNet) and is competitive with the baselines on language benchmarks (TOFU, WMDP). The redefinition helps most under high positive coupling. Code is available at https://github.com/unlearn-ml/machine-unlearning.

cs.LG

版本更新 · v2arXiv:2507.04575

Lilith: Developmental Modular LLMs with Chemical Signaling

Mohid Farooqi, Alejandro Comas-Leon

原文摘要

Current paradigms in Artificial Intelligence rely on layers of feedforward networks which model brain activity at the neuronal level. We conjecture that expanding to the level of multiple brain regions with chemical signaling may be a productive step toward understanding the emergence of consciousness. We propose LILITH, a novel architecture that combines developmental training of modular language models with brain-inspired token-based communication protocols, mirroring chemical signaling in the brain. Our approach models distinct brain regions as specialized LLM modules including thinking, memory, sensory, and regulatory components that communicate through emergent token-based signaling protocols analogous to neurotransmitter networks. Unlike traditional pre-trained systems, LILITH would employ developmental training where untrained LLM architectures learn through simulated life experiences, developing communication pathways and cognitive abilities through environmental interaction and evolutionary optimization. This framework would enable direct empirical investigation of consciousness emergence using Integrated Information Theory metrics while providing unprecedented insight into inter-module signaling patterns during development. By optimizing for consciousness emergence rather than task performance, LILITH could provide insight into different emergent phenomena at multiple levels of neural correlates, contrasting neuronal-level processing with multi-region coordination dynamics. The goal of this paper is to put the idea forward while recognizing the substantial challenges in implementing such a system.

q-bio.NC · cs.AI

新论文 · v1arXiv:2611.15488

FloCOS: Predicting Compact Forward Occupancy Sets of Surrounding Vehicles via Conditional Flow Matching

Chuansheng Dong, Yinxiao Zhan, Zongdian Li, Peng Hou, Jin Wang, Jiayu Fan

原文摘要

Existing methods for predicting surrounding vehicles' forward occupancy may under-approximate the ground-truth occupancy, exposing the ego vehicle to collision risk, or produce overly conservative regions that unnecessarily restrict feasible space and cause planning failures. To address these issues, we propose FloCOS, a conditional flow-matching framework that predicts compact forward occupancy sets with high occupancy coverage. FloCOS represents the forward occupancy set as a time-varying union of half-space convex polygons parameterized by temporal basis coefficients. Conditional flow matching captures the conditional distribution of these coefficients to govern the temporal evolution of the convex components, trained under coverage and union-area losses that penalize missed occupancy and excess area. For downstream trajectory optimization, the predicted nonconvex union is directly incorporated into hyperplane-based collision-avoidance constraints. Evaluations on the Waymo Open Motion Dataset show that FloCOS generates compact forward occupancy sets with high coverage and achieves a higher interaction completion rate than evaluated baselines. Real-world vehicle experiments further confirm its ability to support collision-free planning in interactive scenarios.

cs.RO

新论文 · v1arXiv:2611.15372

LLMRunner: Closed Workload Model Performance Testing Framework for LLM Servings

Arush Upadhyaya, Debadatta Mishra

原文摘要

Performance testing large language model (LLM) serving engines is a crucial requirement considering the criticality of the infrastructure for deploying conversational AI at scale. Most of the benchmarking tools used to carryout performance evaluation of LLM serving do not capture realistic workload orchestration unlike closed workload performance testing infrastructure used in other domains such as web and database engines. For example, state-of-the-art LLM benchmarks for performance testing model traffic as streams of independent single-turn and stand-alone requests omitting the end-user behavior such as think-time between conversational turns. We present LLMRunner, a performance tester for LLM serving that addresses this gap by providing a framework to generate realistic load consisting of multi-turn conversations with configurable end-user parameters such as number of users in the workload loop, think-time distributions etc. Moreover, LLMRunner provides declarative matrix-sweep experiment plans, integrated GPU and KV-cache monitoring, and an automated artifact collection and plotting subsystem. We use LLMRunner to comparatively analyze the performance of LLM serving when NVIDIA CUDA Unified Virtual Memory (UVM) is used as a drop-in replacement memory allocator for the Key-Value cache (KV-Cache). Our test demonstrates that UVM incurs no measurable throughput or latency penalty compared to the baseline memory allocation technique for non-oversubscription scenarios.

cs.PF

新论文 · v1arXiv:2611.15346

Towards Better Legal Reasoning LLMs: Signal Balancing and Reward Scheduling

Yinghao Hu, Qian Xiao, Yuting Huang, Kaisong Song, Yiquan Wu, Ang Li, Junjie Cao, Jun Lin 等 10 位作者

原文摘要

In the legal domain, LLMs can improve reliability and interpretability by generating explicit reasoning traces. However, training LLMs to produce high-quality reasoning traces remains challenging. Existing supervised fine-tuning methods struggle when reasoning traces are significantly longer than final answers, as the learning signal for the answer becomes diluted. Meanwhile, reinforcement learning methods such as Group Relative Policy Optimization also have several limitations, including costly reward design, performance plateaus, and reward hacking. We therefore propose a two-stage training framework. In Stage I, JurisCoT-SFT employs a length-normalized dual objective to balance learning signals between reasoning traces and final answers. In Stage II, Lifecycle-Aware Backtrackable Policy Optimization dynamically evaluates and retires auxiliary reward signals based on their impact on final evaluation objectives, enabling efficient reward utilization. Our framework substantially improves legal reasoning performance on relevant tasks selected from multiple legal benchmarks, including ChJGBench, LawBench, and LegalBench. Experimental results demonstrate consistent improvements in both reasoning trace quality and final answer accuracy, while our models remain competitive with larger models.

cs.CL

新论文 · v1arXiv:2611.15217

Are We Ready for Snow-tonomous Driving? Challenges Toward Robust Automated Driving in Extreme Weather

Eren Erdal Aksoy, Abu Mohammed Raisuddin, Thien-Thu Ngo, Eren Aydemir, Osman Tahir Ekşi, Paula Litkey, Petri Manninen, Heikki Hyyti 等 29 位作者

原文摘要

Automated driving has gained remarkable momentum over the past decade, with both industry and academia investing substantial resources in developing perception and control solutions to advance vehicle autonomy. However, these efforts have largely focused on clear-weather scenarios, leaving harsh conditions, such as snow, rain, and fog, comparatively understudied. As a result, inclement weather remains one of the most significant hurdles for autonomous vehicles, often leading to substantial performance degradation in downstream perception and control tasks. In this paper, we present insights from the EU-funded Horizon Europe project ROADVIEW, which aims to develop robust, weather-aware perception and control modules for connected and automated vehicles operating under severe conditions, including snow, rain, and fog. Drawing on four years of large-scale development and real-world demonstrations across multiple vehicle platforms in different locations, we identify ten key challenges that hinder the development of weather-resilient autonomy, including data scarcity, domain shifts, limitations in multimodal perception, control robustness, and validation gaps, among others. We summarize these challenges and lessons learned toward enabling reliable snow-autonomous driving, highlighting critical directions for future research and standardization.

cs.RO · cs.AI · cs.CV

新论文 · v1arXiv:2611.15204

Alignment De-Identifies Without Aligning: A Congruence-Invariant Relational Gap in Cross-Subject Neural Representations

Anna Notaro, Letizia Rossato, Sadasivan Puthusserypady

原文摘要

In brain-computer interfaces, inter-subject variability remains a major challenge that limits decoding performance across users. Subject-wise alignment is widely used to improve cross-subject transfer of neural decoders, yet it is typically evaluated only through decoding accuracy, which cannot determine whether aligned representations share greater task-related structure. We therefore distinguish two questions that accuracy conflates: whether alignment removes subject-specific information and whether it makes the relational organization of task conditions more similar across individuals. Using three motor imagery-EEG cohorts, trials are represented as covariance matrices and aligned by recentering each subject's mean covariance to a common reference. Subject-specific information is quantified with a subject-identification probe, whereas relational structure is assessed using representational dissimilarity matrices (RDMs) computed from condition means with the affine-invariant Riemannian distance. We show that recentering leaves this distance, and therefore the resulting RDMs, unchanged. Consistent with this result, recentering reduces subject identification accuracy from 0.96 to chance level across all cohorts, while altering RDMs only at numerical precision. Cross-subject agreement in relational structure is significantly above zero but below the estimator's lower noise ceiling. Introducing an explicit similarity regularizer during training also fails to increase held-out agreement: the apparent reduction in between-subject differences is explained by a decline in the reliability ceiling rather than improved alignment. These findings show that eliminating subject identity is not equivalent to aligning relational geometry. More broadly, alignment claims must be interpreted relative to the invariances of both the distance and the statistic used to evaluate them.

cs.HC · q-bio.NC

版本更新 · v2arXiv:2611.09364

SafeOrchestrate: Runtime Checked Intent-Driven Orchestration for Cyber-Physical Systems

Muhammad Ashfaq, Ahmed R. Sadik, Ewan Warburton, Pyry Kotilainen, Niko Mäkitalo, Tommi Mikkonen

原文摘要

Modern cyber physical systems (CPS) integrate heterogeneous sensors, actuators, controllers, and services, composed at runtime rather than at design time. Orchestrating such systems through natural language (NL) is attractive, but unconstrained large language model (LLM) tool use is risky because actions must respect device capabilities, runtime state, and safety constraints. We present Safe Orchestrate, a reference architecture for runtime checked, intent driven CPS orchestration. Given an NL intent, it derives atomic goals, generates a runtime checkable specification for each, grounds the specifications to device affordances, and verifies every candidate action against runtime state and safety constraints before execution. In a Web of Things (WoT) instantiation, the architecture produces Linear Temporal Logic (LTL) style specifications from the NL intent, grounds them to Thing Description (TD) affordances exposed through the Model Context Protocol (MCP), and checks candidate actions against satisfiability modulo theories (SMT) backed guardrails. We evaluate this instantiation on simulated smart home, greenhouse, and industrial automation tasks against a direct LLM to MCP baseline. Safe Orchestrate maintains 100% required action accuracy on every task and 100% MCP Execution Similarity (MCP ES) on all but one, where MCP ES is 92%. By contrast, the baseline degrades on multi device, event triggered, and ordered tasks, with MCP ES falling to 13%. These results suggest that combining LLM based specification generation with role aware grounding and runtime constraint checking improves reliability for open CPS orchestration without enriched TD annotations or planning domain expertise.

cs.AI

新论文 · v1arXiv:2611.15136

Bit-Sparsity Aware Acceleration with Compact CSD Code on Generic Matrix Multiplication

Zixuan Zhu, Xiaolong Zhou, Chundong Wang, Li Tian, Zunkai Huang, Yongxin Zhu

原文摘要

The ever-increasing demand for matrix multiplication in artificial intelligence (AI) and generic computing emphasizes the necessity of efficient computing power accommodating both floating-point (FP) and quantized integer (QINT). While state-of-the-art bit-sparsity-aware acceleration techniques have demonstrated impressive performance and efficiency in neural networks through software-driven methods such as pruning and quantization, these approaches are not always feasible in typical generic computing scenarios. In this paper, we propose Bit-Cigma, a hardware-centric architecture that leverages bit-sparsity to accelerate generic matrix multiplication. Bit-Cigma features (1) CCSD encoding, an optimized on-chip sparsification technique based on canonical signed digit (CSD) representation; (2) segmented dot product, a multi-stage exponent matching technique for long FP vectors; and (3) the versatility to efficiently process both FP and QINT data types. CCSD encoding halves the cost of CSD encoding while achieving optimal bit-sparsity, and segmented dot product improves both accuracy and throughput. Bit-Cigma cores are implemented using 65 nm technology at 1 GHz, demonstrating substantial gains in performance and efficiency for both FP and QINT configurations. Compared to state-of-the-art Bitlet, Bit-Cigma achieves 3.2\texttimes{} performance, 6.1\texttimes{} area efficiency, and 15.3\texttimes{} energy efficiency when processing FP32 data while ensuring zero computing error.

cs.AR

版本更新 · v3arXiv:2608.18504

UMER: Unifying Embedding and Ranking via Pair-Aware Discriminative Reasoning for Universal Multimodal Retrieval

Libiao Chen, Xiyang Liu, Yanheng Wei, Zhenyu Tang

原文摘要

Modern Web information access increasingly involves heterogeneous multimodal content, including images, videos and visually rich documents. Users may seek not only globally similar content but also candidates that satisfy fine-grained attributes, relations or answer evidence under complex instructions. Supporting such access requires both efficient corpus-scale retrieval and fine-grained relevance reasoning. Multimodal large language model (MLLM)-based embedding methods derive representations from MLLM hidden states, and recent work further uses Chain-of-Thought (CoT) reasoning to improve embedding capability by injecting intermediate semantic evidence into the representation. However, existing CoT methods typically use item-wise reasoning over queries and candidates in isolation, providing no explicit evidence to distinguish a positive from a semantically confusable hard negative. Moreover, contrastive embeddings capture global similarity but struggle with meta-tasks requiring answer verification, category judgment or fine-grained reasoning. In this paper, we propose UMER, a Unified Multimodal Embedding and Ranking framework for universal multimodal retrieval. UMER replaces item-wise reflection with PairAware Discriminative Reasoning, which compares query-candidate pairs to identify instruction-relevant matching and discrepancy evidence. UMER jointly learns contrastive embeddings for efficient global matching and discriminative ranking for explicit pairwise relevance judgment within a single MLLM. A complementary mutual distillation strategy further transfers reliable pairwise preferences between the embedding and ranking functions. On MMEB-V2, UMER-R scores 65.5/70.6 with Qwen2-VL-2B/7B, outperforming the strongest included matched-backbone baselines by 1.4/2.0 points. UMER also supports budget-adjustable inference from efficient embedding retrieval to optional pair-aware reranking.

cs.AI

新论文 · v1arXiv:2611.15117

PolyMorphWBC: Whole-Body Control from End-Effector Trajectories for Quadrupedal Mobile Manipulation across Arm Morphologies with Extended Reach

Heng Li, Yang Li, Yifan Duan, Ren Fang, Matao Duan, Wenhao Yu, Lu Zhang, Jianmin Ji 等 9 位作者

原文摘要

Quadrupedal mobile manipulators can extend their manipulation workspace by coordinating the mounted arm with the mobile base. At the task level, short-horizon end-effector (EE) trajectories provide an interface for specifying the desired manipulation motion without prescribing how it should be realized by the arm and base. However, executing such trajectories remains challenging because the controller must determine when and how the base should move, and this decision depends on the mounted-arm morphology. We therefore present PolyMorphWBC, a hierarchical controller that takes an EE trajectory as the sole task-level motion command and generates coordinated arm--base motions across four families of 6-DoF mounted arms, with extended-reach trajectories beyond the initial fixed-base reach. Within PolyMorphWBC, a trajectory-conditioned coordinator determines the base motion from previewed EE targets, while arm-specific Inverse Kinematics (IK) tracks the current target, and a frozen locomotion backend executes the resulting motion. Cross-arm reuse is enabled by a Unified Robot Description Format (URDF)-derived morphology conditioning, together with online residual-wrench feedback. We train PolyMorphWBC on procedurally generated arms and structured trajectories within and beyond fixed-base reach. In IsaacLab, it achieves 93.95% completion with 2.30cm position error and 4.81° orientation error on held-out trajectories and arm morphologies. In MuJoCo evaluation against UMI-on-Legs, PolyMorphWBC reduces EE position error by 69--72% and orientation error by 91--97% across four within- and extended-reach trajectories. On a physical Go2--ARX5 system, we demonstrate language-conditioned extended-reach pick-and-place using EE trajectories from pi_0 without vision-language-action (VLA)-generated base commands.

cs.RO

版本更新 · v3arXiv:2605.07755

Rethinking State Tracking in Recurrent Models Through Error Control Dynamics

Jiwan Chung, Heechan Choi, Seon Joo Kim

原文摘要

The theory of state tracking in recurrent architectures has predominantly focused on expressive capacity: whether a fixed architecture can theoretically realize a set of symbolic transition rules. We argue that equally important is error control, the dynamics governing hidden-state drift along the directions that distinguish symbolic states. We prove that affine recurrent networks, a class of models encompassing State-Space Models and Linear Attention, cannot correct errors along state-separating subspaces once they preserve state representations. Consequently, practical affine trackers do not learn robust state tracking; rather, they learn finite-horizon solutions governed by accumulated state-relevant error. We characterize the mechanics of this failure, showing that tracking remains readable only while the accumulating within-class spread remains small relative to the between-class separation. We demonstrate empirically on group state-tracking tasks that this breakdown is predictable: tracking collapses when the distinguishability ratio crosses the readability threshold. Across trained models, the point of this crossing predicts the horizon at which downstream accuracy fails. These results establish that robust state tracking is determined not only by an architecture's theoretical expressivity but crucially by its error control.

cs.LG · cs.CL

新论文 · v1arXiv:2611.15059

Test-Time Selective Adaptation for Cross-Modal UAV Object Tracking with Token Shift

Yun Xiao, Hailong Ye, Zhicheng Zhao, Lei Liu, Amir Hussain

原文摘要

Cross-modal unmanned aerial vehicle (UAV) object tracking faces modality-induced appearance discrepancies and abrupt target-position shifts that can arise from modality switching, UAV motion, and inter-sensor offsets. Although existing methods model modality and spatial variations, they primarily rely on offline representation learning and offer limited localization-oriented adaptation during testing. To address these challenges, we propose Test-Time Selective Adaptation with Token Shift (TSAT), which derives spatial and temporal adaptation signals from unlabeled test sequences for online optimization. Specifically, we design a controllable token shift auxiliary task, which imposes explicit spatial correspondence between predefined token translations and resultant localization offsets, generating stable annotation-free spatial adaptation signals. Furthermore, we introduce a temporal backward prediction auxiliary task to exploit frame-wise temporal dependencies, effectively mitigating cumulative localization errors in continuous tracking. To suppress interference from unreliable tracking samples, we develop a reliability-aware update gating strategy to screen valid adaptation signals and stabilize online parameter updates. Experiments on CM-UOT demonstrate that TSAT achieves state-of-the-art performance against existing test-time adaptation methods, exhibiting superior robustness under frequent modality switching and severe spatial displacement. Experiments across tracking frameworks and datasets further validate the effectiveness and generalization capability of TSAT.

cs.CV

新论文 · v1arXiv:2611.15024

$k$-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms

Rin Saito, Yuma Tamura

原文摘要

Enumerating all inclusion-minimal solutions is a powerful approach to designing fixed-parameter tractable (FPT) algorithms. However, for the \textsc{Feedback Vertex Set} problem, this approach faces a fundamental obstacle, as the number of minimal feedback vertex sets is not, in general, bounded by any function of the solution size~$k$. To overcome this limitation, we introduce a data structure called a \emph{$k$-product list}, which implicitly encodes all minimal solutions while admitting non-minimal ones to maintain efficiency. We present FPT algorithms for computing such lists not only for the \textsc{Feedback Vertex Set} problem but also for its natural generalizations, the \textsc{$\ell$-Forest Deletion Set} problem and the \textsc{$r$-Pseudoforest Deletion Set} problem. Our framework yields simple FPT algorithms for a wide range of variants, providing the first such results in several cases and demonstrating the broad applicability of our approach.

cs.DS

版本更新 · v5arXiv:2602.15342

SACS: A Code Smell Dataset using Semi-automatic Generation Approach

Hanyu Zhang, Tomoji Kishi

原文摘要

Code smell is a great challenge in software refactoring, which indicates latent design or implementation flaws that may degrade the software maintainability and evolution. Over the past of decades, the research on code smell has received extensive attention. Especially the researches applied machine learning-technique have become a popular topic in recent studies. However, one of the biggest challenges to apply machine learning-technique is the lack of high-quality code smell datasets. Manually constructing such datasets is extremely labor-intensive, as identifying code smells requires substantial development expertise and considerable time investment. In contrast, automatically generated datasets, while scalable, frequently exhibit reduced label reliability and compromised data quality. To overcome this challenge, in this study, we explore a semi-automatic approach to generate a code smell dataset with high quality data samples. Specifically, we first applied a set of automatic generation rules to produce candidate smelly samples. We then employed multiple metrics to group the data samples into an automatically accepted group and a manually reviewed group, enabling reviewers to concentrate their efforts on ambiguous samples. Furthermore, we established structured review guidelines and developed a annotation tool to support the manual validation process. Based on the proposed semi-automatic generation approach, we created an open-source code smell dataset, SACS, covering three widely studied code smells: Long Method, Large Class, and Feature Envy. Each code smell category includes over 10,000 labeled samples. This dataset could provide a large-scale and publicly available benchmark to facilitate future studies on code smell detection and automated refactoring.

cs.SE

新论文 · v1arXiv:2611.14937

Caprese: Change Impact Recommendation Using History and Runtime Analysis

Sadjad Tavakoli, Saba Alimadadi

原文摘要

Change impact recommendation identifies program entities potentially affected by source code changes. Historical co-changes and runtime dependencies provide complementary evidence, particularly in JavaScript, where dynamic and asynchronous behaviour complicates dependency analysis. We present Caprese, an open-source framework for function-level change impact recommendation in Node.js. Given a change set, it produces a ranked impact set of potentially affected functions. It supports repository-based recommendation through confidence-guided mining of recurring, change-set-relevant co-change patterns of varying lengths; dynamic recommendation through execution-derived dependencies involving calls, callbacks, events, timers, and shared state; and hybrid recommendation integrating both analyses. Its modular implementation supports reusable analyses. Evaluation on ten open-source applications and 100 selected change sets shows that, on average across projects, 77.4% of the relevant functions among the top 60 hybrid recommendations are identified exclusively by one analysis, demonstrating substantial complementarity. Dynamic recommendation achieves the highest mean precision among the top five recommendations (0.65), while repository-based recommendation performs best when the ranking is extended to 60 recommendations (0.42). Hybrid recommendation outperforms TARMAQ on average but does not consistently outperform the individual modes. Caprese is publicly available with source code, documentation, and evaluation artifacts.

cs.SE

新论文 · v1arXiv:2611.14883

Random feature policy iteration for inverse mean field games with complex geometry and high dimensions

Xiangjian Zhang, Shanyin Tong, Xiaofeng Xu

原文摘要

We propose a random feature policy iteration method for reconstructing the obstacle function in a mean-field game (MFG) from observations of its value function, leveraging the method's mesh-free nature and flexibility to handle complex geometries and high-dimensional problems. The method builds on a policy iteration framework for inverse MFGs, which decouples the coupled nonlinear forward-backward PDE system into a sequence of linear PDE and inverse problem solves. The fixed random feature representations preserve this linear structure, allowing the resulting subproblems to be solved by minimizing residuals at sampled collocation points through linear least-squares problems. The mesh-free nature of the method further extends the applicability of the policy iteration framework to inverse MFGs with complex geometry and in high dimensions. Another key advantage is its flexibility in using different spatial approximations for different variables: the obstacle function, value function, and population density can be represented in separate feature spaces, accommodating obstacles that are substantially less regular than the corresponding PDE solutions. Moreover, boundary conditions can be enforced through collocation on irregular domains without constructing boundary-fitted meshes. Numerical experiments involving smooth and discontinuous obstacles, a domain with holes, and higher-dimensional problems demonstrate the accuracy and flexibility of the proposed method.

math.NA · cs.GT · math.OC

新论文 · v1arXiv:2611.14808

OverServe: Resource Amplification Attacks on SaaS Agents via Tool--Prompt Co-Design

Ruiheng Yu, Oteo Mamo, Siyu Gan, Weikuan Yu, Mulong Luo

原文摘要

Advances in large language models (LLMs) are enabling software-as-a-service (SaaS) providers to automate longer business workflows with agents. In subscription-based SaaS deployments, model and tool calls consume provider resources without additional customer payments. Because the agent autonomously decides when to stop, a malicious tenant can send a prompt to the agent, exploiting its completion decisions to extend execution and waste provider resources. In this paper, we present OverServe, a multi-agent framework for constructing such attacks against SaaS agents. OverServe co-designs Model Context Protocol (MCP) status tools and completion-confirmation prompts for the attacker. Each tool call returns accurate status and terminates normally, yet the agent may repeatedly check an unfinished condition to satisfy the prompt. This consumes the SaaS provider's resources even after the original business task is completed. OverServe constructs service-specific tool--prompt pairs and uses separate tool and prompt reviews to guide candidate pair selection. Tested tool specifications trigger no alerts in the evaluated MCP scanners. We evaluate Qwen, Nemotron, DeepSeek, and Sonnet on selected tasks from nine benchmarks. All OverServe runs pass the original task checks. OverServe can reach a maximal amplification of API requests by $93.88\times$ while preserving the original task goal and collateral checks.

cs.CR · cs.AI · cs.SE

新论文 · v1arXiv:2611.14775

DeNA-SGN: Deterministic Neighborhood Aggregation for Verified Spiking Graph Inference

Sanjay Das, Xi Zhang, Emily Herron, Prasanna Date

原文摘要

Graph learning on neuromorphic substrates requires an explicit spiking realization of neighborhood aggregation, supporting control and classification. We propose DeNA-SGN, which combines fixed OR and tie-inclusive Majority aggregation of binary node features with a learned signed-weight threshold classifier. A degree-dependent inhibitory construction implements Majority through shared control neurons, enabling a complete circuit compilation into SuperNeuroMAT. Across seven datasets and 41 mapped classifiers, native simulation matches the exported ANN on every evaluated class decision and output-spike pattern. On the new confirmatory Amazon Photo dataset, DeNA-SGN achieves 83.93+-0.93% current-readout accuracy and 71.61+-2.22% strict output-spike accuracy; Wiki-CS reaches 75.99+-0.54% over 20 public masks. In the matched Cora study, we achieve 74.90+-2.67% on current-readout and 68.57+-2.94% strict spike accuracy. Complete circuit and activity accounting supports analytical energy comparisons and identifies the cost of clocking inactive neurons in large deployments. Current argmax is decoded on the host, and energy is modeled rather than measured on hardware. These findings establish a reproducible route to useful graph classification with decision-matched spiking execution and explicit implementation costs.

cs.NE

版本更新 · v3arXiv:2508.11682

Re-evaluating Heart Rate Variability Biomarkers for Glucose Sensing: The Impact of Age Normalisation and Subject-Independent Validation

Md Basit Azam, Sarangthem Ibotombi Singh

原文摘要

Heart rate variability (HRV) from electrocardiogram (ECG) signals may indicate glycemic status, but prior studies often combine distinct glucose targets and use validation strategies vulnerable to data leakage. Since HRV declines with age, aging may be confounded with diabetes-related autonomic dysfunction. We tested whether age-dependent HRV normalisation improves glycemic estimation. We analysed ECG features from 43 male patients with type 2 diabetes. Outcomes were glycated hemoglobin (HbA1c; n=29) and fasting blood glucose (FBG; n=38). We used leave-one-subject-out cross-validation, with feature selection and standardisation within each training fold. We compared 20 machine-learning algorithms, six age-adjustment methods, and 20 normalisation parameter combinations. Validation included 500 permutations and bootstrap confidence intervals. Extra Trees regression performed best: R2=0.222 (r=0.476, p=0.009) for HbA1c and R2=0.086 (r=0.344, p=0.034) for FBG. Mean absolute errors were 1.18 percentage points and 2.27 mmol/L, respectively. Permutation testing supported both associations (p=0.002). Contrary to our hypothesis, no age-adjustment method or parameter combination improved performance. Tree ensembles retained positive performance under strict validation, whereas linear models had negative R2 values; neural networks performed poorly. Strict within-fold preprocessing materially changed model performance and revealed potential inflation from conventional validation. Bootstrap 95% confidence intervals were [0.13, 0.82] for HbA1c R2 and [0.10, 0.72] for FBG R2. Although findings support HRV-glycemic associations, performance remains insufficient for standalone clinical use. The study highlights the importance of separating glycemic targets, subject-independent validation, within-fold preprocessing, and comprehensive baselines in non-invasive glycemic monitoring research.

eess.SP · cs.AI · cs.LG

新论文 · v1arXiv:2611.14659

Closing the Loop: Co-Evolving EM for Irregular Time Series Generation in Lifted Representations

Idan Arbiv, Gal Fadlon, Omri Azencot

原文摘要

Regular time-series generation from irregular time series is typically reduced to one-shot imputation: complete each partial sequence once, freeze the completions, and train a generator on the resulting surrogate dataset. We show that this open-loop strategy is structurally flawed. Point imputers collapse ambiguous missing regions to conditional averages, while stochastic imputers become stale as the generator evolves; the binding constraint is therefore iteration, not imputer design. We introduce a co-evolving Monte Carlo EM framework that closes the imputer-generator loop. Each E-step samples missing values from the posterior of the current generator, and each M-step retrains the generator on these completions, preserving unconditional generator training. Since our diffusion prior operates in a lifted 2D representation while observations live in time-series space, we further introduce Posterior Sampling for Lifted Representations (PSLR), which enforces operator-consistent conditioning, uncertainty preservation, and manifold consistency during the E-step. Across ten datasets and four corruption regimes, our method achieves state-of-the-art performance, improving over the strongest baselines by 59% in discriminative score, 15% in predictive score, 73% in Context-FID, and 71% in feature-correlation error. Ablations show that our approach reduces average discriminative score by 73% over single-step baselines, closing most of the remaining gap to the clean-data oracle. Code is available at https://github.com/azencot-group/PSLR.

cs.LG

新论文 · v1arXiv:2611.14451

一种用于实时皮肤渲染与数字化的轻量级可微方法

A Lightweight Differentiable Method for Real-Time Skin Rendering and Digitization

Mario Marquez-Balduque, Carlos Rodriguez-Pardo, Jorge Lopez-Moreno

AI 速读 基于摘要

提出可微的屏幕空间次表面散射框架,从单光单视角轻量采集直接估计适配实时渲染管线的皮肤散射参数。

cs.CV · cs.GR

查看原文摘要

Inverse rendering for skin typically relies on offline path tracing to estimate physical properties, which fail to map directly to the approximate shaders utilized in interactive applications, such as game engines. We bridge this gap by directly estimating subsurface scattering parameters tailored for real-time rendering pipelines. We introduce a differentiable Screen-Space Subsurface Scattering (SSSS) framework that enables the joint optimization of spatially varying base textures and scattering distances. To account for local variations in skin thickness, we estimate these parameters across distinct facial regions, generating a blended profile map ready for production runtime engines. Our pipeline utilizes a low-cost, single-light, single-view capture setup designed for accessible and practical appearance acquisition. Optimization is driven by a masked loss function targeting regions where subsurface scattering effects are dominant. We validate our approach on a real-world dataset of $45$ individuals across the Monk Skin Tone Scale, ensuring demographic generalization. Furthermore, we complement this evaluation with synthetic data, a multi-light setup validating our single-light assumption, and a tilted-view configuration confirming angular consistency. Results demonstrate that our method effectively recovers scattering parameters from lightweight inputs, yielding realistic skin appearance directly compatible with standard real-time shaders.

新论文 · v1arXiv:2611.14126

Hierarchical Graph Representation Learning with Pooling-Induced Substructures

Luca Sbicego, Xiaowen Dong, Dorina Thanou

原文摘要

Hierarchical graph-level tasks that require reasoning over substructures that extend beyond local neighborhoods are posing challenges for standard Graph Neural Networks (GNNs). While graph pooling aims to address this by coarsening graphs into hierarchical representations, existing methods often fail to explicitly preserve the substructures they induce, leading to inconsistent empirical performance. Moreover, evaluating such approaches remains challenging due to the lack of benchmarks with explicit hierarchical structure. We propose Pooled-Substructure-Aware GNNs, an approach to graph pooling that explicitly preserves and processes substructures uncovered by structure-based pooling schemes. We show that this design enhances the expressive power of pooling-based GNNs in the sense of the Weisfeiler-Lehman (WL) test. To enable principled evaluation, we introduce two new synthetic datasets with controllable hierarchical structure and propose a metric to characterize the prevalence of hierarchical patterns in real-world graph-level benchmarks. On tasks with relevant hierarchical structure, our approach outperforms matched pooling baselines, while remaining competitive on structurally simpler benchmarks. Code and datasets are publicly available at https://github.com/lsbicego/PSA-GNN/.

cs.LG