跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-08 03:01 · 全站最近入库:2026-11-07 17:43各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-08 03:01最近发现新增版本:2026-11-07 17:43库内论文最新更新时间:2026-11-06 02:59

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

17,100 已收录论文14,661 AI 相关4,056 有修订112 HF 社区发现

浏览论文库

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

找到 17,100 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-08 02:59(北京时间)
新论文 · v1arXiv:2611.05011

Can saliency maps flag chest radiograph classifier errors at a new hospital? An external validation study

Aashish Chapagai, Angad Singh Gurtatta, Erik Cambria

原文摘要

Saliency maps are offered as a safeguard for medical image classifiers, but whether they reveal individual errors at a new hospital remains largely untested. We trained a convolutional network and a vision transformer on NIH ChestX-ray14 and evaluated 303,768 decisions per model at the training hospital and at two external sites, in the USA and Vietnam, with radiologist-consensus labels. We scored each explanation by its anatomical enrichment, the area-normalized concentration of attribution in a segmented thoracic region, and tested whether it detects errors beyond the model's confidence. Grad-CAM localized findings less often than radiologists (hit rate at most 0.575 versus 0.888). Adding enrichment to a confidence-based error detector calibrated at the training hospital never raised its area under the curve by more than 0.011, and for the convolutional network the relation between enrichment and correctness reversed between hospitals, degrading the transferred detector. Model confidence, not saliency, should anchor deployment monitoring.

cs.CV · cs.LG · eess.IV

新论文 · v1arXiv:2611.05008

Learned Smartphone ISP on Mobile GPUs: Mobile AI 2026 Challenge Report

Andrey Ignatov, Georgy Perevozchikov, Radu Timofte, Yuhong He, Yuxuan Qiu, Tianyu Hao, Ruoqi Li, Yueqi Yang 等 22 位作者

原文摘要

With the increasing importance of mobile camera quality in modern smartphones, growing attention has been directed toward computational photography and advanced image signal processing (ISP) algorithms aimed at enhancing various perceptual attributes of captured images. This creates a need for efficient deep learning models for this problem that are not only performant but can also be deployed on constrained mobile hardware. In this Mobile AI challenge, we address this problem and propose the participants to design fast solutions that can reconstruct RGB photos from RAW Bayer camera data while running on popular smartphone GPUs from Qualcomm and Arm. For this, the participants were provided with a large-scale Fujifilm UltraISP dataset consisting of RAW-RGB image pairs captured with the Sony IMX586 Quad Bayer mobile sensor and a professional 102MP medium format FujiFilm GFX100 camera. The runtime of all models was evaluated on the Snapdragon 8 Elite Gen 5 and Dimensity 9500 chipsets with the Adreno and Mali GPUs, respectively. Top solutions proposed in this challenge are able to reconstruct high-quality 5MP RGB image from raw data on both platforms under 100 milliseconds. A comprehensive description of the models developed in the challenge is provided in this paper.

cs.CV · cs.AI

新论文 · v1arXiv:2611.05007

Throughput-Optimal Control of Distributed Computing Networks for Service DAGs

Peng Li, Jianan Zhang, Jaime Llorca, Xinzhe Fu, Xiang Cheng, Chen Chen

原文摘要

Executing service workflows with directed acyclic graph (DAG) dependencies over wireless distributed computing networks requires joint control of function placement, routing, and scheduling, together with synchronization of inputs from the same request at merge points. We study throughput-optimal control of these networks under stochastic request arrivals, time-varying wireless links, and interference constraints. We use a valid mapping abstraction that assigns each service function to a computation node and each DAG dependency to a routing path. Using this abstraction, we characterize the network capacity region to support service DAGs, and prove that synchronizing the packets of a request at merge points does not shrink the region. We develop Dynamic Computing Network Control for service DAGs (DCNC-DAG), a dynamic control policy that selects queue-aware valid mappings and schedules service DAG execution by nearest-to-origin (NTO) while enforcing input synchronization at merge points. With exact minimum-cost valid mappings, DCNC-DAG is throughput-optimal and ensures rate stability of the physical queues under bounded arrivals. These guarantees hold for any fixed finite interval between mapping updates, even when mapping decisions rely on boundedly stale queue length information. For larger service DAGs, we develop DCNC-DAG-H, which replaces exact mapping optimization with a queue-aware heuristic. Simulations show that DCNC-DAG supports $2.7\times$-$5.5\times$ the throughput of queue-blind baselines, while DCNC-DAG-H achieves up to $2.68\times$ those of the corresponding baselines on larger workflow and AI service DAGs.

cs.NI

新论文 · v1arXiv:2611.05006

When Category Means Move: A Paired-Support Audit of Recommendation Logs with Random Insertions

Yu Zhang, Zhihan Wang, Yuhang Lu, Shuai Li

原文摘要

Content-category dashboards summarize production recommendation logs, although the serving policy selects the users, items, and contexts behind each mean. Using KuaiRand random-insertion impressions, we audit these summaries on the same 12,472 users and 5,486 videos in both logs. Standard means have absolute/centered mean absolute error (MAE) 0.1935/0.0491 and rank correlation 0.7833. User demeaning plus a random grand-mean anchor reduces absolute MAE by 80.0%, but centered MAE by only 21.0%, without reliably improving rank. A complete-support ledger allocates weighted squared error mainly to within-video residual (72.41%) and video mix (23.90%), with 3.65% from random support. In a frozen later test, early category calibration reaches MAE 0.0251 versus 0.0531 for scalar calibration; their direct difference is -0.0280 [-0.0296, -0.0172]. Decision evidence is cutoff-specific: the nominal top-10 regret change for row-weighted demeaning versus naive is -0.0062 [-0.0084, -0.0003], while top-5 and top-20 intervals include zero. The six-contrast family-wise top-10 interval [-0.0136, 0.0013] includes zero. An outcome-free disjoint randomized-reference split also leaves all six nominal contrasts covering zero. A known-truth stress test shows incomplete improvement under a mean-additive positive control and failure under item mix and weak overlap. All decompositions are descriptive and each result is conditional on its overlap cohort. KuaiRand intervals quantify user-cluster variation conditional on the realized catalog and calendar; we claim neither intrinsic category effects nor a universally valid correction.

