跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

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

找到 24,106 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v2arXiv:2610.01002

What Can Analogy Tell Us About Artificial Consciousness?

Keith J. Holyoak, Martin M. Monti

原文摘要

Who or what is conscious? Because subjective experience is directly accessible only in the first person, judgments about consciousness in other entities depend partly on analogy. Historically, such inferences have focused on nonhuman animals, but advances in artificial intelligence have raised the possibility of conscious AI. Here we develop a causal framework for evaluating such evidential analogies. The key distinction is between similarities in factors plausibly involved in generating consciousness and similarities in downstream behavioural or cognitive effects. Our framework weights source-target similarity by causal relevance while allowing for unknown causes, disabling differences and alternative routes to consciousness. Applied to biological systems, it explains why analogical support generally weakens with increasing causal distance from humans. Applied to contemporary AI, it suggests that behavioural similarity provides only limited evidence for consciousness because relevant causal correspondences remain poorly established. The framework also clarifies what evidence would strengthen claims of artificial consciousness.

cs.AI

版本更新 · v2arXiv:2609.07868

SGD in Multiclass Logistic Regression: Sequential Learning and Scaling Laws

Konstantinos Christopher Tsiolis, Denny Wu, Christos Thrampoulidis, Murat A. Erdogdu

原文摘要

We study the training dynamics of multiclass logistic regression on high-dimensional mixture models with a large number of classes and establish precise scaling laws governing the cross-entropy risk under gradient-based optimization. We show that learning proceeds sequentially across classes, from most to least frequent. When the class priors follow a power law distribution, the risk dynamics decompose into three phases: an initial plateau until the first class is learned, a power-law decay regime during which sequential learning occurs, and a final convergence regime. We then analyze how model capacity interacts with optimization under a fixed compute budget. When the effective dimension is restricted via projection onto leading principal components, the risk decomposes into a capacity term (a power law in the retained dimension) and an optimization term (a power law in training time). Optimizing this tradeoff yields a compute-optimal scaling law for logistic regression, with explicit prescriptions for model size and training time as functions of compute. These results extend theoretical scaling laws from linear regression to multiclass classification, while connecting to empirical scaling laws observed in large-scale neural networks.

stat.ML · cs.LG

新论文 · v1arXiv:2611.10341

Collaboration Signatures: Tracking Long-Horizon Dynamics of Cross-Meeting Collaboration Networks

Shengqi Zhu, Sheshera Mysore, Bahareh Sarrafzadeh

原文摘要

Enterprise platforms have received increasing attention as a core component of social networks and the Web. However, existing work mostly relies on fragmented logs of small units of work, like emails and chats, and focuses on who connects with whom without sufficient account of collaboration content and dynamics. This work systematically explores tracking collaborations across sequences of meetings as a new approach to interpreting their long-horizon dynamics. Linking 45,426 meetings in a large multinational technology company based on full transcripts and 1.6 million extracted agenda items, we establish a cross-meeting collaboration network of 6,065 collaborations. The network recovers the natural shapes of workplace collaborations: meetings, as snapshots of ongoing collaboration, link into largely tree-shaped structures, while the work content forms nested directed acyclic graphs (DAGs). Further, we explore how these networks evolve over time, examining three established perspectives: task division, team composition, and temporal continuity. Each explains part of the dynamics but does not capture the distinctness of long-horizon workplace collaboration: e.g., work flows in a consistent direction between a few pairs of subjects, yet a collaboration's subject explains little of how its meetings are conducted. Instead, accumulating the agenda, interaction, and language of meetings along each tree yields a signature of the collaboration, a distinctive profile that picks out the collaboration of a held-out meeting at 4.5 times chance. The signature models collaboration better than team or task views, individually or combined, in next-meeting prediction and tree-level fitting. We discuss the implications of these cross-meeting dynamics for designing office applications and support tools, and call for next-generation Web systems that represent collaborations over their long horizon.

cs.SI · cs.CL · cs.CY · cs.HC

版本更新 · v3arXiv:2604.16706

Measuring What Tool-Using LLM Agents Actually Do: Structured Validation, Causal Error Propagation, and Fabricated Tool Use

Bhaskar Gurram

原文摘要

Tool-using agents built on large language models (LLMs) are usually scored by comparing the final answer with a reference text, using a string heuristic or an LLM judge. This is unreliable when the references describe the task rather than its answer. We replace it with a deterministic validator that checks the tools called, the executed parameters, the resulting state, and whether the values in the answer are supported by the correct tool observations. We re-scored 33,583 traces from 13 agents on simulated calendar, weather, medical and retail tools. The simulator reproduced all 10,396 logged observations, and the gold observations supported the validator in 16 of 18 disagreements with a three-annotator majority (the annotators in none). The instrument changes conclusions: on the same 306 traces, Gemini-2.0-Flash scores 63.4% under the substring heuristic and 5.6% under the validator. In a paired design (same task and model, with and without one schema-valid wrong argument injected into the first tool call), the error rate rises from 52.4% to 74.5% (+22.0 percentage points, 95% CI 18.4-25.5; 1,085 pairs, 7 models), and by 44.7 points (38.4-51.0) where the corrupted call executed without errors. An LLM-judge ensemble estimates +2.5 points on the same pairs. Agents also report tool results without executing any call, in 0-42.5% of traces depending on the model (rule-based lower bounds), largely because the harness accepts an action and a final answer in one completion. A rule-based runtime monitor costs about 7 microseconds per trace but reduces wrong answers mainly by abstaining.

