跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1022新增论文
+813其中 AI 相关
+85已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

24,849 已收录论文20,754 AI 相关7,213 有修订112 HF 社区发现

浏览论文库

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

找到 43 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · 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:2512.07302

Towards Accurate UAV Image Perception: Guiding Vision-Language Models with Stronger Task Prompts

Mingning Guo, Mengwei Wu, Shaoxian Li, Haifeng Li, Chao Tao

原文摘要

UAV image perception with VLMs aims to identify and localize targets based on semantic and spatial task prompts. However, small, densely distributed objects and cluttered backgrounds hinder these tasks, particularly when concise prompts provide insufficient guidance. Although task-specific fine-tuning improves image-text alignment, it requires large-scale annotations and model-specific updates, increasing adaptation costs across models and tasks. To address this, we propose AerialVP, a task-adaptive, training-free agent that adapts VLMs through prompt enhancement rather than parameter optimization. AerialVP dynamically adapts its enhancement strategy to the original prompt's specificity, selectively incorporating image-derived semantics, spatial positions, and object relationships. These cues provide discriminative descriptions and spatial constraints, leveraging VLMs' pretrained alignment and reasoning capabilities to improve image-text alignment and reduce target ambiguity. Specifically, an LLM-based Task Engine coordinates modular tools for prompt analysis, visual information extraction, and prompt fusion. The enhanced prompt and original image are then provided to the unchanged backend VLM for prediction. This prompt-centric strategy enables training-free adaptation across diverse open-source and proprietary VLMs. For systematic evaluation, we introduce AerialSense, a unified benchmark covering Aerial Visual Grounding, Aerial Visual Reasoning, and Aerial Visual Question Answering across diverse UAV scenes and imaging conditions. Experiments demonstrate consistent improvements across all three tasks and evaluated VLMs. AerialVP also achieves competitive performance against LoRA-based instruction fine-tuning, validating prompt-centric adaptation. Our work is available at https://github.com/lostwolves/AerialVP.

cs.CV · cs.AI

新论文 · v1arXiv:2611.14220

SHARP: Semantic Hierarchical Agentic Reasoning for Next POI Prediction with Dynamic Memory

Yuhang Zhan, Silin Zhou, Zhuo Chen, Haoxiang Lei, Yunren Feng, Lisi Chen, Shuo Shang

原文摘要

Next point-of-interest (POI) prediction supports personalized location services by anticipating users' next destinations. Recent methods leverage large language models (LLMs) for semantic reasoning and graphs for collective mobility modeling, improving POI prediction. However, three challenges still remain. Bridging LLMs' semantic reasoning and specific POI prediction remains challenging. User mobility also evolves over time, making it necessary to retain and update historical knowledge within limited LLM contexts. Meanwhile, global transition graphs smooth out time-specific category transition patterns. To address these challenges, we propose Semantic Hierarchical Agentic Reasoning for Next POI Prediction with Dynamic Memory (SHARP), an agentic hierarchical framework in which category-level reasoning guides specific POI prediction. A trajectory memory agent maintains a dynamic trajectory memory bank that preserves earlier mobility patterns and tracks behavioral changes with limited context growth. We construct multi-granularity time-aware category transition graphs with global and time-conditioned views to preserve temporal regularities obscured by global aggregation. A category predict agent combines these graphs with trajectory memory to predict likely next categories. SHARP learns semantic IDs (SIDs) through a residual-quantized variational autoencoder (RQ-VAE) to construct semantic POI representations, which are jointly optimized with a category-guided POI predictor end-to-end. On three real-world datasets, SHARP improves Acc@5 and Acc@10 by an average of 5.29 and 4.52 percentage points, respectively, over the strongest baseline.

cs.IR

新论文 · v1arXiv:2611.13820

CASCADE: Constraint-Aware SCAffolded DEcomposition for Logical Anomaly Detection

Jinchan Kim, Jinhee Im, Hyunsouk Cho

原文摘要

Logical Anomaly Detection (LAD) requires verifying whether all category-specific constraints, such as object counts, pairing relations, and measurement ranges, are satisfied by a query image given only a few normal references. Recent LAD methods based on Large Vision-Language Models (LVLMs) formulate this as checklist verification, decomposing the decision into independent textual checks. This decomposition, however, is text-only. Every item still reads the same unmodified query image, so the LVLM must extract different forms of visual evidence from one raw image. We identify this text-image mismatch as a constraint-specific perception gap, the source of two failure modes: instance conflation for binding constraints and scale drift for calibration constraints. To diagnose whether these failures stem from insufficient reasoning or insufficient perception, we compare textual reasoning guides and visual perception guides in a training-free setting. Our analysis shows that reasoning over the same image provides little benefit, whereas adapting the visual input to each constraint substantially improves verification accuracy. Based on this finding, we propose CASCADE, a training-free framework that extends checklist decomposition using constraint-specific visual scaffolds. We further introduce CASCADE++, which adapts these scaffolds at the object level by deriving their configurations from the constraint structure and reference distribution. Across MVTec-LOCO and VID-AD, CASCADE++ surpasses the full-shot state of the art by 3.9 AUROC points with only three references, and improves over the strongest VID-AD baseline by 11.4, transferring across multiple LVLM backbones without any training.

