跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+94新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

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

论文修订列表

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

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

Extending Tardos's Theorem to Separable Convex Quadratic Programming

Bin Cui, Hanqing Li, Xupeng Miao

原文摘要

For an integer equality matrix $A\in\mathbb{Z}^{r\times m}$ of binary encoding length $\langle A\rangle$, Tardos's theorem solves linear programs using $\operatorname{poly}(r,m,\langle A\rangle)$ rational arithmetic operations and comparisons, independently of the right-hand side and objective coefficients. We extend this guarantee to continuous separable convex quadratic programming over $Ax=b$, $x\ge0$: the operation count is independent of the right-hand side, linear costs, and all nonnegative quadratic weights. The algorithm returns an exact optimal primal-dual pair or a certificate of infeasibility or unboundedness. All intermediate rational numbers have encoding lengths polynomial in the total input length. As an application, we obtain a strongly polynomial algorithm for continuous multicommodity flow with shared capacities and quadratic costs of aggregate arc flow, independently of demands, capacities, and cost coefficients. Objective compression and continuous-integer proximity yield a local solver returning a point close to an optimum. We relax nonnegativity on coordinates with zero optimal dual slack, minimize the largest remaining coordinate, and optimize over the relaxed coordinates. A descent LP over the recession cone provides a complementary bound. Circuit decomposition combines these bounds into a scale ensuring that each local call reveals a new coordinate. At most $m$ calls, followed by two LPs, recover an exact optimum and its dual certificate.

cs.DS

版本更新 · v4arXiv:2610.33307

Tree Depth and Sample-Quality-Associated Features: Two Hidden Factors in Boruta Selection for RNA-Seq Data Classification

Tareque Mohmud Chowdhury, Abu Raihan Mostofa Kamal

原文摘要

Random Forest--based selectors such as Boruta depend on tree depth, yet Boruta's most used implementation, BorutaPy, recommends depths of 3 to 7 without published evidence. We tested the effect of depth using pan-cancer data from The Cancer Genome Atlas (10,469 tumors, 33 cancer types) and breast cancer PAM50 subtyping (981 tumors, 5 subtypes). Label-dependent steps were fitted inside training folds, effects were measured against seed-to-seed variation, and each task kept a locked test set. In pan-cancer data, depth 5 changed the selection far more than a new seed did: the top-500 Jaccard overlap with unlimited depth was 0.37, against 0.84 (depth 5) and 0.93 (unlimited) between seeds. Depth-5 trees confirmed 472 instead of 1,659 genes, covered fewer large-class markers (16% vs 62%) and gave less accurate 50-gene panels (balanced accuracy 0.809 vs 0.889). The effect vanished once the cap reached 61 to 76% of the median depth of unrestricted trees, a depth that depends mainly on the number of classes, not sample size. In PAM50 subtyping (median depth 12) the effect was small, and leaving depth uncapped cost no accuracy in either task. It replicated in a second cross-validation repeat and under permutation importance. About a third of pre-filtered candidates correlated within class with the number of detected genes, a sample-quality measure; a within-class filter removed them without loss of test accuracy (0.943 vs 0.942 balanced accuracy, 1,000 genes). We recommend uncapped trees, or a cap above 75% of the realized median depth, and a within-class quality filter before Boruta.

cs.LG

版本更新 · v3arXiv:2603.05811

LIPAR: Training-free Latent Inter-Frame Pruning with Attention Recovery

Dennis Menn, Yuedong Yang, Bokun Wang, Xiwen Wei, Mustafa Munir, Feng Liang, Radu Marculescu, Chenfeng Xu 等 9 位作者

原文摘要

Video generation enables text-to-video synthesis, video editing, and motion-controlled content creation. However, current video generation models suffer from high computational latency, rendering true real-time capabilities infeasible for downstream tasks. We address this limitation by exploiting the temporal redundancy inherent in video latent patches. To this end, we propose the Latent Inter-frame Pruning with Attention Recovery (LIPAR) framework, which detects and skips recomputing duplicated latent patches. Additionally, we introduce a novel Attention Recovery mechanism that approximates the attention values of pruned tokens, thereby removing visual artifacts arising from naively applying the pruning method. Empirically, our method increases generation throughput by $1.45\times$, on average achieving 12.2 FPS on an NVIDIA A6000 compared to the baseline 8.4 FPS. The proposed method does not compromise generation quality and can be seamlessly integrated with Diffusion Transformer without additional training. Our approach effectively bridges the gap between traditional compression algorithms and modern generative pipelines.

cs.CV

版本更新 · v2arXiv:2605.22869

FuRA: Full-Rank Parameter-Efficient Fine-Tuning with Spectral Preconditioning

Yequan Zhao, Ruijie Zhang, Liyan Tan, Niall Moran, Tong Qin, Zheng Zhang

原文摘要

