跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 21,490 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
新论文 · v1arXiv:2611.22028

BATMoS: Budget-Aware Guidance Allocation for Efficient Video Diffusion

Zhixu Du, Kuo Yang, Jingwei Sun, Hai "Helen" Li, Yiran Chen

原文摘要

The effectiveness of a video diffusion model's inference budget depends on where computation is spent along the denoising trajectory. Across eight equal-budget inference configurations, VBench total scores span 4.80 points, highlighting the importance of explicit allocation design. Our key insight is that guidance evaluations are not equally valuable across diffusion time: retaining the sampling updates while selectively reusing guidance can preserve generation quality with fewer denoiser evaluations. We introduce BATMoS (Budget Aware Temporal Mixture of Strategies), which routes between fresh classifier-free guidance and cached guidance using a single pretrained denoiser. A magnitude-based temporal rule assigns guidance reuse to low-magnitude blocks and reserves fresh guidance for the remaining blocks, with a single integer controlling the computation budget. The resulting schedule requires no additional router training or per-budget threshold search. Evaluated on CogVideoX-2B with 4,720 videos per configuration across all sixteen official VBench dimensions, BATMoS achieves the highest total score among the eight allocation policies and comes within 0.10 points of full classifier-free guidance using 20\% fewer branch evaluations. BATMoS also composes with feature reuse, reducing computation from 80 to 62 effective branch evaluations with a 0.11-point decrease in total score. These findings make temporal guidance allocation a practical mechanism for extracting more generation quality from a fixed inference budget.

cs.CV

版本更新 · v2arXiv:2507.15448

Frames over finite fields with respect to the Galois inner product and their connections to self-orthogonal and LCD codes

Junmin An, Jon-Lark Kim

原文摘要

In this paper, we generalize the theory of frames to vector spaces over finite fields equipped with the $\ell$-Galois inner product. We introduce $\ell$-Galois analogues of fundamental concepts in frame theory and investigate extensions of existing results to the $\ell$-Galois setting. In particular, we establish necessary and sufficient conditions for a given matrix to be the $\ell$-Galois Gram matrix of a frame and show that such frames are unique up to isometry. We also extend Gerzon's bound to $\ell$-Galois equiangular systems and show that equality in this bound yields an $\ell$-Galois equiangular tight frame. Furthermore, we investigate the connections between $\ell$-Galois frames and $\ell$-Galois self-orthogonal and LCD codes over finite fields. We establish necessary and sufficient conditions for constructing $\ell$-Galois equiangular tight frames from self-dual codes, generalizing existing results by Shi et al. on the relationship between frames and self-dual codes over finite fields. Beyond self-dual codes, we provide sufficient conditions for constructing $\ell$-Galois equiangular tight frames from linear codes using their automorphism groups, together with explicit examples.

cs.IT

版本更新 · v3arXiv:2603.17673

Towards Reliable Local Security Agents: Verifiable Post-Training for Linux Privilege Escalation

Philipp Normann, Andreas Happe, Jürgen Cito, Daniel Arp

原文摘要

LLM agents are increasingly important in security, yet leading systems are typically closed-source and cloud-hosted, limiting reproducibility and their use with sensitive data. This creates a need for small, local models that can perform security tasks under strict resource constraints, though effective methods for developing them remain underexplored. In this paper, we address this gap by proposing a two-stage post-training recipe that turns a small local language model into a security agent. To this end, we focus on Linux privilege escalation as a representative setting to systematically study the training of local models, as the task is automatically verifiable and requires multi-step interactive reasoning. Using an experimental setup that mitigates benchmark leakage, we post-train a small 4B model in two stages: supervised fine-tuning on traces from procedural privilege-escalation environments, followed by reinforcement learning with verifiable rewards. On a held-out benchmark of 12 Linux privilege-escalation scenarios, supervised fine-tuning nearly doubles the baseline success rate under a tight budget of 20 interaction rounds, and subsequent reinforcement learning improves our model, PrivEsc-LLM 4B, to 93.3% success, ahead of all other evaluated models that fit a single consumer GPU. At the same time, its expected inference cost per successful escalation is more than 80x lower than that of Claude Opus 4.7. Our findings show that small local models can be adapted to complex security tasks. We document the challenges involved and offer guidance for transferring this recipe to other settings.

cs.CR · cs.AI

新论文 · v1arXiv:2611.22019

Computed Permutation Trellis Coding: Near-Optimal Quantization from Two Multiplications and a 64-Byte Table

Muhammed Fatih Balın

原文摘要

We propose Computed Permutation Trellis Coding (CPTC), a low-bit quantization format for tensors written once and read many times. Formats that round each value on its own, such as INT4 and FP4, waste a large part of their bits against the information-theoretic ideal. Trellis codes recover this loss by encoding values jointly, but prior decoders either need a large lookup table for their best quality or compute values with a hash that restricts what they can decode. CPTC's decoder multiplies its state by two coefficients and adds the top bits of the products to index a 64-byte table. Because that sum is not uniformly distributed, the rarely used ends of a small table can hold values far out in the tails. One decoder serves every bit width from 1 to 6, reproduces the standard integer and floating-point formats exactly, and comes within 0.07 bits of the ideal at 4 bits. It matches a random-permutation trellis code whose table is thousands of times larger, and exceeds every QTIP codebook. In LLM weight quantization without fine-tuning, CPTC has the lowest KL divergence to the unquantized model at every tested bit width on Llama 3.1 8B and 70B Instruct against QTIP's codebooks (by up to 27%). The decoder has been built into the AWS Trainium 4 AI accelerator, where it runs at the throughput of the native FP4 and FP8 formats for a negligible fraction of the systolic array's area. Fused encoding kernels quantize an 8B model's linear layers in under two minutes on one GPU and, in cycle-level simulation, on one Trainium 4 chip.

