跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

+1743新增论文
+1399其中 AI 相关
+191已有论文修订
+94新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

论文修订列表

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

找到 8,559 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 19:07(北京时间)
版本更新 · v3arXiv:2605.19232

Devilray: A Reconfigurable Adversarial Baseline for Revealing Blind Spots in Fake Base Station Detection

Taekkyung Oh, Duckwoo Kim, Hansung Bae, Beomseok Oh, CheolJun Park, Tyler Tucker, Nathaniel Bennett, Sangwook Bae 等 11 位作者

原文摘要

Fake Base Station (FBS) detection has been a critical focus of cellular security research for over two decades. However, significant financial and regulatory barriers to accessing commercial FBS (C-FBS) devices have limited direct visibility into real-world operations, forcing detection systems to be designed and evaluated around self-built prototypes. In this paper, we present Devilray, a reconfigurable adversarial baseline to guide effective FBS detection by exploring the realistic adversarial space and identifying blind spots in detection systems -- regions of realistic adversarial behavior excluded by prevailing threat models. To this end, we establish an empirical anchor through the first academic analysis of a C-FBS, define a fundamental four-phase pipeline and seven operational feature dimensions for adversarial behaviors, and extend them with operational variants derived from 3GPP standards analysis. Through combinatorial configurations of operations from commercial practices and specifications, Devilray enables the exploration of 2,592 FBS instances, spanning diverse operational possibilities. Using Devilray, we evaluate seven currently accessible FBS detectors and uncover coverage gaps across all seven, revealing blind spots rooted in assumption-bound design and evaluation. Our work provides an empirically grounded adversarial baseline for evaluating FBS detectors and guiding future detection design, with Devilray and its configuration profiles released to vetted research groups.

cs.CR

版本更新 · v5arXiv:2609.24965

Jev for Scientific Decisions: Evaluating Semantic Choices and Their Consequences

Boyuan Deng, Shuyi Fan, Hongyang Zhang, Xinhong Xie

原文摘要

Scientific workflows often require choosing among known relations before a deterministic calculation can proceed. Whether observations share a culture, treatment or reference standard can change the scientific meaning of the resulting count or comparison. Once the evidence is prepared and the calculation is written as code, this choice reduces to one semantic judgment among listed candidates. We evaluate Jev on this step, using a harness that follows its documented guidance. The study compares twelve model configurations on twenty Choices in ten scientific cases built from published sources, each repeated five times. We measure semantic selections, downstream outputs and final claim labels separately. Jev tied with five other configurations at complete semantic correctness and achieved the lowest observed median latency and known mean cost among successful responses. On one question, whether samples shared a culture, three comparison models made seven wrong selections that changed downstream counts while preserving the correct final label. These results support using Jev to select relations when the evidence and candidates are prepared in advance, and show that evaluating it requires checking the relations and quantities that a workflow will reuse.

cs.CL · cs.AI

版本更新 · v5arXiv:2507.08846

Precomputed Dominant Resource Fairness

Serdar Metin

原文摘要

Dominant Resource Fairness (DRF) is a resource allocation scheme, addressing the problem of fair allocation of multiple resource types among users with heterogeneous demands for different types of resources. Based on Max-min Fairness, which is a well-established algorithm in the literature for allocating resources in single resource type scenarios, DRF generalises the main principle of maximising the minimum share given to any user to the multiple resource case. It has a number of desirable properties, such as Sharing Incentive, Envy-Freeness, Pareto Efficiency, and Strategy Proofness, that make it preferable over alternatives, and as such, it is widely adopted in distributed systems. In the present study, we revisit the original study and analyse the structure of the algorithm in closer view. The main contribution is an alternative algorithm, which approximates the DRF allocation in linear time, significantly improving over the original algorithm's pseudo-polynomial runtime. We name the new algorithm Precomputed Dominant Resource Fairness (PDRF), after its main working principle. We provide bounds for approximating the original algorithm, and critically evaluate the agreements of aforementioned properties, comparing DRF and PDRF over them. It turns out that there is an adversarial strategy which forces DRF to unfairly allocate more resources to users who submit inflated demands. PDRF, on the other hand, favouring smaller demands, penalises such adversarial behaviour and creates incentive for users to submit their minimal demands.

cs.GT · cs.DC · cs.DS

版本更新 · v3arXiv:2502.13828

Software Security in Software-Defined Networking: A Systematic Literature Review

Moustapha Awwalou Diouf, Samuel Ouya, Jacques Klein, Tegawendé F. Bissyandé

原文摘要

Software-defined networking (SDN) separates the control plane from the data plane and exposes the network through software applications and open APIs. The same programmability that drove its adoption also turned the network into a large body of software, and that software can be vulnerable. Knowing where and how SDN software fails is a prerequisite for defending it, yet the literature offers no consolidated account of the problem. We address this gap with a systematic literature review of 113 primary studies published between 2012 and 2025 on the security of the software that makes up SDN. We study how each software component becomes vulnerable, how attackers exploit it, which testing and analysis techniques expose its defects, and how the field has evolved. The review yields a taxonomy of vulnerabilities and attack vectors organized by SDN software component, a synthesis of the methods used to find software defects in each component, and a set of open problems that mark the most promising directions for future work. Earlier surveys treat SDN security as a networking problem; ours is, to our knowledge, the first to treat SDN components as software artifacts whose code, logic, and interactions can be defective. Our artifacts are available at https://github.com/mad975/SDNSoftwareSecurity_SLR.