cs.CV · cs.AI · cs.LG

新论文 · v1arXiv:2611.12696

Generalized Adaptive Boosting and the Geometry of Mistakes

Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen

原文摘要

Not all mistakes are alike. For example, in medical diagnosis, false positive and false negative mistakes have a different impact and should not be aggregated. By revisiting the classical theory of boosting through this lens, we introduce the notion of $Z$-learner, which returns weak hypotheses achieving joint false-positive/false-negative guarantees $(\mathrm{FP},\mathrm{FN})$ from some set $Z \subseteq [0,1]^2$. This formulation generalizes the standard notion of $γ$-weak learning--recovered by taking $Z=\{(z_1,z_2): z_1+z_2<1/2-γ\}$--and allows for more flexible notions of weak learnability that account for the impact of the distribution on the achievable learning guarantees. This raises a natural question: which sets $Z$ are boostable? We answer this by giving a complete geometric characterization that unifies, as special cases, both the classical boosting dichotomy and the recent multi-objective extension of Bressan et al. (COLT 2025). We also present an adaptive algorithm for boosting $Z$-learners without relying on the prior knowledge of $Z$, generalizing AdaBoost's ability to handle unknown margin parameters. Finally, we demonstrate that $Z$-learners can achieve confidence amplification. However, the analysis is significantly more involved than in classical boosting and relies on the centerpoint theorem from discrete and computational geometry.

cs.LG · stat.ML

新论文 · v1arXiv:2611.12295

Be My Eye: Learning to See Beyond a Robot's Own Perspective

Baifu Huang, Shilin Fang, Jianan Wang

原文摘要

Robots operating in the real world are inherently subject to partial observability, particularly in multi-robot collaboration, where individual observations may be insufficient for effective task execution. A key challenge is leveraging complementary observations from partner robots to support collaborative decision-making. We argue that information sharing should go beyond passively transmitting raw observations or generic visual features. Instead, robots should selectively encode task-relevant information according to task objectives and execution progress. To this end, we propose a task-oriented active context sharing framework that transforms robot observations into compact representations, preserving critical information under constrained communication budgets. The framework adopts a two-stage training paradigm. In the first stage, onboard observations and task instructions are jointly encoded into compact context representations. Task-oriented future prediction and soft task-progress correspondence learning guide this collaboration-agnostic compression, preserving information about task objectives and execution progress. In the second stage, the learned representations are integrated into a pretrained Vision-Language-Action (VLA) policy, enabling bidirectional context exchange. Each robot combines complementary partner information with local observations to guide action generation. Action supervision jointly refines the context representations and policy, aligning information sharing with collaborative decision-making. Controlled experiments demonstrate substantial performance gains under constrained communication budgets, while three real-world experiments validate the framework in complex dual-robot tasks. These results highlight a shift from passive visual transmission toward active, task-oriented context sharing that directly supports collaborative decision-making.

cs.RO · cs.AI

版本更新 · v2arXiv:2606.20135

Frequency-Aware Flow Matching for Continuous and Consistent Robotic Action Generation

Jianing Guo, Fangzheng Chen, Zihao Mao, Wong Lik Hang Kenny, Zhenhong Wu, Yu Li, Yishuai Cai, Yuanpei Chen 等 15 位作者

原文摘要

Flow matching has emerged as a standard paradigm for robotic manipulation owing to its strong expressive power for modelling complex, multimodal action distributions, alongside similar approaches like diffusion policy. However, existing methods rely on discretized action chunks, making them brittle to demonstrations collected at heterogeneous control frequencies and prone to temporally inconsistent actions that degrade control stability. In this paper, we propose Frequency-Aware Flow Matching (FAFM), which outputs continuous, temporally consistent actions. To handle heterogeneous frequency input, we transform discrete action sequences into the frequency domain with the discrete cosine transform (DCT), perform flow matching over the resulting coefficients, and reconstruct continuous actions via cosine basis expansion. To generate temporally consistent actions, we regularize the first-order temporal derivative to promote smooth actions. This corresponds to a Sobolev-type constraint that suppresses high-frequency errors and discourages abrupt action changes. Our FAFM is simple, introduces no additional network parameters and applies to standalone flow-matching policies and vision-language action models. Across synthetic toy benchmark, obstacle avoidance, LapGym, and LIBERO, FAFM improves success rates, multimodal expressivity, motion smoothness, convergence speed, robustness to mechanical bias and mixed-frequency input. These gains are consistent when deployed on a real-world Franka robot. Code available at https://github.com/gakakulicc/FAFM.

cs.RO · cs.AI

版本更新 · v2arXiv:2610.33143

Learning Pathology-Sensitive Representations for Unsupervised Retinal OCT Anomaly Detection

Tania Haghighi, Sina Gholami, Behafarin Emam, Jennifer I Lim, Theodore Leng, Atalie C Thompson, Hamed Tabkhi, Minhaj Nur Alam

原文摘要