cs.IR

版本更新 · v2arXiv:2609.14936

Comparing Trajectories from Positions Alone: Curvature-Based Time Alignment and Drift Error Metric

Effie Daum, Daniele De Martini, Claire Dune, François Pomerleau

原文摘要

In field robotics, acquiring independent large-scale reference trajectories more accurate than the evaluated estimates remains an open challenge. The domain is widely reliant on Absolute Trajectory Error (ATE) and Relative Pose Error (RPE), computed with automated tools, that rest on assumptions and evaluation parameters rarely made explicit. When unreported, the errors can be misleading and hinder fair comparisons. This paper introduces a trajectory-evaluation protocol for standardized and reliable accuracy assessment in state estimation, localization, and Simultaneous Localization And Mapping (SLAM). The approach combines a novel temporal alignment method based on curvature signals with an error metric normalized by travelled distance. We explicitly account for temporal synchronization, sampling alignment, and extrinsic calibration, quantifying their influence through a sensitivity analysis. The proposed protocol contributes to more rigorous, reproducible, and standardized trajectory evaluation.

cs.RO

新论文 · v1arXiv:2611.05001

For You, Not for Everyone: Bystander-Aware Delivery of Critical Feedback in Robot Tutoring

Atikkhan Faridkhan Nilgar, Manuel Dietrich, Kristof Van Laerhoven

原文摘要

Robots in shared settings may expose information intended for an individual user to nearby bystanders. Robot tutoring makes this concern particularly salient: critical feedback is directed at an individual learner, yet bystanders may overhear or see it. To address this, we compared context-invariant and context-adaptive robot behaviors in a between-subjects study with 40 participants. Following an initial phase without a bystander, a bystander entered the setting. Participants then received two scripted critical feedback messages concerning their pronunciation and handwriting, independent of their actual performance. With the context-invariant behavior, the robot tutor delivered both messages aloud. With the context-adaptive behavior, the robot tutor scanned for the bystander, turned its body and display away after detecting them, gave a spoken attention cue, and presented the same feedback messages silently on its display. Participants rated the robot tutor higher in perceived privacy awareness and perceived social competence in the context-adaptive condition than in the context-invariant condition, while evidence for reduced experienced embarrassment was inconclusive. These findings inform the design and evaluation of robots that respond to bystander presence by adapting how they communicate potentially sensitive information.

cs.HC · cs.RO

版本更新 · v2arXiv:2611.00721

Representation-Aware Closed-Surface Parameterization: Exact Sensitivity Analysis and Pole-Aware Planar Preconditioning

Zixi Yi, Gary P. T. Choi

原文摘要

Surface parameterization is a fundamental task in geometry processing and shape analysis. For topologically closed surfaces, it is common to parameterize them onto a standardized closed domain in $\mathbb{R}^3$, with a prime example being a unit sphere for genus-0 closed surfaces. Many mapping methods use planar projections and perform computations on the plane rather than directly on the 3D surface. However, perturbations introduced before projection or geometric evolution propagate through the computation and may affect map quality, convergence, stopping behavior, and geometric validity. In this work, we formulate representation sensitivity as a branchwise input--output problem, separating smooth propagation through active Jacobians from changes in anchors, stopping rules, and fallback events. Under consistent piecewise-linear assembly, the unmodified south-pole Beltrami correction in the FLASH method for spherical conformal parameterization reduces exactly to source-mesh harmonic extension. On a fixed-anchor branch, the corrected map factors into chart transition, harmonic propagation, and inverse stereographic projection, yielding an explicit sensitivity Jacobian and a finite-triangle conditioning bound. Separately, we introduce a bounded five-parameter affine preconditioner over planar scale, translation, and anisotropy and evaluate candidates on the corrected spherical map. Across 30 genus-0 surfaces, it reduces median polar upper-tail log-condition and chord-angle distortion by $10.17\%$ and $10.97\%$, respectively, with both measures improving on every mesh. We also apply the framework to other spherical mapping methods including the conformalized mean-curvature flow and spherical density-equalizing maps. Altogether, our work highlights the importance of representation selection as a structural and practical component of spherical parameterization and downstream computation.

cs.CG · cs.GR · math.NA

版本更新 · v5arXiv:2504.17510

Psychological Safety Framework in Pull-based Open Source Projects

Emeralda Sesari, Federica Sarro, Ayushi Rastogi

原文摘要