cs.IT · cs.AI · cs.AR · cs.LG

新论文 · v1arXiv:2611.22017

SkillBuffBench: Measuring What Agent Skills Contribute across Harnesses, Models, Skill Access Modes and Memory

Gengyue Dong, Ye Wei, Zheng Zhu, Yidong Han, Jiale Miao, Xiaojun Jia, Guanghui Li

原文摘要

Agent Skills, file-based packages of procedural knowledge that a coding agent can discover and load on demand, are now shipped by every major agent harness, yet the evidence for how much they help comes almost entirely from settings in which the right Skill is hand-picked for the task and the agent starts from a blank slate. Neither holds in deployment, where an agent chooses from whatever library happens to be installed and frequently carries memory from earlier work. We present SkillBuffBench, a benchmark and paired evaluation protocol that treats Skill access as a three-level factor (no Skill, a curated Skill, and automatic invocation from an installed library), crosses it with memory (off and on), with four agent harnesses and with multiple models (the state-of-the-art proprietary models from Anthropic, Google and OpenAI, and the state-of-the-art open-weight models from Chinese providers), every model being run under every harness, and evaluates the result on research tasks contributed by domain experts together with the Skills they use, currently in materials science and biology, with the suite extended on a rolling basis. Every run is marked by a deterministic verifier; uncertainty is reported with a paired, task-level bootstrap; and cost, agent rounds and wall-clock time are reported alongside the score rather than folded into it. This version of the paper describes the design of the benchmark, its evaluation protocol and its current tasks and Skills. The evaluation is in progress: results will be added once the runs are complete, and the task suite, results and analysis will continue to be updated on a rolling basis.

cs.AI · cs.CL · cs.LG

版本更新 · v2arXiv:2602.13042

GPTZero: Robust Detection of LLM-Generated Texts

George Alexandru Adam, Alexander Cui, Edwin Thomas, Emily Napier, Nazar Shmatko, Yue Gao, Zikun Chen, Jacob Schnell 等 12 位作者

原文摘要

While historical considerations surrounding text authenticity revolved primarily around plagiarism, the advent of large language models (LLMs) has introduced a new challenge: distinguishing human-authored from AI-generated text. This shift raises significant concerns, including the undermining of skill evaluations, the mass-production of low-quality content, and the proliferation of misinformation. Addressing these issues, we introduce GPTZero 5.0, a state-of-the-art industrial AI detection solution, offering reliable discernment between human and LLM-generated text. Our key contributions include: introducing a hierarchical, multi-task architecture enabling a flexible taxonomy of human and AI texts, setting a new state-of-the-art for AI detection accuracy on 11 independent third-party benchmarks and 18 writing domains, and achieving superior robustness to adversarial attacks and paraphrasing via multi-tiered automated red teaming. GPTZero offers accurate and explainable detection, and educates users on its responsible use, ensuring fair and transparent assessment of text.

cs.LG

版本更新 · v2arXiv:2606.17516

FoundCause: A Foundation Model for Causal Discovery with Latent Confounders from Observational Data

Patrick Blöbaum, Krishnakumar Balasubramanian, Shiva Prasad Kasiviswanathan

原文摘要

Causal discovery from observational data requires recovering directed relations and latent confounding without interventions. We propose FoundCause, an {\em amortized causal discovery foundation model} trained only on synthetic structural causal models that maps datasets to causal graphs in a single forward pass. A permutation-equivariant transformer alternates attention over samples and variables to model cross-variable dependence and per-variable distributions. Pairwise dependence and asymmetry statistics guide its attention, edge decoder and confounder module. The decoder separates edge existence from direction, while triangular refinement incorporates evidence from chains and colliders. Learnable latent tokens predict which variable pairs share a hidden common cause, and a masked input representation handles missing data. To our knowledge, FoundCause is the first amortized causal discovery approach for i.i.d. observational data to predict latent confounding as a separate, explicit output. On 14 real-world and semi-synthetic datasets, FoundCause leads 11 classical and 7 amortized baselines in average AUROC, $F_1$, skeleton $F_1$, and normalized structural Hamming distance ($\mathrm{SHD}/d$): clearly in $\mathrm{SHD}/d$ ($0.875$ vs.\ $0.956$), narrowly in $F_1$ ($0.531$ vs.\ $0.516$). It also has the highest accuracy among amortized methods on bivariate cause--effect pairs.

cs.LG · cs.AI · stat.ME · stat.ML

版本更新 · v2arXiv:2611.16965

Asymptotic Dimension of Persistence Modules of Bounded Presentation

Sushovan Majhi, Atish Mitra, Žiga Virk

原文摘要

We compute the asymptotic dimension of spaces of multiparameter persistence modules of bounded presentation under the interleaving distance. The $d$-parameter modules with at most $n$ generators and $m$ relations have asymptotic dimension, and Assouad-Nagata dimension, exactly $d(n+m)$, the number of coordinates of their generator and relation grades, over every field; for two parameters this is $2(n+m)$. The space has continuous moduli, already for two parameters and $n,m\ge2$: over an infinite field it contains, at every scale, infinite uniformly separated families of pairwise non-isomorphic modules with one fibered barcode, so it is not doubling even at a fixed fibered barcode; already for $m\ge1$ it is not coarsely equivalent to a proper metric space. The proof is an induction on the number of distinct grade coordinates: an interleaving small compared with the gaps between these coordinates moves each of them by at most twice its size and preserves the induced grid representation, so the continuous moduli are invisible at large scale. Each class of modules at finite distance therefore embeds coarsely into Hilbert space; for two parameters, $n,m\ge2$ and an uncountable field, a class containing such a family admits no coarse embedding into a separable Hilbert space. Under the two-parameter matching distance, on the space of rank invariants, the asymptotic dimension and the Assouad-Nagata dimension are again $2(n+m)$: slope-one slices pin the grid of grades, and over a grid only finitely many rank invariants occur; on a finite net of $S$ slices the asymptotic dimension is at most $2nS$.