cs.AI · cs.CL · cs.MA

新论文 · v1arXiv:2611.10340

IdealCache: Rethinking Cache Scheduling in Diffusion Transformers via Ideal Trajectories

Shang Xue, Li Zhu, Ping Chen

原文摘要

Feature caching accelerates Diffusion Transformers by reusing intermediate computations across denoising timesteps, yet existing methods share a fundamental blind spot: they treat the standard reference denoising trajectory as the optimisation target, approximating its per-step states and thus inheriting its output as an implicit quality ceiling. We argue that this target is arbitrary -- what truly matters is the ideal result, not the intermediate path taken to reach it. We propose IdealCache, a training-free framework that abandons step-wise imitation of the reference trajectory. Instead, it anchors caching on a per-input ensemble of ideal trajectories constructed from candidate target results, aggregates their geometry into a single graph, and discovers optimal non-uniform schedules via a constrained shortest path on this graph. By decoupling from the reference process, IdealCache breaks the performance bottleneck of trajectory-approximation; our schedules can attain near-lossless fidelity in generation and even surpass on task-specific metrics (e.g., maintaining higher semantic consistency in image editing). Without retraining, IdealCache achieves 6.35x speedup on Qwen-Image, 5.84x on Qwen-Image-Edit, and 4.32x on HunyuanVideo, with competitive or superior quality across tasks.

cs.AI

新论文 · v1arXiv:2611.10338

On the universal structure in deterministic generative diffusion

Defang Chen, Zhenyu Zhou, Can Wang, Zeyu Zheng, Siwei Lyu

原文摘要

Diffusion-based generative modeling has emerged as a general computational framework for simulating high-dimensional, structured data across various domains. Understanding its generative mechanisms is paramount for advancing model training and inference in a principled way. Here, we demonstrate that deterministic sampling trajectories share a universal geometric structure invariant to data modalities and diffusion model implementations. This structure can be largely explained by an exactly solvable model based on the optimal linear denoiser.

cs.LG · cond-mat.stat-mech · cs.CV · stat.ML

版本更新 · v3arXiv:2606.30901

GRAPE: Graph-Augmented Prototype Explanations for Interactive Medical Image Diagnosis

Rasul Khanbayov, Erchin Serpedin, Hasan Kurban

原文摘要

Prototype-based medical image classifiers present three clinical limitations: they treat findings as independent, silently amplify unsafe physician feedback, and require full retraining whenever a new finding is needed. We present GRAPE (Graph-Augmented Prototype Explanations), a unified architecture that targets all three challenges. First, a Graph Attention Task Head boosts macro-F1 by +13.8,pp over the prototype baseline on TBX11K but not on NIH ChestX-ray14, with no graph-specific benefit established. Second, a Concept-Mismatch Safety Check, to our knowledge the first such mechanism in prototype-based medical classifiers, warns when the model's dominant finding inside a doctor-drawn region conflicts with the claimed label, catching 85% of simulated erroneous annotations with no extra inference cost at a favorable operating point, though sensitivity falls substantially at clinically realistic false-positive budgets. Third, Open-Vocabulary Prototype Anchoring aligns visual prototypes to clinical text, allowing a new finding to be added from a single labeled image without modifying any other component, evaluated for localization only. On NIH ChestX-ray14, one Effusion example matched that concept's low fully-supervised Pointing Game ceiling in one run but not in a second. On TBX11K, prototype maps achieve 2.1x better lesion localization than end-to-end concept-based baselines. The graph head adds only +1~ms latency at interactive batch size. The project page is available at https://kurbanintelligencelab.github.io/GRAPE.

cs.CV

新论文 · v1arXiv:2611.10337

TimeTraveler: Temporal Strategy Planning with Time Dictionary for Streaming Video Understanding

Minkuk Kim, Junho Kim, Seong Tae Kim

原文摘要

Streaming video understanding (SVU) requires models to answer user queries over continuously evolving video streams. Unlike offline video QA, SVU must handle queries whose evidence may lie in the past, appear in the current scene, or emerge only after future observations. Existing streaming video systems often rely on compact visual memories or fixed evidence-access schemes, which can lose fine-grained details and fail to adapt the answering process to the temporal intent of each query. In this paper, we propose TimeTraveler, a streaming VQA framework that performs temporal strategy planning with a Time Dictionary. Inspired by the need to search across different temporal regions of a stream, TimeTraveler stores each observed moment as a timestamp-indexed structured caption and uses this dictionary as an explicit source of queryable evidence. Given a query, TimeTraveler determines whether to recall past evidence, read the present context, or wait for future observations, and then applies a strategy-specific evidence acquisition process. Comparative experiments on streaming video QA benchmarks show that TimeTraveler improves streaming question answering by preserving fine-grained temporal evidence and selecting the appropriate temporal strategy for each query. The project page is available at https://geppa.github.io/TimeTraveler.