cs.CR · cs.SE

版本更新 · v4arXiv:2503.18974

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices

Swastik Bhandari

原文摘要

We present FreqBased, a frequency-based algorithm for the maximal square problem in binary matrices. The algorithm maintains a vertical run-length array and a horizontal counter to validate candidate squares, matching the standard single-array dynamic programming algorithm in O(mn) time and O(n) space while reducing the amount of work performed during execution. Experiments on synthetic random binary matrices reveal a clear density-dependent performance transition: FreqBased consistently outperforms the dynamic programming baseline on moderate- and high-density inputs across Intel and AMD processors, achieving peak speedups of 1.175x and 1.277x, respectively, while executing up to 2.08x fewer instructions. On 180 real aerial image masks from the INRIA dataset, FreqBased outperforms the baseline on every instance with speedups of up to 4.63x, confirming that the instruction-count advantage observed on synthetic inputs extends to real binary matrices with spatial structure. Hardware performance counter analysis shows that the performance advantage arises primarily from reduced instruction count despite lower execution efficiency, demonstrating that algorithms with identical asymptotic complexity can exhibit substantially different practical performance depending on input characteristics.

cs.DS · math.OC

版本更新 · v2arXiv:2503.21049

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM

Dominik Kempa, Tomasz Kociumaka

原文摘要

We study the relative hardness of fundamental problems with state-of-the-art word RAM algorithms that take $O(n\sqrt{\log n})$ time for instances described in $Θ(n)$ machine words ($Θ(n\log n)$ bits). This complexity class, one of six hardness levels identified by Chan and Pătraşcu [SODA 2010], includes problems from several domains: Counting Inversions, string processing problems (BWT Construction, LZ77 Factorization, Longest Common Substring, Batched Longest Previous Factor Queries, Batched Inverse Suffix Array Queries), and computational geometry tasks (Orthogonal Range Counting, Orthogonal Segment Intersection Counting). We offer two main contributions: We establish new links between the above string problems and Dictionary Matching, a classic task solvable using the Aho-Corasick automaton. We restrict Dictionary Matching to instances with $Θ(n)$ binary patterns of length $m = Θ(\log n)$ each, and we prove that, unless these instances can be solved in $o(n\sqrt{\log n})$ time, the aforementioned string problems cannot be solved faster either. Via further reductions, we extend this hardness to Counting Inversions (a fundamental component in geometric algorithms) and thus to Orthogonal Range Counting and Orthogonal Segment Intersection Counting. This hinges on String Nesting, a new problem which is equivalent to Dictionary Matching and can be reduced to Counting Inversions in three steps. Together, our results unveil a single problem, with two equivalent formulations, that underlies the hardness of nearly all major problems currently occupying the $O(n\sqrt{\log n})$ level of hardness. These results drastically funnel further efforts to improve the complexity of near-linear problems. As an auxiliary outcome of our framework, we also prove that several central string problems can be efficiently reduced to their versions over the binary alphabet.

cs.DS

版本更新 · v2arXiv:2610.37682

Rank-Aware Differentially Private Release of Listwise Preferences for LLM Alignment

Junwei Chen, Manjiang Yu, Pengpeng Qiao, Yang Cao

原文摘要

Listwise preference feedback offers richer supervision for large language model (LLMs) alignment than pairwise comparisons, but a full ranking also reveals more sensitive user preferences. Existing privacy-preserving alignment methods focus mainly on pairwise feedback, while listwise alignment under local differential privacy (LDP) remains unexplored. Extending LDP to this listwise domain raises a critical challenge: the high sensitivity of the full ranking space demands excessive noise, neutralizing the benefits of listwise supervision. To address this challenge, we analyze the interaction between supervision granularity and privacy noise in downstream training, and introduce a rank-aware exponential mechanism that privatizes listwise preference data into a low-sensitivity granularity suitable for downstream alignment. The mechanism leverages ranking information to sample a fixed-size binary partition, concentrating the noise near borderline items instead of perturbing all items uniformly as randomized response (RR) does. Empirical evaluations on downstream LLM alignment tasks show that our mechanism consistently outperforms existing LDP baselines at matched privacy budgets. The code is available at https://github.com/tdsai-lab/RAEM.

cs.CL · cs.AI

版本更新 · v5arXiv:2603.06082

Offline Materials Optimization with CliqueFlowmer

Jakub Grudzien Kuba, Benjamin Kurt Miller, Sergey Levine, Pieter Abbeel

原文摘要

Recent advances in deep learning inspired neural network-based approaches to computational materials discovery (CMD). A plethora of problems in this field involve finding materials that optimize a target property. Nevertheless, the increasingly popular generative modeling methods are ineffective at boldly exploring attractive regions of the materials space due to their maximum likelihood training. In this work, we offer an alternative CMD technique based on offline model-based optimization (MBO) that fuses direct optimization of a target material property into generation. To that end, we introduce a domain-specific model, dubbed CliqueFlowmer, that incorporates recent advances of clique-based MBO into transformer and flow generation. We validate this model's optimization abilities and show that materials it produces strongly outperform those from generative baselines. To support specialized materials discovery applications and broader interdisciplinary research, we release our code (https://github.com/znowu/CliqueFlowmer), model weights (https://huggingface.co/iamkuba/CliqueFlowmer), and an interactive demo (https://cliqueflowmer.znowu.workers.dev).