math.MG · cs.CG · math.AT

版本更新 · v2arXiv:2608.28828

Representation Learning with Quantum Signal Processing

Junqi Wang, Junyu Liu

原文摘要

Representation learning begins when training changes the features that define similarity between data. A frozen-kernel model only reweights a fixed geometry. We establish quantum signal processing (QSP) as a solvable quantum model of the representation-learning regime. At arbitrary depth, we compute the exact mean and variance of its quantum neural tangent kernel, revealing an input-dependent angular geometry whose diagonal remains non-self-averaging even when the underlying unitary approaches Haar randomness. We also prove a sparse-data guarantee for the full nonlinear gradient flow without freezing or ensemble-averaging the kernel: the realized dynamics converges to an integrable scalar flow with a time-dependent kernel closure and explicit convergence times. A finite-depth speed limit holds for every data set and trajectory. At higher data density, numerical results show coupled evolution beyond both the scalar and frozen-kernel descriptions. These results give a controlled theory of learned quantum data geometry with provable training dynamics beyond the frozen limit.

quant-ph · cs.AI · cs.LG · stat.ML

版本更新 · v2arXiv:2510.26185

Cross-Epoch Bias in SGD-based Leave-One-Out Influence: Analysis and Accumulative Correction

Yunxiao Shi, Shuo Yang, Yixin Su, Rui Zhang, Min Xu

原文摘要

Training-data influence estimates support data selection and cleansing by predicting the effects of removing individual examples. The standard multi-epoch SGD-Influence Estimator (SGD-IE) aggregates contributions from a sample's repeated appearances along the recorded trajectory. When used to approximate finite deletion, it omits an interaction: later removals act on the parameter displacement accumulated from earlier removals. We introduce the Accumulative SGD-Influence Estimator (ACC-SGD-IE) to account for how earlier removals change the effect of removing the same sample again. It uses the sample's Hessian at subsequent appearances to correct the estimated parameter change. Our non-convex analysis shows that this correction removes SGD-IE's additional interaction contribution from the finite-horizon error bound: the omitted interaction produces a local error linear in the accumulated parameter change, while the remaining Taylor remainder is bounded quadratically under Lipschitz-Hessian assumptions. The bounds characterize how training propagates the remaining error. In non-convex experiments across clean and noisy tabular, text, and vision datasets, ACC-SGD-IE reduces validation-loss-change RMSE by 10.8% and improves Jaccard@10% by 15.2% on average relative to SGD-IE. These gains also translate into lower test misclassification rates after data cleansing on MNIST and CIFAR10 at the evaluated removal budgets. On noisy industrial datasets, it reduces aggregate parameter RMS error with a mean relative reduction of 53.4%. We further discuss computational tradeoffs, provide complementary theoretical analysis and experimental evaluation for strongly convex objectives, and explore potential extensions of the accumulative correction mechanism to other influence estimators.

cs.LG · cs.AI

版本更新 · v2arXiv:2611.17461

Tracing Knowledge and Reasoning in LLMs

Yang Wang, Xiao Wang, Yiqi Liu, Chenghao Xiao, Eleni Vasilaki, Goran Nenadic, Chenghua Lin

原文摘要

Current evaluations of Large Language Models (LLMs) report performance at the dataset or task level, revealing what a model achieves but offering little insight into the internal processing associated with its performance. We propose a task-centric framework for characterising the model-internal processing elicited by a benchmark. It combines attention- and activation-based signals with representation-based measures to characterise benchmarks spanning a continuum from retrieval-dominant to reasoning-dominant and to surface failure modes that task-level scores conceal. We evaluate 16 LLMs across 24 diverse benchmarks and conduct targeted internal-state analyses on representative models and tasks, observing systematic differences in processing between knowledge-centric and reasoning-centric tasks. We shift evaluation from asking what score a model achieves toward characterising the processing patterns associated with that score, potentially supporting more targeted benchmark selection and more informed model choice. We open source our code at https://github.com/extraordinarylab/trace-kr.

cs.CL

版本更新 · v2arXiv:2609.04747

BEAM3R: Beam's-eye-view architecture with Mamba-3 for implicit dose reconstruction

Chen Cheng, Michael Ferraro, James Grover, David E J Waddington, Emily Hewson

原文摘要