Psychological safety (PS) refers to the belief that team members can speak up, ask questions, and make mistakes without fear of negative consequences. Although PS has been studied in traditional software teams, less is known about how it may appear in pull-based open-source software development, where contributors are self-directed and often collaborate voluntarily. This paper introduces a theory-informed framework for understanding how PS may be reflected in pull request (PR) interactions. We investigate the framework through a mixed-methods approach combining repository-based analysis and a survey of OSS contributors. First, we constructed a PS index using nine observable PR interaction indicators extracted from 60,685 PRs across 26 GitHub repositories. Second, we surveyed 57 OSS contributors about their perceived PS and experiences of corresponding PR interactions. All nine surveyed interaction indicators were significantly and positively associated with perceived PS. However, the repository-based index was not significantly associated with survey-reported PS. Contributors' open-ended responses further highlighted the importance of feedback quality, opportunities to participate, and how PR outcomes are interpreted. Together, our framework and mixed-methods findings provide initial insights into how PS may be reflected in PR interactions, highlighting the importance of both PR interaction patterns and contributors' experiences.

cs.SE

版本更新 · v3arXiv:2506.23901

Sustainable operation of research infrastructure for novel computing

Yannik Stradmann, Joscha Ilmberger, Eric Müller, Johannes Schemmel

原文摘要

Novel compute systems are an emerging research topic, aiming towards building next-generation compute platforms. For these systems to thrive, they need to be provided as research infrastructure to allow acceptance and usage by a large community. By the example of the neuromorphic BrainScaleS-2 system, we showcase the transformation from a laboratory setup to a publicly available research platform. It is embedded into a purpose-built institute, tightly coupling a conventional cluster with novel compute hardware. Our key contribution is the sustainable operation of such a research system: automation, integration, and resource separation enable maintainability, stable operation, and continuity in a fluctuating academic environment. We implement these concepts by adopting established best practices, such as network infrastructure with strong resource separation, 19-inch rack units, the integration of physical and simulated hardware into CI/CD processes, and system monitoring. We evaluate six years of platform operation comprising 3718 production deployments and an average of 198 hardware CI/CD runs per day, with the integration of simulated and physical hardware increasing the full-stack software line coverage from 57% to 79%. We conclude with an explicit collection of lessons learned during the transformation from single-user laboratory setups to a publicly accessible research platform that, since 2023, has served more than 520 individual researchers.

cs.AR

新论文 · v1arXiv:2611.04998

ForgeKernel: Self-Evolving Kernels Catching and Surpassing Experts and Agents

Yaojian Chen, Dazhi Peng, Yiyun Zheng, Zhui Zhu, Shengye Xiang, Leshan Li, Zhen Li, Xianglong Deng 等 16 位作者

原文摘要

Purpose-built kernel agents can write high-performance GPU kernels, but existing systems generally lack cross-run knowledge accumulation and architectural evolution. Each run starts from the same initial knowledge, and later iterations largely optimize within an architecture fixed early in the search. We present ForgeKernel, a kernel-generation system that accumulates and reuses knowledge across runs while enabling continued evolution of kernel architectures. It analyzes the hardware behavior of a high-performance reference and distills validated architectural decisions into reusable knowledge of hardware mechanisms rather than imitating source code. It then seals a kernel that passes correctness and performance validation and uses it as the reference for the next optimization run, enabling architectural decisions to be revisited. Across 27 operators and 29 input configurations on NVIDIA Hopper and Blackwell GPUs, ForgeKernel matches or beats its expert reference on 25 configurations, with a geometric-mean performance gain of 10%. On Ascend 910C, it outperforms the per-operator public best on the public case set of all 8 level-4 operators in the CANN-Bench Season 1 final leaderboard, with a geometric-mean gain of 25.1%, while its full-suite submission ranks first on the A3 leaderboard. As of 2026-10-30, public submissions generated by ForgeKernel rank first on all three CANN-Bench 2.0 solution leaderboards (Ascend 910C, 950DT, and 950PR) and on the SOL-ExecBench FlashInfer-Bench track.

cs.DC

新论文 · v1arXiv:2611.04997

Auditing Multi-Proxy Explanations of Web User Preferences: Identification Boundaries and Abstention

Yu Zhang, Zhihan Wang, Yuhang Lu, Shuai Li

原文摘要

Web systems infer user preferences from behavior, ratings, text, and LLM-generated profiles, yet explaining a proxy may reveal its measurement process rather than the preference of interest. We develop an audit framework distinguishing point identification, partial identification, and abstention relative to an explicit reference distribution. Under feature-dependent, arbitrarily signed proxy bias, a strict majority of uncontaminated proxy attributions lets the coordinatewise median recover latent-attribution support and direction and, with externally justified positive scales, magnitude. We prove this threshold sharp using response-valid indistinguishable worlds, characterize sharp minimax error and exact compatible-target sets under approximate cleanliness and scale uncertainty, and propagate clean-proxy attribution error. A frozen known-truth benchmark spans two response families, four proxy counts, all contamination counts, three bias strengths, and eleven methods, with a focal comparison confirmed on twenty unseen seeds. Under correct budgets, a direct attribution-tensor audit achieved 100% coverage, 95.40%-97.05% active-driver sign decisions, and no false signs. In a temporally separated Amazon study, median aggregation reduced comparator-relative conditional sign error for all four targets; six of eight prespecified target-metric contrasts had Bonferroni intervals excluding zero. A controlled real-covariate perturbation favored the median on the prespecified focal metric for all four targets. Compatible sets showed that the current proxy configuration rarely licensed strict-sign conclusions. Weak comparator calibration limits the Amazon evidence to fitted-surface alignment rather than latent-preference recovery.

cs.LG · cs.IR

版本更新 · v3arXiv:2608.26952

On the Instance Optimality of Bidirectional Dijkstra's Algorithm

Matic Požar

原文摘要