Both full fine-tuning (Full FT) and parameter-efficient fine-tuning methods such as LoRA introduce weight updates without accounting for the spectral structure established during pretraining. As a result, noisy gradients from limited fine-tuning data can perturb robust pretrained features. We identify spectral preconditioning as the missing ingredient: reparameterizing each weight matrix through its full-rank singular value decomposition (SVD) and freezing one singular basis constrains updates to the pretrained column space, yielding a preconditioned optimization scheme that outperforms unconstrained Full FT at the same trainable parameter count. Building on this insight, we propose FuRA (Full-Rank Adaptation), an efficient full-rank adaptation framework based on a block tensor-train factorization W = LSR, where the large core L is fixed to the pretrained block-wise SVD basis, while only the compact core R and the block-wise singular values S are optimized. This design simultaneously provides full-rank spectral preconditioning, preserves full-rank update expressivity, and achieves parameter, memory, and step-time efficiency comparable to LoRA. FuRA consistently outperforms Full FT across multiple settings, including LLM fine-tuning (+1.37 on LLaMA-3-8B commonsense reasoning), LLM reinforcement learning for mathematical reasoning, and visual instruction tuning for VLMs. Furthermore, the 4-bit quantized variant, QFuRA, also surpasses QLoRA. Code is available at https://github.com/yequanzhao/FuRA

cs.LG

版本更新 · v3arXiv:2610.29696

Quantum f-divergences from retrodictive tests: a unifying classical variational principle

Francesco Buscemi

原文摘要

A single classical f-divergence has several inequivalent quantum versions, but what distinguishes them operationally is less clear. Matsumoto's reverse tests characterize the maximal quantum f-divergence as the least classical distinguishability needed to prepare two quantum states with one device. Here we introduce retrodictive tests, in which two reverse tests sharing a reference state are coupled via Bayesian retrodiction to define a forward and a reverse stochastic process. In the forward process, the system is prepared by the first device and measured by the Petz transpose of the second; the reverse process interchanges their roles. We seek the least classical distinguishability between these two processes, as measured by the f-divergence between their joint laws, for fixed prescribed states and reference. For full-rank states in finite dimension, we prove that the canonical spectral implementations attain this minimum simultaneously for every operator-convex f. The reference then determines which quantum f-divergence is obtained: a flat reference gives the standard divergences, with the Nussbaum--Szkoła distributions as optimal joint laws; either prescribed state as reference recovers Matsumoto's reverse tests and the maximal divergences; and power references give the geodesic family. In particular, the Umegaki and Belavkin--Staszewski relative entropies arise from the same classical variational principle under different choices of reference. Spectral optimality extends to processes containing a quantum channel; for channels with full-rank Choi operator, the minimum of the forward relative entropy agrees with a known average entropy production.

quant-ph · cs.IT · math-ph

版本更新 · v3arXiv:2605.24795

Lifted Schrödinger Bridges for Gaussian Mixture Endpoints: Projection Gaps and Path-Space Obstructions

Siddhartha Ganguly, George Rapakoulias, Panagiotis Tsiotras

原文摘要

We study stochastic density control between Gaussian-mixture endpoint distributions under Brownian prior dynamics. Since the direct Schrödinger bridge between Gaussian mixtures is generally not available in closed form, we introduce a lifted path-space construction in which each trajectory is augmented with a source--target component label. Consequently, the problem decomposes into Gaussian component-to-component Schrödinger bridges with explicit marginal, drift, and cost formulas, while the mixture-level assignment reduces to a finite-dimensional entropic coupling problem with a Sinkhorn scaling form. We then analyze the projection obtained by discarding or forgetting the label. By construction, the projected law satisfies the original Gaussian-mixture endpoint constraints, but its relative entropy generally differs from the lifted relative entropy by a nonnegative conditional label-information gap. This gap reveals a path-space obstruction: the lifted optimizer cannot, in general, be identified with the direct unlabeled Schrödinger bridge after projection. We also derive the posterior-averaged Markov drift associated with the projected marginal flow, prove a kinetic-energy upper bound, and identify a common path-potential condition under which the projection gap vanishes. Several numerical illustrations showing density and shape control are recorded for a self-contained exposition.

math.OC · cs.LG · cs.RO · eess.SY

版本更新 · v3arXiv:2610.09025

SPIN: Shadow Predictive Indexer for Sparse Attention

Yao Fu, Jiahan Chang, Yueying Li, Ritchie Zhao, Bryce Long, Mohammad Mahdi Kamani, Samkit Jain, Rahul Raman 等 14 位作者

原文摘要

Indexer-based sparse attention reduces the cost of core attention by passing only a fixed, small number of important tokens to it. However, the indexer must still score the entire KV cache at every decoding step. This scoring overhead becomes a major bottleneck as the context length grows. We propose SPIN (Shadow Predictive Indexer) to reduce this indexer overhead. SPIN uses lightweight, history-based prediction to identify important KV blocks, avoiding the need to score the full KV cache at every decoding step. SPIN keeps the score history fresh with random exploration and allocates the block budget across layers by their measured miss rates. SPIN treats KV blocks and speculative decoding as first-class design and implementation considerations. Across extensive evaluations on long-context and agentic benchmarks, SPIN achieves 30-40% sparsity while preserving task quality. With larger exploration shares and per-layer block budgets, SPIN keeps task quality on the especially difficult MRCRv2 benchmark close to baseline at 50-57% effective block sparsity. In end-to-end vLLM serving, SPIN improves output throughput by up to 13.9% and reduces median inter-token latency by up to 13.6%.