Deep learning approaches for retinal optical coherence tomography (OCT) predominantly rely on predefined disease categories, limiting their ability to detect rare or previously unseen abnormalities. While visual foundation models provide transferable representations, their effectiveness in identifying pathological deviations from normal retinal anatomy remains insufficiently understood. In this work, we introduce an unsupervised framework for retinal OCT anomaly detection and localization that adapts pretrained visual representations to normal retinal anatomy through anatomy-aware reconstruction and contrastive triplet learning guided by synthetic structural perturbations, without requiring disease-specific annotations. We systematically investigate the influence of pretraining strategies, anatomy-aware representation adaptation, and anomaly scoring mechanisms on the detection and localization of unseen retinal abnormalities. Our findings demonstrate that adapting pretrained representations to normal retinal structure improves anomaly sensitivity, while pixel-space reconstruction errors and feature-space deviations provide complementary signals for identifying pathological changes. These findings underscore the importance of anatomy-aware representation learning and offer insights into developing generalizable retinal anomaly detection frameworks beyond predefined disease categories.

cs.CV · cs.LG

版本更新 · v2arXiv:2605.08577

Self-Distilling Generative Adversarial Networks

Antoni Nowinowski, Krzysztof Krawiec

原文摘要

In modern GANs, maintaining an Exponential Moving Average (EMA) of the generator's weights is a standard practice, as such an averaged model consistently outperforms the actively trained generator. However, the EMA generator is used for final deployment only and does not influence the training process. To address this missed opportunity, we introduce Self-Distilled GAN (SD-GAN) that employs the EMA generator as a teacher to guide the active generator (student) via perceptual loss. We prove the local asymptotic stability of SD-GAN in the simplified continuous-time Dirac-GAN setting and show that it dampens the parasitic cycling behavior that plagues conventional GANs. Empirical evaluations across established architectures and datasets demonstrate that SD-GAN improves the final image quality on several metrics (FID and random-FID in particular), stabilizes the optimization trajectory and provides additional learning guidance that is not trivially correlated with the conventional adversarial loss. It also proves effective for fine-tuning pretrained GAN models.

cs.CV · cs.LG

新论文 · v1arXiv:2611.11560

LiveAsset: Learning Intent Assets from Corrective Interactions for Agent Runtime Control

Guanming Liu, Weihang Wang, Peng Zhang, Meng Wu, Kainan Tu, Jiahao Liu, Yu Zhang, Liuxin Zhang 等 11 位作者

原文摘要

Large language model (LLM) agents acting across web applications and online services often need multi-turn corrections to align their work with users' underspecified goals and preferences. In practice, users may identify problems in the current outcome without specifying the desired result, so learning user intentions requires interpreting each correction against the agent's preceding and revised outcomes. These expectations are often connected to a particular context, making it hard to know when they apply and how to ensure the agent later acts as the user expects. To this end, we propose LiveAsset, an intent harness that learns reusable intent assets from corrective interactions and uses them for runtime control of agent execution. LiveAsset jointly interprets each correction with the agent's original and revised results to infer user intent, incrementally updating the assets while preserving earlier requirements that remain applicable. The learned requirements guide agent execution from task entry and provide criteria for runtime verification, which uses the explanations to assess applicability before each reply is delivered and directs the agent to revise the result to address unmet requirements while preserving those already satisfied. Following a learning phase in which simulated users progressively reveal requirements through multi-turn corrections, we evaluate LiveAsset using same-task replay of the original requests on π-Bench, PERMA, and Vita and cross-task transfer on PAST-Bench and SkillEvolBench. Experiments show that LiveAsset better fulfills requirements learned from corrective interactions and improves performance on these benchmarks compared with memory, skill, and rule-based harness baselines. Code is available at github.com/landian60/LiveAsset.

cs.AI

版本更新 · v2arXiv:2603.03325

IntPro: Context-Aware Intent Inference via Selective Retrieval from User History

Guanming Liu, Meng Wu, Peng Zhang, Yu Zhang, Yubo Shu, Xianliang Huang, Kainan Tu, Ning Gu 等 11 位作者

原文摘要

Accurately understanding user intent in context is essential for large language models (LLMs) to provide effective assistance. However, observed behavior may support multiple plausible intents, making the current context alone insufficient for identifying the user's underlying goal. A user's interaction history may contain recurring context-to-intent patterns that help disambiguate the current intent. Leveraging such historical patterns requires deciding whether to invoke retrieval for the current context and, if so, forming queries that express plausible intents rather than relying on contextual similarity alone. We present IntPro, a proxy agent that learns to either infer intent directly from the current context or generate candidate intent explanations to retrieve intent-aligned records from the user's history. We design intent explanations as a shared intent-oriented natural-language form that expresses the observed action, its functional goal, and a cue-to-intent rationale. Label-conditioned explanations represent historical records, while candidate explanations generated from the current context serve as retrieval queries in the same form. IntPro first learns direct and retrieval-conditioned inference through Direct-and-Retrieval supervised fine-tuning (SFT). IntPro then uses multi-turn GRPO with a retrieval-decision reward to jointly optimize intent prediction and selective retrieval mechanism. Experiments across three scenarios and three model backbones demonstrate that IntPro consistently improves context-aware intent inference.

cs.CL · cs.AI · cs.LG

新论文 · v1arXiv:2611.11305

Least-Privilege Auditing of Agent Tool Calls with Intent Graphs and Reasoning-Guided Escalation

Doron Shavit

原文摘要