cs.AI · cs.CE

版本更新 · v3arXiv:2610.11213

AliO: Output Alignment Matters in Long-Term Time Series Forecasing

Kwangryeol Park, Jaeho Kim, Seulki Lee

原文摘要

Long-term Time Series Forecasting (LTSF) tasks, which leverage the current data sequence as input to predict the future sequence, have become increasingly crucial in real-world applications such as weather forecasting and planning of electricity consumption. However, state-of-the-art LTSF models often fail to achieve prediction output alignment for the same timestamps across lagged input sequences. Instead, these models exhibit low output alignment, resulting in fluctuation in prediction outputs for the same timestamps, undermining the model's reliability. To address this, we propose AliO (Align Outputs), a novel approach designed to improve the output alignment of LTSF models by reducing the discrepancies between prediction outputs for the same timestamps in both the time and frequency domains. To measure output alignment, we introduce a new metric, TAM (Time Alignment Metric), which quantifies the alignment between prediction outputs, whereas existing metrics such as MSE only capture the distance between prediction outputs and ground truths. Experimental results show that AliO effectively improves the output alignment, i.e., up to 58.2% in TAM, while maintaining or enhancing the forecasting performance (up to 27.5%). This improved output alignment increases the reliability of the LTSF models, making them more applicable in real-world scenarios.

cs.AI

版本更新 · v2arXiv:2512.17262

SHARP-QoS: Sparsely-gated Hierarchical Adaptive Routing for Joint Prediction of QoS

Suraj Kumar, Arvind Kumar, Soumi Chattopadhyay

原文摘要

Dependable service-oriented computing relies on multiple Quality-of-Service (QoS) parameters to assess service performance. However, real-world QoS data are often sparse, noisy, and shaped by hierarchical dependencies arising from QoS interactions, geographical constraints, and network-level factors, making accurate prediction challenging. Existing deep learning-based methods often predict each QoS parameter separately, requiring multiple similar models, which increases computational overhead and limits their suitability for applications requiring joint decisions across multiple QoS parameters. Although recent joint QoS prediction studies employ shared architectures, differences in numerical ranges across QoS parameters can lead to task imbalance and negative transfer, while inadequate representation learning and suboptimal joint optimization can degrade prediction accuracy. We present SHARP-QoS, a joint QoS prediction framework with three components. First, hyperbolic graph and hypergraph convolutions in the Poincaré ball extract hierarchical features from QoS invocation and contextual graphs. Second, sparsely gated sub-network routing selectively shares contextual and cross-QoS features, and a gated fusion module combines them with the structural features. Third, an EMA-based loss-balancing strategy smooths short-term fluctuations in task losses to provide less fluctuating task weights. Experiments on three multi-QoS datasets covering two, three, and four QoS parameters show that SHARP-QoS achieves lower prediction errors than existing joint QoS prediction methods. Because its contextual branch relies only on public region and AS attributes, it supports prediction for new users and services. Ablation, hyperparameter, outlier, and scalability analyses further assess its performance, highlighting the trade-off between prediction accuracy and computational cost.

cs.LG

版本更新 · v3arXiv:2607.15659

Harnessing Plastic Deformation for Continuous Passive Stability in Soft Grippers

Junlong Xiao, Yaoqiang Pan, Xuan Zhang, Michael Yu Wang, Chao Chen

原文摘要

Soft robots offer compliance and adaptability for interacting with complex environments, but their low structural stiffness can compromise stability under dynamic disturbances. Here, we present a continuously stable structure through plastic deformation (CSSPD), a hybrid metal-elastomer architecture that enables passive shape retention without continuous energy input. By deliberately exploiting plastic deformation in a kirigami-patterned metal layer, CSSPD establishes new equilibrium configurations while increasing structural stiffness and resistance to dynamic disturbances. A theoretical model is developed to characterize the deformation and stability of the hybrid structure and guide the geometric design of the metal layer. We further introduce a bioinspired paw pad that provides top-side support for enhanced grasp stability and serves as an integrated sensing interface for rapid object acquisition. A telescopic soft pressing mechanism (TSPM) mechanically couples paw-pad motion with tendon actuation. Experiments demonstrate passive holding forces of up to 16 N without continuous energy input, comparable to pneumatic actuation at 0.3 MPa, and stable grasping under pulsed accelerations of up to 400 m/s^2 when combined with pneumatic actuation. Energy-free perching on tree branches further demonstrates the potential of the proposed composite architecture for stable and energy-efficient manipulation.

cs.RO

版本更新 · v3arXiv:2610.31028

Multimodal Progress-Residual Fusion for Anticipating Navigation Retreat in Robotic Flexible Endoscopy

Chi Kit Ng, Tianchun Wu, Jiachen Sun, Yuming Sun, Jianru Zhang, Hongliang Ren

原文摘要