To enable accurate and rapid photon control point and proton beamlet dose calculation in the DoseRAD2026 challenge, we present BEAM3R, a dose estimation framework operating in beam's-eye-view (BEV). Our core innovation combines a Mamba-3 state-space depth-sequence core with physics-based transport conditioning to model long-range depth transport without expensive 3D convolutions. BEAM3R shares a 2D CNN encoder-decoder architecture for photon and proton dose tasks, processing per-plane BEV slices. Proton beamlets are conditioned on water equivalent thickness and remaining range, encoding the parameters determining Bragg peak position. Photon models use a bidirectional Mamba-3 core to capture dose contributions from materials downstream of the calculation point, while the proton model uses a forward core with learned energy-prefix tokens and a Bragg-peak refinement module. To reduce interpolation artifacts and support high spatial resolution, we introduce axial grid alignment of BEV lattices with CT slices and an implicit super-resolution representation arranged as channels, evaluated by a differentiable Triton-accelerated resampler that reconstructs packed cubic B-spline coefficients directly in CT space. For MRI-based tasks, synthetic CTs (sCT) are generated using a conditional GAN with a SwinUNETR generator and a PatchGAN discriminator. On the preliminary DoseRAD2026 test set, CT-to-photon and CT-to-proton models achieved 1%/1 mm local gamma pass rates of 96.8% and 96.0%, with stratified plan-level MAEs of 0.0041 and 0.0079. Substituting sCT reduced gamma pass rates to 89.7% for photon and 75.4% proton plan level doses, with stratified plan-level MAEs of 0.0093 and 0.0336. Standardised runtimes were 23.4 s and 18.4 s for CT-to-photon and CT-to-proton prediction, increasing to 39.7 s and 42.8 s for the corresponding MRI-based pipelines.

physics.med-ph · cs.CV

新论文 · v1arXiv:2611.22009

DiagTrace: An Interactive Benchmark for Clinical Decision Making

Yufan Wang, Rui Yang, Yi Lin, Chunhua Weng, Yifan Peng

原文摘要

Large language models (LLMs) have shown strong performance on medical question answering and diagnostic reasoning benchmarks. However, existing evaluations typically provide all patient information upfront and assess only the final diagnosis or rationale. This setup ignores the need to acquire diagnostic evidence incrementally from incomplete information in real-world diagnosis. To bridge this gap, we introduce DiagTrace, a source-grounded benchmark for evaluating whether LLMs can reconstruct the documented diagnostic trajectory through interactive information seeking. Each benchmark instance is built from a PubMed Central case report and includes an initial presentation, an event bank, a clinical course, and diagnostic references. DiagTrace contains 510 cases across eight specialties, with 225 used to evaluate four LLMs on clinical-course alignment, interaction quality, and efficiency. Results reveal trade-offs in coverage, source-consistent ordering, and turn use.

cs.CL · cs.AI

版本更新 · v2arXiv:2605.09238

iMuon: Intrinsic Spectral Optimization on Riemannian Matrix Manifolds

Yibang Li, Bihari Lal Pandey, Ravi Sah, Andi Han, Cyrus Mostajeran, Pratik Jawanpuria, Bamdev Mishra

原文摘要

Muon and related norm-constrained optimizers, now central to large-scale learning, compute updates via a linear maximization oracle (LMO) over a matrix-norm ball in Euclidean space. However, they do not generalize cleanly to manifold-valued parameters such as low-rank factorizations, orthogonality constraints, or symmetric positive-definite (SPD) matrices. Naively restricting the Muon LMO to the tangent space (i) breaks quotient symmetries and (ii) couples the tangent-space constraint with an ambient norm bound, which obstructs closed-form solutions. We resolve both issues with a key observation: every Riemannian metric canonically lifts a unitarily invariant Euclidean norm to an intrinsic norm on each tangent space. The resulting intrinsic LMO is symmetry preserving and, under a structural condition on the scaled tangent space, reduces to a standard Euclidean LMO. Building on this, we introduce intrinsic Muon (iMuon), a unified framework with closed-form updates on the fixed-rank, SPD, Stiefel, and Grassmann manifolds for various unitarily invariant norms, including the spectral, Frobenius, and nuclear norms. We establish deterministic and stochastic convergence rates of iMuon with constants that depend only on the manifold dimension. Notably, on the fixed-rank manifold, the constant depends only on the rank, which makes the rate independent of factor conditioning and removes the runtime factor rescaling required by prior work. Experiments on LoRA fine-tuning of LLMs, image classification, and subspace learning illustrate the efficacy of the proposed approach.

cs.LG · cs.AI

新论文 · v1arXiv:2611.22006

Supporting Researcher Control in AI-Assisted Social Media Analysis: A Mixed-Methods Study of AI4OSN

Qile Wang, Abhishek Karwankar, Shukria Muhammadi, Srikanth Kumar Perumalla, Abhin Suresh, Sunita Chandrasekaran, Kenneth E. Barner, Matthew Louis Mauriello

原文摘要

High-quality annotated datasets are critical for advancing computational social science (CSS) research, yet collecting, curating, and analyzing large-scale data from dynamic sources such as online social networks (OSNs) remains a persistent bottleneck. Researchers must also translate substantive questions into queries, relevance criteria, and defensible interpretations. Large language models (LLMs) can assist, but they can also obscure the judgments, potentially reducing researcher oversight and critical evaluation. We present AI4OSN, a mixed-initiative platform that keeps researchers in control of data collection, relevance labeling, and sensemaking while making AI assistance available as an inspectable advisory resource. In a systematic user study (N=18) using X/Twitter data, participants reported above-benchmark perceived usability (mean SUS score of 79.7), increased confidence in LLM-assisted annotation and analysis tasks, and low cognitive workload during AI-supported sensemaking. Notably, novice participants showed descriptively greater alignment and higher reported agreement with AI output than experienced participants, underscoring the need to support differentiated verification practices across expertise levels. Overall, this work contributes both a human-centered system for social data analysis and empirical insights into how AI-assisted interfaces shape researcher behavior, trust, and decision-making. Our findings highlight design opportunities and tensions in building accessible, transparent, and agentic AI systems for social media and web research.

cs.HC

新论文 · v1arXiv:2611.22005

Where Should the Lamp Go? Ambient-Aware Lamp Placement for Portraits

