跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-21 04:33 — 2026-11-22 04:33(北京时间) · 点击数字查看对应简报;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 社区发现

论文修订列表

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

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

One Model, Two Roles: Emergent Specialization in a Shared Recurrent Transformer

Jucheng Shen, Barbara Su, Anastasios Kyrillidis

原文摘要

Can a shared-weight recurrent Transformer---one that repeatedly applies the same Transformer to update evolving latent states---develop distinct internal roles without being partitioned into separate modules? We study this in Asymmetric Input Recurrence (AIR), a minimal two-state reasoning architecture in which the same Transformer model is reused for both updates (per literature, L and H) and the only built-in difference in the update rule is that the encoded input is injected during L-updates but not H-updates. Across Sudoku-Extreme and Maze, decoded rollouts reveal a consistent split: $z_H$ behaves like a fully committed proposal state, whereas $z_L$ retains local uncertainty and shifting intermediate structure. Freeze interventions provide evidence of dynamical dependence between the two states, with responses that vary across tasks, intervention directions, and seeds. Ablations show that to induce specialization, the shared model needs to be able to tell the two update types apart, either from input injection asymmetry or from a separate level token. Mechanistically, attention analysis shows that L-updates are consistently more local than H-updates in both Sudoku and Maze. Together, these results show that, in a two-state recurrent setting, a clear state-identity signal can induce stable, related functional roles inside a shared-parameter recurrent Transformer. Code is available at https://github.com/juchengshen/air.

cs.LG · cs.AI · math.OC

版本更新 · v2arXiv:2506.13929

Nonlinear Nonlocal Diffusion Equations for the Analysis of Coordination

John S. McAlister, Nina H. Fefferman, Tadele A. Mengesha

原文摘要

Coordination games with explicit spatial or relational structure are of interest to economists, ecologists, sociologists, and others studying emergent global properties in collective behavior. When assemblies of individuals seek to coordinate action with one another through myopic best response or other replicator dynamics, the resulting dynamical system can exhibit many rich behaviors. Here we seek to understand these coordination dynamics in the non-atomic setting by use of a nonlinear, nonlocal diffusion equation framework. For this class of nonlocal equations, we prove existence and uniqueness for the initial value problem in the free boundary case and, with certain conditions on the underlying game theory, we go further and prove a maximum principle, weak regularity results, and a characterization of asymptotic behavior. Additionally, with the help of several numerical results, we present several modeling results, characterizing stationary solutions both rigorously and through numerical experiments.

math.DS · cs.GT

版本更新 · v2arXiv:2605.14301

Language-Induced Priors for Domain Adaptation

Qiyuan Chen, Jiayu Zhou, Raed Al Kontar

原文摘要

Domain adaptation faces a fundamental paradox in the cold-start regime. When target data is scarce, statistical methods fail to distinguish relevant source domains from irrelevant ones, which often leads to negative transfer. In this paper, we address this challenge by leveraging expert textual descriptions of the target domain, a resource that is often available but overlooked. We propose a probabilistic framework that translates these semantic descriptions into a choice model, namely a Language-Induced Prior (LIP), that learns the preferences from a pretrained Large Language Model. The LIP is then integrated into an Expectation-Maximization algorithm to identify source relevance. Methodologically, this framework is compatible with any parametric model where a likelihood is available. It allows the LIP to guide the selection of sources when target signals are weak, while gradually refining these choices as samples accumulate. Theoretically, we prove that the estimator roughly matches an oracle cold-start mean squared error under a correct prior, while remaining asymptotically consistent regardless of the quality of the LIP. Empirically, we validated the framework on a descriptive (Gaussian estimation), a predictive (C-MAPSS dataset), and a prescriptive task (MuJoCo Hopper).

cs.LG · stat.ML

版本更新 · v2arXiv:2610.36297

FASST: A Compact Stateless Atmosphere Model for Long-Term Ocean Coupling

Pratham Aggarwal, Duncan Watson-Parris, William E. Chapman

原文摘要

Coupled climate simulations are computationally expensive, largely because of the atmosphere. We introduce FASST, a coupled climate model that retains the prognostic POP2 ocean while replacing the atmosphere and sea ice with lightweight U-Net emulators. The atmospheric emulator is diagnostic, predicting surface fluxes from the evolving ocean-ice state every $6$ simulated hours, while the sea-ice emulator advances the ice state monthly. For $140$ years of unforced integration, FASST maintains a stable global-mean climate without SST restoring, with post-transient global-mean SST of $291.30 \pm 0.22\mathrm{K}$ compared with $291.25 \pm 0.10\mathrm{K}$ in CESM$2$ piControl. FASST also captures interannual Niño-$3.4$ variability, although with weaker amplitude than CESM ($0.62\mathrm{K}$ versus $1.02\mathrm{K}$). These results demonstrate that a stateless learned atmosphere can sustain stable, free-running coupled climate simulations over century-scale integrations.

physics.ao-ph · cs.LG

版本更新 · v2arXiv:2609.28226

Pinpointing Super-Quadratic Quantum Enumeration Speedups: Exact and Certified Evaluation of the Guessing-Moment Exponent under Product-Distribution Advice