Flexible robotic endoscopes provide access through tortuous anatomy, where friction, deformation, and wall interaction separate commanded insertion from useful distal progress. Operators interpret this mismatch and retreat to recover a navigable configuration. Recognizing the approach to that decision requires relating motor intent to distal response and the local visual scene. We introduce Multimodal Progress-Residual Fusion (MPRF), a causal model that anticipates operator retreat from commands, electromagnetic (EM) tracking, and endoscopic video. A nominal-progress model predicts the response expected in normal or successful navigation; a temporal predictor combines its EM residual with all three observed modalities. In a 150-episode colon-phantom collection, MPRF achieves 0.580 +/- 0.007 AUPRC across three seeds, compared with 0.511 for the strongest reduced-modality control. Complete multimodal histories provide the principal ranking advantage, while the residual adds an explicit intent-response representation with a small, uncertain increment over raw fusion. Analysis of frozen alarms relates warning timing to the behavioral label and explains the increase in event recall under a longer matching window. These results establish a basis for behavioral assistance during operator-controlled navigation.

cs.RO

版本更新 · v2arXiv:2605.06258

The Weight Gram Matrix Captures Sequential Feature Linearization in Deep Networks

Taehun Cha, Daniel Beaglehole, Adityanarayanan Radhakrishnan, Donghun Lee

原文摘要

Understanding how deep neural networks learn representations remains a central challenge in machine learning theory. In this work, we propose a feature-centric framework for analyzing neural network training by relating weight updates to feature evolution. We introduce a simple identity, the Feature Learning Equation, which identifies the weight Gram matrix as the key object capturing feature dynamics. This enables us to interpret gradient descent as implicitly inducing a hypothetical evolution of features, whose covariance structure, termed the Virtual Covariance, characterizes how representations evolve during training. Building on this perspective, we introduce Target Linearity, a measure quantifying the linear alignment between features and targets. By analyzing the training and layer-wise dynamics, we show that deep networks learn to sequentially transform representations toward target-linear structure. This linearization perspective provides a unified interpretation of several empirical phenomena, including Neural Collapse and linear interpolation in generative models.

cs.LG · cs.AI

版本更新 · v2arXiv:2605.21041

Conditioning Gaussian Processes on Almost Anything

Henry Moss, Lachlan Astfalck, Thomas Cowperthwaite, Colin Doumont, Sam Willis, Philipp Hennig, Christopher Nemeth, Andrew Zammit-Mangion

原文摘要

Gaussian processes (GPs) offer a principled probabilistic model over functions, but exact inference is restricted to the linear-Gaussian regime. We establish an explicit equivalence between GPs and a class of linear diffusion models, recasting predictive sampling as an ODE with closed-form Gaussian dynamics and a likelihood-dependent guidance term that admits a simple Monte Carlo approximation. In the linear-Gaussian setting, we recover standard GP conditioning exactly; beyond conjugacy, the same machinery handles any conditioning statement admitting point-wise likelihood evaluation - including non-linear physics, and, for the first time, natural language via large language models. Whitening isolates the irreducible non-Gaussian dynamics, minimising Wasserstein-2 transport cost and eliminating numerical stiffness. The result is a general-purpose GP inference scheme requiring no bespoke derivations. Together, these results provide a general mechanism for incorporating the full richness of real-world knowledge as conditioning information, opening a new frontier for the probabilistic modelling of real-world problems.

stat.ML · cs.LG · stat.ME

版本更新 · v3arXiv:2509.14594

SynBench: A Benchmark for Differentially Private Text Generation

Yidan Sun, Viktor Schlegel, Srinivasan Nandakumar, Iqra Zahid, Yuping Wu, Yulong Wu, Hao Li, Jie Zhang 等 12 位作者

原文摘要

Synthetic text generation with Differential Privacy (DP) guarantees emerges as a principled approach that can enable the sharing of sensitive datasets across institutional and regulatory boundaries, while bounding the risks of re-identification and membership inference. LLM-based methods deliver promising results; however, comparisons are exacerbated by differing evaluation setups and "private" datasets, potential pre-training contamination is not considered and guarantees are not verified with DP audits. To advance this field, we introduce a unified evaluation framework with standardised utility and fidelity metrics and privacy audits, encompassing nine curated datasets that capture domain-specific complexities such as technical jargon, long-context dependencies, and specialised document structures. In a large-scale empirical study, we benchmark LLM-based state-of-the-art DP text generators of varying sizes (between 1--8B). Our results indicate that DP synthetic text generation remains an unsolved challenge, with quality deteriorating more as the private datasets deviate further from the generators' pre-training corpora. Our analyses suggest that synthetic data quality may be overestimated when LLMs have been pre-trained---without DP---on portions of the "private" data to be generated, and our membership inference (MIA) auditing setup for synthetic text reveals measurable membership signals even under tight privacy budgets. Finally, we note that under the "public pre-training, private generation" paradigm, the nominal $(\varepsilon,δ)$ guarantee does not account for exposure during pre-training, motivating contamination-aware evaluation of DP synthetic text generation. Code and data splits: https://github.com/ImperialGlobalSingapore/synbench

cs.AI

版本更新 · v2arXiv:2610.19431