cs.LG

版本更新 · v4arXiv:2502.11053

Demystifying 5G Polar and LDPC Codes: A Comprehensive Review and Foundations

Mody Sy

原文摘要

Understanding how 5G networks correct errors is no trivial matter. At the heart of the process lie two sophisticated families of codes: LDPC and polar codes. This paper opens the black box, not only by explaining how these codes are designed, but also by showing how they are encoded and decoded in practice. To describe the research covered in this review, we present a detailed survey of the literature supplemented with insights that are often buried deep within technical standards. These foundations are not just historical footnotes: they remain relevant to research on error correction for future wireless systems. In bringing clarity to these building blocks, we aim to help engineers and researchers navigate what is both a complex and increasingly vital part of wireless communication.

cs.IT

版本更新 · v2arXiv:2608.25429

Distance Is Not Enough: Forget-Retain Alignment Gap Predicts LLM Relearning Robustness

Yi Chen, Hanna Hsieh, Shuhong Liu, Chuanbo Hua, Zihan Ma, Kun Wang, Joo-Young Kim

原文摘要

Machine unlearning aims to make a model forget specific data, yet unlearned LLMs often fail to stay unlearned: brief fine-tuning can revive removed knowledge. Existing robustness predictors rely on global weight-space displacement, but distance alone can be misleading when random or destructive updates collapse performance. We argue that relearning robustness depends on update structure: robust unlearning should affect forget-critical weights while sparing retain-critical ones. We introduce the Forget-Retain Alignment Gap (FRAG), a training-free predictor that scores an update's forget-retain alignment without running a relearning attack, and separates selective from dense updates more reliably than global distance. Building on the forget-critical, retain-sparing principle, Forget-Retain Pruning (FRP) improves relearning robustness. Our results suggest that weight selectivity better explains robustness than distance alone. Code is available at https://github.com/Yi1-Chen/FRAG.

cs.AI · cs.LG

版本更新 · v2arXiv:2605.24311

Terrain-Adaptive Grouser Wheel for Optimal Planetary Exploration: Design and Experimental Investigation

Vincent Griffo, Yashwanth Kumar Nakka

原文摘要

Planetary rovers operating in extraterrestrial environments often encounter significant mobility challenges due to varying terrain features such as gradients and granularity. While recent works in multimodal wheel design have explored adjustments in stiffness, compliance, and diameter as a means to improve terrain adaptability, full wheel grouser-adjustable designs remain largely unexplored. Grousers are a compelling feature to actuate, as granular terrains tend to require increased grouser height for improved wheel performance. As a result, we introduce GROVER, a multimodal wheel capable of continuously adjusting its grouser height for terrain adaptation. Fixed-height performance was characterized on vinyl, coarse rock, pea gravel, and sand under two packing states. Across 950 trials, the best configuration varied with terrain, reducing slip by 34.6\%--58.0\% in granular terrains and improving travel time and energy consumption by up to 77.4\%. No single grouser height minimized slip across all terrains, motivating mid-traversal reconfiguration toward lower-slip operation. Two experiments demonstrated this. First, an instructed terrain transition changed grouser height toward a known low-slip configuration during motion, with slip decreasing by $44.0\pm4.7\%$ from the transient peak across 20 trials. Second, an online adaptation routine used closed-loop slip feedback alone to search the grouser-height range for a lower-slip configuration on four terrains with previously uncharacterized granularities: three field terrains and one laboratory regolith terrain. The controller selected different heights, with settled slip 25.4\%--37.2\% lower than the pre-settled mean. Together, these results demonstrate GROVER's ability to improve mobility by varying wheel morphology during traversal toward lower-slip operating states.

cs.RO

版本更新 · v2arXiv:2603.26993

On the Reliability Limits of LLM-Based Multi-Agent Planning

Ruicheng Ao, Siyang Gao, David Simchi-Levi

原文摘要

LLM-based multi-agent planning delegates operational decisions to specialists that communicate through finite reports. In this research, we study its reliability limits when a coordinator can revisit source records before completing a resource-constrained plan. A useful report can support an immediate decision or direct later reading, so its value depends on how these stages communicate. We derive exact communication and access tradeoffs and prove that two report forms suffice for a broad class of allocation requirements, one favoring immediate resource identification and the other distinguishing absence from unnamed availability. For shared capacity, this reduction permits joint optimization of reporting roles and adaptive reads for a fixed number of source types with unequal workloads and reading costs. Identical specialists can optimally report different facts, and maximizing immediate completion can impose an unbounded recovery cost penalty even with full-record access. We also conduct numerical experiments to quantify the benefits of the proposed joint optimization and show how source access improves language-agent decisions that already use their reports optimally. In particular, an exhaustive evaluation of 207,632 report designs on small allocation instances recovers the predicted joint optima. Our analysis suggests that reliable agent communication should be evaluated by the complete decisions it supports and the cost of finishing its unresolved cases, instead of solely by report length, local prediction accuracy, or immediate task completion, as is often the case in current practice.