Carsten Schubert, Niklas Paskarbeit, Maximilian J. Kramer, Jean-Pierre Seifert, Marian Margraf

原文摘要

Grover's algorithm gives an optimal quadratic query advantage for black-box search. In cryptanalysis, however, the search often comes with additional probabilistic advice over the candidates, frequently of product form, e.g. from side-channel leakage on independent key coordinates. Classically, guessing in likelihood order is optimal in expectation. In the quantum setting, Montanaro showed how to achieve an optimal expected query complexity, beating plain Grover on every non-uniform advice distribution (up to a constant overhead factor). What has been missing so far is a finite-size method for evaluating the quantum-classical guessing-moment separation induced by a given advice distribution. We provide such a method for product-distribution advice, thereby sharpening the previous entropy-based estimate of Bashiri et al. We reduce the classical and quantum guessing moments to functionals of the one-dimensional surprisal distribution, obtained for product advice by convolving the per-coordinate surprisal laws. When the surprisals lie on a common arithmetic grid (the commensurate case), the logarithmic moments and hence the speedup exponent can be evaluated as finite sums without discretization error; exponential tilting makes this computation numerically stable. For general product advice, we discretize the surprisals onto a common grid and derive an a-posteriori bound on the resulting binning error. We apply the framework to cold-boot leakage on seeds and block-cipher keys, to template-attack posteriors, and to synthetic i.i.d. Bernoulli posteriors calibrated to average residual ranks reported for Keccak side-channel attacks on ML-KEM and ML-DSA. The resulting exponents substantially exceed 2 in several skewed-advice settings, reaching 3.92 for cold-boot advice and 3.12 in the synthetic models, and include cases where the previous entropy-based bound did not establish an exponent above 2.

cs.CR

版本更新 · v2arXiv:2506.04467

Generalizable dose denoising using diffusion transformer framework for pencil beam scanning proton therapy

Yuzhen Ding, Hongying Feng, Jianfeng Zhao, Jason Holmes, Martin Bues, Lisa A. McGee, Jean-Claude M. Rwigema, Nathan Y. Yu 等 17 位作者

原文摘要

Background and purpose: Intensity-modulated proton therapy (IMPT) enables conformal dose delivery for head and neck (H&N) cancers. However, its sensitivity to inter-fractional anatomical changes motivates online adaptations, where rapid and accurate Monte Carlo (MC) dose calculation remains a major bottleneck. Low-statistics MC simulations reduce computation time but introduce noise. This study aimed to develop a diffusion-transformer framework to recover high-statistics dose distributions from noisy MC simulations. Materials and methods: A diffusion-transformer-based dose denoising framework was developed. Eighty H&N patients were used for training and additional 10 H&N patients and 30 patients with lung, breast, and prostate cancers (10 per site) were used for evaluation. Noisy and high-statistics dose maps were generated using MCsquare. The model was trained using noisy dose maps and CT images as inputs and high-statistics dose maps as ground truth, with mean squared error, residual, regional mean absolute error (MAE), and dose-volume histogram (DVH) losses. Performance was evaluated using MAE, 3D gamma passing rates, and DVH indices. Results: Mean whole-body MAE ranged from 0.08 +/- 0.06 to 0.20 +/- 0.11 Gy (Relative Biological Effectiveness, RBE) (RBE = 1.1) across test cohorts. Mean whole-body 3 %/2 mm gamma passing rates ranged from 95.8 +/- 0.8 % to 97.6 +/- 0.9 %. DVH indices from high-statistics and predicted dose distributions showed close agreement for clinical target volumes and organs of interest. Conclusions: The diffusion-transformer-based framework denoised low-statistics MC dose distributions. Despite being trained on H&N data, the model generalized to lung, breast, and prostate cohorts without retraining.

physics.med-ph · cs.AI

版本更新 · v3arXiv:2610.12094

Differentiable Systematic Resampling for Variational Sequential Monte Carlo

Fredrik Cumlin, Saikat Chatterjee

原文摘要

Particle filters are a standard tool for nonlinear state estimation, but their resampling step is discrete, preventing gradient-based learning in variational sequential Monte Carlo. We introduce Differentiable Systematic Resampling (DSR), a temperature-controlled relaxation of systematic resampling, that preserves the CDF-ordered, banded structure of systematic resampling while enabling full gradient flow. DSR converges to exact systematic resampling as the temperature vanishes, and we prove a pointwise exponential convergence rate for the induced bias. Compared to optimal-transport-based differentiable resampling, DSR avoids iterative solvers and has substantially lower computational overhead. Experiments on stochastic dynamical systems and real-world handwriting data show that DSR achieves comparable or superior filtering and dynamics learning performance.

stat.ML · cs.LG · eess.SP

版本更新 · v2arXiv:2607.02842

Continuous-time nonlinear closed-loop in-memory computing for high-accuracy massive MIMO detection

Piergiulio Mannocci, Giacomo Pedretti, Giacomo Larelli, Fabian Böhm, Thomas Van Vaerenbergh

原文摘要