cs.CV

新论文 · v1arXiv:2611.10335

Two-Sided Conformal Evidence Sets for Retrieval-Augmented Generation

Ben Jenkins, Mihaela Cardei

原文摘要

Retrieval-augmented generation (RAG) can surface passages that support a claim, contradict it, or fail to address it, yet existing calibrated grounding methods are typically one-sided and model only supporting evidence. We introduce Conformal Evidence Sets (CES), a two-sided framework that returns separate support and refutation sets with finite-sample inclusion coverage of at least $1-α$ on each side under exchangeability; a Bonferroni union yields joint coverage of at least $1-2α$. On labeled candidate pools from the contrastive VitaminC benchmark, CES closely tracks nominal coverage across $α\!\in\!\{0.05,0.10,0.15,0.20,0.30\}$, with maximum deviations of $3.0$ percentage points for support and $5.4$ for refutation, and reaches essentially the same empirical coverage--size frontier as a test-tuned fixed-threshold heuristic without any test exposure. Stress tests mark the boundary of that guarantee: under FEVER distribution shift both sides under-cover, by up to $12.7$ percentage points, and support-side group-stratified recalibration substantially reduces the support gap. Scorer swaps, hard-negative retrieval, cross-dataset transfer, and a live end-to-end pilot expose a clear separation: when exchangeability holds and relevant evidence is retrieved, evidence inclusion remains calibrated even with an imperfect scorer, whereas the support/refute verdict tracks scorer quality directly. Calibrated evidence coverage and reliable verdicts are therefore distinct properties and should be reported separately.

cs.LG · cs.CL

新论文 · v1arXiv:2611.10334

Reproducible LoRA Inference Through Deterministic Split-K Reduction

Dhayaneshwar Balusamy, Ankur Mohan

原文摘要

Reproducibility is important for LoRA-adapted language models used in repeated evaluation, auditing, and decision-making. However, Split-K kernels used to introduce parallelism in low-rank LoRA multiplications can have the unintended consequence of numerical nondeterminism when partial results are combined using floating-point atomic additions. We investigate this non-determinism in vLLM across GSM8K mathematical reasoning, MBPP code generation, and Jev-style structured toxicity decisions on Civil Comments and introduce a deterministic Triton Split-K implementation. Under identical-input replay, Atomic Split-K=8 produces different FP32 shrink outputs in 97.61% of comparisons, while our Deterministic Split-K=8 shows no observed variation. Repeated atomic inference changes generated outputs in 17.30% of GSM8K and 14.96% of MBPP comparisons, sometimes altering task correctness. Structured-decision probabilities vary in 81.47% of atomic comparisons, with decision flips. Controlled tracing demonstrates how shrink-output differences propagate into the KV cache and how accumulated cache differences can change token decisions and final answers. Our deterministic Triton Split-K=8 implementation preserves parallelism, achieving 16.8-21.1% latency-based speedup over unsplit reduction with only 1.02-2.62% additional latency relative to Atomic Split-K=8.

cs.LG · cs.AI · cs.DC · cs.PF

版本更新 · v3arXiv:2609.25722

Signed Graph Pre-Training and Prompt Learning

Zihan Mei, Rong Pan, Yuzhou Chen, Yixuan He

原文摘要

Signed graphs arise in trust--distrust networks, financial correlation systems, biological interaction graphs, and many other domains in which edges can be positive or negative and may also be directed. While signed graph neural networks have improved task-specific learning, graph transfer learning on signed graphs remains underdeveloped. In this paper, we introduce TopoSIGN, a pioneer topology-guided graph pre-training and prompt learning framework for signed graphs. TopoSIGN combines a structural encoder built on the magnetic signed Laplacian with a novel persistent-homology branch that summarizes signed topology through Dowker-complex persistence images. The fused embeddings are then transferred to a prompt learning function. Experimental results on synthetic and real-world datasets demonstrate the efficacy of TopoSIGN in extracting useful structural information in signed graphs, as well as the adaptability and flexibility of the proposed general framework.

cs.LG

新论文 · v1arXiv:2611.10331

Evaluating classification and explainability in multimodal petrographic image analysis

Thomas James Wood, Oktay Karakuş, Can Eyüpoğlu

原文摘要