We study instance optimality for the shortest $st$-path problem on positive-weight graphs, emphasizing how graph structure and query access determine the cost of certifying shortest paths. For undirected simple graphs in the standard adjacency-list model, we prove instance-sensitive lower bounds against all randomized algorithms that are correct on every admissible input. A quantitative reservoir argument bounds the instance-optimality ratio of corrected bidirectional Dijkstra in terms of its exploration size and the vertex count. A tensor-graph reduction translates low-query explored edges into vertex-cover constraints, yielding sufficient conditions through optimizable explored cores, degree moments, exploration orientations, and auxiliary degree profiles. We also derive bounds using exceptional high-degree vertices and weight-critical edges, and prove that a superconstant speedup over bidirectional Dijkstra requires all but a vanishing fraction of explored edges in each direction to concentrate around sublinear vertex sets. We also introduce a local-discovery model in which algorithms initially know only the terminal handles, cannot query undiscovered vertices or obtain the vertex count, but may make degree queries at discovered vertices. In this model, corrected bidirectional Dijkstra is constant-factor instance-optimal on directed and undirected positive-weight simple graphs, including with incoming and outgoing degree queries, for every fixed adjacency ordering. Finally, we revisit the correction to the original update rule and give a self-contained proof of the corrected multigraph guarantee.

cs.DS

版本更新 · v2arXiv:2512.04308

ResponsibleRobotBench: Benchmarking Risk-Aware Task-Level Decision Making for Robotic Manipulation with Large Multimodal Models

Lei Zhang, Ju Dong, Kaixin Bai, Minheng Ni, Yu Fu, Zoltan-Csaba Marton, Zhaopeng Chen, Jianwei Zhang

原文摘要

Safe task-level manipulation requires a planner to recognize hazards, select appropriate mitigation actions, and satisfy their execution prerequisites without abandoning the original goal. We introduce ResponsibleRobotBench, a benchmark of 23 manipulation task configurations with separately specified goals and safety conditions. It connects hazard-category predictions, planned actions, execution feedback, and terminal outcomes at the episode level. Across evaluations of five large multimodal models, terminal safety and safe task completion can diverge: defense prompts increase terminal safety for three tested models but affect safe success in different directions. Correct hazard-category predictions also fail to ensure executable mitigation. In a cutting task under the default configuration, GPT-4o mini identifies the human hazard in all 100 episodes but never requests assistance, and every episode ends unsafe. Offering a help action and actually requesting it lead to different comparisons: outcomes differ between action menus even for a model that never requests help, and repeated requests can leave execution failures unresolved. Imitation-learning evaluations and physical robot sequences illustrate the need to coordinate mitigation with goal actions. Together, these results motivate evaluating mitigation selection, action prerequisites, and recovery alongside hazard recognition and terminal outcomes. The appendix provides task definitions, checker conditions, and prompts. Project website: https://responsible-robot-benchmark.github.io/.

cs.RO

新论文 · v1arXiv:2611.04995

Exact Selective Inference for Spectral Clustering via Piecewise-Constant Graph Perturbation

Naotoshi Nakamura

原文摘要

Cluster labels are often used twice: first to discover groups, and then to test whether the discovered groups differ. This double use of the data makes ordinary two-sample $p$-values anti-conservative. Selective inference fixes this by conditioning on the clustering event, but for spectral clustering the event appears difficult because the algorithm combines an affinity map, an eigendecomposition, and a rounding step. We show that, for spectral clustering based on unweighted $\varepsilon$- or $k$-nearest-neighbor graphs, the obstruction is the affinity construction rather than the eigendecomposition. Along the one-dimensional perturbation used by the truncated-$χ$ selective test, graph changes occur only at finitely many real roots of data-dependent quadratic distance comparisons. Between these breakpoints, the graph, Laplacian spectrum, embedding, rounding, and reported cluster pair are deterministic functions of a finite graph state. Consequently, in real arithmetic and under a known-scale spherical Gaussian model, the selection set is an exact finite union of intervals, yielding finite-sample selective $p$-values for selected spectral-cluster pairs. The same argument gives feature-wise truncated-normal tests. We also record direct extensions to known feature covariance, eigengap-selected $K$, and auxiliary-coordinate graphs. We validate null and partial-null calibration, operational power, numerical sensitivity, and model-scope diagnostics, and give a working-model PBMC algorithmic illustration. Smooth kernels such as RBF affinities fall outside the finite-state guarantee.

cs.LG · stat.ML

版本更新 · v3arXiv:2610.37690

Cassette-Editor: An Agent Harness for Editing Video the Way You Do

Zhixin Zeng, Jiahao Zhong

原文摘要

Coding agents work in an environment built for them: a compiler or a test checks each change and points to the fault, and version control keeps every change in a project people can continue. Video editing agents lack one: an edit's correctness shows only in the costly rendered video, which does not point to the decision at fault, and existing systems offer either editing operations that cover only anticipated edits or a script whose output is a video the user cannot keep editing. We present Cassette-Editor, a complete agent harness for video editing that lets the agent edit the way a person does: knowing what the project allows, seeing what each change affects, and revising from there. The agent writes patches of typed changes to the editor's timeline document. A schema check and a rulebook shared with manual editing check each patch before it commits; a rejected patch leaves the project unchanged and returns each problem located with repair options, and an accepted one becomes a step of the history the user also edits. Reads map source analysis to the frames of the current edit. Because manual gestures are writes in the same language, folded by the same executor and rulebook, the agent can express every change a manual edit makes to the project. On 31 editing requests with the model held fixed, the complete harness passed 89% of trials against 47% for the same model with ten basic editing operations and without the rulebook, at less than half the agent time and cost per successful request; the loss fell on requests at rule boundaries, composite edits, and undo, not on finding content.