Analog in-memory computing (IMC) has emerged as a promising approach for accelerating matrix operations by exploiting the intrinsic physics of memory arrays. To date, however, most IMC architectures have focused on linear algebra workloads in which computation is encoded in the equilibrium state of a physical system. Extending these principles to nonlinear optimization remains challenging and typically relies on iterative algorithms composed of repeated linear operations. Here, we introduce a continuous-time nonlinear closed-loop IMC architecture for box-constrained zero-forcing (BCZF) decoding in massive multiple-input multiple-output (MIMO) systems. The proposed architecture embeds the decoding problem directly within the dynamics of a nonlinear feedback network of memory arrays and supply-limited operational amplifiers, allowing solutions to emerge through continuous-time physical optimization. We derive a compact analytical model of the circuit and show that its trajectories minimize an equivalent energy function. Experimental emulation using a fabricated IMC chip confirms the predicted dynamics under realistic hardware nonidealities for up to 16x16 MIMO systems. To overcome the finite precision of analog hardware, we extend mixed-precision iterative refinement from linear algebra to nonlinear continuous-time optimization, enabling reliable detection of high-order modulation formats including 1024-QAM. Benchmark projections indicate operation from ultra-low-energy approximate decoding to high-accuracy massive MIMO detection. Together, these results extend closed-loop IMC from equilibrium-based linear algebra to continuous-time nonlinear optimization and establish a pathway toward efficient physical accelerators for high-accuracy wireless communications.

cs.ET · cs.AR · eess.SP

版本更新 · v2arXiv:2610.36195

Learning to Read Braille: Benchmarking and Improving Braille Recognition Capabilities of VLMs

Kartik Jangra, Atharva Gawane, Siddharth Pulipaka, Hemachandran Karah, Raj Dabre

原文摘要

Despite rapid progress in visual understanding and document transcription, modern vision-language models (VLMs) struggle with a fundamental accessibility task: reading Braille from images. We introduce BrailleBench, a manually curated benchmark of 259 real-world Grade-1 and Grade-2 Braille images. We evaluate proprietary, open-weight, OCR-specialized, and tool-assisted multimodal systems and find that standalone general-purpose models perform poorly at directly transcribing Braille images, whereas tool-assisted systems perform much better. We design a synthetic Braille generation pipeline with diverse layouts and image perturbations. A 2B VLM model trained on our synthetic data reaches 87% exact match on Grade-1 and 61% on Grade-2 BrailleBench, outperforming standalone VLMs and achieving the highest Grade-2 exact match score among the evaluated systems. We further show that high accuracy on synthetic validation data does not guarantee high accuracy on real photographs in our experiments: models trained on prior synthetic data reach up to 96% on their synthetic validation set but at most 3.26% on Grade-1 BrailleBench. Our results identify an accessibility-relevant capability gap in multimodal systems and show that targeted synthetic supervision can improve real-world Braille transcription.

cs.CV · cs.CL

版本更新 · v2arXiv:2605.08441

DUET: Optimize Token-Budget Allocation for Reinforcement Learning with Verifiable Rewards

Haoyu Hu, Xuandong Zhao, Xuhai "Orson'' Xu, Nori Jacoby

原文摘要

Reinforcement learning with verifiable rewards (RLVR) generates hundreds of thousands of tokens per training step, with rollout generation dominating the computational cost. The overall token budget can be controlled along two main dimensions: (i) deciding which prompts to allocate rollouts to, and (ii) deciding how long each rollout should be. Prior work has generally controlled only one of these dimensions at a time. We show that jointly tuning both decisions under a shared compute budget improves both reasoning quality and wall-clock training time. We instantiate this view as \textbf{DU}al-controlled tok\textbf{E}n alloca\textbf{T}ion (DUET), a computationally efficient layer over GRPO that uses a lightweight pre-rollout surrogate of prompt informativeness to set how many rollouts each prompt receives, and a marker-gated abort rule with importance reweighting to set when to stop them. On Qwen3-1.7B trained on MATH, DUET outperforms full-budget GRPO and the other three budget-aware baseline methods. DUET's advantage further generalizes to other benchmarks across math and coding, and is on par with the best baseline on the scientific Q\&A domain, while also achieving a $1.62\times$ wall-clock speedup. More notably, using only 50\% of the token budget, DUET still outperforms all baseline methods at their full budget, achieving an even higher $2.51\times$ speedup over full-budget GRPO. We verify the high performance of DUET on other backbone LLMs, including Qwen3-4B to 14B and Llama-3.2-3B-Instruct. Notably, the gap between DUET and the strongest baseline \emph{widens} as the budget tightens, contrary to the usual pattern in which efficient methods trade off quality as compute decreases. More broadly, these results suggest that DUET budget-aware control strategies are valuable not only for accelerating training, but also for improving the quality of the learning signal.

cs.LG · cs.AI

版本更新 · v2arXiv:2602.18002

Asynchronous Heavy-Tailed Optimization

Junfei Sun, Dixi Yao, Xuchen Gong, Tahseen Rabbani, Manzil Zaheer, Tian Li

原文摘要