Automated thin-section classifiers increasingly combine plane-polarised and cross-polarised light (PPL and XPL), two complementary views central to petrographic identification. Classification accuracy alone does not reveal whether model errors reflect mineralogical relationships, how predictions depend on each optical view, or whether attribution maps identify regions that influence model decisions. Here, we examine these complementary aspects of the released LITHOS dual-stream vision transformer using outputs from an earlier evaluation of 105,802 expert-annotated grains across 25 categories. Classification errors frequently followed the label taxonomy: 72.6\% of misclassified plagioclase, microcline and sanidine grains were assigned the generic Feldspar label, while 87.1\% of quartz-family grains received a label within that family, compared with 66.6\% assigned their exact label. Replacing the XPL input with its per-channel spatial means produced a greater reduction in true-class probability than equivalent PPL replacement in 20 of 25 categories, but not in the three quartz categories. Five explainable artificial intelligence (XAI) attribution procedures generated visually distinct maps for identical inputs. In a superpixel-deletion analysis involving 30 grains from 29 thin sections, method-minus-random contrasts ranged from $-0.043$ to $0.057$, with all 41 simultaneous 95\% confidence intervals including zero. Together, these findings show that error structure, modality sensitivity and attribution behaviour capture distinct aspects of model performance that cannot be established from classification accuracy or visual inspection of attribution maps alone.

cs.AI · cs.CV

新论文 · v1arXiv:2611.10329

SIRIS: Can LLMs Tell When Simulation Errors Matter in AI-Driven Systems Research

Jinwoo Hwang, Sukmin Cho, Tao Zhang, Soheil Abbasloo, Jongse Park, Peng Cheng

原文摘要

LLM agents increasingly drive systems research and rely on simulators to evaluate candidate designs at scale. Simulators are imperfect by design: their modeling limitations can distort predictions yet leave the recommended design correct, or change which design should be selected. We introduce Siris to test whether LLMs can tell these cases apart, judging from their systems understanding when a limitation invalidates the simulator's recommendation. By perturbing a simulator, Siris constructs workload pairs with the same candidates, limitation, and simulator recommendation. The perturbation changes predictions on both workloads, yet a reference simulator supports the recommendation on only one. Evaluating thirteen frontier LLMs on LLM serving design problems, we find that identifying a limitation does not ensure a correct choice, and even the strongest models sometimes abandon valid recommendations. Self-correction through a review turn helps these models restore valid choices but introduces new errors in several others. These findings motivate evaluating systems understanding through design decisions under imperfect simulators.

cs.AI

版本更新 · v4arXiv:2605.01729

Stable GFlowNets with TV Monitoring and Probabilistic Guarantees

Zengxiang Lei, Ananth Shreekumar, Jonathan Rosenthal, Ruoyu Song, Alvaro A. Cardenas, Daniel J. Fremont, Dongyan Xu, Satish Ukkusuri 等 9 位作者

原文摘要

Generative Flow Networks (GFlowNets) sample diverse structured objects in proportion to reward and have been applied to molecular discovery and biological-sequence design, where finding multiple high-quality candidates is more useful than returning a single optimum. Despite their theoretical promise, practical training is often unstable, exhibiting severe loss spikes and mode collapse. To address this, we first assess the sensitivity of GFlowNet objectives, demonstrating that a small Total Variation (TV) distance between the learned and target distributions does not preclude an unbounded training loss. Motivated by this mismatch, we establish converse guarantees by deriving loss-to-TV bounds that certify global fidelity from bounded trajectory balance losses. Lastly, we propose Stable GFlowNets, which leverages our theory to stabilize training via adaptive reference flow and improves the trade-off among mode coverage, robustness, and certifiability. Code is available at: https://github.com/tjleizeng/StableGFlowNets.

cs.LG · stat.ML

新论文 · v1arXiv:2611.10327

Policy Over Purpose: Auditing LLM Content Moderation of Reclaimed Slur Usage

Christina Chance, Kai-Wei Chang

原文摘要

As Perspective API is deprecated, platforms are turning to large language models for content moderation, encoding policy as natural language that the model must interpret at inference time. Reclaimed slurs test this design directly. The same term can express in-group pride or target the community that reclaimed it, and misreading it silences the speech moderation is meant to protect. We audit four general-purpose LLMs and four moderation-specific systems, with Perspective API as a legacy baseline, on IYKYK, a corpus of reclaimed and derogatory usage of three slurs annotated by community members. Across the policy, decision, reasoning, disparity, and steering layers of this audit, we find that whether a system was purpose-built for moderation explains little about how it handles reclaimed language. No system reliably agrees with community judgment, and all fail most on language reclaimed within Black communities. What separates systems is instead how their policy is represented. Only systems whose policy is expressed in the prompt can be steered at all, and even then, explicit definitions change how models justify a decision more than how they make it. We argue that policy transparency determines whether moderation failures can be corrected, but that correcting them requires contextual judgment that definitions supplied at inference time cannot provide.

cs.CL

版本更新 · v2arXiv:2605.05403

When Helpfulness Becomes Sycophancy: Sycophancy is a Boundary Failure Between Social Alignment and Epistemic Integrity in Large Language Models

Jiechen Li, Catherine A. Barry, Rishika Randev, Janet Chen, Ella Jorgensen, Brinnae Bent

原文摘要