Yuyan Chen

原文摘要

Portraits shape first impressions, and lighting is an important factor. Prior work, such as lighting estimation and portrait relighting, edits lighting after capture but does not guide where to place a light before the shot. This leaves an open question: where should a light go to best light a face? Therefore, we propose LightMatch, a preference-grounded inverse lighting framework that disentangles the controllable light from ambient illumination and optimizes its placement. We first learn a Bradley-Terry quality model from pairwise human judgments. A perception head then regresses spherical-harmonic lighting from frozen self-supervised features via cross-attention. Finally, a placement solver isolates the light via spherical-harmonic linearity and optimizes its reachable position. On held-out environments, LightMatch attains 87.8% of the oracle improvement, outperforming the conventional solver that ignores ambient light by a relative 28.4% and the same pipeline with the widely used DPR estimator by a relative 70.5%. It reaches 73.2% on real OLAT faces of unseen identities and, on our real captures, cuts lamp-direction error by 37.7%.

cs.CV · cs.GR

版本更新 · v3arXiv:2604.02203

QuantumXCT: Learning Interaction-Induced State Transformation in Cell-Cell Communication via Quantum Entanglement and Generative Modeling

Selim Romero, Shreyan Gupta, Robert S. Chapkin, James J. Cai

原文摘要

Inferring cell-cell communication (CCC) from single-cell transcriptomic data remains challenging. Most existing methods retrieve curated ligand-receptor pairs, score their coordinated average expression and apply statistical testing, a static and indirect strategy that tends to overlook intracellular signaling consequences, context dependence and higher-order interactions. Here, we introduce QuantumXCT, a hybrid quantum-classical framework that defines CCC as learnable transformations between cellular state distributions induced by cell-cell interaction. By encoding transcriptomic profiles into a high-dimensional Hilbert space, QuantumXCT trains parameterized quantum circuits to learn a unitary transformation mapping a baseline non-interacting cellular state to an interacting state, and infers CCC under explicitly stated modeling assumptions. Unlike methods restricted to curated ligand-receptor pairs, QuantumXCT can evaluate any cross-cell gene pair. On synthetic data with known ground-truth interactions, QuantumXCT ranked the programmed intercellular interactions above non-interacting gene pairs (ROC-AUC 0.93). On an ovarian cancer-fibroblast mono- and co-culture model, it identified a PDGFB-PDGFRB-STAT3 axis reproducible across bootstrap resamples, amplitude encodings and search algorithms, and consistent with published perturbation experiments. The learned circuit is interpretable: its entangling topology translates into interaction networks, and post hoc contribution analysis quantifies the influence of individual interactions on the observed state transitions. QuantumXCT provides an interpretable, hypothesis-generating framework for de novo discovery of communication programs, and delineates both the potential and the current limits of quantum machine learning in single-cell biology.

cs.ET · physics.bio-ph · physics.data-an · q-bio.GN

新论文 · v1arXiv:2611.22000

How Much Distribution Shift Can a Clustering Withstand? Exact Split and Merge Certificates for Structured Transports

Alisina Bayati, Srinivasa Salapaka, Shahriar Talebi

原文摘要

In clustering, the distribution of the population being clustered is often uncertain or changes over time, so the true distribution may shift away from the nominal distribution used to form the clustering. Once the clustering is committed and each member is assigned to a cluster, such shifts may change the distribution of each cluster. They can make a cluster too spread out for one representative at a given resolution, motivating a split, or bring distinct clusters close enough to share a representative at that resolution, motivating a merge. We make these split and merge events precise using a local stability criterion built on the phase-transition analysis in deterministic annealing. This notion of stability enables us to quantify how robust a clustering is against such events. Furthermore, motivated by applications in which uncertainty and population change are structured, we study shifts whose displacements are restricted to a prescribed subspace. The smallest structured shifts that reach the respective thresholds define the split and merge radii, for which we obtain exact semidefinite programming (SDP) reformulations. The split SDP has only two scalar decision variables. These convex reformulations enable us to combine the radii into a robustness certificate for the full clustering that gives the size of the smallest structured shift that reaches any monitored split or merge threshold.

cs.LG

新论文 · v1arXiv:2611.21998

KV-LTM: Persistent Per-Session KV Caches as Long-Term Memory for Personal Assistants

Ziv Kfir, Ido Kfir

原文摘要

Personal assistants accumulate months of conversations, but today's long-term memory stacks put derivation or selection between a question and its evidence. In a system-level comparison on LongMemEval, two commercial assistants scored well below the same model reading the history offline [1], consistent with, but not isolating, content loss between write and read. We propose KV-LTM: a memory tier storing each session's raw text plus its KV cache under a fixed reader model, answering by restoring cached sessions and appending the question. KV-LTM is complementary to, not a replacement for, retrieval and indexing. Text is the memory of record; the cache is a recompute-free prefill accelerator, degrading gracefully to text. We specify the design: storage record, budget-derived retention, append-only read path, and bounded aggregation. We size it analytically: across pinned BF16 full-attention (GQA) and latent-cached MLA configurations, per-token state spans approximately 31K-328K bytes (the pinned KDA+MLA hybrid differs: approximately 8.1K bytes/token plus a fixed per-session recurrent term), giving approximately 0.34-3.6 TB per user-year at a declared 30K-token/day scenario, against approximately 49 MB of raw text; per-query cost is modelled as regime-conditional transfer, attention, decode, aggregation, and compute. We define an evaluation protocol needing no persistent-cache implementation for logical QA evaluation: per-session prefill emulates valid cache reuse under the same model/input-state contract and ideal arithmetic, with named arms, controlled baselines, and a preregistered reader-model gate; a separate minimal real-cache replay tests numerical equivalence and measures the cost axis, with outcomes not assumed. KV-LTM trades storage for avoided re-prefill compute and write-time fidelity, within a declared retention budget.