$S^3$-Nav: Structured Spatial-Semantic Decision Making for Language-Guided Robot Navigation

Chaemin Lee, Hae Min Cho

原文摘要

Language-guided robot navigation under partial observability requires robots to reason over spatial-semantic evidence accumulated across observations, particularly when goals involve spatial relations between objects. This paper presents $S^3$-Nav, a structured spatial-semantic decision-making framework that integrates online mapping, persistent object--relation memory, and goal-conditioned navigation. Using RGB-D observations and SLAM, $S^3$-Nav maintains a persistent object--relation memory containing object records and confirmed relation records alongside an evolving navigation context containing exploration frontiers, without requiring a pre-existing map. A goal-conditioned evidence interface selects task-relevant evidence from this structured state and constructs a capacity-controlled decision view as part of the high-level policy input for exploration, target approach, and stopping decisions. The persistent memory remains available for subsequent reasoning and verification even when some of its records are excluded from the decision view. To ensure grounded execution, provisional policy decisions are independently validated against persistent object--relation memory and current geometric evidence before physical execution or task termination. Evaluations across multiple environments and object- and relation-goal tasks show improved closed-loop navigation reliability and reduced language-model token consumption with capacity-controlled evidence exposure under the evaluated inference configuration.

cs.RO

版本更新 · v4arXiv:2406.16715

GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights

Shengbo Gong, Juntong Ni, Noveen Sachdeva, Carl Yang, Wei Jin

原文摘要

Graph condensation (GC) is an emerging technique designed to learn a significantly smaller graph that retains the essential information of the original graph. This condensed graph has shown promise in accelerating graph neural networks while preserving performance comparable to those achieved with the original, larger graphs. Additionally, this technique facilitates downstream applications like neural architecture search and deepens our understanding of redundancies in large graphs. Despite the rapid development of GC methods, particularly for node classification, a unified evaluation framework is still lacking to systematically compare different GC methods or clarify key design choices for improving their effectiveness. To bridge these gaps, we introduce \textbf{GC4NC}, a comprehensive framework for evaluating diverse GC methods on node classification across multiple dimensions including performance, efficiency, privacy preservation, denoising ability, NAS effectiveness, and transferability. Our systematic evaluation offers novel insights into how condensed graphs behave and the critical design choices that drive their success. These findings pave the way for future advancements in GC methods, enhancing both performance and expanding their real-world applications. Our code is available at https://github.com/Emory-Melody/GraphSlim/tree/main/benchmark.

cs.LG

版本更新 · v2arXiv:2605.07138

Can You Break RLVER? Probing Adversarial Robustness of RL-Trained Empathetic Agents

Deeraj S K, Sadhana Devarajan, Krishna Mehra, Sudhakar Mishra

原文摘要

Reinforcement learning from verifiable emotion rewards (RLVER) yields strong empathetic language models, but is evaluated with cooperative, honest simulated users. Real users gaslight, escalate, and demand unconditional validation. We introduce the Adversarial Empathy Benchmark (AEB), six adversarial trajectory types whose discriminative rewards penalize formulaic comfort, and the Emotional Consistency Score (ECS), which separates whether a model \emph{improves} the user's emotional state from whether that state stays legible in the transcript. Across eight scenario-matched conditions (480 dialogues; two RLVER and two Qwen2.5 base models, with and without thinking), RLVER-PPO-Think outperforms its untuned same-scale baseline (FS $0.979$ vs.\ $0.761$, $p<10^{-12}$) with no dialogue collapses and 53\% higher hidden-intention detection; the gain is not explained by response length. Yet under an independent cross-family judge (Gemma-3-4b-it), ECS is indistinguishable between the two ($p=0.43$). We call this an outcome--legibility dissociation: RLVER improves emotional outcomes without making the user's state more legible. We do not claim ECS measures internal understanding.

cs.AI · cs.LG

版本更新 · v2arXiv:2606.22174

OpenHLM: An Empirical Recipe for Whole-Body Humanoid Loco-Manipulation

Yingdong Hu, Haodong Zhu, Boyuan Zheng, Yihang Hu, Tong Zhang, Zunhao Chen, Junming Zhao, Ruiqian Nai 等 9 位作者

原文摘要