This position paper argues that sycophancy in LLMs is a boundary failure between social alignment and epistemic integrity. Existing work often operationalizes sycophancy through external behavior such as agreement with incorrect user beliefs, position reversals, or deviation from an objective standard of correctness. These formulations capture overt forms of the phenomenon but leave subtler boundary failures involving epistemic integrity and social alignment underspecified. We argue that sycophancy should be defined not by agreement or factual incorrectness alone, but by cue-driven degradation of epistemic integrity. To clarify this boundary, we propose a three-condition decision rule requiring (1) a user cue, (2) a model response that shifts toward that cue, and (3) a resulting degradation of epistemic integrity. Building on this definition, we also introduce a taxonomy consisting of alignment targets, mechanisms, and severity to characterize cases identified as sycophantic. An initial 48-item annotation pilot provides preliminary evidence that the framework can be operationalized using structured guidelines, although broader empirical validation remains necessary. The paper concludes by discussing implications for alignment evaluation, including boundary-aware assessment, structured rubrics, and mitigation strategies, while situating these proposals alongside alternative views of sycophancy.

cs.AI

新论文 · v1arXiv:2611.10325

Update Slope Is Bounded by Prior Calibration: A Structural Bound and Its Contingent Empirical Signature

Ben Jenkins, Mihaela Cardei

原文摘要

Evaluations of LLM forecasters increasingly measure how forecasts improve as richer evidence is supplied. We identify two confounds in this update-slope metric. First, outcome-aware evidence construction substantially inflates measured responsiveness: on the same models and questions, slopes are roughly four times larger than with resolution-blinded evidence ladders. Second, update slope is a change score with a prior-dependent structural ceiling, so raw comparisons can reflect differences in starting calibration rather than updating behavior. The ceiling defines only a feasible region; whether slope and prior calibration are empirically coupled depends on headroom utilization and varies across our Manifold, ForecastBench, and ACLED pools. Despite this variability, conditioning on prior calibration roughly triples the association between intermediate updating and final Brier score under both blinded and outcome-aware construction. Question identity also explains substantially more variance than model identity across the evaluated pools. We recommend building evidence ladders blind to outcomes, conditioning on prior calibration, and reporting headroom-normalized measures alongside raw slopes.

cs.LG · cs.AI · stat.AP

新论文 · v1arXiv:2611.10324

Caleta: An Evidence-Oriented Trust Layer for Reproducible Local Large Language Model Inference

Joan-Marc Fisa

原文摘要

Local large language model (LLM) inference is often described as private, verified, or reproducible without separating the technical claims behind those terms. This paper presents Caleta, an Apache-2.0 process supervisor and evidence layer around llama.cpp rather than a new inference engine. Caleta combines versioned manifests, exact-size and SHA-256 verification, controlled backend construction, a restricted OpenAI-compatible proxy, prompt-free execution records, benchmark reports, and a small conformance suite. Its contribution is the composition of these mechanisms into explicit contracts that distinguish integrity from authenticated provenance and privacy controls from operating-system isolation. We evaluate the implementation through static checks, 22 unit tests, deterministic end-to-end tests on Ubuntu, macOS, and Windows, and a pinned real-model experiment on Windows CPU using Qwen2.5-0.5B-Instruct Q4_K_M and llama.cpp b11981. The real experiment validates artifact verification, startup, model listing, non-streaming and server-sent-event chat, and conformance. Three independent benchmark invocations produced fifteen successful warm requests with no failures. In this single configuration, median time to first token was 18.066 ms and median decode throughput was 54.394 tokens/s. These descriptive measurements do not establish cross-engine superiority, output quality, energy efficiency, or hardware-general performance. Raw JSON, commands, and environment metadata are published. Remaining challenges include signed manifests, time-of-check/time-of-use replacement, operating-system containment, proxy-overhead measurement, and broader experimental matrices.

cs.SE

版本更新 · v2arXiv:2606.29164

Latent Reasoning Does Not Lack Signal, It Lacks Invariance: Subspace-Constrained Refinement for Robust Reasoning

Arun Vignesh Malarkkan, Manan Roy Choudhury, Utkarsh Byahut, Yash Ravindra Charde, Vivek Gupta, Xiquan Cui, Xiangliang Zhang, Yanjie Fu

原文摘要

Latent reasoning models perform multi-step inference in embedding space, reducing the token overhead of chain-of-thought reasoning. Recent training-free refinement methods steer latent trajectories using contrastive signals from stronger and weaker reference checkpoints. We identify three sources of fragility in these methods: hyperparameter sensitivity, reference-pair dependence, and input sensitivity. We propose Trajectory-Invariant Latent Refinement (TILR), a training-free framework that constrains corrections to a stable refinement subspace and adaptively controls their magnitude. First, we extract a spectrally concentrated subspace from strong-weak reference differences across a calibration set and project contrastive updates onto it to filter unstable variation. Second, an adaptive gate scales each update according to its alignment with the learned subspace, suppressing unreliable corrections and recovering the unmodified backbone when alignment is low. Across six reasoning benchmarks, TILR improves robustness to input perturbations and reference selection while maintaining competitive accuracy. On the Coconut backbone, TILR improves answer agreement under semantically equivalent paraphrasing by 11.4% and reduces latent trajectory variance by approximately 30% relative to existing refinement baselines. These results support invariant subspaces as a practical basis for reliable latent refinement without retraining or backpropagation.

cs.LG · cs.AI · cs.CG

版本更新 · v2arXiv:2505.10700