cs.AI

新论文 · v1arXiv:2611.21996

Beyond Appearance: Where Forest Visual Place Recognition Actually Fails

Blake Matheson, Ben McShanag, Isabella Moffat, Michael Milford, Peyman Moghadam, Dana Kulić, Somayeh Hussaini, Kavindie Katuwandeniya

原文摘要

Visual place recognition (VPR) in forest environments remains challenging because repetitive vegetation, and changes in illumination, season, and viewpoint can make distinct places appear similar and revisited places appear substantially different. In this paper, we investigate whether temporal, linguistic, structural, and geometric context can improve on an appearance-only descriptor, and what limits each representation when it does not. Using MegaLoc as the appearance-based baseline on the WildCross benchmark, we evaluate score-space and descriptor-space sequence matching, vision-language captions and reranking, scene-graph representations, and depth-derived stem graphs across same-direction revisits, extended routes, and reverse traversals. On a same-direction revisit, both sequence matching strategies reach similar Recall@1 (94.1% vs. 91.5%), but recall at 100% precision rises from 50.9% (single-frame MegaLoc) to 71.6% in score space and falls to 36.5% in descriptor space. The remaining context representations provide no consistent improvement over the appearance-based baseline. Same-place captions show limited place-specific discrimination, reranking is constrained by the initial candidate shortlist, and stem-graph matching remains weak even with LiDAR depth.

cs.CV

新论文 · v1arXiv:2611.21993

DEFTS: Data-Efficient, Training-Free Few-Shot Learning for CLIP in the Text Subspace

Yijin Zeng

原文摘要

Contrastive Language-Image Pre-training (CLIP) achieves impressive zero-shot image classification performance by comparing image embeddings against class-specific text embeddings. While recent few-shot methods leverage labeled training samples to improve upon this zero-shot baseline, they often predominantly rely on image embeddings and underutilize the semantic structure of the text embeddings. In this paper, we introduce DEFTS, a data-efficient, training-free few-shot classification method strictly in the text subspace. We first demonstrate empirically that while raw text embeddings can be suboptimal as direct classifiers, the linear subspace they span remains highly discriminative. DEFTS therefore proposes to reduce the image-text modality gap by projecting estimated image prototypes directly into this subspace. Importantly, by expressing these prototypes as linear combinations of text embeddings, DEFTS reduces a high-dimensional estimation problem to the derivation of just a few coefficients. These coefficients are then computed via a Bayesian posterior mean, using a prior naturally centered on the original text embedding coordinates. Extensive experiments across 12 image classification benchmarks demonstrate that DEFTS significantly improves upon existing training-free methods.

cs.CV · stat.ML

新论文 · v1arXiv:2611.21983

Large Language Models as Nonlinear Dynamical Systems: The Three Clocks of Depth, Training, and Generation

Maor Farid

原文摘要

Language models are dynamical systems. A transformer is iterated over its layers, over the steps of its training and over the tokens it generates, and on each of these three clocks it shows behavior that nonlinear dynamics has studied for a century: fixed points, bifurcations, synchronization, chaos and noise-driven escape from potential wells. The two communities rarely meet, so this behavior is often rediscovered under new names. We build a bridge between them. To describe, we condense about 200 papers into the Three-Clock Dictionary, which maps fifteen concepts of nonlinear dynamics onto each clock and marks every correspondence as proved, measured or conjectured, and we show each concept in a mechanical system and in a language model side by side. To explain, we derive reduced-order models: the softmax is a Boltzmann distribution, gradient descent an Euler step on a nonlinear spring, a loss spike a ball thrown out of a stiff valley, attention on the circle a Kuramoto model, and a repetition loop a well that deepens while it is occupied. We then test these explanations on open language models, on a laptop CPU. Escape from repetition loops in GPT-2 and Pythia follows the Arrhenius law with the logit gap as the barrier, and the barrier deepens and then saturates, so the temperature needed to leave a loop falls like $1/\ln N$ with the generation length $N$ and rises with model size. Coherent text lives in a narrow window of temperatures, which a small reasoning model shares at its recommended temperature. Training makes each Pythia layer more expansive, and a small transformer trains at a multi-mode edge of stability. The third step, solving problems of language models, is still ahead: controllers derived from the escape analysis remove loops but do not yet beat the best fixed temperature. We state twelve open problems where nonlinear dynamics could get there.

cs.LG · cs.CL · math.DS · nlin.CD

新论文 · v1arXiv:2611.21980

Modeling Document and Section Hierarchies in Embedding Space

Kriste Krstovski, Sharyn O'Halloran, Kshitij Chandna

原文摘要

Embedded topic models integrate word embeddings into the topic generation process, producing coherent topics and robust performance on large vocabularies. However, each document is represented by a single topic distribution, ignoring its internal structure. Many real world collections, including legal documents, company and government reports, and online discussion forums, exhibit hierarchical organization in which documents consist of multiple sections that often address distinct subtopics. We introduce the Hierarchical Embedded Topic Model (hETM), a structured topic model that couples the topic distribution of a document and those of its sections through a hierarchical prior in the embedding space. We derive an amortized variational inference procedure for hETM and evaluate it on structured collections from each of these domains. Experimental results show that hETM achieves the lowest or near-lowest held-out perplexity among flat and hierarchical topic model baselines, along with comparable or higher topic quality. It also performs strongly on a downstream clustering task, achieving the best clustering performance on most of the collections.