LLM agents that call tools are exposed to indirect prompt injection: instructions hidden in tool outputs can steer an agent into calls the user never asked for. We present a runtime audit that derives an executable intent graph from the user's objective and the deployment's tool catalog with one LLM call per task, and checks every tool call against it with a deterministic loop that makes no LLM call (median 5.7 microseconds per call). Two further mechanisms recover utility. Lookups of the user's own state bypass the audit, because the harm of an attack lies in its write or outward step. The calls that remain flagged are escalated to a reasoning guardian, in the spirit of tool-integrated reasoning models such as START: a reasoning model that sees only the objective, the plan, the call history without tool outputs, and the flagged call, and can verify facts with a restricted Python-expression tool. A current agent showed no baseline attack success, so end-to-end validation remains open.

cs.CR · cs.AI

版本更新 · v3arXiv:2608.03031

CastFSR: Fast--Slow--Reflect Agentic Reasoning for Context-Aware Time Series Forecasting

Xiaoyu Tao, Mingyue Cheng, Bokai Pan, Hao Xue

原文摘要

Time series forecasting is fundamental to temporal data mining, yet numerical models often struggle to account for changing contextual factors. A key challenge is determining when contextual evidence should guide forecast revisions while maintaining consistency with temporal patterns and domain knowledge. To address this, we propose CastFSR, a fast--slow--reflect agentic framework for context-aware time series forecasting. Fast-thinking forecasting analyzes numerical patterns, selects a suitable forecaster, and constructs a data-driven forecast prior. Slow deliberative reasoning incorporates relevant contextual evidence to selectively refine this prior, while reflective evaluation checks the revised forecast against temporal patterns, contextual evidence, and domain constraints. A shared state maintains forecasting priors, contextual evidence, intermediate forecasts, and feedback across stages. CastFSR supports both training-free LLM coordination and two-stage post-training for compact LLM coordinators. Workflow-aware trajectory distillation (WATD) learns state-conditioned tool use and forecasting decisions from teacher trajectories, while trajectory-level policy optimization (TLPO) further improves the coordinator through reinforcement learning guided by forecasting accuracy and workflow feedback. Experiments on multiple real-world datasets under an offline evaluation protocol using historical context demonstrate competitive performance against representative baselines. Our code is available at https://github.com/Xiaoyu-Tao/CastFSR.

cs.AI

版本更新 · v5arXiv:2511.15974

Knowledge and Reasoning Augmented Learning for Language Model Assisted Antimicrobial Decision Support

Zhe Li, Yehan Qiu, Yuntian Huang, Xin Ding, Yujie Chen, Jing Sun, Min Yan, Lei Chen 等 18 位作者

原文摘要

Background: Antimicrobial decision support requires both clinical knowledge and patient-specific reasoning. We developed Knowledge and Reasoning Augmented Learning (KRAL) to improve language model performance on antimicrobial decision-making tasks. Methods: In this retrospective technical study, a 27-billion-parameter student model underwent guideline-grounded supervised fine-tuning followed by Multi-turn Agentic GRPO using clinical reasoning trajectories. Six configurations were evaluated on 123 clinician-validated clinical antimicrobial treatment cases from Peking Union Medical College Hospital (PUMCH) and 100 JAMA Clinical Challenge cases. A language model judge scored responses, and paired tests compared configurations. Component ablations assessed benchmark performance and training stability. Results: On the PUMCH benchmark, KRAL achieved the highest composite score (0.895 on a 0-1 scale), outperforming all five controls (all P<0.001). On JAMA, KRAL scored 0.600 and exceeded the base model with and without retrieval (P = 0.0048 and 0.0499, respectively). Reinforcement learning ablation experiments demonstrate that the reward smoothing can significantly improve the performance and training stability of vanilla GRPO. Conclusions: KRAL improved performance on a single-center clinical antimicrobial benchmark and publicly available JAMA clinical challenge cases by combining guideline-grounded learning with Multi-turn Agentic GRPO. Further external clinical validation is needed to evaluate the practical utility and effectiveness of KRAL.

cs.AI

版本更新 · v3arXiv:2511.16660

推理的认知基础及其在大语言模型中的表现

Cognitive Foundations for Reasoning and Their Manifestation in LLMs

Shuyue Stella Li, Priyanka Kargupta, Haocheng Wang, Jinu Lee, Dean Light, Shan Chen, Orevaoghene Ahia, Thomas L. Griffiths 等 12 位作者

AI 速读 基于摘要

该研究将认知科学整合为28个认知要素的分类体系,并据此细粒度比较18个模型与人类在推理过程中的认知要素使用差异。

cs.AI

查看原文摘要

Large language models (LLMs) solve complex problems yet fail on simpler variants, suggesting they achieve correct outputs through mechanisms fundamentally different from human reasoning. To understand this gap, we synthesize cognitive science research into a taxonomy of 28 cognitive elements spanning reasoning invariants, meta-cognitive controls, representations for organizing reasoning and knowledge, and transformation operations. We introduce a fine-grained evaluation framework and apply it to 192K traces from 18 models across text, vision, and audio, alongside 1,346 human think-aloud traces on a new, domain-agnostic dataset for human-model comparison. We find that models are able to deploy cognitive elements seen in human reasoning but differ in how they use them. Leveraging these patterns, we develop test-time reasoning guidance that automatically scaffolds successful reasoning topologies, improving the accuracy of the strongest models by 9.7 percentage points on ill-structured problems. Meta-analysis of 1.6K LLM reasoning papers reveals the research community concentrates on easily quantifiable elements but rarely targets self-awareness, whose use differs between human and model reasoning. By establishing a shared vocabulary between cognitive science and LLM research, our framework enables diagnosis of reasoning failures and principled development of models that reason through robust cognitive mechanisms rather than spurious shortcuts, while providing tools to test theories of human cognition at scale.