cs.MA · cs.LG · math.OC · stat.ML

版本更新 · v4arXiv:2605.08571

BEACON: Cross-Domain Co-Training of Generative Robot Policies via Best-Effort Adaptation

Antong Zhang, Han Qi, Heng Yang

原文摘要

We introduce BEACON--Best-Effort Adaptation for Cross-Domain Co-Training--a theory-guided framework for training generative robot policies with abundant source demonstrations and limited target demonstrations. BEACON casts cross-domain co-training as a discrepancy-aware importance-reweighting problem, jointly learning a diffusion-based visuomotor policy and per-sample source weights through an objective inspired by the Best-Effort Adaptation (BEA) bound. To make this approach practical for high-dimensional sequence policies, we develop scalable instance-level discrepancy proxies, stochastic alternating updates for policy and weights, and a multi-source extension that balances heterogeneous source domains. Across sim-to-sim, sim-to-real, and multi-source manipulation settings, BEACON improves robustness and data efficiency over target-only, fixed-ratio co-training, and feature-alignment baselines. Without an explicit alignment objective, BEACON also brings source and target representations closer together as an implicit result of discrepancy-aware co-training.

cs.RO

版本更新 · v2arXiv:2511.00532

AQBuc: Air Pollution Forecasting in Bucharest

Dragoş-Andrei Şerban, Răzvan-Alexandru Smădu, Dumitru-Clementin Cercel

原文摘要

In recent years, air pollution, especially the particulate matter $2.5\,μ\text{m}$ (PM2.5), has become a growing concern mainly in urban areas. Exposure to air pollution is linked to the development of numerous health conditions, such as the aggravation of respiratory diseases, cardiovascular disorders, impaired lung function, and even cancer or early death. Forecasting future levels of PM2.5 has become increasingly important, as it can provide early warnings and help prevent diseases. We propose AQBuc, a dataset for predicting PM2.5 pollution in Bucharest, Romania, introducing an understudied location, as most work in this field has focused on Asian cities. Our dataset allows us to benchmark models for predicting future levels of PM2.5 across various time horizons. We evaluate a broad range of methods, including machine learning models, such as linear regression and ensemble-based methods, deep learning models based on recurrent networks and transformers, and large language models (LLMs). Specialized time-series models handle temporal data better, especially on longer horizons, while tree ensembles are more cost-effective for short horizons. Meanwhile, LLMs struggle to capture continuous sensor dynamics without specialized architectural changes.

cs.LG · cs.AI · cs.CY · stat.AP

版本更新 · v2arXiv:2505.23565

DRO: A Python Library for Distributionally Robust Optimization in Machine Learning

Tianyu Wang, Jiashuo Liu, Henry Lam, Hongseok Namkoong, Jose Blanchet

原文摘要

We introduce dro, an open-source Python library for distributionally robust optimization (DRO) for regression and classification problems. The library implements 15 DRO formulations and 9 backbone models, enabling 85 distinct DRO methods. Furthermore, dro is compatible with both scikit-learn and PyTorch through a unified interface, and uses approximation techniques to reduce runtime for some computationally demanding formulations. Comprehensive documentation is available at https://python-dro.org.

cs.LG · cs.MS · math.NA

版本更新 · v2arXiv:2607.06699

RoboSnap: One-Shot Real-to-Sim Scene Generation for Generalizable Robot Learning and Evaluation

Shujie Zhang, Jingkun Yi, Weipeng Zhong, Zirui Zhou, Yangkun Zhu, Hanqing Wang, Xudong Xu, Weinan Zhang 等 9 位作者

原文摘要

Recovering real-world scenes as interactive simulation environments can enable generalizable robot learning and reproducible policy evaluation. However, constructing scenes that are both physically stable and visually faithful remains slow and expensive. In this work, we present RoboSnap, a real-to-sim framework that turns a single RGB image into a simulation-ready scene. The key idea is a layered design that separates the physics-critical interaction area from the surrounding visual context: collision-aware foreground assets are refined for stable robot interaction, while a 3D Gaussian splatting visual layer preserves faithful background appearance under novel views. Experiments on DROID scenes and real-robot tasks show that RoboSnap achieves reliable trajectory replay in the recovered scenes, supports task-specific synthetic data generation for policy training, and yields meaningful sim-real correlation for policy evaluation. To further support real-to-sim research, we introduce DROID-Sim, a real-to-sim companion dataset constructed from 564 real-world scenes in DROID. Extensive experiments suggest that the value of real-to-sim methods lies not only in high-fidelity visual reconstruction, but in turning real environments into reusable infrastructure for robot learning and evaluation.

cs.RO

版本更新 · v3arXiv:2605.09294

Understanding, Predicting, and Steering LLM Behavior via Representational Effective Theory

Muhammed Ustaomeroglu, Guannan Qu

原文摘要