Heavy-tailed stochastic gradient noise, commonly observed in transformer models, can destabilize the optimization process. Recent works mainly focus on developing and understanding approaches to address heavy-tailed noise in the centralized or distributed, synchronous setting, while asynchronous optimization under such noise remains underexplored, especially in the practical settings with local updates. In this work, we first investigate two asynchronous communication schemes (server- and client-centric) that handle stragglers under heavy-tailed gradient noise. We further propose and theoretically analyze algorithmic modifications based on delay-aware learning rate scheduling and delay compensation to enhance the performance of asynchronous algorithms. Our convergence guarantees achieve the optimal rate under heavy-tailed noise and improve delay tolerance compared with existing asynchronous approaches. Empirically, our approaches outperform prior synchronous and asynchronous methods in terms of accuracy/runtime trade-offs and are more robust to hyperparameters in both image and language tasks.

cs.LG

版本更新 · v2arXiv:2609.06021

Delay and Throughput Analysis of Computation Offloading in Mobile Edge Computing: A Queueing Network Approach

Amirparsa Bahrami, Farid Ashtiani

原文摘要

Mobile edge computing (MEC) enables mobile devices to offload computation to nearby edge servers and to the cloud in order to reduce end-to-end delay for different applications. In this paper, we study static computation offloading when each task consists of multiple dependent subtasks represented by a rooted directed tree. We develop a product-form queueing-network (PFQN) model with an approximation to capture the computation and communication dynamics of tree-structured task execution in a multi-tier MEC system. Based on this model, we derive closed-form expressions for server utilizations and waiting times, and then construct a recursive algorithm for evaluating the average delay of general tree-structured tasks. We formulate the static offloading design problem as the minimization of the rate-weighted average task delay over the routing probabilities, and solve it through a differentiable optimization framework based on softmax parameterization, log-sum-exp smoothing, and a stability barrier on server utilizations. Numerical results show that the proposed PFQN approximation provides accurate delay estimates and that the delay-optimized static policy consistently outperforms the considered baseline algorithms in terms of both average task delay and maximum stable throughput.

cs.NI

版本更新 · v2arXiv:2604.17331

Evaluation of Gauss-Legendre curves

Filip Chudy, Paweł Woźny

原文摘要

We present new representations of Gauss--Legendre polynomials and their derivatives in the shifted power basis and in bases related to symmetric orthogonal Jacobi polynomials. Using these representations and certain recurrence relations, we propose $O(n^2+dn)$ methods for evaluating a Gauss--Legendre curve of degree $n$ in $\mathbb E^d$. We also propose algorithms for multipoint evaluation with computational complexity $O(Mdn+dn^2)$, where $M$ is the number of evaluation points. Numerical tests show that the approach using the shifted power basis is very fast, but it works well only for small $n$ (approximately up to 20), whereas the method employing Jacobi polynomials gives good numerical results even for large $n$ (around 100).

math.NA · cs.GR

版本更新 · v2arXiv:2605.07114

Where to Spend Rollouts: Hit-Utility Optimal Rollout Allocation for Group-Based RLVR

Tao Wang, Shuo Li, Yan Sun, Dongsheng Ding, Edgar Dobriban

原文摘要

Reinforcement learning with verifiable rewards (RLVR) has emerged as a central paradigm for improving the reasoning capabilities of large language models. Group-based policy optimization methods, such as GRPO, typically allocate a fixed number of rollouts to every prompt. This uniform allocation can be inefficient: it over-allocates compute to prompts whose sampled groups are already saturated while under-exploring prompts for which additional samples may reveal useful correct trajectories. To address this limitation, we introduce hit utility, the posterior probability that at least one rollout in a proposed additional allocation for a prompt will be correct. Building on this notion, we propose Hit-Utility Optimal Rollout Allocation (HORA), a learning-free rollout allocation policy that maximizes total posterior hit utility within each allocation batch. HORA adaptively reallocates rollout budgets while leaving the downstream reward evaluation and group-based advantage estimator unchanged. Across two training sets, four mathematical reasoning benchmarks, and three model families at multiple scales, HORA preserves comparable Pass@1 and improves Pass@K over compute-matched GRPO, and it outperforms related allocation baselines at large K. It is also drop-in compatible with other group-based estimators such as RLOO. Ablation studies indicate that the uniform prior used by HORA is competitive with five prompt-conditioned learned-prior alternatives.

cs.LG

版本更新 · v2arXiv:2609.30177

Search-Aware Reinforcement Learning for Multi-Component Query Understanding in Roblox Game Search

Nayoung Choi, Shengjian Chen, Xiaokai Wei, Wenzheng Zhang, Daiyao Yi, Rachit Pareek, Vincent Su, Michelle Gong 等 9 位作者

原文摘要

Query understanding (QU) in production search systems has typically relied on separate models for each subtask, such as search intent classification, attribute extraction, and query rewriting. Large language models (LLMs) now make it possible to consolidate these subtasks into a single model that emits a unified QU output. This consolidation, however, introduces a new optimization challenge. A single model serves multiple components, each with a distinct downstream role within the search pipeline, and the utility of each depends on how the underlying search engine acts on it rather than on agreement with static labels. We present a search-aware reinforcement learning (RL) framework for multi-component QU based on a distill-then-RL paradigm. Teacher-student supervised fine-tuning (SFT) first yields a schema-compliant small policy. The RL stage then starts from this policy, executes each QU plan on the live production search engine, and optimizes every component with a reward tailored to its operational role, rather than relying on a single reward tied to the final search outcome. On a large-scale user-generated game platform, this component-specific optimization raises NDCG@20 by 8.9 points over the SFT policy and by 3.5 points over a single end-to-end reward. The resulting small, low-latency student models also surpass their much larger teacher, and our final model is being incrementally deployed in production.