版本更新 · v2arXiv:2609.09384

有向安全协调中的网络化可容许性保持控制

Networked Admissibility-Preserving Control for Directed Safe Coordination

Abhinav Sinha, Lohitvel Gopikannan, Shashi Ranjan Kumar

AI 速读 基于摘要

针对固定有根有向图上输入受限的标量智能体,提出网络化可容许性保持控制架构,使各智能体在异构非对称输入界下安全协调进入共同移动输出走廊。

eess.SY · cs.MA · cs.RO · math.DS

查看原文摘要

This paper addresses safe coordination of scalar agents with constrained input dynamics over fixed rooted digraphs. We propose a networked Admissibility-Preserving Control (APC) architecture for a common moving output corridor under heterogeneous asymmetric input bounds, wherein the Admissibility-Preserving Input Realization (APIR) generates the physical inputs. In logarithmic barrier coordinates, the closed-loop dynamics form an exact cascade of exponentially decaying realization errors and directed consensus dynamics. We derive direction-specific compatibility conditions that guarantee uniform corridor and input margins, bounded commands, unique complete solutions, and exponential consensus for compact initial sets. The closed-form expression for the agreement value quantifies the effect of the initial APIR mismatch. Under the corresponding compatibility conditions, partial pinning guarantees safe reference tracking whenever the root component contains at least one informed agent. Simulations illustrate the coordination guarantees.

版本更新 · v3arXiv:2606.14571

StreamMemBench: Streaming Evaluation of Agent Memory for Future-Oriented Assistance

Guanming Liu, Yuqi Ren, Hansu Gu, Peng Zhang, Weihang Wang, Jiahao Liu, Ning Gu, Tun Lu

原文摘要

A central role of personal-agent memory is to turn stored information and prior interactions into future-oriented assistance. In daily use, useful cues come from what the agent observes and how the user interacts with the agent, and the agent must carry them forward from the current request to similar future tasks. Existing memory benchmarks usually test dialogue recall or task improvement in isolation, leaving the trajectory from streaming observations to later assistance largely untested. We introduce StreamMemBench, a streaming benchmark that constructs a two-step task sequence around each evidence anchor from EgoLife egocentric streams. The initial task tests evidence use, while the follow-up task tests whether feedback and interaction experience are reused. Four metrics diagnose evidence recall, initial evidence use, feedback incorporation, and follow-up reuse. Experiments with eight memory systems across two backbones show that current systems often fail to use observed evidence or turn feedback into reliable follow-up behavior, even when evidence is stored or feedback is incorporated locally. StreamMemBench is publicly available at https://github.com/landian60/StreamMemBench.

cs.AI

版本更新 · v5arXiv:2410.14383

MARLIN: Multi-Agent Reinforcement Learning Guided by Language-Based Inter-Robot Negotiation

Toby Godfrey, William Hunt, Mohammad D. Soorati

原文摘要

Multi-agent reinforcement learning is a key method for training multi-robot systems. Through rewarding or punishing robots over a series of episodes according to their performance, they can be trained and then deployed in the real world. However, poorly trained policies can lead to unsafe behaviour during early training stages. We introduce Multi-Agent Reinforcement Learning guided by language-based Inter-robot Negotiation (MARLIN), a hybrid framework in which large language models provide high-level planning before the reinforcement learning policy has learned effective behaviours. Robots use language models to negotiate actions and generate plans that guide policy learning. The system dynamically switches between reinforcement learning and language-model-based negotiation during training, enabling more effective exploration. MARLIN is evaluated using both simulated and physical robots with local and remote language models. Results show that, compared to standard multi-agent reinforcement learning, the hybrid approach achieves higher performance in early training with limited impact on the final performance. The code is available at https://github.com/SooratiLab/MARLIN.

cs.RO

新论文 · v1arXiv:2611.02081

Understanding the relationship between retrospective soundscape attributes and continuous pleasantness and eventfulness ratings

Yuanbo Hou, Kening Guo, Francesco Aletta, Woon-Seng Gan, Dick Botteldooren, Jian Kang

原文摘要

Soundscape studies ask listeners to rate perceived affective quality (PAQ) attributes, such as pleasant and vibrant, after listening to recordings or experiencing acoustic environments. These retrospective ratings summarise an experience during which impressions may change. International Organization for Standardization (ISO) procedures convert these PAQ ratings into Pleasantness and Eventfulness scores. Pleasantness and Eventfulness (P/E) can also be rated directly and continuously during listening, capturing changes in reported perception over time. Retrospective PAQ ratings and continuous direct P/E describe the same soundscape experience from different perspectives. We examine how PAQs relate to direct P/E and how ISO-derived P/E corresponds to direct judgements, using 1,782 paired 30-s trials involving audiovisual recordings from 18 streets. The results show that PAQs retain a predominantly two-dimensional structure. Vibrant and Monotonous lie closer to the Eventfulness-Uneventfulness axis in the direct P/E plane than in the ISO 2025 reference geometry. The full 30-s direct P/E mean has lower calibrated error against ISO-derived P/E than three 10-s means. An empirical mapping using the same 8 PAQs reduces held-out joint root-mean-square error by 4.9% relative to affine-calibrated ISO 2025 scoring. The findings show that retrospective and continuous assessments offer related but distinct soundscape descriptions.