Whole-body humanoid loco-manipulation requires coordinating the robot's entire kinematic chain. However, most existing systems typically decouple the upper and lower bodies into separate controllers, limiting such coordination and yielding behaviors similar to those of a wheeled dual-arm platform. In this paper, we ask what it takes to build a whole-body native vision-language-action (VLA) model that maps language and pixels directly to all of the humanoid's degrees of freedom. We conduct a systematic empirical study organized as a roadmap of one-variable-at-a-time experiments across three phases: whole-body teleoperation, VLA model design, and heterogeneous co-training. Our study yields several intriguing findings: a joint-based whole-body teleoperation interface outperforms alternatives that only partially expose the humanoid's degrees of freedom; a VLA pretrained on static and wheeled dual-arm platforms transfers surprisingly well to a humanoid's full action space; and co-training with HuMI, the humanoid analog of UMI, extends the policy to new objects and instructions without additional whole-body teleoperation on those targets. Following this roadmap yields OpenHLM, an open-source recipe for whole-body humanoid loco-manipulation. In a challenging long-horizon task that spans a wide vertical range of the humanoid, OpenHLM outperforms two state-of-the-art humanoid VLA baselines (GR00T N1.6 and $Ψ_0$) using less than half the total demonstration time. Our code, training data, and model checkpoints are available at [https://openhlm-project.github.io/].

cs.RO

版本更新 · v3arXiv:2610.38249

Keepace.ai: A Technical Report on a Large Language Model for Sports and Health

Keepace. ai Team, Bowen Wu, Heng Wang, Jufeng Mi, Kang Liu, Kun Li, Long He, Manling Han 等 15 位作者

原文摘要

Large language models hold promise for delivering safe, scientifically grounded, and personalized exercise guidance at scale, yet the sports-and-health domain still lacks curated training corpora and rigorous evaluation benchmarks. Keepace (Keepace.ai) is a domain-specialized LLM built on Qwen3.5-27B through post-training, currently optimized for Chinese-language exercise guidance across three tasks: workout plan generation, sports-and-health knowledge QA, and personal sports data analysis. In internal rubric-based evaluations designed with domain experts, Keepace outperforms its base model and larger general-purpose baselines, with the most pronounced improvements in exercise safety, boundary compliance, structured output completeness, and scientific accuracy. This report summarizes the current design, data pipeline, safety-first evaluation framework, and evaluation results of Keepace.

cs.CL

版本更新 · v2arXiv:2605.29319

Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective

Shenghao Ye, Yuxiang Wang, Yu Guo, Tao Zhang, Shuangwu Chen, Zijian Wen, Qihui Zhu, Mengjie Zhang 等 11 位作者

原文摘要

Large Reasoning Models (LRMs) achieve strong performance on table reasoning tasks but incur substantial inference cost due to long reasoning traces. Stepwise model routing mitigates this issue by dynamically assigning reasoning steps to smaller or larger models. However, stepwise model routing for table reasoning remains underexplored. Through empirical analysis, we find that reasoning steps involving tables contain two types of tokens with distinct uncertainty distributions: table tokens grounded in table structure, such as cell values and headers, and text tokens representing surrounding natural-language reasoning. The uncertainty of both token types is correlated with the risk that the model makes an error in the next reasoning step. However, existing methods fail to model them separately, leading to suboptimal routing decisions. To address this, we propose EcoTab, a table-aware stepwise routing framework for efficient table reasoning. At each reasoning step, EcoTab separately estimates the uncertainties of table tokens and text tokens, maps them to next-step failure risks for the small model, and combines the two risks for routing. Experiments on multiple table reasoning benchmarks show that EcoTab consistently outperforms strong baselines and achieves a better balance between accuracy and efficiency.

cs.CL

版本更新 · v3arXiv:2610.33702

Seeing the Options: What Should a Visual Candidate See?

Fengxin Li

原文摘要

Agents often choose among candidates that are images: elements of a screenshot, product photos, charts. A single-pass decision model either encodes the request and all candidates as one sequence, making its answer depend on candidate order, or encodes each candidate alone, which keeps order invariance and reusable encodings but hides the request from the candidate. We ask where the joint encoder's advantage comes from: from candidates seeing the request, or from candidates seeing each other while they are encoded. With one backbone and the same fine-tuning steps on screenshot crops of Multimodal-Mind2Web, the answer is mostly the request. Continuing each candidate from a forked cache of the encoded request recovers 11 to 13 of the 12 to 17 points that independent encoding loses to joint encoding, at the price of cross-request reuse, and we prove that order invariance stays exact whenever candidates never see each other. A joint encoder retrained with its candidates isolated from one another during encoding loses 1.1 and 0.4 ranking points in one paired run (0.7 and 0.3 against the mean of five joint runs), and permutation-equivariant interactions among candidates, over pooled vectors or inside the encoder, gain nothing beyond continued training. At a matched abstention operating point the state-conditioned model is 0.6 and 1.0 points below the joint encoder (mean of four runs) with a flip rate of zero, against 8-10% for the joint encoder; on AndroidControl crops (three and five runs) it is 2.5 to 4 ranking points below. Finally, the abstention threshold drifts: the choice term of the loss ignores the score level, and the coverage term pins it only weakly once positives saturate; a quantile threshold aligns operating points.

cs.AI · cs.CV

版本更新 · v5arXiv:2509.22964

Functional Critics for Off-Policy Actor-Critic: From Stability to Exploration

Qinxun Bai, Yuxuan Han, Yuxiao Wen, Wei Xu, Zhengyuan Zhou

原文摘要

Actor-critic methods are central to modern reinforcement learning, yet off-policy actor-critic theory remains far removed from practical algorithms, due in part to the interaction between the deadly triad and the continually changing target policy. We revisit functional critics, i.e., value functions that explicitly condition on the policy, and show that this representation provides a shared foundation for off-policy training stability and policy-space exploration. We first develop a convergent off-policy actor-critic framework under linear function approximation that accommodates target-based TD, partial coverage, and evolving behavior policies. Our analysis combines a policy-evaluation guarantee under partial coverage with policy-gradient generalization of functional critics to yield a dual trust-coverage framework that controls policy-gradient error under evolving behavior policies while enabling greater reuse of off-policy data. We further develop a replay-buffer analysis under i.i.d. sampling, yielding a principled replay-sampling design for minimizing the replay-sample complexity required to reach a prescribed evaluation accuracy. We next show that functional critics provide a natural representation for model-free posterior-sampling-style exploration. Standard critic ensembles do not naturally represent joint uncertainty over return functions across policy space, whereas functional-critic ensembles represent policy-conditioned return functions directly. This motivates a particle-based, model-free analogue of posterior-sampling-style exploration without explicit model learning. Finally, we instantiate these ideas in a deep functional actor-critic algorithm that, despite omitting several standard off-policy AC heuristics, achieves strong performance across the full Dog and Humanoid task series of the DeepMind Control Suite.

cs.LG · cs.AI

版本更新 · v2arXiv:2610.41187

Multiple Swap Local Search Approximations for Uniform-Cost Capacitated Facility Location with Extensions to Outliers

Zachary Friggstad, Pengfei Wu

原文摘要

We study \textsc{Capacitated Facility Location}, a fundamental clustering problem, in the setting of uniform opening costs and non-uniform capacities. We give a polynomial-time $(3+ε)$-approximation for this problem. Our algorithm is a multiple-swap generalization of the local search algorithm by Dabas, Garg, and Gupta (2024), who obtained a $3.732$-approximation. The main technical contribution is the analysis of this natural multiple-swap local-search method: variants of this approach have been analyzed previously, but allowing larger swaps requires new grouping and counting arguments. We also show that a multiple-swap local search algorithm provides a $(3+ε)$-approximation for \textsc{Capacitated Facility Location with Outliers}, again in the same setting of uniform opening costs and non-uniform capacities. This is an improvement over the $6.372$-approximation, again by Dabas, Garg, and Gupta. Finally, we show that the factor $3$ is tight for our local-search framework, and that the same multiple-swap idea does not improve the known locality gap for the non-uniform opening-cost setting.

cs.DS

版本更新 · v2arXiv:2607.09959

SEAMLiS: Visibility-Aware Safety for Perception-Limited Multi-Robot Exploration

Taekyung Kim, Rahul H Kumar, Aswin D. Menon, Tzu-Hsiang Lin, Dimitra Panagou

原文摘要

Autonomous exploration in unknown environments is typically driven by informative frontiers, viewpoints, or trajectories, while local safety controllers avoid obstacles represented in the current map. Under finite sensing range and limited field of view, this separation can be unsafe: an exploration stack may plan optimistically through unobserved space and steer the sensor toward information gain rather than along the direction of motion, causing hidden obstacles to be detected too late for bounded-actuation avoidance. This paper presents SEAMLiS (Safe Exploration for Autonomous Multi-Robot Systems Under Limited Sensing), a modular execution-layer safety framework for decentralized multi-robot exploration. SEAMLiS preserves the upstream exploration stack, including the goal allocator and local planner, and enforces safety at the execution layer through perception-aware attitude and positional filters. A gatekeeper-based attitude filter switches between a visibility-promoting yaw policy and a velocity-tracking backup policy to preserve visibility of the critical known-free/unknown boundary with sufficient braking margin. A Control Barrier Function (CBF)-based positional filter then avoids known obstacles, newly detected obstacles, and other robots. We provide sufficient collision-avoidance conditions and validate the framework in randomized simulation, Isaac Sim, and Crazyflie hardware experiments. Results show collision-free exploration across tested single- and multi-robot settings while retaining much of the efficiency of visibility-promoting yaw control.

cs.RO · eess.SY

版本更新 · v2arXiv:2602.02358

Transfer Learning Through Conditional Quantile Matching

Yikun Zhang, Steven Wilkins-Reeves, Wesley Lee, Aude Hofleitner

原文摘要

We introduce a transfer learning framework for regression that leverages heterogeneous source domains to improve predictive performance in a data-scarce target domain. Our approach fits a conditional generative model to each source domain and calibrates a shared linear combination of the generated responses via conditional quantile matching at the observed target covariates. The calibration aligns the conditional response distributions while accommodating simultaneous shifts in both the covariate and conditional response distributions. The calibrated responses then serve as pseudo-labels to augment the target data for a broad class of downstream learning tasks. Theoretically, we derive an excess risk bound for an empirical risk minimizer (ERM) trained on the augmented data, separating the benefit of an enlarged training sample from errors due to density ratio estimation, source generator estimation, conditional calibration, and irreducible transfer bias. Empirically, simulations and real-data applications show that the proposed method can improve target-domain prediction when the transfer bias is small.

stat.ML · cs.LG

版本更新 · v2arXiv:2605.09806

LEAD: Length-Efficient Adaptive and Dynamic Reasoning for Large Language Models

Songtao Wei, Yi Li, Zhikai Li, Xu Hu, Yuede Ji, Guanpeng Li, Feng Chen, Carl Yang 等 10 位作者

原文摘要

Large reasoning models, such as OpenAI o1 and DeepSeek-R1, tend to become increasingly verbose as their reasoning capabilities improve. These inflated Chain-of-Thought (CoT) trajectories often exceed what the underlying problems require, wasting compute, latency, and context budgets. While introducing length-based efficiency rewards during reinforcement learning offers a natural remedy, existing methods struggle with two fundamental challenges: the optimal balance between correctness and efficiency is non-stationary throughout training, and intrinsic reasoning budgets vary drastically across problems. Relying on static reward weights and global length constraints inevitably forces a compromise between degraded accuracy and unrealized compression. To overcome these limitations, we propose LEAD (Length-Efficient Adaptive and Dynamic reasoning), a method that replaces static heuristics with online, self-adaptive mechanisms. LEAD dynamically calibrates the correctness--efficiency trade-off at each step using a Potential-Scaled Instability, directing optimization capacity to the most informative learning signal. Furthermore, it estimates an adaptive per-problem target length online based on the model's own correct rollouts, applying a symmetric efficiency reward that penalizes both overthinking and over-compression. Evaluated on five mathematical reasoning benchmarks, LEAD achieves the highest accuracy and Accuracy-Efficiency Score among RL-trained efficient-reasoning methods in our matched comparisons while producing substantially shorter outputs than the base model.

cs.LG · cs.AI

版本更新 · v2arXiv:2610.40726

Li$^{2}$SAO: Lifting Light Single-Rollout Asynchronous RL Optimization via Group-Relative Actor-Critic Bootstrapping

Zichen Bai, Yanli Wang, Yang Liu, Junhao Shi, Xueqin Liu, Jinguo Sun, Muye Li, Shaoqiang Zheng 等 12 位作者

原文摘要

Asynchronous reinforcement learning (RL) is becoming a mainstream paradigm for post-training large language models (LLMs), as it improves training efficiency by updating the model as rollouts arrive. Recent work argues that group-wise sampling in GRPO does not naturally fit asynchronous RL training because rollout lengths follow a long-tailed distribution, and proposes Single-rollout Asynchronous Optimization (SAO) to improve stability and off-policy behavior, especially on agentic tasks. However, SAO relies on a closed-source value model obtained from scaling value pretraining. In this paper, we analyze GRPO and LiSAO, our lightweight reproduction of SAO without the pretrained value model, on single-turn reasoning and multi-turn agentic tasks. We find that GRPO outperforms LiSAO on reasoning tasks, while the reverse holds on agentic tasks. Since the value model of LiSAO is not yet well trained , LiSAO lags behind GRPO substantially in early training steps. To address this issue, we propose Li$^{2}$SAO, which Lifts Light Single-rollout Asynchronous Optimization with group-relative actor-critic bootstrapping: while the critic is cold, a group-relative advantage trains the actor and a group-centered return trains the critic, after which training switches to single-rollout GAE. Experiments show that Li$^{2}$SAO catches up with or surpasses GRPO in early training and further raises the later performance ceiling. Code is available at https://github.com/jd-cc-coder/Li2SAO.

cs.CL · cs.LG

版本更新 · v2arXiv:2609.30905

Network Analysis in Communication Research: A Review of Methods, Theories, and Research Practices

Pengjia Cui

原文摘要

Network analysis has become a standard way of representing consultation, sourcing, media use, attention, and influence in communication research. This review examines 31 applications across communication subfields and asks of each what communication problem it addresses, which explanatory resource it invokes, and what its research practice makes observable. The three dimensions form a comparison framework and yield three propositions with stated scope and refutation conditions: resource relevance is task- and criterion-dependent; commonality at one level of aggregation does not imply commonality at another; and influence estimates are conditional on relationship type, group stage, and time. A short bibliometric section describes how the literature's cited references are organised: method references are paired with one another more often than year-specific margins predict (ratio 1.36) and with theoretical references less often (0.82), a pattern consistent with a methodological toolkit that circulates apart from the commitments that license its use. The review closes with designs that would test each proposition.

cs.SI · stat.OT

版本更新 · v2arXiv:2609.34428

AgentHop: A Diagnostic Benchmark for Agentic Multi-Hop Question Answering over Scientific Citation Graphs

Chanhee Park, Jeongho Yoon, Sungbin Han, Hyeonseok Moon, Heuiseok Lim

原文摘要

Agentic tasks require a large language model to interact with the world, navigating information and gathering evidence across multiple steps with restricted resources. Due to this complexity, agentic task failures arise from various sources, and pinpointing these failure causes is essential to diagnose and improve agentic systems. Existing benchmarks, however, tend to focus on a single leaderboard score, leaving the underlying failure modes opaque. To fill this gap, we introduce AgentHop, a diagnostic benchmark of 1,011 multiple-choice questions paired with a controlled seven-tool sandbox under fixed token, turn, and tool-call constraints. AgentHop reveals model vulnerabilities by dissecting a single accuracy score along four axes of agent operation: retrieval, synthesis, tool-call, and resource management. Across 19 models, we find that behavior clusters by model family, with tool-call signatures revealing distinct family fingerprints: GPT models commit early, Anthropic and GLM checkpoints verify before committing, DeepSeek and Kimi over-search, and Gemini-3 Pro stays balanced. Decomposed axes further expose within-family structure: Claude Opus 4.6 and Sonnet 4.6 land within one accuracy point yet diverge on retrieval-versus-synthesis emphasis, with Opus retrieving more and Sonnet synthesizing better. We release the full benchmark set and the harness to support diagnostic agent benchmarking.

cs.CL · cs.AI