stat.ML · cs.AI · cs.CL · cs.LG

版本更新 · v3arXiv:2609.38166

LeapQuant: Efficient Linear Attention with Accurate Recurrent State Quantization

Yi Pan, Haocheng Xi, Kan Zhu, Xingyang Li, Yibo Wu, Mayank Mishra, Hongtao Zhang, William X. Zheng 等 13 位作者

原文摘要

Recent LLMs increasingly adopt hybrid designs that replace standard attention with linear attention, such as Gated DeltaNet (GDN) and Kimi Delta Attention (KDA). Although they compress the context into a fixed-size recurrent state and substantially reduce the cost of long-context processing, repeatedly reading and updating that state remains a major inference bottleneck. Quantization offers a natural way to reduce this cost, but can significantly degrade model quality, due to the accumulation of rounding errors and the presence of outlier rows and columns in the state. To address these challenges, we propose LeapQuant, a training-free method that achieves near-lossless performance under 8-bit recurrent-state quantization. First, to mitigate error accumulation, we propose per-window quantization, which leaps over a window of tokens and quantizes the state only once at its end. Within a window, outputs are computed from the fixed low-bit state together with high-precision buffered updates. Second, to reduce the error introduced by each quantization, LeapQuant retains the state's largest outliers as a few high-precision Compensator Tokens, which share the update path of real tokens. We then smooth the remaining residual before quantization to further reduce the error. Comprehensive experiments across the Qwen, Kimi, and GLM model families show that LeapQuant substantially reduces memory and compute costs during inference. With accuracy comparable to the FP32 baseline, it achieves average speedups of 2.05--3.70$\times$ at the kernel level and 1.47$\times$ for end-to-end inference on NVIDIA B200, RTX PRO 6000, and RTX 5090 GPUs.

cs.LG · cs.AI

新论文 · v1arXiv:2611.21978

WebAgents: Unbundling Agent Creation, Hosting, and Execution for an Agent-Native Web

Dario Fenoglio, Martin Gjoreski, Marc Langheinrich, Pradyumna Chari, Ramesh Raskar

原文摘要

Large language models are moving from isolated assistants toward autonomous agents that can plan, use tools, and coordinate with others, motivating an emerging Agentic Web of independently developed agents and services. Realizing this vision requires agent behavior to move across creators, hosts, and runtimes without coupling publication to a particular execution environment or transferring authority over user resources. We introduce WebAgents, which unbundles these roles through a signed agent.pkg that carries portable workflows, skills, schemas, and resource requirements. An OpenClaw-based agent-native browser/runtime verifies the package, obtains authorization, and binds it at run time to user-controlled models, tools, permissions, and budgets, while hosts distribute the public program and may retain private services server-side. We demonstrate this contract with three unrelated workflows executed unchanged under local and API-backed models, including literature review with live services and a website-published travel agent using semantic tools and user-selected personal resources. In a controlled suite, WebAgents explicitly blocks all 716 injected contract violations while accepting all 295 matched benign controls, with median automated pre-execution processing below 0.5 s for all three packages. We conclude by outlining a path toward NANDA-based discovery and interoperable package ecosystems while retaining execution authority in the user's runtime.

cs.AI

新论文 · v1arXiv:2611.21975

Pathology Randomization for Synthetic Priors and Zero-Shot Detection

Alexandra G. Roberts, Tonmoy Hossain, Mark Olchanyi, Stefan Brandstätter, Jonathan Williams Ramirez, Ana Lawry Aguila, Matthew Rosen, Annabel Sorby-Adams 等 10 位作者

原文摘要

Hospital brain imaging archives hold a diverse array of pathology at sample sizes beyond prospective studies, particularly for underrepresented populations and diseases. To unlock uncurated clinical data and scale analysis, methods are needed to detect abnormalities across contrasts and resolutions. Synthetic data has provided robust, contrast-agnostic models for a variety of human neuroimaging tasks in healthy anatomy, but pathology detection and other tasks in clinical settings still require real patient data, contrast-specific models, or disease-specific generators. We propose PathoDraw, a generative model of brain MRI with pathology. A conditional distribution of lesions given the healthy anatomy is drawn into the label map before contrast-agnostic rendering, and a single network estimates healthy anatomy with exact signed intensity deviation of any input scan. The contrast-agnostic 3D UNet learns the healthy labels under the lesion and the signed deviation directly and identifies pathology via robust tissue statistics and learned features, despite no training on real pathology. We show zero-shot detection on public stroke, tumor, and white matter hyperintensity datasets as well as archived clinical data, spanning $T_1$w, FLAIR and $T_2$w at various resolutions under a recent unsupervised anomaly detection benchmark protocol. Our single model exceeds or performs comparably to contrast-specific anomaly detectors trained on real scans and keeps healthy anatomy intact. The same generator trains networks for super-resolution and for registration in the presence of pathology. Our model, robust across acquisition and disease, enables the use of uncurated, archived data for clinical analysis. Our code is available at https://github.com/agr78/Pathology-Randomizer.

cs.CV · cs.AI · eess.IV

新论文 · v1arXiv:2611.21974

Beyond Bitwidth: Deployment-Constrained Mixed-Precision Quantization for Multilingual LLM Inference on NVIDIA Blackwell

Hyojung Han

原文摘要