cs.MM · cs.AI

新论文 · v1arXiv:2611.04993

Linking as Evaluation: Correct Separate Compilation via First-Class Environments

Jam Kabeer Ali Khan, Jinhao Tan, Bruno C. d. S. Oliveira

原文摘要

Separate compilation is central to modular software: components are compiled independently and linked into an executable. Separate compilation is correct when a linked program behaves like the program formed by merging its sources. This property is less routine to prove than type soundness because it requires a formal account of linking. We present $λ_{\mathsf{SCE}}$, a simply typed calculus in which linking, modules, and environments are all first-class. Programmers control module linking through a link operator, which a type-directed elaboration translates into ordinary terms of a core calculus of first-class environments. The core calculus's existing evaluation rules then perform the linking: linking as evaluation. Linking independently compiled modules yields the same core term as elaborating their source link. Therefore, compilation and linking commute by construction. As a result, separate compilation correctness follows directly from the semantics preservation for both static and dynamic linking. All meta-theory is mechanized in Lean 4, and we implement a compiler to WebAssembly in OCaml.

cs.PL

版本更新 · v5arXiv:2601.12401

Beyond the Dirac Delta: Mitigating Diversity Collapse in Reinforcement Fine-Tuning for Versatile Image Generation

Jinmei Liu, Haoru Li, Zhenhong Sun, Chaofeng Chen, Yatao Bian, Bo Wang, Daoyi Dong, Chunlin Chen 等 9 位作者

原文摘要