Inquisitive Team Semantics of LTL

Laura Bozzelli, Tadeusz Litak, Munyque Mittelmann, Aniello Murano

原文摘要

In recent years, hyperproperties (i.e., properties of sets of traces) have been identified as a crucial concept for capturing information-flow security policies and knowledge of agents in distributed systems. In the synchronous linear-time setting, a well-known approach for the specification of hyperproperties is based on the set semantics of standard LTL. The resulting logic (TeamLTL) inherits the powerful split interpretation of disjunction from dependence logic. In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic, whose main features are the intuitionistic interpretation of implication and the inquisitive semantics of disjunction. We investigate expressiveness, decidability, and complexity issues of the novel logic that we call InqLTL and its extension with strong negation. We show that InqLTL with strong negation is highly undecidable and strictly less expressive than TeamLTL with strong negation. On the positive side, we identify a meaningful fragment of InqLTL with a decidable model-checking problem that can express relevant classes of hyperproperties. To the best of our knowledge, this fragment represents the first hyper logic with a decidable model-checking problem that allows unrestricted use of temporal modalities and conditional second-order universal quantification over system refinements via intuitionistic implication.

cs.LO · cs.FL

新论文 · v1arXiv:2611.10322

Police Behavior Patterns Through Radio Analysis

Milo Z. Trujillo, Adam Perhala, Elaine Zou, Tyler Mckenzie, Juniper Lovato, Brooke Foucault Welles, Alyssa Hasegawa Smith

原文摘要