Low-bit LLM quantization is useful only if a model preserves service-relevant accuracy, executes through supported GPU kernels, and meets measured memory and latency limits. We study Qwen3-8B on NVIDIA B200 with vLLM, including INT2/INT3, GPTQ, NVFP4, and mixed-precision configurations. We verify native packed execution and precision on all 144 fused linear modules and evaluate Korean, English, numerical, and reasoning quality under preregistered gates. Packed INT2 and INT3 execute, but all seven tested INT2 grids degenerate on generation. Isolated module-restoration effects are strongly non-additive; Korean and reasoning sensitivity rankings disagree, and a promising INT4/INT8 development candidate fails independent final evaluation. A configuration with 16-bit activations, 98 NVFP4 weight-only modules, 46 INT8 modules, and an INT8 output head passes all gates on the untouched FINAL-81 set (5,168 items): 5.917 GiB of weight-loading memory (limit 5.98), Korean teacher-correct retention 0.904 (gate 0.90), and TPOT ratio 0.939 relative to BF16. It improves paired accuracy over NVFP4 W4A4 by +1.4 percentage points (Bonferroni-adjusted interval [+0.2, +2.6]), compared with +3.4 points on the selection set. This comparison changes both activation precision and INT8 protection; exploratory analyses suggest that the activation change contributes substantially, but the isolated allocation effect is not established. Final checkpoints were not retained, and bitwise rebuild reproducibility remains unverified.

cs.IR · cs.CL · cs.LG

新论文 · v1arXiv:2611.21973

How Many Persistent Features Does a Biometric Need? A Law Linking Equal Error Rate to Feature Count and Persistence

Oleg Komogortsev, Mehedi Hasan Raju

原文摘要

A biometric designer controls the number of features and their temporal persistence. Earlier empirical work linked the equal error rate (EER) to persistence and to the required number of features by straight lines. We derive the law behind these regularities. For $N$ independent standardized Gaussian features with test-retest correlation $ρ$, scored by cosine similarity, Fisher's $z$-transform turns the genuine and impostor scores into two normals, giving $\mathrm{EER}=Φ(-\frac{1}{2}\sqrt{N}\,\operatorname{atanh}ρ)$ and, inversely, $N=(2q/\operatorname{atanh}ρ)^2$ with $q=Φ^{-1}(1-\mathrm{EER})$; intercorrelated features enter through an effective count $N_{\mathrm{eff}}$. The central extension lets persistence vary across comparisons with spread $τ$ on Fisher's scale: $\mathrm{EER}=Φ(-m/(\sqrt{τ^2+v}+\sqrt{v}))$ with $v=1/(N_{\mathrm{eff}}-2)$, which for a normal spread has a floor $Φ(-m/τ)$ that no number of features can lower. With no fitted parameter the simple law reproduces published simulations and the EER-ICC line, and predicts the KCC-EER relation of eye-movement embeddings on GazeBase ($R^2=0.88$), though less well on GazeBaseVR ($0.63$). Read from the genuine and impostor scores, the general form matches the EER of eye movements, keystroke dynamics, the ECG and face embeddings over 101 conditions with $R^2=0.98$ and a median error of $0.6$ points, against $0.87$ and $1.9$ points for the simple law. The 61 eye-movement, keystroke and ECG conditions check consistency on the same scores; the 40 face conditions use held-out subjects, with the same accuracy. The product $τ\sqrt{N_{\mathrm{eff}}-2}$ gives a design rule: adding or decorrelating features pays fully while it is well below one and little once it exceeds about three, where only higher or more uniform persistence helps.

cs.CV

新论文 · v1arXiv:2611.21969

It's My Turn! Interpretable Methods Reveal Developmental Differences from Mother-Child Conversational Dynamics

A'di Dust, Anura Deshpande, Pat Levitt, Maja Matarić

原文摘要

Understanding conversational interactions between mothers and children is an important challenge for computational behavioral modeling. Existing methods use traditional statistical approaches and subjective measures of conversational dynamics, without incorporating temporal or probabilistic modeling. We developed an interpretable computational framework that combines sequence analysis, information-theoretic measures, and Bayesian hierarchical modeling to characterize temporal conversational dynamics in parent-child play. We applied this framework to interactions from 94 mother-child dyads with two-year-old children. Sequence analysis revealed that dyads with lower language development (as defined by scores on the Bayley developmental test) exhibited more heterogeneous conversational organization and fewer serve-and-return exchanges than higher-development dyads, a reciprocal turn-taking pattern in which one partner initiates communication and the other responds. Mutual information analyses suggested differences in conversational predictability between lower- and higher-development dyads, although the bootstrap confidence intervals overlapped. Bayesian hierarchical models estimated temporal trajectories for maternal consecutive turns, child responses following maternal speech, and overlapping responses; HDIs showed that trajectories differed in whether they excluded 0, but there were no statistically credible differences between the Bayley groups. Overall, these results indicate that children with higher developmental scores have more organized and predictable communication styles, with more ``serve-and-return" patterns with their mothers. These results demonstrate that interpretable computational representations of conversational dynamics capture developmental differences beyond simple measures of speech quantity.

cs.HC · cs.CL

新论文 · v1arXiv:2611.21966

Supersaturation and reconfiguration diameter of independent transversals

Wouter Cames van Batenburg, Penny Haxell, Ross J. Kang, Ronen Wdowinski

原文摘要

Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree $Δ$. It is a classic result that when all parts have size at least $2Δ$, the collection is nonempty. Recently, it was found that if the parts have size at least $2Δ+1$, then every pair of independent transversals is connected, within the collection, by a sequence of one-vertex reconfigurations. We prove, among other results, that there are exponentially many independent transversals when the parts have size at least $2Δ$, and that the reconfiguration diameter is at most linear in the number of parts when the parts have size at least $4Δ$.

math.CO · cs.DM