cs.AI

版本更新 · v2arXiv:2609.01202

Towards AI-Assisted Clinical Trial Matching: Practical Considerations, Multicenter Evaluation, and Real-World Deployment

Yin Fang, Qiao Jin, Shubo Tian, Lauren He, Maya Geer, Noor Naffakh, Ryan Huu-Tuan Nguyen, Zifeng Wang 等 27 位作者

原文摘要

Clinical trials are essential for evidence-based medicine and drug development, but many fail because of insufficient patient enrollment. Although there is growing interest in using AI to support patient recruitment, existing systems largely perform eligibility assessment alone and have rarely been evaluated in real-world workflows. Here we present TrialGPT 2.0, an AI-assisted clinical trial recommendation system improved for responsible real-world deployment. Rather than asking only whether a patient may qualify, the system assesses which trials warrant further consideration given the patient's current clinical needs and local workflow priorities, and provides structured, inspectable explanations for expert review. Importantly, we evaluated TrialGPT 2.0 retrospectively and prospectively across government research, patient-advocacy, academic medical center, and community-based radiation-oncology settings. In retrospective multicenter cohorts comprising 288 cases, TrialGPT 2.0 retrieved at least one clinician-recommended trial in its top 10 recommendations for approximately 91% of cases while reducing clinician screening time by 55.0%. In a six-month prospective evaluation embedded in an active precision oncology tumor board, TrialGPT 2.0 contributed additional trial opportunities missed by the routine workflow, increasing the number of patient cases with at least one final trial recommendation by 90.9%. To support scientific reproducibility, we also developed NIH-TrialBench, a clinician-authored benchmark comprising 126 diverse synthetic patient vignettes and matching scenarios from 11 NIH Institutes and Centers. Together, these findings support the value of AI to assist clinical trial matching by improving clinician efficiency and identifying frequently overlooked trial opportunities, ultimately helping to expand and accelerate accrual to cancer trials.

cs.CL · cs.AI · cs.CY

版本更新 · v3arXiv:2601.02629

Self-Learning Surprise Detection in Spatial Audio for Viewport-Aware 360-Video Streaming

Arman Nik Khah, Ravi Prakash

原文摘要

Adaptive streaming of 360-degree video relies on viewport prediction to allocate bandwidth efficiently. Current approaches predominantly use visual saliency or historical gaze patterns, neglecting the role of spatial audio in guiding user attention. This paper presents a self-learning framework for detecting "surprising" auditory events, moments that deviate from learned temporal expectations, and demonstrates their utility for viewport prediction. The proposed architecture combines SE(3)-equivariant graph neural networks with recurrent temporal modeling, trained via a dual self-supervised objective. A key feature is the natural modeling of temporal attention decay: surprise is high at event onset but diminishes as the listener adapts. Experiments on the AVTrack360 dataset show that integrating audio surprise with visual cues reduces bitrate waste by up to 18% compared to visual-only methods.

cs.MM

版本更新 · v2arXiv:2602.15493

LEADER: Lightweight End-to-End Attention-Gated Dual Encoder-Decoder Network for Robust Minutiae Extraction

Raffaele Cappelli, Matteo Ferrara

原文摘要

This paper introduces LEADER (Lightweight End-to-end Attention-gated Dual Encoder-decodeR), a neural network that maps raw fingerprint images to minutiae descriptors, including location, direction, and type. The proposed architecture integrates non-maximum suppression and angular decoding to enable end-to-end inference using only 0.9M parameters. It employs a novel ``Castle-Moat-Rampart'' ground-truth encoding and a dual encoder-decoder architecture, interconnected through an attention-gating mechanism. Experimental evaluations demonstrate state-of-the-art accuracy on plain fingerprints and robust cross-domain generalization to latent impressions across two benchmark datasets. Specifically, LEADER outperforms top-tier commercial systems, achieving F1-score gains of up to 34% and 39% over the closest competitor on NIST SD27 and SD302, respectively. Qualitative visual analysis suggests that the internal representations learned by the model align with established fingerprint domain concepts, such as segmentation masks, orientation fields, frequency maps, and skeletons. Inference requires only 15ms on GPU (average latency per image at batch size 32) and 322ms on CPU, outperforming leading commercial software in computational efficiency. The source code and pre-trained weights are publicly released to facilitate reproducibility.

cs.CV

版本更新 · v2arXiv:2604.26065

FlowS: One-Step Motion Prediction via Local Transport Conditioning

Leandro Di Bella, Adrian Munteanu, Bruno Cornelis

原文摘要