eess.AS · cs.SD

新论文 · v1arXiv:2610.40264

From MS/MS evidence to adaptive spectroscopic characterization: Reinforcement learning guided by candidate molecular structures

Bowen Gao, Lei Zhu, Yiying Wang, Wenjie Yu

原文摘要

Small-molecule identification from tandem mass spectrometry (MS/MS) may require complementary measurements. Herein, we propose a structure-informed deep Q-network (SI-DQN) that uses existing MS/MS evidence to decide whether further characterization is needed, which measurement to request, and when to stop. The policy combines spectral representations and candidate rankings with score-weighted descriptors of the candidates' chemical features and structural differences. The policy was evaluated on 79,462 held-out samples with simulated MS/MS, infrared (IR), and nuclear magnetic resonance (NMR) spectra from the Multimodal Spectroscopic Dataset. Evaluation used fixed hard candidate sets containing the correct structure and equal normalized acquisition costs. Averaged across three training runs, SI-DQN increased Top-1 accuracy from 80.10% to 93.78% for positive-ion MS/MS starts and from 70.44% to 93.31% for negative-ion starts. The corresponding mean additional measurement counts were only 0.227 and 0.340 per sample, respectively. Complete acquisition achieved 97.72% accuracy with four additions, whereas SI-DQN reduced the additional measurement count by 94.3% and 91.5%. Relative to a rule-based policy, SI-DQN reduced the composite loss combining terminal ranking error and acquisition cost by 19.3% and 25.5%. Adding structural information to DQN further improved accuracy while reducing requests across all three training runs. At comparable ranking uncertainty, SI-DQN increased request rates relative to DQN more strongly in groups with high structural disagreement, where larger reductions in composite loss were also observed. Together, these results support using the ambiguity among candidate structures after MS/MS analysis to guide further characterization, providing a quantitative basis for balancing identification performance against subsequent measurement effort.

cs.LG

版本更新 · v4arXiv:2608.27906

Design the Feedback, Not Just the Reward: Environments for Open-Ended Reinforcement Learning

Rui Jin, Jikai Chen, Chengyue Yu, Yihan Chen, Hao Zhou, Demin Zhu, Kaichen Yang, Dong Wang 等 10 位作者

原文摘要

Reinforcement learning has advanced large language models on tasks with reliable verifiers, where checking an outcome provides a clear basis for reward. Extending this approach to open-ended tasks requires environments that can both evaluate complex, partially successful outputs and turn these judgments into effective learning guidance. We propose a reinforcement learning framework built around a training environment that integrates human domain knowledge with model reasoning. Human domain knowledge, encoded in rubrics, anchors evaluation to task intent, while model reasoning combined with hierarchical rewards distinguishes complex open-ended outputs and links diagnosed failures to likely responsible output regions. Furthermore, these diagnostic attributions guide token-level weights in the GRPO objective, thereby translating the ambiguous notion of success in open-ended tasks into concrete guidance for policy optimization. We instantiate this framework in interactive web application generation, a representative open-ended generation task. The resulting model achieves an average pass rate of 41.25\% on MiniAppBench and 76.19\% on ArtifactsBench. Ablation studies show the contributions of individual components, while additional out-of-distribution evaluations support transferable gains without degrading performance on other evaluated tasks.

cs.AI

版本更新 · v2arXiv:2604.15528

Inter-Satellite Link Optimization for Low-Latency Global Networking

Arman Mollakhani, Jerayu Tiamraj, Shu-Jie Cao, Dongning Guo

原文摘要

Large-scale low-Earth-orbit satellite constellations offer a promising platform for global low-latency networking, in part because signals propagate faster in free space than in fiber and copper. In such systems, end-to-end latency is largely determined by the inter-satellite link (ISL) topology. In particular, the network diameter--the longest shortest path, in hops, between any pair of satellites--serves as a key performance metric for time-sensitive applications. Designing diameter-optimal topologies is challenging due to node degree constraints, orbital dynamics, and the combinatorial nature of link selection. This paper proposes a two-stage optimization framework for ISL topology design. First, a continuous relaxation of the link-selection problem is formulated as a convex program that maximizes the algebraic connectivity of the graph Laplacian, serving as a tractable surrogate for diameter minimization. Second, the resulting fractional solution is mapped to a feasible topology via maximum-weight b-matching, a problem solvable in polynomial time. Simulations on Walker-Delta constellations show that the proposed method consistently achieves smaller network diameters than a local-search baseline and standard patterned topologies. For a 1,584-satellite constellation in which each satellite has four ISLs of up to 2,500 km, the diameter is as small as 12 hops, and the maximum propagation delay between any two satellites is about 90 ms. With up- and downlinks adding up to 8 ms, the user-to-user propagation delay is at most about 98 ms, comparable to the delay over a great-circle fiber route between antipodal points on Earth.