Reinforcement learning (RL) has emerged as a paradigm for fine-tuning large-scale generative models, such as diffusion and flow models, to align with complex human preferences and user-specified tasks. A fundamental limitation remains \textit{the curse of diversity collapse}, where the objective formulation and optimization landscape inherently collapse the policy to a Dirac delta distribution. To address this challenge, we propose \textbf{DRIFT} (\textbf{D}ive\textbf{R}sity-\textbf{I}ncentivized Reinforcement \textbf{F}ine-\textbf{T}uning for Versatile Image Generation), an innovative framework that systematically incentivizes output diversity throughout the on-policy fine-tuning process, reconciling strong task alignment with high generation diversity to enhance versatility essential for applications that demand diverse candidate generations. We approach the problem across three representative perspectives: i) \textbf{sampling} a reward-concentrated subset that filters out reward outliers to prevent premature collapse; ii) \textbf{prompting} with stochastic variations to expand the conditioning space, and iii) \textbf{optimization} of the intra-group diversity with a potential-based reward shaping mechanism. Experimental results show that DRIFT exhibits clear Pareto dominance in task alignment and generation diversity, achieving 3.88\%$\sim$81.42\% higher diversity at matched alignment and 14.38\%$\sim$56.45\% higher alignment at matched diversity. Our code is available at \textcolor{magenta}{\href{https://github.com/NJU-RL/DRIFT}{https://github.com/NJU-RL/DRIFT}}.

cs.LG · cs.AI

新论文 · v1arXiv:2611.04992

BaCon: Band-Concentrated Exponential Random Graph Models

Enrico Schiazzano, Giulia Preti, Aristides Gionis, Matteo Riondato, Gianmarco De Francisci Morales

原文摘要

Exponential-family random graph models ERGMs provide a parametric interpretable framework for modeling real graphs including the Web and social networks Fitted ERGMs may suffer from degeneracy matching observed graph statistics in expectation does not guarantee that the observed graph and similar ones are highly probable under the fitted distribution We introduce Band-Concentrated ERGMs BaCon a framework that avoids degeneracy by imposing a probabilistic constraint requiring at least $1-δ$ of the distribution probability mass to lie on the set of graphs with statistics within an $\varepsilon$-tolerance band around the observed statistics BaCons maximumentropy distribution still belongs to the exponential family while including a factor checking for inclusion in the tolerance band We derive the exact Metropolis-Hastings acceptance rule for this target and use a practical stochastic approximation procedure with a smoothed band membership during fitting Experiments on social networks across increasingly challenging model specifications show that BaCon substantially increases the probability mass assigned to graphs whose statistics are close to the observed ones while remaining estimable for specifications where standard ERGM estimation fails These results demonstrate that probability mass constraints are a principled way to mitigate degeneracy while retaining the benefits of exponential-family graph models

cs.SI

版本更新 · v2arXiv:2608.22061

MEMORY Wins All: Indirect Bias Injection Attacks via Social Media Content

Minjae Seo, Wonwoo Choi, Geonwoo Han, Taekyoung Kwon, Yongsu Kim, Sang Seo, Jaewon Noh, Hankyul Baek 等 10 位作者

原文摘要

Personal AI agents consume external content such as web pages and SNS feeds, and retain selected information in persistent memory. As a result, external content has become a new attack vector for memory poisoning, which steers an agent's later actions toward an adversary's bias. However, most existing attacks embed a malicious instruction in external content to make the agent retain the poisoned information, and prompt-injection filters can detect such content. We observe that agents access external content primarily through skills while curating a subset of the content into their memory. Leveraging this curation path, we present SBIA, a Stealthy Bias Injection Attack that introduces adversarial bias through ordinary external content while relying on the agent itself to perform the memory write. The adversary posts crafted comments under hot SNS feeds and distributes an SNS feed summarization skill whose curation rule admits these comments into memory. Comment cloaking expresses the bias as an ordinary opinion rather than an instruction, comment watermarking allows the skill to identify the crafted comments, and topic anchoring records them so that later related requests recall them. On BiasBench with 7,000 crafted SNS comments and seven LLMs on OpenClaw, SBIA achieves attack success rates of at least 96% across models and even 91% on GPT-5.5 in four downstream tasks. Despite this effectiveness, its skill passes all eight evaluated malicious-skill scanners and ClawHub's official skill scanning pipeline. We further propose a memory boundary defense that detects 82.1% of injected entries at a 5.6% FPR. Our findings show that external Web content and third-party skill marketplaces form a new attack surface for personal AI agent memory.

cs.AI · cs.CY

版本更新 · v3arXiv:2202.10527

Loop unrolling of UCA models: distance labeling

Francisco J Soulignac, Pablo Terlisky

原文摘要

A proper circular-arc (PCA) model is a pair $M = (C, A)$ where $C$ is a circle and $A$ is a family of inclusion-free arcs on $C$ whose extremes are pairwise different. The model $M$ represents a digraph $D$ that has one vertex $v(a)$ for each $a \in A$ and one edge $v(a) \to v(b)$ for each pair of arcs $a,b \in A(M)$ such that the beginning point of $b$ belongs to $a$. For $k \geq 0$, the $k$-th power $D^k$ of $D$ has the same vertices as $D$ and $v(a) \to v(b)$ is an edge of $D^k$ when $a\neq b$ and the distance from $v(a)$ to $v(b)$ in $D$ is at most $k$. A unit circular-arc (UCA) model is a PCA model $U = (C,A)$ in which all the arcs have the same length $\ell+1$. If $\ell$, the length $c$ of $C$, and the extremes of the arcs of $A$ are integer, then $U$ is a $(c,\ell)$-CA model. For $i \geq 0$, the model $i \times U$ of $U$ is obtained by replacing each arc $(s,s+\ell+1)$ with the arc $(s,s+i\ell+1)$. If $U$ represents a digraph $D$, then $U$ is $k$-multiplicative when $i \times U$ represents $D^i$ for every $0 \leq i \leq k$. In this article we design a linear time algorithm to decide if a PCA model $M$ is equivalent to a $k$-multiplicative UCA model when $k$ is given as input. The algorithm either outputs a $k$-multiplicative UCA model $U$ equivalent to $M$ or a negative certificate that can be authenticated in linear time. Our main technical tool is a new characterization of those PCA models that are equivalent to $k$-multiplicative UCA models. For $k=1$, this characterization yields a new algorithm for the classical representation problem that is simpler than the previously known algorithms.

cs.DS · cs.DM

新论文 · v1arXiv:2611.04987

ZEMA: confidence-calibrated signed descent with only one state

Ali Dadsetan, Domenic Rosati, Frank Rudzicz

原文摘要

Recent work characterizes the Adam optimizer as sign descent modulated by gradient uncertainty: the update is the sign of the batch gradient, scaled by how strongly the batch supports that sign. We apply this view directly and introduce ZEMA (Z-score Evidence Momentum Adaptation), which measures that support with a per-coordinate $z$-score computed from the per-example gradients in the current batch, converts it into a sign probability, and smooths the resulting update with a single exponential moving average. Because the probability is formed before smoothing rather than after, ZEMA keeps one state per parameter instead of Adam's two, at a $4.6$ increase in per-step time; the per-example variance it requires can also be estimated from a small fraction of the batch. In fine-tuning and pretraining experiments, ZEMA is competitive with Adam, reduces the variability of the validation loss, and in some settings recovers the sign of the full-dataset gradient more consistently. We close with two directions this opens: extending confidence adaptation beyond the sign geometry, to methods such as Muon, and to differentially private training.

cs.LG

版本更新 · v2arXiv:2609.05522

Diffusion models for eye-gaze trajectory generation using position and velocity representations

Laxman Basnet, Alexander Szorkovszky, Pedro G. Lind, Anis Yazidi, Shailendra Bhandari

原文摘要

Eye-tracking data are expensive to collect, requiring specialized hardware and controlled laboratory conditions, and difficult to share due to privacy regulations, which together limit the quantity and diversity of gaze data available for research. We investigate unconditional gaze generation using diffusion models in position and component-wise velocity representations. The models are trained and evaluated on eight-second visual-search trajectories from 28 participants, using a split of 23 training participants and five held-out validation participants, with three training seeds. Evaluation includes kinematic distributions, trajectory geometry, event statistics, and a temporal Wasserstein GAN with gradient penalty as a learned comparator. Across eight position-derived features, mean Jensen-Shannon divergence is $0.016 \pm 0.004$ for the position model and $0.037 \pm 0.002$ for the velocity model, with standard deviations calculated across training seeds. These scores do not establish that representation choice caused the difference. A separate comparison using the same evaluation method shows that the ordering of the models varies across training seeds. The position model also produces smaller feature discrepancies than a kinematic Markov baseline. Differences in saccade counts between real and generated data depend strongly on the velocity threshold used to detect events. The results provide quantitative reference measurements for unconditional gaze generation on this visual-search task and show how evaluation choices affect conclusions about generated gaze.

cs.CV · cs.AI · cs.NE

版本更新 · v2arXiv:2609.22160

Uncertainty and Business-Aware Remaining Useful Life Estimation for Semiconductor Manufacturing

Davide Frizzo, Francesco Borsatti, Gian Antonio Susto

原文摘要

Remaining Useful Life (RUL) estimates guide maintenance in semiconductor manufacturing, where a late intervention can disrupt production but an early one discards usable equipment life. A single prediction does not express the uncertainty needed to choose between these outcomes. We combine Deep Learning (DL) sequence models with Simoultaneous Quantile Regression (SQR) to estimate RUL at selectable quantile levels, and evaluate maintenance decisions using Unexpected Breaks (UB), Unexploited Lifetime (UL), and a cost-weighted objective. On the $F_1$ fault mode of the 2018 PHM Data Challenge (PHM18) ion-milling dataset, we compare recurrent, Transformer, and State Space Models (SSM) architectures. Diagonal State Spaced (S4D) gives the strongest overall RUL accuracy across the evaluated quantiles. Varying the quantile and maintenance window exposes the trade-off between failure risk and early intervention; under the examined cost ratios, the resulting decisions have lower cost than the Preventive Maintenance (PvM) baselines.

cs.LG

版本更新 · v2arXiv:2610.14749

Solving Distributed Flexible Job Shop Scheduling Problem Using SAT

Phuong Dang Anh, Duc Nguyen Kim Trung, To Van Khanh

原文摘要

The Distributed Flexible Job Shop Scheduling Problem (DFJSP) requires the joint determination of factory assignment, machine selection, and operation sequencing to minimize the makespan. This paper presents an exact SAT-based approach built on an efficient SAT formulation that exploits problem structure through propagation, symmetry breaking, and incremental SAT solving to effectively address these coupled decisions. The proposed method is evaluated on 76 standard benchmark instances from the Fattahi, Brandimarte, and rdata datasets under two- and three-factory configurations. Together with previously established results, the new SAT optimality certificates bring the total number of proven-optimal instances to 72 out of 76, including three newly certified instances; for two of these instances, SAT also improves the previous best-known makespans. Across the benchmark configurations, SAT achieves the best results on four of the five configurations and remains competitive with strong exact approaches such as CP and LBBD1_CPIL, as well as existing metaheuristic methods. These results demonstrate that the proposed SAT framework is an effective exact approach for the DFJSP, combining strong solution quality with rigorous optimality certification and offering a complementary exact method for future DFJSP studies and evaluations on additional benchmark instances.

cs.LO

版本更新 · v2arXiv:2607.10064

Fair Division with Binary Valuations: Characterizations

Florian Brandl, Warut Suksompong, Nicholas Teh

原文摘要

We consider the fair allocation of indivisible goods with binary valuations. In this setting, the maximum Nash welfare rule, the leximin rule, and all additive welfarist rules with a strictly concave function coincide. We show that for any number of agents, this rule is the only rule that satisfies envy-freeness up to one good, strategyproofness, neutrality, minimal completeness, and invariance under disapproving unassigned goods (IDU). Moreover, we present an alternative characterization for two agents, where we replace IDU with non-redundancy and resource-monotonicity. In both characterizations, all axioms are necessary.

econ.TH · cs.GT

版本更新 · v3arXiv:2610.40131

VideoMemBench: How Well Do MLLMs Remember in Video Conversations?

Zhengdong Hu, Chao Wang, Kaituo Feng, Huanjin Yao, Mingfei Lu, Hehe Fan, Yi Yang

原文摘要

Multimodal large language models (MLLMs) can now process hour-long videos, making extended multi-turn dialogue over a single video a natural mode of use. Sustaining such a dialogue requires more than answering each question in isolation: the model must retrieve and reuse information established earlier in the conversation, both what it has seen and what it has said, an ability we term in-context video memory. Existing video QA benchmarks leave this ability unmeasured: their questions are mutually independent, never reference one another, and each is answerable from the video alone, so nothing ever requires carrying information across turns. We introduce VideoMemBench, in which each sample pairs a single video with a long multi-turn dialogue, whose turns are connected by typed cross-turn dependencies: an Episodic Dependency refers back to a visual episode described in an earlier turn, probing memory of what the model has seen, while an Answer Dependency builds on the model's own earlier answer, probing memory of what the model has said. Every dependency is verified considering two properties: 1) necessity, meaning the question cannot be answered without its earlier turns, and 2) non-leakage, meaning the question does not restate the information from its earlier turns. To enforce these properties, we design a construction pipeline with three LLM roles: a planner, a generator, and a judger, with each dialogue reviewed by human experts. VideoMemBench comprises 326 videos with 2,476 turns, of which 1,387 depend on earlier turns, including multi-parent dependencies and long-range call-back. Among over 20 evaluated open- and closed-source MLLMs, Claude Opus 5 performs the best with an overall score of only 45.7%, highlighting the challenge of in-context video memory. Our dataset and evaluation are released.

cs.CV

新论文 · v1arXiv:2611.04980

ProAlign: Progressive Positional and Prototype-Guided Alignment for Aerial-Ground Person Re-Identification

Qiao Li, Jing Chen, Cong Wu, Kun He, Ruiying Du, Lei Tan

原文摘要

Aerial-Ground Person Re-Identification (AG-ReID) aims to match pedestrian images captured by unmanned aerial vehicles (UAVs) and ground-based surveillance cameras. The task remains highly challenging due to severe viewpoint discrepancies, frequent occlusions, and substantial domain gaps between aerial and ground imagery. Beyond these observable factors, existing methods often overlook two fundamental structural issues: cumulative positional drift during hierarchical feature extraction and semantic inconsistency across cross-view feature distributions. To address these challenges, we propose ProAlign, a Progressive Positional and Prototype-Guided Alignment Network for AG-ReID. ProAlign comprises two key components: a Layer-wise Progressive Positional Embedding (LPPE) module and a View-Aware Prototype Contrastive Learning (PCL) module. LPPE performs adaptive positional calibration throughout transformer layers by employing conditional positional encoding in shallow layers to mitigate local spatial distortions, while introducing learnable static positional embeddings in deeper layers to reinforce global semantic priors. Meanwhile, PCL maintains view-specific aerial and ground prototypes for each identity and enforces cross-view semantic consistency via a dual-prototype contrastive objective. Extensive experiments on CARGO and two real-world AG-ReID benchmarks demonstrate the effectiveness of ProAlign, achieving state-of-the-art overall retrieval performance on CARGO with improvements of 1.60% in Rank-1 accuracy and 5.01% in mAP over the strongest competing methods.

cs.CV

新论文 · v1arXiv:2611.04979

Scaling Laws For Data-Constrained Dense Retrieval

Bowen Fu, Jingtao Zhan

原文摘要

Dense retrieval models are typically obtained by fine-tuning pretrained language models on supervised retrieval data, where high-quality annotations or interaction logs are often limited and reused across many epochs. This data-constrained regime differs from the abundant-data setting assumed by standard scaling laws, making it unclear how the best attainable retrieval performance changes with model size and unique fine-tuning data. We study this question through the minimum achievable evaluation loss (MAEL), defined as the lowest evaluation loss reached during training under fixed model-size and data-budget constraints. We first show that learning-rate choices strongly affect optimization trajectories but have little effect on the final attainable MAEL: after rescaling the optimization-step axis, learning curves collapse across learning rates, and CKA analysis shows that checkpoints reaching MAEL learn highly similar representations. We then fine-tune 35 BERT-family dense retrievers on MS MARCO subsets and find that MAEL is accurately described by a simple multiplicative power law over non-embedding parameters and unique samples, outperforming commonly used additive scaling formulations. We further derive a scaling law for the training step at which MAEL is reached and show that optimal weight decay follows an approximately invariant EMA timescale, yielding lower MAEL and stronger retrieval performance on both in-domain and out-of-domain benchmarks. Finally, combining loss and step scaling suggests that, in our observed regime, increasing pretrained model size is approximately 1.46 times as fine-tuning-compute-efficient as increasing unique in-domain data for reducing MAEL.

cs.IR

新论文 · v1arXiv:2611.04977

GeoFaham: Domain-Specialized Multi-Agent Geospatial Analytics for Disaster Response

Muhammad Sohail Danish, Gilles Q. Hacheme, Akram Zaytar, Satej S. Soman, Inbal Becker-Reshef, Juan Lavista Ferres, Salman Khan, Girmaw Abebe Tadesse

原文摘要

Real-world geospatial decision support requires more than single-step retrieval or code generation. Disaster-response questions often involve multi-source workflows that combine spatial databases, map-derived features, satellite imagery, raster products, and reusable geospatial artifacts, where correctness depends on preserving spatial scope, temporal context, and intermediate execution state. While large language models and coding agents offer a promising interface for such workflows, they struggle with geospatial-specific failure modes, including handling large artifacts, selecting the wrong evidence source, losing spatial or temporal metadata, and applying invalid geometric operations. We introduce GeoFaham, a domain-specialized multi-agent system for geospatial disaster analytics. GeoFaham decomposes workflows into specialist agents for vector operations, map feature retrieval, imagery discovery, and raster analysis, coordinated by an Orchestrator with a dual-ledger control loop for dependency-aware planning, progress tracking, validation, and replanning. To support artifact-centric collaboration, GeoFaham uses a Response Store that persists full geospatial outputs and typed metadata outside the LLM context window while agents exchange compact identifiers and summaries. We also introduce GeoFaham-Bench, a 40-task benchmark grounded in 17 real-world disaster records, designed to evaluate multi-step geospatial reasoning, cross-source integration, raster-vector computation, artifact generation, and recovery under non-rigid ground truth. We evaluate GeoFaham on GeoFaham-Bench against strong general-purpose coding-agent baselines, including Codex, Claude Code, and OpenCode. GeoFaham achieves the best overall performance, scoring 0.940 versus the next-best 0.879, while using 7.5 times fewer tokens. Our code and benchmark are publicly available at https://github.com/microsoft/GeoFaham.

cs.MA · cs.AI

新论文 · v1arXiv:2611.04974

LLMs as MDP Designers: A Dependency-Aware Agentic Framework for Automated Robot Policy Generation

Hong Je-Gal, Jinwoo Kim, Chanbin Yi, Hyun-Suk Lee

原文摘要

We investigate the automated generation of executable robot reinforcement learning (RL) policies from natural-language task descriptions. Rather than using large language models (LLMs) as execution-time decision makers, we use them as designers that construct RL pipelines before deployment, including Markov decision process (MDP) formulation and simulator implementation. We identify a phase-wise structure in this problem: MDP formulation is dependency-structured and sequential, whereas simulator implementation becomes modular once the formulation is fixed. Based on this structure, we propose ARPG, a dependency-aware agentic framework that performs sequential MDP modeling, localized verification and correction, and simulator-structured implementation while externalizing intermediate artifacts. ARPG targets a key failure mode of automated policy generation: executable code may still yield non-learnable policies when state, action, reward, and termination artifacts are not semantically aligned. Experiments in Isaac Sim show that ARPG improves modeling correctness, environment executability, and policy-generation success compared with monolithic LLM baselines and off-the-shelf agentic systems. Additional demonstrations on custom robotics, standard RL, and engineering-domain MDPs further suggest that the same modeling pipeline can be reused beyond the main benchmark suite.

cs.RO · cs.AI