Generative motion prediction must satisfy three simultaneous requirements for real-world autonomy: high accuracy, diverse multimodal futures, and strictly bounded latency. Diffusion models meet the first two but violate the third, requiring tens to hundreds of denoising steps. We identify a conditioning strategy that resolves this tension: \textit{single-step integration is accurate when the underlying transport problem is local}. A model that must both discover the correct behavioral mode and traverse a long displacement in one step accumulates large discretization errors; conditioning the base distribution to lie near plausible futures reduces the problem to short-range refinement, the regime where a single Euler step suffices. We instantiate this \emph{local transport conditioning} in FlowS, a conditional flow matching framework with two mechanisms. First, an online, scene-conditioned learned prior emits $K$ calibrated anchor trajectories per agent, each already near a plausible future, converting mode discovery into local correction. Second, a step-consistent displacement field enforces semigroup self-consistency, guaranteeing that a single step inherits multi-step accuracy. Crucially, anchoring this field at learned priors along straight-line paths yields a {stable, low-variance} training target, unlike prior self-consistency methods that suffer from {high-variance bootstrap} signals on curved diffusion paths. On the Waymo Open Motion Dataset, FlowS achieves state-of-the-art Soft mAP {(0.4804) and mAP (0.4703) with ensemble at 75\,FPS} with single-step inference, demonstrating that local transport conditioning makes one-step generative motion prediction practical for safety-critical autonomy. Code and pretrained models will be released upon acceptance.

cs.RO

版本更新 · v3arXiv:2509.15691

Fast subdivision of Bézier curves

Paweł Woźny, Filip Chudy

原文摘要

It is well-known that a $d$-dimensional polynomial Bézier curve of degree $n$ can be subdivided into two segments using the famous de Casteljau algorithm in $O(dn^2)$ time. We show that it is possible to do this in $O(dn\log{n})$ time using the fast Fourier transform and its inverse. The direct application of the method is numerically unstable for larger values of $n$. Therefore, we also introduce a modified version based on parameter scaling, which retains the same asymptotic computational complexity. This scaling approach can improve numerical accuracy in some cases (for $n\lesssim 50$), as demonstrated by our experiments. Moreover, the new method has a nice property: if a Bézier curve is extended by an additional control point, the subdivision can be updated in $O(d)$ time. The method can be adapted to subdivide rational Bézier curves and rectangular Bézier surfaces, as well as to compute the derivatives of Bézier curves. Although motivated by applications in CAGD, the proposed methods may also be useful in other areas involving polynomial reparameterization.

cs.GR · math.NA

版本更新 · v3arXiv:2402.19411

PaECTER: Patent-level Representation Learning using Citation-informed Transformers

Mainak Ghosh, Michael E. Rose, Sebastian Erhardt, Erik Buunk, Dietmar Harhoff

原文摘要

PaECTER is an open-source document-level encoder specific for patents. We fine-tune BERT for Patents with examiner-added citation information to generate numerical representations for patent documents. PaECTER performs better in similarity tasks than current state-of-the-art models used in the patent domain. More specifically, our model outperforms the patent specific pre-trained language model (BERT for Patents) and general-purpose text embedding models (e.g., E5, GTE, and BGE) on our patent citation prediction test dataset on different rank evaluation metrics. PaECTER predicts at least one most similar patent at a rank of 1.32 on average when compared against 25 irrelevant patents. Numerical representations generated by PaECTER from patent text can be used for downstream tasks such as classification, tracing knowledge flows, or semantic similarity search. Semantic similarity search is especially relevant in the context of prior art search for both inventors and patent examiners.

cs.IR · cs.CL · cs.LG

版本更新 · v2arXiv:2609.36956

Controlled Decoding Attacks on Black-Box LLMs

Jesson Wang, Shawn Li, Wei Yang, Franck Dernoncourt, Ryan A. Rossi, Charith Peris, Yue Zhao

原文摘要

Manipulating next-token probabilities during generation can bypass the safety alignment of large language models. Existing approaches, however, rely on access to model weights or numerical token probabilities and therefore do not apply to interfaces that return only sampled text. Reconstructing probabilities from sampled outputs offers a possible alternative, but finite sampling produces sparse and noisy estimates, while repeating this process at every generation step incurs substantial query costs. Our empirical observations suggest that large distributional changes along successful jailbreak trajectories are concentrated at a small subset of positions, motivating selective control. We introduce \method{}, a framework for jailbreaking through text-only continuation interfaces that permit repeated sampling and assistant-prefix continuation. Sample-Based Distribution Reconstruction combines sampled outputs with a prior over unobserved actions to obtain a usable control signal. Risk-Gated Residual Control uses the evolving response prefix to decide when to reconstruct and modify the distribution, concentrating sampling costs at selected positions. Speculative Multi-Token Execution further amortizes target calls by verifying and accepting draft prefixes that require no intervention. Across four target endpoints and three benchmarks, \method{} achieves the highest mean score most comparisons against baselines.

cs.CR · cs.AI

版本更新 · v4arXiv:2412.08556

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures

Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan, Nikolaos Melissinos, Michal Opler