Large language models (LLMs) assist with writing, teaching, programming and decision-making, yet the computations underlying their behaviour remain largely opaque. Full access to every weight and activation does not by itself yield understanding: a microscopic description need not reveal how computation is organized at the level that governs behaviour. Complex systems are often understood instead through a few macroscopic variables whose dynamics capture the behaviour of interest, as temperature and pressure do for molecular motion in thermodynamics. Here we show that such an effective description of LLM computation can be learned directly from data. We introduce Representational Effective Theory (RET), a framework that learns low-dimensional macrostates and their dynamics from a model's hidden-state trajectories. These macrostates exhibit approximately closed dynamics and trace interpretable trajectories through reasoning. They also predict sycophancy and alignment faking early in generation, while steering the model towards selected macrostates produces corresponding changes in its reasoning. Together, these results show that LLM computation admits useful macroscopic descriptions that support interpretation, prediction and control.

cs.LG · cs.AI

版本更新 · v3arXiv:2603.08683

Benchmarking Language Modeling for Lossless Compression of Full-Fidelity Audio

Phillip Long, Zachary Novack, Chris Donahue

原文摘要

Autoregressive "language" models (LMs) trained on raw waveforms can be repurposed for lossless audio compression, but prior work is limited to 8-bit audio, leaving open whether such approaches work for practical settings (16/24-bit) and can compete with existing codecs. We benchmark LM-based compression on full-fidelity audio across diverse domains (music, speech, bioacoustics), sampling rates (16kHz-48kHz), and bit depths (8, 16, 24-bit). Standard sample-level tokenization becomes intractable at higher bit depths due to vocabulary size (65K for 16-bit; 16.7M for 24-bit). We propose Trilobyte, a byte-level tokenization schema for full resolution audio, improving vocabulary scaling from $O(2^{b})$ to $O(1)$ and enabling the first tractable 24-bit LM-based lossless compression. While LMs consistently outperform FLAC and yield state-of-the-art compression at 8-bit and 16-bit, we observe that compression gains become more modest as bit depth increases beyond 8-bit.

cs.SD · cs.AI · cs.LG · eess.AS

版本更新 · v2arXiv:2610.38691

Beyond fabrication: Misattributed numbers in papers written by AI research agents

Mosab Alfaqeeh, Omar Mohammed Horani, Mou'th Hourani, Hashem Alfaqeeh

原文摘要