In the United States, most police departments communicate using police radio, which allows for officer-to-officer and officer-to-dispatch communication without depending on cellular network or WiFi availability. While some departments use encrypted digital radio, many continue to transmit in the clear, and are legally monitored by public citizens with `police scanners.' Because police radio is intended for internal police use and represents real-time communication, it may offer valuable insight into patterns of law enforcement activities without the potential bias and filtering introduced by a press release after the fact. In this study, we collect and examine over 14 million radio transmissions representing over 100,000 hours of speech by officers in 34 cities across the United States from July 2025 through July 2026; to our knowledge the largest scale analysis of Broadcast Police Communication (BPC) to date. We highlight both typical patterns of police communication and categorize anomalous activity that represents incidents including protests and major weather events. We present this dataset as a starting point for an array of police communication studies, conduct our own preliminary analysis, and propose several further areas of inquiry.

cs.CY · cs.CL · cs.SI · eess.AS

新论文 · v1arXiv:2611.10321

LoCo: Selective Local Competition for Discriminative Open-Vocabulary Multi-Label Recognition

Zhuoming Li, Bo Han, Xiaoyu Wang, Yuheng Jia

原文摘要

Open-Vocabulary Multi-Label Recognition (OV-MLR) aims to identify all queried semantic concepts present in an image. Existing methods mainly improve global image-text matching or text-side representations, leaving local prediction largely under-explored. In this paper, we revisit local prediction and reveal that it can serve as a strong discriminative branch once two properties are properly handled: spatial consistency of local visual features and compatibility-aware local competition. This perspective is motivated by local semantic sparsity: each image region is related to only a small subset of queried concepts, while compatible concepts of different granularities or types may still coexist locally. We instantiate this perspective with LoCo, a selective Local Competition framework for OV-MLR. LoCo adopts a spatially consistent visual encoder to reduce local feature entanglement, and introduces Selective Softmax to impose competition only among locally incompatible categories while preserving compatible responses. Multi-scale inference further improves local prediction at different scales. LoCo can also be ensembled with an existing global predictor to provide complementary image-level context. Experiments on four multi-label benchmarks show that standalone LoCo improves average F1-score and mAP over TagCLIP by 3.4% and 3.8%, respectively. LoCo + DualPrompt achieves the highest averages among the compared methods, with gains of 4.8% and 5.2% over TagCLIP. Our results suggest that local semantic sparsity offers a useful basis for developing more discriminative open-vocabulary multi-label recognition methods. The code is available at https://github.com/lee-plus-plus/LoCo.

cs.CV · cs.AI

版本更新 · v2arXiv:2607.16189

Searching Videos as Trees: Self-Correcting Agents for Grounded Long Video QA

Ce Zhang, Ziyang Wang, Yulu Pan, Oluwatumininu Oguntola, Pranav Wagh, Qiyu Wu, Hiromi Wakaki, Mohit Bansal 等 9 位作者

原文摘要

Grounded long-video question answering (Grounded LVQA) requires answering a question about a long video while localizing the short evidence interval that supports the answer. Recent agentic methods frame this task as multi-turn exploration with a single crop_video(start, end) action, which supports coarse-to-fine narrowing but provides no primitive for fine-to-coarse backtracking. As a result, these agents typically converge prematurely and cannot recover from an early mistake. We propose VideoTreeSearch (VTS), a framework that casts grounded LVQA as iterative self-correcting search over an adaptive temporal tree. VTS constructs a non-uniform tree through adaptive temporal segmentation so that each node corresponds to a semantically coherent segment, and trains an agent to navigate the tree through four discrete operations: zoom_in, zoom_out, shift, and answer. These operations expose backtracking and recovery as explicit, learnable primitives rather than implicit behaviors. To train this navigation, we introduce a trajectory synthesis pipeline that produces multi-step paths through the tree, including deliberate detours into incorrect branches followed by recovery. We use these trajectories for supervised fine-tuning, followed by reinforcement learning with grounding and answer-accuracy rewards. On three Grounded LVQA benchmarks (CG-Bench, Haystack-LVBench, Haystack-Ego4D), VTS outperforms the strongest prior multi-turn cropping agents by +12.5 mIoU on CG-Bench and +7.4 T-F1 on Haystack-Ego4D. The learned policy also transfers to general long-video QA, surpassing all prior multi-turn cropping agents on Video-MME, MLVU, and LVBench by up to +7.1 accuracy points. Ablations confirm that self-correcting hierarchical search is the central mechanism behind these gains: removing either adaptive descent or explicit backtracking substantially degrades performance.

cs.CV

版本更新 · v3arXiv:2602.06643

HuMI: Humanoid Whole-Body Manipulation from Humanoid-Free Demonstrations

Ruiqian Nai, Boyuan Zheng, Junming Zhao, Haodong Zhu, Sicong Dai, Zunhao Chen, Yihang Hu, Yingdong Hu 等 11 位作者

原文摘要

Current approaches for humanoid whole-body manipulation, primarily relying on teleoperation or visual sim-to-real reinforcement learning, are hindered by hardware logistics and complex reward engineering. Consequently, demonstrated autonomous skills remain limited and are typically restricted to controlled environments. In this paper, we present the Humanoid Manipulation Interface (HuMI), a portable and efficient framework for learning diverse whole-body manipulation tasks across various environments. HuMI enables humanoid-free data collection by capturing rich whole-body motion using portable hardware. This data drives a hierarchical learning pipeline that translates human motions into dexterous and feasible humanoid skills. Extensive experiments across five whole-body tasks--including kneeling, squatting, tossing, walking, and bimanual manipulation--demonstrate that HuMI achieves a 3x increase in data collection efficiency compared to teleoperation and attains a 70% success rate in unseen environments.

cs.RO · cs.AI · cs.LG

新论文 · v1arXiv:2611.10319

Prove What You Can: Hybrid Neurosymbolic Reasoning for Logical Natural Language Inference

Ada Canoğlu, Sadiq Qara

原文摘要

Logical reasoning over natural language requires both semantic interpretation and deductive search. Large language models (LLMs) can propose plausible intermediate derivations, but they often fail to compose them into a complete proof and overpredict uncertainty. Neurosymbolic methods improve search by translating an entire problem into first-order logic and handing it to a prover, but a single bad clause can make the whole translation nonexecutable. We present Hybrid Reasoning, a three-stage pipeline that decouples proposing a proof, validating its steps, and deciding a label. An LLM proposes a structured proof tree with a raw verdict; a theorem prover validates each derivation locally, keeping only the subset it can prove; and an uncertainty-gated repair attempts to re-derive the label from the premises plus the validated derivations, when the raw verdict is UNCERTAIN. Across four benchmarks (FOLIO, ProofWriter, ProverQA, PrOntoQA) and five contemporary LLMs, Hybrid Reasoning is the top-performing method on the two hardest datasets, improving on the strongest baseline by 5.3 points on FOLIO and 4.9 on ProverQA, and reaches ceiling-level accuracy on the easiest. The repair stage operates at 78-98% precision, producing 326 correct relabellings against 19 regressions.

cs.CL

版本更新 · v3arXiv:2212.01506

Autonomous Apple Fruitlet Sizing and Growth Rate Tracking using Computer Vision

Harry Freeman, Mohamad Qadri, Abhisesh Silwal, Paul O'Connor, Zachary Rubinstein, Daniel Cooley, George Kantor

原文摘要

In this paper, we present a computer vision-based approach to measure the sizes and growth rates of apple fruitlets. Measuring the growth rates of apple fruitlets is important because it allows apple growers to determine when to apply chemical thinners to their crops in order to optimize yield. The current practice of obtaining growth rates involves using calipers to record sizes of fruitlets across multiple days. Due to the number of fruitlets needed to be sized, this method is laborious, time-consuming, and prone to human error. With images collected by a hand-held stereo camera, our system, segments, clusters, and fits ellipses to fruitlets to measure their diameters. The growth rates are then calculated by temporally associating clustered fruitlets across days. We provide quantitative results on data collected in an apple orchard, and demonstrate that our system is able to predict abscise rates within 3.5% of the current method with a 6 times improvement in speed, while requiring significantly less manual effort. Moreover, we provide results on images captured by a robotic system in the field, and discuss the next steps required to make the process fully autonomous.

cs.RO · cs.CV

版本更新 · v4arXiv:2609.10802

A Time-Frequency Framework for GKP Codes

Franz Luef, Eduard Ortega

原文摘要

We develop a time--frequency framework for lattice GKP codes in which ideal codewords are realized in the modulation space $M^\infty$ and identified, through a vector-valued Zak transform, with a finite logical fibre over the continuous syndrome torus. Multi-window Gabor analysis then represents the logical vector by a finite block of adjoint-lattice coefficients. We prove that the normalized block map is an isometry, obtain an explicit recovering projection, and derive stable logical reconstruction. We further construct normalizable GKP approximants as lattice-envelope Gabor multipliers and establish weak-$*$ convergence and asymptotically isometric encoding. Finally, we recover displacement syndromes from phase relations between translated coefficient blocks and quantify their stability under additive perturbations.

math-ph · cs.IT · math.FA · math.OA · quant-ph

新论文 · v1arXiv:2611.10318

AI-Driven Repair of Missing Automotive Components

Kazim Abbas, Zheng Liu

原文摘要

Due to supply constraints, replacing damaged automotive components can be expensive and time-consuming, while replacing the entire component can be wasteful when much of it remains usable. This paper presents a pipeline to investigate whether missing geometry can be reconstructed as a repair patch using paired observations of the intact models and synthetically damaged components. Noise-free color, depth, and silhouette images were produced using the camera viewpoints. Depth differences were then used to identify the potential missing regions, while multi-view voxel reconstruction was used to estimate the missing portion. A pretrained DINOv2 model was also added to validate missing candidates and determine whether pretrained visual features could improve reconstruction. We tested the pipeline on 20 automotive CAD models, each with a synthetically removed portion. Each model was tested under four different conditions using two reconstruction methods for a total of 160 trials. The predictions were compared with the missing geometry of the unchanged ground-truth using predefined thresholds of the voxel intersection-over-union over 0.85 and the absolute relative volume error less than 15%. Of the 160 experimental trials, 109 of them satisfied both thresholds. Geometry-only reconstruction passed 16 of 20 components with eight views but only 10 of 20 with four adjacent views. Further analysis showed that 24 out of the 37 failed reconstructions could be categorized as unsuccessful because extra material was incorrectly added to areas that should have been empty. The implementation of DINOv2 into the pipeline did not improve the overall reconstruction accuracy and made prediction generation slower. For 13 verified tests, printing only the repaired sections instead of the entire parts reduced filament use by 93.08% and printing time by 89.39% based on the median results.

cs.CV

新论文 · v1arXiv:2611.10317

TripleGrader: A Web-Based Platform Supporting Collaborative Triple Annotation with Quality Grading and Inter-Rater Agreement Assessment

Rajan Lamichhane, Songhui Yue

原文摘要

Knowledge graphs need validated relational triples, and gold benchmarks of such triples are often built by several annotators. Most text annotation platforms focus on span tagging and compute agreement on categorical labels. They are not designed for ordinal quality grading of triples that have already been extracted. We present TripleGrader, an open-source web platform for grading subject-predicate-object triples on a 0 to 10 ordinal scale. In TripleGrader, each triple is scored independently, and peer scores stay hidden until the grader has rated it. Graders then discuss entries in threaded comments and propose revisions, which the session owner approves and publishes as new versions. For agreement, the platform computes quadratic-weighted Cohen's kappa for two raters and a quadratic-weighted Fleiss-type kappa for three or more. Graded sessions and the final benchmark are exported in common formats. We evaluated the platform in three ways. We ran 72 automated tests, including 18 workflow scenarios through the REST API. We also injected 10 error types to check whether prescribed corrections could be applied while preserving unaffected triples. On two small corpora with existing gold benchmarks, we then used the platform to curate the triples extracted by four large language models into each benchmark. Only 10% to 32% of the candidate triples could be kept unchanged, and 53% to 71% needed corrections, partly to match the benchmarks' naming conventions. Per model, 11 to 29 missing triples had to be added. On these corpora, the extracted triples therefore needed substantial human review. The source code is available at https://github.com/razz0n/triple-grader-tool.

cs.AI

版本更新 · v2arXiv:2605.10642

Composing diffusion priors with explicit physical context via generative Gibbs sampling

Weizhou Wang, Jonathan Weare, Aaron R. Dinner

原文摘要

Pretrained diffusion models provide powerful learned priors, but in scientific sampling the target distribution often depends on physical context that a single generative model can neither fully represent nor learn from scarce joint-system data. We introduce Generative Gibbs for Physics-Aware Sampling (GG-PA), a training-free framework that composes learned partial priors with explicit physical context through Gibbs sampling. We prove that this sampler is asymptotically exact as the diffusion time vanishes and remains exact at finite diffusion time for quadratic interactions. As a special case, the finite-time result corrects a finite-noise bias in plug-and-play split Gibbs samplers for linear inverse problems at no additional cost. We further introduce replica exchange over diffusion time to accelerate mixing. In experiments, a one-dimensional double-well prior recovers a context-induced distribution shift when coupled to an environment, and copies of such a prior composed on a lattice reproduce the emergent collective behavior of the $φ^4$ model. In atomistic peptide systems, GG-PA captures a context-induced distribution shift and the spontaneous formation of hydrogen-bonded dimers from two copies of a prior trained only on the monomer.

cs.LG · cond-mat.stat-mech