原文摘要

Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the makespan of the proposed solution. This is the setting studied in the Multiagent Path Finding problem. In this work, we additionally provide the agents with a way to communicate with each other. Due to size constraints, it is reasonable to assume that the range of communication of each agent will be limited. What should be the trajectories of the agents to, additionally, maintain a backbone of communication? In this work, we study the Multiagent Path Finding with Communication Constraint problem under the parameterized complexity framework. Our main contribution is three exact algorithms that are efficient when considering particular structures for the input network. We provide such algorithms for the case when the communication range and the number of agents (the makespan resp.) are provided in the input and the network has a tree topology, or bounded maximum degree (has a tree-like topology, i.e., bounded treewidth resp.). We complement these results by showing that it is highly unlikely to construct efficient algorithms when considering the number of agents as part of the input, even if the makespan is $3$ and the communication range is $1$.

cs.CC · cs.AI

版本更新 · v2arXiv:2608.03462

When AI Joins the Team! A Model of How AI Adoption Relates To Social Patterns in Software Engineering Teams

Giusy Annunziata, Rudrajit Choudhuri, Anita Sarma, Gemma Catolino, Filomena Ferrucci

原文摘要

Context: The growing adoption of AI-assisted development tools is changing how software teams collaborate, share knowledge, and coordinate, yet its consequences for team social dynamics remain largely unexplored. Gap: It is unclear whether AI adoption is associated with an increase or reduction in community smells,socio-technical anti-patterns reflecting coordination and communication breakdowns,and through which mechanisms. Method: Grounded in Transactive Memory Systems (TMS) theory, we validate instruments for HumanAI and HumanHuman interaction along two TMS dimensions, Specialization and Coordination, and test five PLS-SEM models on survey data from 152 software professionals using AI tools. Community smell constructs were derived from the literature and validated through expert surveys and factor analysis. Results: AI adoption relates to community smells not in a single way, but through mechanisms depending on the work. In specialization work, AI is associated with higher knowledge-sharing peer interaction, which is in turn associated with fewer smells. In coordination work, AI is directly associated with higher communication quality, complementing rather than replacing human interaction. Contributions: We provide an empirically validated, TMS-grounded model showing that the AIcommunity-smell relationship is contingent on the type of collaboration, with a reusable instrument and evidence-based implications for research and practice.

cs.SE · cs.HC

版本更新 · v2arXiv:2610.07083

Graph-Based Recognition of Simulated Train-Driver States From Facial and Upper-Body Keypoints

Olivia Nocentini, Marta Lagomarsino, Gokhan Solak, Younggeol Cho, Qiyi Tong, Sara Zeynalpour, Marta Lorenzini, Alessandro Ledda 等 9 位作者

原文摘要

Driver fatigue poses a significant challenge to railway safety, with traditional systems like the dead-man switch offering limited and basic alertness checks. This study presents a vision-based monitoring system that relies solely on a single front-facing RGB camera and a graph neural network to classify simulated train-driver states into alert, not-alert, and an emergency class comprising acted emergency-like behaviours. To optimize input representations for the model, an ablation study was performed, comparing three feature configurations: skeletal-only, facial-only, and a combination of both. Experimental results show that combining facial and skeletal features yields the highest accuracy (81%) for the three-class model under the light condition, outperforming models that use only facial or skeletal features. Furthermore, the combination of facial and skeletal features achieves 99% accuracy in the alert/not alert classification in light condition. Additionally, we introduced a controlled RGB video dataset containing alert, not alert, and acted emergency-like behaviours recorded under three illumination conditions. These contributions represent a step toward passive and non-contact train-driver state recognition based on facial and upper-body dynamics.

cs.CV · cs.AI

版本更新 · v2arXiv:2609.18635

Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set

Adithya Diddapur

原文摘要