Verifying numerical claims in research written by AI agents is an important but challenging problem. Recent benchmarks show that many agent-written papers fail integrity checks, but such verdicts, often produced by a single LLM judge, identify failure without explaining its nature, and existing checks either test a paper for internal consistency or test whether a reported value appears somewhere in an agent's output. We re-analyze all 540 released judgments from a recent public benchmark of AI research agents (nine agents, fifteen open research problems) and manually label 256 numerical claims from 18 submissions. Failures concentrate on alignment between the paper and the underlying work rather than overt cheating, and about four in five unsupported claims correspond to values in the agent's own files that come from the wrong experiment, metric, or run. We introduce a deterministic claim-to-evidence checker that scores whether the surrounding context identifies the claimed result and calibrates each claim against numerical decoys. With its rules fixed before labeling, it certifies claims with over 90% precision against blinded annotators (78 of 85; Cohen's kappa = 0.89), while verifying only a subset of claims; most claims it cannot verify are nevertheless traceable, so failure to verify is not evidence of falsehood. An LLM verifier given the same evidence recovers more traceable claims but accepts about three times as many misattributed ones, so the two are best used together. Applied to 99 submissions, the checker reveals large differences in traceability across agents, and on 30 submissions a second judge configuration, with a different model and harness, orders the agents' vendor groups as the official judge does while passing twice as many papers. These findings motivate provenance-first auditing of AI-produced research.

cs.AI · cs.CL · cs.DL

版本更新 · v3arXiv:2601.10083

Starfield: Demand-Aware Satellite Topology Design for Low-Earth Orbit Mega Constellations

Shayan Hamidi Dehshali, Tzu-Hsuan Liao, Shaileshh Bojja Venkatakrishnan

原文摘要

Low-Earth orbit (LEO) mega-constellations are emerging as high-capacity backbones for next-generation Internet. Deployment of laser terminals enables high-bandwidth, low-latency inter-satellite links (ISLs); however, their limited number, slow acquisition, and instability make forming a stable satellite topology difficult. Existing patterns like +Grid and Motif ignore regional traffic, ground station placement, and constellation geometry. Given sparse population distribution on Earth and the isolation of rural areas, traffic patterns are inherently non-uniform, providing an opportunity to orient inter-satellite links (ISLs) according to these traffic patterns. In this paper, we propose Starfield, a novel demand-aware satellite topology design heuristic algorithm supported by mathematical analysis. We first formulate a vector field on the constellation's shell according to traffic flows and define a corresponding Riemannian metric on the spherical manifold of the shell. The metric, combined with the spatial geometry, is used to assign a distance to each potential ISL, which we then aggregate over all demand flows to generate a score for each satellite's link selection. Inspired by +Grid, each satellite selects the link with the minimum Riemannian distance along with its corresponding angular links. To evaluate Starfield, we developed a custom, link-aware, and link-configurable packet-level simulator, comparing it against LAMP, +Grid, Motif, and Random topologies. For the Phase 1 Starlink, simulation results show up to a 30% reduction in hop count and a 15% improvement in stretch factor across multiple traffic distributions. Moreover, static Starfield, an inter-orbital link matching modification of Starfield, achieves a 15% improvement in stretch factor under realistic traffic patterns compared to +Grid. Experiments demonstrate Starfield's robustness under traffic demand perturbations.

cs.NI · cs.ET · math.DG

版本更新 · v2arXiv:2601.21514

Transversal gates for quantum CSS codes

Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews, Narayanan Rengaswamy, Rodrigo San-José

原文摘要

In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of these gates and characterize the subgroups that induce tensor products of single-qubit logical gates and logical identities. We describe these groups through explicit linear equations given by componentwise products of basis vectors of the underlying classical codes, which is the key difference from previous approaches. We compute the complete set of diagonal transversal gates fixing the code, and of transversal logical gates, for any CSS code arising from monomial codes, a family that includes decreasing monomial codes and polar codes. As a consequence, we recover and extend some results in the literature on CSS-T codes, triorthogonal codes, and divisible codes. We also extend these results to diagonal gates acting transversally on several code blocks and use them to characterize addressable gates.

cs.IT · quant-ph

版本更新 · v3arXiv:2510.25069

TOPol: Reconstructing and Interpreting Multidimensional Semantic Polarity Fields

Lucia Gomez, Gabin Taibi, Julius Sipke Kooistra

原文摘要

Polarity in natural language processing has long been operationalized as a single axis: the sentiment construct. We challenge this one-dimensional view by asking what a topic's documents are bipolar about, without specifying an answer in advance. TOPol inverts the usual concept-direction paradigm: rather than mapping a named construct to one direction, it maps a topic to the full set of statistically reproducible bipolar semantic axes its documents support in a transformer's residual stream, and asks only afterwards which of them correspond to a known construct. These axes need not be evaluative. The method is a recursive, orthogonal-by-construction bipartition of each topic's document cloud, with a candidate axis promoted to a finding only if it survives one pre-specified split-half stability gate. We calibrate against a known answer first: on 9,986 Amazon reviews (14 discovered topics) in Gemma 3 4B, the star-rating difference-in-means vector serves as a ruler known by construction to be sentiment. Discovery blindly re-derives the sentiment axis in every topic (cosine 0.71-0.97) without ever seeing the rating label, while the same gate certifies 543 axes, of which 106 are near-orthogonal to sentiment yet equally reproducible; each topic supports 33-45 mutually orthogonal axes, and sentiment axes resolve in later layers than the rest. Differential vocabulary, an internals-grounded natural-language decoder and vocabulary-based clustering agree on what the non-sentiment axes contrast; clustering by shared vocabulary surfaces 99 families, 9 recurring across topics. Direction similarity to the ruler predicts an independent sentiment estimate only weakly ($r=0.243$). Polarity is better treated as a property of a topic's representational geometry, with a measurable rank and a per-axis depth, than as one universal scalar.

cs.CL

版本更新 · v3arXiv:2605.07746

Flow Matching for Count Data

Ganchao Wei, John Pearson

原文摘要

High-dimensional count data arise in applications such as single-cell RNA sequencing and neural spike trains, where mappings between distributions across successive batches or time points form critical components of data analysis. The recent success of diffusion- and flow-based deep generative models for images, video, and text motivates extending these ideas to count-valued settings, but many existing methods either treat each count as a categorical state or transform counts into a continuous space, neither of which is natural or efficient when the count range is large. We propose count-FM, a flow-matching framework for count data based on a continuous-time birth-death process with local unit jumps. Count-FM learns marginal transitions efficiently in count space through simulation-free training of conditional transition rates, allowing transport between arbitrary count-distributed source and target populations. In simulation, count-FM variants achieve strong sample quality while using substantially fewer parameters. We further apply count-FM to scRNA-seq and neural spike-train data for unconditional generation, transport, and conditional generation. Across these tasks, count-FM yields improved sample quality, greater modeling efficiency, and interpretable transport paths.

stat.ML · cs.LG · q-bio.QM

版本更新 · v4arXiv:2605.26236

DuoGesture: Motion-Grounded Semantic Conditioning and Biomechanical Beat Priors for Co-Speech Gesture Generation

Ferdinand Paar, Lanmiao Liu, Aslı Özyürek, Serge Thill, Esam Ghaleb

原文摘要

Co-speech gesture generation requires both semantic expressivity and biomechanically plausible rhythmic motion. Existing holistic gesture models mix lexically grounded semantic gestures with frequent prosody-aligned beat gestures. This limits semantic grounding, speech-motion alignment, and kinematic smoothness. We propose DuoGesture, a neuro-inspired and biomechanically informed approach that decomposes co-speech gesture synthesis into semantic and beat streams. The two streams are coordinated by a Semantic Variational Information Bottleneck, a stochastic frame-level gate that learns when semantic gestures should override rhythmic beat motion. The semantic stream is controlled by Motion-Grounded Semantic Conditioning, which replaces purely linguistic word embeddings with motion-language representations to provide motion-aligned semantic priors for long-tailed lexical triggers of gestures. The beat stream is further regularised by an Inertial Beat Prior, an anthropometry-weighted arm-chain module that reduces jitter and improves rhythmic consistency without constraining semantic frames. Objective evaluations and subjective experiments show that DuoGesture outperforms strong baselines, while component ablations confirm the complementary roles of semantic grounding, stochastic stream selection, and biomechanical regularisation. We encourage readers to view our demos and qualitative illustrations, which are available on the project page: https://ferdinandpaar.github.io/DuoGesture/.

cs.CV · cs.SD

版本更新 · v2arXiv:2510.01691

Can MLLMs Perceive and Describe Medical Image Quality Beyond Scores?

Jiyao Liu, Jinjie Wei, Wanying Qu, Chenglong Ma, Junzhi Ning, Yunheng Li, Ying Chen, Jiafan Zhang 等 19 位作者

原文摘要

Medical Image Quality Assessment (IQA) serves as a critical safety gate for clinical AI, yet existing approaches rely on scalar metrics that fail to capture the descriptive, expert-like evaluation process central to clinical practice. We introduce MedQ-Bench, a comprehensive benchmark for language-based medical IQA evaluation with MLLMs, establishing a perception--description paradigm across 5 imaging modalities and over 40 quality attributes. The benchmark comprises two complementary tasks: MedQ-Perception probes low-level visual attribute discrimination via 2,600 expert-annotated perceptual queries; MedQ-Description covers both no-reference and comparison description sub-tasks with 708 expert-annotated samples, evaluated through a four-dimensional judging protocol. Comprehensive evaluation of 23 state-of-the-art MLLMs reveals that current models exhibit only preliminary and unstable capabilities, and highlights the urgent need for targeted optimization of MLLMs in medical IQA. Project & Dataset: https://github.com/liujiyaoFDU/MedQ-Bench

cs.CV

版本更新 · v3arXiv:1704.04538

A Simple Randomized Estimator for Harmonic Numbers and Logarithms

Ali Dasdan

原文摘要

Scanning a list of $x$ distinct numbers in uniformly random order for its maximum replaces the running maximum $H_x$ times on average, where $H_x$ is the $x$th harmonic number. Run backwards, this gives an estimator: the replacement count of a random list is an unbiased Monte Carlo estimate of $H_x$, and since $H_x = \ln x + γ+ O(1/x)$, a corrected estimate of $\ln x$. We give the exact variance of the count, an error decomposition with sample-size rules, and an exact sampler of the count using $H_x$ integer draws on average instead of a scan of length $x$. Coupling two counts estimates $\ln(a/b)$ without $γ$, and a binary range reduction then bounds the standard error by $\sqrt{\ln 2/n}$ for every $x$ at fewer than $1.7$ draws per repetition on average. A classical deterministic series on the same reduction reaches the rounding floor with sixteen terms in the reported experiments, quantifying the gap between the two approaches. The purpose is pedagogical: the analysis of an algorithm becomes an estimator of the quantity that analysis produces, with exact variances, finite-sample error bounds, reproducible experiments, and machine-checked algorithm contracts and moment identities. The ingredients are classical; the contribution is their assembly.

cs.DS

版本更新 · v4arXiv:2510.06445

A Survey on Agentic Security: Applications, Threats and Defenses

Asif Shahriar, Md Nafiu Rahman, Sadif Ahmed, Farig Sadeque, Md Rizwan Parvez

原文摘要

In this work we present the first holistic survey of the agentic security landscape, structuring the field around the fundamental pillars of Applications, Threats and Defenses. We provide a comprehensive taxonomy of 274 papers that covers red-teaming, blue-teaming and domain-specific applications, attack surfaces on agentic systems, defense techniques, and both offensive and defensive evaluation frameworks. For each pillar, we first discuss the literature around the taxonomy and then perform a quantitative analysis to understand the patterns across these works. For the applications, we show their security-lifecycle coverage map, compare between red-teaming and blue-teaming agents, and analyze the adversarial use of red-teaming applications. On the threat side, we analyze the entry points and agent-loop stages that attacks target, their specificity to the agentic setting, and the threat models they assume. On the defense side, we analyze the prevailing defense strategies, their cost and security trade-offs, and where in the agent lifecycle they are deployed. Finally, we provide a deatiled cross-cutting analysis, where we map which defenses cover which attack classes and chart trends in agent architecture, backbone model usage, and data modality coverage. Taken together, these findings give a researcher a structural understanding of how agentic capabilities, vulnerabilities, and countermeasures relate to one another, and to identify where the field is concentrated and where it is thin.

cs.CL · cs.AI · cs.CR

版本更新 · v3arXiv:2601.18706

Health-SCORE: Improving Open-Ended Health LLMs Using Scalable Rubric-Based Rewards

Zhichao Yang, Sepehr Janghorbani, Dongxu Zhang, Jun Han, Qian Qian, Andrew Ressler, Gregory D. Lyng, Sanjit Singh Batra 等 9 位作者

原文摘要

Reinforcement learning is a powerful approach for improving language models, but applying it to open-ended domains such as healthcare remains challenging because high-quality responses are often multidimensional, context-dependent, and difficult to capture with a single reward signal. Rubrics offer a natural form of supervision by providing a structured representation of the criteria that define a strong response. Existing rubric-based approaches, however, often rely on instance-specific criteria, creating two important limitations: (1) such rubrics are typically unavailable for unseen examples at test time; and (2) constructing new rubrics for every instance incurs substantial reward design costs. We introduce Health-SCORE, a scalable framework that captures recurring principles of response quality in the form of reusable meta-rubrics. Rather than relying on manually constructed instance-level criteria, Health-SCORE captures generalizable principles that can be applied across examples, tasks, and healthcare datasets. These meta-rubrics support two forms of model improvement: they can serve as structured, safety-aware reward signals for reinforcement learning during post-training, and they can be incorporated directly into prompts to guide model behavior at inference time. Across several open-ended healthcare benchmarks, models trained with Health-SCORE achieve performance competitive with models trained using human-authored instance-level rewards, while substantially reducing reward-design costs and improving generalizability.

cs.AI · cs.LG

版本更新 · v2arXiv:2606.04177

A Systematic Analysis of Linguistic Features in AI-Generated English Text Detection Across Domains and Models

Yassir El Attar, Esra Dönmez, Maximilian Maurer, Agnieszka Falenska

原文摘要

Interpretable linguistic features offer a promising approach for explaining why a given text appears machine-generated, particularly for non-expert users. However, existing findings on which features reliably indicate LLMgenerated text remain fragmented across feature sets, models, and text domains. To address this gap, we conduct a large-scale empirical study assessing the robustness of linguistic signals for characterizing AI-generated text. Our analysis covers 284 interpretable linguistic features across outputs from 30 LLMs and 10 text domains under cross-model and cross-domain generalization settings. We show that classifiers based solely on linguistic features can reliably distinguish AI-generated from human-written text. However, many previously proposed indicators prove strongly context-dependent, with the exception of measures of lexical richness, which remain robust signals across model families and text domains. These results demonstrate which linguistic signals generalize across contexts and provide a foundation for more reliable, interpretable analyses of AI-generated language.

cs.CL · cs.AI

版本更新 · v2arXiv:2609.18272

Who Audits Whom, on What Substrate, with What Evidence? An Independence-Graded Audit Protocol for Agentic AI

Mohamed Chahine Ghanem, Baidaa Al-Bander

原文摘要

Agentic AI systems plan, invoke tools, and act with limited supervision; they are now both the subject of audits and, increasingly, the auditor. Independence-the foundation of assurance-is still applied to them as a binary. We argue that it must be graded along three orthogonal axes: principal independence (who controls the auditor), substrate independence (an auditor that shares the auditee's foundation-model family, toolchain, or guardrails fails with the auditee), and evidence independence (whether evidence is attestable rather than self-reported). Each axis has precedent; the contribution is to grade all three on a single audit, aggregate them by the weakest link, and apply the same rubric when the auditor is itself an agent. We give the model a formal basis by transplanting the beta-factor model of common-cause failure from reliability engineering. We also provide a seven-step protocol whose outputs a third party can verify, a structural detectability analysis of a procurement-controls agent audited at three grades, and a closed-form study of the model in which, at a declared common-mode share of 0.90 for a same-family auditor and a declared reporting probability of 0.6 for an internal team, a conventional internal audit of an agent-a real audit team, a second agent, and provider logs-surfaces 5.9% of the faults it could in principle see and, independently of those two values, none at all in half of the fault classes. Because an evidence grade says who could have altered a record, not what the record covers, every load-bearing record also carries a declared-scope predicate, and reports carry a false-flag rate beside the detection floor wherever the auditor's own performance has been measured. We map the triple to the EU AI Act as amended, ISO-IEC 42006, UK public-sector risk-management guidance, and audit-regulator practice.

cs.AI · cs.CR · cs.ET

版本更新 · v2arXiv:2604.08741

LPLCv2: An Expanded Dataset for Fine-Grained License Plate Legibility Classification

Lucas Wojcik, Eduardo A. F. Machoski, Eduil Nascimento, Rayson Laroca, David Menotti

原文摘要

Modern Automatic License Plate Recognition (ALPR) systems achieve outstanding performance in controlled, well-defined scenarios. However, large-scale real-world usage remains challenging due to low-quality imaging devices, compression artifacts, and suboptimal camera installation. Identifying illegible license plates (LPs) has recently become feasible through a dedicated benchmark; however, its impact has been limited by its small size and annotation errors. In this work, we expand the original benchmark to over three times the size with two extra capture days, revise its annotations and introduce novel labels. LP-level annotations include bounding boxes, text, and legibility level, while vehicle-level annotations comprise make, model, type, and color. Image-level annotations feature camera identity, capture conditions (e.g., rain and faulty cameras), acquisition time, and day ID. We present a novel training procedure featuring an Exponential Moving Average-based loss function and a refined learning rate scheduler, addressing common mistakes in testing. These improvements enable a baseline model to achieve an 89.5% F1-score on the test set, considerably surpassing the previous state of the art. We further introduce a novel protocol to explicitly addresses camera contamination between training and evaluation splits, where results show a small impact. Dataset and code are publicly available at https://github.com/lmlwojcik/LPLCv2-Dataset.

cs.CV