cs.NI

版本更新 · v3arXiv:2606.08555

FAWAM: Force-Aware World Action Models for Closed-Loop Contact-Rich Manipulation

Haotian He, Zeyu Yan, Qipeng Liu, Ning Guo, Wenzhao Lian

原文摘要

Force signals provide critical interaction cues for contact-rich robotic manipulation. However, existing methods mostly use force as an additional observation modality, without fully exploiting its role in modeling future interaction dynamics or guiding execution-time feedback correction. In this paper, we propose FAWAM, a force-aware world action model that incorporates force information at three levels: perception, prediction, and closed-loop execution. FAWAM first encodes historical 6-axis force/torque signals to modulate action generation, then jointly predicts future actions and end-effector wrenches to explicitly model contact evolution. It further introduces a residual correction module that uses the predicted wrench trajectory as an execution-time reference to refine actions online based on real-time force feedback. Real-world experiments across multiple contact-rich tasks show that FAWAM improves the average success rate by 36.25% over vision-only baselines and 21.25% over existing force-aware baselines, demonstrating the effectiveness of our force-aware framework for robust contact-rich manipulation.

cs.RO

新论文 · v1arXiv:2610.36546

REACH: An RL-based Hierarchical Humanoid Crawling Framework for Adaptable Confined Space Traversal

Shengzhang Xu, Yuning Guo, Weiyi Hu, Yifeng Xu, Zhongyu Li, He Kong

原文摘要

Humanoid locomotion in confined spaces requires continuous height adaptation across multiple locomotion modes, yet most existing approaches remain limited to height-adjustable bipedal walking. We present REACH, an RL-based hierarchical framework that enables a Unitree G1 humanoid to traverse height-constrained environments through variable-height bipedal walking and crawling. The learned policies regulate body height over complementary command ranges of 1.27--0.50m in bipedal locomotion and 0.50--0.20m in crawling, extending traversal beyond the clearance limits of crouched walking. To address contact-rich crawling dynamics, we employ a history-conditioned latent representation that captures terrain and interaction context from proprioceptive observations. A bidirectional transition policy further connects crouched bipedal locomotion and crawling across large kinematic and contact discontinuities. These skills are integrated with a LiDAR-based planner that converts point clouds into collision-free three-dimensional paths and locomotion commands, including proactive height targets. Real-world experiments demonstrate accurate height and velocity tracking, robust terrain traversal, reliable mode transitions and confined-space traversal with the proposed pipeline. Code and videos are available at https://aislab-sustech.github.io/REACH/.

cs.RO · cs.AI

新论文 · v1arXiv:2610.35108

FlowGenesis: Representation-Driven Self-Organization of Neural Architectures

Maksim A Kazanskii

原文摘要

Deep neural networks typically rely on architectures specified before training, despite the continuous evolution of their internal representations. We introduce FlowGenesis, a framework in which neural architectures adapt through neuron birth and pruning guided by Representation Flux, a local statistic capturing changes in minibatch mean activations. Neurons exhibiting persistently high Flux undergo splitting designed to approximately preserve the network function, while neurons with low Flux and low activity are pruned. This mechanism allows network capacity to evolve without prescribing a target architecture or performing a separate architecture search. Experiments on image and text classi- fication show that networks initialized with different sizes approach similar final neuron-count ranges within each dataset while maintaining comparable predictive performance. We further extend FlowGenesis to continual learning, where representation-guided structural adaptation reduces the neurons and parameters allocated to successive tasks while maintaining accuracy comparable to fixed-width Progressive Neural Networks in a task-incremental learning setting. These findings demonstrate that neural architectures can adapt through feedback between representation learning and structural change, suggesting an alternative to prescribing network capacity before training.

cs.LG

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1313ACL Anthology · ACL 2026

InfiniteWeb: Scalable Web Environment Synthesis for GUI Agent Training

Ziyun Zhang, Zezhou Wang, Xiaoyi Zhang Microsoft, Zongyu Guo Microsoft Research, Jiahao Li Microsoft Research Asia, Bin Li Microsoft, Yan Lu Microsoft Research Asia

原文摘要

GUI agents that interact with graphical interfaces on behalf of users are a promising direction for practical AI assistants, yet training them is hindered by scarce suitable environments. We present InfiniteWeb, a system that automatically generates functional web environments at scale for GUI agent training. While LLMs perform well on generating a single webpage, building a realistic and functional website with many interconnected pages faces challenges. We address these challenges through unified specification, task-centric test-driven development, and combining website seed variation with reference design images. Our system also generates verifiable task evaluators enabling dense reward signals for reinforcement learning. Experiments show that our system surpasses commercial coding agents at realistic website construction, and GUI agents trained on our generated environments achieve significant performance improvements on OSWorld and Online-Mind2Web, demonstrating the effectiveness of the proposed system.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1352ACL Anthology · ACL 2026

Think before Go: Hierarchical Reasoning for Image-goal Navigation

Pengna Li, Kangyi Wu, Shaoqing Xu, Fang Li, Lin Zhao, Long Chen Xiaomi, Zhi-Xin Yang University of Macau, Nanning Zheng Xi'an Jiaotong University