We study the canonical \textsf{Maximum Clique} and \textsf{Maximum Independent Set} problems in the one-pass edge-arrival graph streaming setting. Here, the edges of some input graph $G = (V,E)$ are presented one at a time (possibly including deletions), before an algorithm needs to produce either a large clique or independent set at the end of the stream, with the focus being on space complexity. We are interested in finding $β$-approximate solutions, for any $β\geq 1$. Previous work gave an algorithm using $\tilde{O}\left(n^2/β^2\right)$ bits of space, together with a corresponding $\tildeΩ\left(n^2/β^2\right)$ two-party communication lower bound [Halldórsson et al., ICALP'12], seeming to resolve the problem. However, their algorithm crucially relies on randomness, and the best known deterministic algorithm remains a folklore derandomisation using $O\left(n^2/β\right)$ bits of space, leaving a (deterministic) gap of size $\tilde{O}(β)$. We make progress towards this gap with a strong lower bound for a restricted range of $β$: whenever $β\leq \sqrt{n}/36\log n$, any deterministic algorithm for either problem must use $Ω\left(\frac{n^2}{β\cdot\log n}\right)$ bits of space. Our proof is via a two-party one-way communication lower bound, and highlights the power of randomness when approaching either of these problems.

cs.DS

版本更新 · v3arXiv:2601.01236

The asymptotic size of finite irreducible semigroups of rational matrices

Stefan Kiefer, Andrew Ryzhikov

原文摘要

In this paper we investigate the maximum size of finite semigroups of rational $n \times n$ matrices, with the goal of shedding more light on their structure. Such semigroups provide a rich generalisation of transition monoids of unambiguous (and, in particular, deterministic) finite automata. While in general such semigroups can be arbitrarily large in terms of $n$, a classical result of Schützenberger from 1962 implies an upper bound of $2^{O(n^2 \log n)}$ for irreducible semigroups. A semigroup of rational matrices is called irreducible if the only subspaces of $\mathbb{Q}^n$ that are invariant for all matrices in the semigroup are $\mathbb{Q}^n$ and the subspace consisting only of the zero vector. Irreducible matrix semigroups can be viewed as the building blocks of general matrix semigroups, and as such play an important role in mathematics and computer science. From the point of view of automata theory, they can be seen as a generalisation of strongly connected weighted automata. Using a very different technique from that of Schützenberger, we improve the upper bound on the cardinality to $3^{n^2}$. This is the main result of the paper. The bound is in some sense tight, as we show that there exists, for every $n$, a finite irreducible semigroup with $3^{\lfloor n^2/4 \rfloor}$ rational matrices. Our main result also leads to an improvement of a bound, due to Almeida and Steinberg, on the mortality threshold of finite semigroups of rational matrices. The mortality threshold is a number $\ell$ such that if the zero matrix is in the semigroup, then the zero matrix can be written as a product of at most $\ell$ matrices from any subset that generates the semigroup.

cs.FL · math.GR · math.RA

版本更新 · v2arXiv:2609.30888

Breaking the Infinite Barrier in the $\frac{1}{3}$--$\frac{2}{3}$ Conjecture

Max Aires, Swee Hong Chan, Igor Pak, Greta Panova

原文摘要

The balance constant is a poset parameter measuring how well random linear extensions can be split according to their relative order on two elements. We give an $\varepsilon$-improvement for the balance constant over the bound by Brightwell, Felsner and Trotter (1995), for some small $\varepsilon>0$. This is the first general result towards the $\frac{1}{3}$--$\frac{2}{3}$ conjecture in over 30 years.

math.CO · cs.DM

版本更新 · v2arXiv:2604.15528

Inter-Satellite Link Optimization for Low-Latency Global Networking

Arman Mollakhani, Jerayu Tiamraj, Shu-Jie Cao, Dongning Guo

原文摘要

Large-scale low-Earth-orbit satellite constellations offer a promising platform for global low-latency networking, in part because signals propagate faster in free space than in fiber and copper. In such systems, end-to-end latency is largely determined by the inter-satellite link (ISL) topology. In particular, the network diameter--the longest shortest path, in hops, between any pair of satellites--serves as a key performance metric for time-sensitive applications. Designing diameter-optimal topologies is challenging due to node degree constraints, orbital dynamics, and the combinatorial nature of link selection. This paper proposes a two-stage optimization framework for ISL topology design. First, a continuous relaxation of the link-selection problem is formulated as a convex program that maximizes the algebraic connectivity of the graph Laplacian, serving as a tractable surrogate for diameter minimization. Second, the resulting fractional solution is mapped to a feasible topology via maximum-weight b-matching, a problem solvable in polynomial time. Simulations on Walker-Delta constellations show that the proposed method consistently achieves smaller network diameters than a local-search baseline and standard patterned topologies. For a 1,584-satellite constellation in which each satellite has four ISLs of up to 2,500 km, the diameter is as small as 12 hops, and the maximum propagation delay between any two satellites is about 90 ms. With up- and downlinks adding up to 8 ms, the user-to-user propagation delay is at most about 98 ms, comparable to the delay over a great-circle fiber route between antipodal points on Earth.

cs.NI

版本更新 · v3arXiv:2602.17155

Powering Up Zeroth-Order Training via Subspace Gradient Orthogonalization

Yicheng Lang, Changsheng Wang, Yihua Zhang, Mingyi Hong, Zheng Zhang, Wotao Yin, Sijia Liu

原文摘要

Zeroth-order (ZO) optimization provides a gradient-free alternative to first-order (FO) methods by estimating gradients via finite differences of function evaluations, and has recently emerged as a memory-efficient paradigm for fine-tuning large-scale models by avoiding backpropagation. However, ZO optimization has a fundamental tension between accuracy and query efficiency. In this work, we show that ZO optimization can be substantially improved by unifying two complementary principles: (i) a projection-based subspace view that reduces gradient estimation variance by exploiting the intrinsic low-rank structure of model updates, and (ii) Muon-style spectral optimization that applies gradient orthogonalization to extract informative spectral structure from noisy ZO gradients. These findings form a unified framework of subspace gradient orthogonalization, which we instantiate in a new method, ZO-Muon, admitting a natural interpretation as a low-rank Muon optimizer in the ZO setting. Extensive experiments on large language models (LLMs) and vision transformers (ViTs) demonstrate that ZO-Muon significantly accelerates convergence and achieves a win-win improvement in accuracy and query/runtime efficiency. Notably, compared to the popular MeZO baseline, ZO-Muon requires only 24.7% of the queries to reach the same SST-2 performance for LLM fine-tuning, and improves accuracy by 25.1% on ViT-L fine-tuning on CIFAR-100.

cs.LG