原文摘要

Image-goal navigation steers an agent to a target location specified by an image in unseen environments. Existing methods primarily handle this task by learning an end-to-end navigation policy, which compares the similarities of target and observation images and directly predicts the actions. However, when the target is distant or lies in another room, such methods fail to extract informative visual cues, leading the agent to wander around. Motivated by the human cognitive principle that deliberate, high-level reasoning guides fast, reactive execution in complex tasks, we propose Hierarchical Reasoning Navigation (HRNav), a framework that decomposes image-goal navigation into high-level planning and low-level execution. In high-level planning, a vision-language model is trained on a self-collected dataset to generate a short-horizon plan, such as whether the agent should walk through the door or down the hallway. This downgrades the difficulty of the long-horizon task, making it more amenable to the execution part. In low-level execution, an online reinforcement learning policy is utilized to decide actions conditioned on the short-horizon plan. We also devise a novel Wandering Suppression Penalty (WSP) to further reduce the wandering problem. Together, these components form a hierarchical framew ork for Image-Goal Navigation. Extensive experiments in both simulation and real-world environments demonstrate the superiority of our method.

cs.CL · cs.CV

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1646ACL Anthology · ACL 2026

HARPO: Hierarchical Agentic Reasoning for User-Aligned Conversational Recommendation

Subham Raj Indian Institute of Technology, Patna, Aman Vaibhav Jha, Mayank Anand, Sriparna Saha

原文摘要

Conversational recommender systems (CRSs) operate under incremental preference revelation, requiring recommendation decisions under uncertainty. While recent LLM-based approaches achieve strong performance on proxy metrics such as Recall@K and BLEU, they often fail to deliver high-quality, user-aligned recommendations in practice, as they optimize intermediate objectives like retrieval accuracy or fluent generation rather than recommendation quality itself. We propose HARPO (Hierarchical Agentic Reasoning with Preference Optimization), an agentic framework that reframes conversational recommendation as a structured decision-making process optimized for multi-dimensional recommendation quality. HARPO integrates (i) hierarchical preference learning that decomposes recommendation quality into interpretable dimensions (relevance, diversity, satisfaction, and engagement) with context-dependent weighting; (ii) deliberative tree-search reasoning guided by a learned value network evaluating candidate paths on predicted quality; and (iii) domain-agnostic reasoning abstractions through Virtual Tool Operations and multi-agent refinement. We evaluate HARPO on ReDial, INSPIRED, and MUSE, demonstrating consistent improvements over strong baselines on recommendation-centric metrics while maintaining competitive response quality.

cs.CL · cs.AI · cs.MA

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1760ACL Anthology · ACL 2026

Refining and Reusing Annotation Guidelines for LLM Annotation

Kon Woo Kim National Institute of Informatics, Jin-Dong Kim Research Organization of Information and Systems, Akiko Aizawa National Institute of Informatics

原文摘要

While Large Language Models (LLMs) demonstrates remarkable zero-shot annotation tasks, they often struggle with the specialized conventions of gold-standard benchmarks. We propose the systematic reuse and refinement of annotation guidelines as an alignment mechanism, introducing an iterative moderation framework that simulates the early phases of annotation projects. We evaluate three hypotheses: (1) the efficacy of guideline integration, (2) the advantage of reasoning-optimized models, and (3) the viability of moderation under minimal supervision. Testing across biomedical NER tasks (NCBI Disease, BC5CDR, BioRED) with three LLM families (GPT, Gemini, DeepSeek), our results empirically confirm all three hypotheses. While the iterative moderation framework shows a good potential in effectively refining guidelines, our analysis also reveals a significant room for improvement.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.2144ACL Anthology · ACL 2026

Rethinking Composed Image Retrieval Evaluation: A Fine-Grained Benchmark from Image Editing

Tingyu Song University of the Chinese Academy of Sciences, Yanzhao Zhang Alibaba Group, Mingxin Li Alibaba Group, Zhuoning Guo Hong Kong University of Science and Technology (Guangzhou), Dingkun Long, Pengjun Xie Alibaba Group, Siyue Zhang, Yilun Zhao Yale University 等 9 位作者

原文摘要

Composed Image Retrieval (CIR) is a pivotal and complex task in multimodal understanding. Current CIR benchmarks typically feature limited query categories and fail to capture the diverse requirements of real-world scenarios. To bridge this evaluation gap, we leverage image editing to achieve precise control over modification types and content, enabling a pipeline for synthesizing queries across a broad spectrum of categories. Using this pipeline, we construct EDIR, a novel fine-grained CIR benchmark. EDIR encompasses 5,000 high-quality queries structured across five main categories and fifteen subcategories. Our comprehensive evaluation of 13 multimodal embedding models reveals a significant capability gap; even state-of-the-art models (e.g., RzenEmbed and GME) struggle to perform consistently across all subcategories, highlighting the rigorous nature of our benchmark. Through comparative analysis, we further uncover inherent limitations in existing benchmarks, such as modality biases and insufficient categorical coverage. Furthermore, an in-domain training experiment demonstrates the feasibility of our benchmark. This experiment clarifies the task challenges by distinguishing between categories that are solvable with targeted data and those that expose intrinsic limitations of current model architectures.

cs.CL · cs.CV

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表