跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 21,490 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
版本更新 · v2arXiv:2609.14735

HELENA for 5G NR LEO NTN Channel Estimation: A Comparative Evaluation

Miguel Camelo Botero, Nina Slamnik-Kriještorac, Johann Marquez-Barja

原文摘要

Deep Learning (DL)-based channel estimation has shown high accuracy and low latency in terrestrial 5G NR, but Low Earth Orbit (LEO) Non-Terrestrial Networks (NTNs) introduce Doppler and synchronization impairments that may require NTN-specific architectures. We investigate whether HELENA, a dual-attention neural channel estimator originally designed for terrestrial channels, remains effective after NTN retraining and suitable across high-performance and power-constrained inference platforms. Its unchanged architecture is trained on paired receiver-compensated and residual-impaired datasets and evaluated alongside terrestrial-origin, NTN-specific, and classical estimators. HELENA's SNR-averaged Normalized Mean Squared Error (NMSE), computed by arithmetic averaging in linear scale, remains within 0.29 and 0.72 dB of the most accurate learned estimator, AttRNet, in the two conditions, respectively. It outperforms global Linear Minimum Mean Squared Error (LMMSE) under compensation and all evaluated LMMSE variants under residual impairments, although profile-aware filtering achieves lower error under compensation. On an RTX PRO 4500, FP16 TensorRT inference reaches 0.0573 ms 99th-Percentile (P99) latency, below the adopted 0.5 ms estimator budget. On a 10 W Jetson Orin NX, HELENA consumes 66.0% less energy per sample than AttRNet, but its 0.9620 ms P99 exceeds the budget; only the less accurate LSiDNN-48 meets it. Thus, HELENA remains effective without NTN-specific redesign for the evaluated task, while accurate embedded inference remains a latency challenge.

eess.SP · cs.LG · cs.NI · cs.PF

版本更新 · v2arXiv:2611.16726

From Data to Wisdom: Rethinking AI Through an Epistemic Lens

Afonso Eduardo

原文摘要

This paper proposes the Data-to-Wisdom Epistemic Architecture for AI (EAAI), a conceptual framework treating Data, Information, Knowledge, Understanding and Wisdom as five distinct but recursively interacting epistemic functions: observation, contextual interpretation, modeling and prediction, critical evaluation and informed judgment. Two observations motivate it: sequential readings of the Knowledge Pyramid obscure how these functions interact, and a targeted review of twelve Bayesian reference books finds that prior distributions are defined mathematically while "prior information" and "prior knowledge" are not consistently distinguished as epistemic categories. A Bayesian interpretation relates the likelihood, prior and posterior distributions, posterior prediction, model checking and decision analysis to the five functions, without limiting EAAI to Bayesian systems. Extending "prior" in an epistemic sense, the paper distinguishes five kinds of prior context that can shape the model, the likelihood, the prior, evaluation and action. Three worked applications -- quantitative financial risk, actuarial modeling in health insurance and agentic AI for medical reimbursement claims -- show how EAAI structures the analysis of model assumptions, evidence interpretation, validation, dependencies and decision consequences, separating the prediction of a risk, the appraisal of its reliability and the justification of action. It draws implications for AI and machine learning, including evaluation by function, treating intermediate model outputs as evidence open to challenge and separating generation from appraisal, and compares EAAI with work on DIKW, Bayesian workflow, AI evaluation and risk governance. Its contributions are an epistemic vocabulary with recursive relationships, a more accessible reading of Bayesian methodology, a typology of prior context and clearer methodological terminology

cs.LG · cs.AI

新论文 · v1arXiv:2611.20246

TileCache: Serving Multi-Round Diffusion Image Editing with Compressed Activation Caches

Yuyang Tian, Desen Sun, Shuncheng Jie, Lishan Yang, Sihang Liu

原文摘要

Multi-round diffusion image editing can reduce computation by reusing intermediate activations, but retaining these activations across editing rounds introduces substantial memory and bandwidth overheads. Compression can reduce these overheads, but efficient cache construction is challenging: compressing only after editing requires buffering over 100 GB of activations per request. Moreover, the compressed cache must support selective reuse, as future masked edits require only a subset of the cached activations. It also exposes a scheduling challenge, as cached edits are faster than initial generations, causing naive policies to severely delay either initial generations or editing requests. In this paper, we aim to address both challenges through compression-informed serving. We develop TileCache, a serving system for multi-round diffusion editing. It compresses reusable activations and incorporates a scheduler that balances both edits and initial generation requests. Compared with the state-of-the-art image editing baseline, TileCache sustains over 2x the request arrival rate at 90% SLO attainment. It completes edits 2.4-4.5x and initial generations 1.3-2.2x faster than the baseline, while preserving image quality.

cs.DC · cs.LG

新论文 · v1arXiv:2611.20245

From XR Sketches to CAD: Preserving Design Intent with AI

Trudi Di Qi

原文摘要

Extended reality (XR) allows designers to sketch shapes directly in 3D, but converting these sketches into editable, feature-based CAD requires interpreting their intent. A sketch may contain drawing errors, intended features, and design choices that remain open. Correcting every irregularity risks erasing intended features, while automatic completion may impose choices the designer has not made. We argue that AI should add precision without overriding design intent, considering both the resulting shape and how the CAD model behaves during later edits. To guide this process, we propose a conceptual framework that distinguishes errors from intentions in individual sketch properties and relates them to correction, preservation, and exploration in editable CAD. We also outline five research directions for sketch interpretation, CAD construction, and evaluation, with testable hypotheses for selected questions.

cs.HC · cs.GR

版本更新 · v2arXiv:2611.05381

Discourse Analysis of Legislative Bill Discussions

Isaac Rudnick, Nipun Das, Foaad Khosmood

原文摘要

Legislative hearings are distinct communication events with their own human recognizable structure and logic, yet they have been analyzed as distinct phenomena beyond their transcripts. Understanding legislative hearings at a deeper level is a major step in analyzing the work and power relationships within democratic bodies. In this work, we present a novel end-to-end pipeline for parsing rhetorical structures from legislative committee hearings with the goal of improving legislative discourse analysis and democratic accountability. We also propose a rhetorical structure grammar and find that 74.71% of California state bill discussions in our dataset can be parsed with this grammar. We evaluate our pipeline with two utterance section classifiers on a random subset of over 2619 annotated utterances corresponding to 100 hearings. We find that a logistic regression-based classifier with grammar-based output masking and utterance tag smoothing outperforms more complex models, achieving an F1 score of 59.0% against our ground truth discourse section labels.

cs.CL

新论文 · v1arXiv:2611.20244

Right Goal, Wrong Body: Re-grounding Frozen VLAs under Actuation Shift

Umer Siddique, Peilang Li, Yongcan Cao

原文摘要

Vision-language-action (VLA) models are capable of producing desired robotic behaviors in ideal settings. However, they often fail when the robot's actuation changes at deployment. For example, remounting, mechanical wear, or command latency changes can lead to failed tasks and unsafe behaviors. To address the inevitable actuation shift, we propose ReGround, an inference-time method that keeps the VLA frozen and re-grounds its intended motion. ReGround learns the deployed robot's dynamics from task-agnostic motor babbling, and then tracks the policy's intended motion while staying close to the policy's own plan. ReGround activates only upon detecting a shift, and needs no rewards, demonstrations, or retraining. We show via two VLAs, eight LIBERO tasks, and five shift settings that ReGround can restore near-oracle success, such as raising $π_{0.5}$'s success from 0.16 to 0.90 under 400 ms latency, while remaining safer than a linear-calibration baseline. Project website and open-source code: https://umersiddique94.github.io/ReGround/.

cs.RO · cs.AI · cs.LG

新论文 · v1arXiv:2611.20243

Achievable Information Rate for FTN under a Reduced Complexity BCJR Receiver

Zichao Zhang, Gokhan M. Guvensen, Melda Yuksel, Halim Yanikomeroglu

原文摘要

The capacity of faster-than-Nyquist (FTN) signaling in additive white Gaussian noise (AWGN) channels has been established and is achieved by Gaussian inputs. However, the capacity of FTN signaling with finite-constellations is not yet fully characterized. The achievable information rate (AIR) provides a lower bound on this constrained capacity by quantifying the rate supported by a specified input distribution and receiver. This paper investigates the AIR of FTN signaling with finite constellations using full-state and reduced-state Bahl-Cocke-Jelinek-Raviv (BCJR) receivers, with bidirectional decision feedback incorporated into the reduced-state receiver. Especially, the detection problem is formulated in a reproducing kernel Hilbert space (RKHS), where a geometric foundation is established to understand FTN under severe time packing. The formulation establishes that the Ungerboeck metric remains valid even when the noise covariance is singular. We further characterize detection errors geometrically using RKHS distances between competing sequences. We also study outage probability for reduced-state detection, which occurs when AIR is zero, in addition to deriving the zero-AIR outage criterion for reduced-state detection. Unlike ISI-free Nyquist signaling, reduced-state FTN detection can retain residual ISI that causes the receiver to assign excessive confidence to incorrect symbols, leading to outage even at high signal-to-noise ratio (SNR). Our results confirm both the spectral efficiency gains and the feasibility of FTN systems employing finite constellations and realistic receiver architectures.

cs.IT · eess.SP

新论文 · v1arXiv:2611.20241

EvoMem3D: Adaptive-Depth Temporal Representation Memory for Multi-Camera 3D Detection

Moshe Kimhi, Idan Kligvasser, Yotam Intrator, Regev Cohen, Ehud Rivlin

原文摘要

Modern multi-camera 3D detectors increasingly rely on large Vision Transformer (ViT) image encoders, making repeated full-depth encoding a dominant inference cost even though adjacent driving frames are highly redundant. We present EvoMem3D, an adaptive-depth temporal framework that caches the most recent full-depth detector-interface appearance representation as a read-only anchor and combines it with policy-selected partial features from the current frame. A lightweight pre-encoding controller chooses among semantic encoder exits before image processing, allocating shallow computation to stable frames and deeper computation when the visual state changes. To reuse appearance without carrying stale geometry, we decouple temporal appearance from geometric alignment: current-frame calibration defines the decoder geometry at every timestamp, while a motion-conditioned positional adapter accounts for anchor-to-current ego motion. On nuScenes, EvoMem3D achieves 61.50 NDS and 52.76 mAP while reducing end-to-end latency from 364.4 to 168.7 ms (x2.16) relative to standard dense DETR3D. With StreamPETR, it reaches 61.36 NDS and 52.55 mAP at a x1.92 speedup. Controlled studies isolate the effects of current evidence, temporal reuse, memory correction, and adaptive routing, while our audit confirms that the policy learns to distinguish semantic driving regimes.

cs.CV

版本更新 · v2arXiv:2610.19608

Forecasting Brand Mentions in LLM Answers: Frozen Predictions Evaluated from Hours to Weeks

Dmitrij Żatuchin

原文摘要

Companies and agencies now monitor which brands large language models (LLMs) name when buyers ask for recommendations. Answers vary between runs, so a single check can mislead and repeated checks cost money. We extend an earlier 20-day replication to ask how well past brand mentions predict later ones over seven weeks. We froze probabilistic forecasts before each of four prospective collection waves of Gemini 3.1 Pro answers to the same 54 buyer questions: nine question families in English, Estonian and Finnish, each for two markets, with four of 12 tracked brands per question. The waves were collected between 1.5 hours and 52 days after the history used by the earliest forecast, and each scored 648 brand and answer labels from 162 answers. A smoothed per-question history achieved a Brier score of 0.0599 at 1.5 hours, against 0.1131 for a per-brand rate and 0.25 for a constant 0.5. A pooled rate clipped to 0.05--0.95, named as the challenger before its first test, scored 0.0259 after 8 hours, 0.0269 after 30 days and 0.0328 after 52 days. Of the brand and question cells named in all or none of the earlier answers, 94.5% to 97.5% kept that pattern in each later wave, and none switched from always to never or back. With a search instruction, 100 of 162 answers returned search activity, compared with 1 of 540 earlier Pro answers; mentions stayed predictable (Brier 0.0563), and Pro history predicted a smaller model's answers less well (0.0787). Human coding agreed with 298/300 sampled automatic labels; two coders agreed on 99/100 shared items (kappa = 0.98). The results cover one provider family, a fixed candidate set and lexical mentions. They support per-question history as the baseline that any forecasting or monitoring method for LLM brand mentions should beat.

cs.IR · cs.CL

版本更新 · v2arXiv:2603.04614

SGR3 Model: Scene Graph Retrieval-Reasoning Model in 3D

Zirui Wang, Ruiping Liu, Yufan Chen, Junwei Zheng, Weijia Fan, Kunyu Peng, Di Wen, Jiale Wei 等 10 位作者

原文摘要

3D scene graphs provide a structured representation of object entities and their relationships, enabling high-level interpretation and reasoning for robots while remaining intuitively understandable to humans. Existing approaches for 3D scene graph generation typically combine scene reconstruction with graph neural networks (GNNs). However, such pipelines require multi-modal data that may not always be available, and their reliance on heuristic graph construction can constrain the prediction of relationship triplets. In this work, we introduce a Scene Graph Retrieval-Reasoning Model in 3D (SGR3 Model), a training-free framework that leverages multi-modal large language models (MLLMs) with retrieval-augmented generation (RAG) for semantic scene graph generation. SGR3 Model bypasses the need for explicit 3D reconstruction. Instead, it enhances relational reasoning by incorporating semantically aligned scene graphs retrieved via a ColPali-style cross-modal framework. To improve retrieval robustness, we further introduce a weighted patch-level similarity selection mechanism that mitigates the negative impact of blurry or semantically uninformative regions. Experiments demonstrate that SGR3 Model achieves competitive performance compared to training-free baselines and on par with GNN-based expert models. Moreover, an ablation study on the retrieval module and knowledge base scale reveals that retrieved external information is explicitly integrated into the token generation process, rather than being implicitly internalized through abstraction.

cs.CV

版本更新 · v2arXiv:2611.17141

ISLA: A Coordinate-Free, Measure-Weighted Transformer for Boundary-Driven PDEs

Peter Sharpe

原文摘要

Symmetry is a foundational principle of physics: the behavior of a PDE-governed system does not depend on the coordinate frame, unit system, or mesh used to write it down, and neither should a surrogate model. Yet today's leading neural surrogates lack these invariances and fail under simple transformations of the same problem: for models trained on PDEs of cars in one pose (i.e., translation and rotation), rotating the full PDE raises the surface-pressure error from 4% to more than 100%, and re-sampling its boundary raises it to about 30%. We introduce ISLA (Invariant Slice Attention), a slice-attention transformer for steady, boundary-driven PDEs. Because the boundary determines the interior solution, ISLA encodes the posed boundary once into learned slices and evaluates arbitrary interior points independently through a tree-accelerated learned boundary kernel. Inputs are nondimensionalized in scales computed from the boundary, sums over boundary cells are area-weighted quadratures that converge under mesh refinement, and geometry enters only as distances and relative angles to equivariant slice anchors, making the model equivariant to rigid motions and reflections up to optional token subsampling and tree clustering. On AeroZoo, 2,816 3D flows spanning diverse geometries, poses, physical scales, and boundary conditions, ISLA's mean reference-scaled velocity and pressure errors are at least 1.9 and 2.2 times lower than any baseline's. On full AirfRANS, ISLA is second only to an explicit boundary-integral network (GLOBE), with errors at least 1.6 times lower than Transolver's and GeoTransolver's in every field.

cs.LG · cs.CE · math-ph · physics.flu-dyn

版本更新 · v2arXiv:2611.08804

Generative Search and Recommendation at Shopify

Juhana Kangaspunta, Khalil Hajji, Darshan Fofadiya, Kyumin Park, Michael Garner, Anthony Maltsev, Ryan Synk, Jose Sepulveda 等 11 位作者

原文摘要

Search and recommendation at Shopify require retrieving relevant products from a changing catalog of billions of products under strict latency constraints. We present SID-LLM, which casts both tasks as generating semantic IDs: short sequences of content-derived tokens representing products. We jointly pre-train SID-LLM on catalog and behavioral data, giving search and recommendation a shared representation and training objective. We show that reinforcement learning further improves judged search relevance. Furthermore, distillation from task-specific experts improves recommendation quality over joint supervised fine-tuning without a statistically detected loss in search quality. Finally, for efficient serving, we pair multi-token prediction with a lightweight ranker, improving retrieval quality over our autoregressive baseline while reducing latency. We evaluate SID-LLM both as a standalone retriever and as a component of Shopify's production search and recommendation systems. As a standalone search system, SID-LLM achieves quality comparable to Shopify's existing multi-model search stack while meeting production latency requirements. Integrating SID-LLM into the search and recommendation stacks provides significant gains in both offline evaluations and online A/B tests. Together, these results demonstrate the practical value of semantic-ID generation as a unified approach to product discovery at scale.

cs.IR

版本更新 · v3arXiv:2505.09706

Forests for Differences: Beyond Parametric Difference-in-Differences

Hugo Gobato Souto, Francisco Louzada Neto

原文摘要

This paper introduces the Difference-in-Differences Bayesian Causal Forest (DiD-BCF), a novel non-parametric model addressing key challenges in DiD estimation, such as staggered adoption and heterogeneous treatment effects. DiD-BCF provides a unified framework for estimating Average (ATE), Group-Average (GATE), and Conditional Average Treatment Effects (CATE). By structuring separate regression forests for cohort-specific levels, common untreated trends and treatment effects, the model directly embeds conditional parallel trends and no-anticipation restrictions into Bayesian nonparametrics. We establish non-parametric identification and integrated treatment effect consistency of the exact treatment effect posterior distribution. Extensive simulations demonstrate DiD-BCF's superior performance over established benchmarks, particularly under non-linearity, selection biases, and effect heterogeneity. Applied to U.S. minimum wage policy, the model uncovers significant conditional treatment effect heterogeneity related to county population, insights obscured by traditional methods. DiD-BCF offers a robust and versatile tool for more nuanced causal inference in modern DiD applications.

stat.ME · cs.LG · stat.ML

新论文 · v1arXiv:2611.20234

Impatience Makes Matching NP-Hard

Chen Yan, Sushil Mahavir Varma

原文摘要

Motivated by emerging applications such as online marketplaces and quantum switches, we study a dynamic bipartite matching model with impatient agents, where the two sides represent customers and suppliers. Agents of each type arrive according to an independent Poisson process, and the platform decides which pairs of agents to match. The agents are possibly impatient and may leave the system if not matched before their patience expires. The platform aims to maximize throughput, i.e., the number of matches per unit time. In this paper, we reveal an interesting phase transition in the computational hardness of throughput maximization. In particular, we show that approximating the optimal long-run throughput within a sufficiently small fixed relative error is NP-hard, even when all agents have rate-one exponential patience. This result implies a computational barrier to constructing near-optimal, efficiently executable matching policies that induce a matching process with fast mixing. On the other hand, when all agents on at least one side have infinite patience, we provide a simple polynomial-time algorithm that maximizes the throughput.

cs.CC · cs.DS

版本更新 · v2arXiv:2610.23032

On the Metric Distortion of the Minimum Spanning Tree Problem

Kian Ghassemi, Masoud Seddighin, Saeed Seddighin

原文摘要

We study the metric distortion of the minimum spanning tree (MST) problem when numerical edge weights are unavailable and each vertex reports only a ranking of the other vertices induced by these weights. We first show, through a simple example, that without assumptions on the weights, no ordinal algorithm guarantees a finite approximation ratio. We therefore focus on general metrics and present a Borůvka-inspired algorithm using only ordinal comparisons that achieves distortion $O(\log n)$. We complement this result by showing that, for every $\varepsilon>0$, no deterministic ordinal algorithm guarantees distortion at most $3/2-\varepsilon$ on all finite metric instances. We then investigate more informative settings in pursuit of constant distortion, first considering two well-studied metric classes. For tree metrics realized on the given vertex set, a more careful variant of our initial algorithm achieves distortion 1, recovering an optimal MST from ordinal information alone. For the broad class of doubling metrics, a different algorithm based on endpoint cut stability achieves distortion $2^{O(D)}$, where $D$ is the doubling dimension; this is constant for fixed $D$, independently of $n$. Finally, we study a query-based extension allowing comparisons between two edge lengths without revealing their numerical values. For general metrics with $n\geq2$, fewer than $n$ edge-comparison queries suffice to achieve distortion at most $2\log_2^* n-1$, which is near-constant even for very large inputs.

cs.DS

版本更新 · v4arXiv:2608.23986

The Shadow Price of Intelligence: Quality Degradation and Retry Feedback in LLM Inference

Elioth Sanabria

原文摘要

Large language model providers are compute constrained, and a common response to congestion is to degrade service: route queries to smaller models, cut reasoning budgets, or shorten context windows. A user who receives an unsatisfactory answer either retries, adding load while the system is busy, or abandons, possibly as churn. We model inference serving as a control problem in which service quality is the provider's decision. A two-regime fluid approximation with retries folded into the service rate gives closed-form trajectories and crossing times, so the dynamic program over quality tiers needs no simulation. We characterize a region in which a weaker tier uses less energy per task but more capacity per task, and show that in the fluid model reactive throttling to such a tier can keep the queue from draining. With heterogeneous customers the problem is a transportation problem with retry-inflated capacity coefficients; optimal routing follows a $cμ$-type index, and the dual of the capacity constraint gives the marginal cost of one more query by class and time. We illustrate the method on five instances calibrated to public benchmark data.

math.OC · cs.AI · cs.PF

版本更新 · v2arXiv:2605.17093

HEED: Density-Weighted Residual Alignment for Hybrid Vision-Language Model Distillation

Yihao Liang, Niraj K. Jha

原文摘要

Distilling vision-language models into faster hybrid architectures, such as 3:1 Mamba-2/attention mixes, is now standard practice for making inference efficient. Aggregate benchmarks suggest that this works but they hide selective failures. When we distill Qwen3-VL-8B-Instruct into a 3:1 Mamba-2/attention hybrid, student model stays within 2 points of the teacher across visual reasoning benchmarks like MMStar, MMBench, and MMMU-Pro, while dropping 13 points on optical-character-recognition and document tasks. The student can still understand the scene but loses the fine-grained text needed to answer. We localize much of the failure to a specific kind of position. In a high-resolution image, most patches are sky, wall, or smooth texture, while a small fraction carries text, edges, object boundaries, or other local details. In a token-level diagnostic, the top 10% highest-density patches have 3.6x larger residual drift than the bottom 10% lowest-density patches and 3.5x larger teacher-masking answer contribution. Uniform weighting devotes many loss terms to low-information background patches, whereas sparse answer bearing patches receive no special protection. The required intervention is minimal: we replace uniform residual alignment with density-weighted residual alignment, using patch self-dissimilarity as a training-free proxy for position importance. We call this HEED. Compared with normal end-to-end distillation, HEED increases performance by 8.7 points on OCRBench v2 and 5.13 points on a 10-benchmark average. The gain is realized on different teacher models. After standard post-training, the student reaches teacher-level performance on the 10-benchmark average. HEED adds no parameters and no inference-time cost. Hence, the student maintains the hybrid architecture's 4.12x throughput and 68% memory saving at 128k context. Code is available at https://github.com/jha-lab/HEED.

cs.CV · cs.CL

新论文 · v1arXiv:2611.20227

Learning From the Best: What Makes Popular Hugging Face Models?

Yinan Wu, Zhou Yang, Bowen Xu, Bo Wang, Bach Le, David Lo

原文摘要

Hugging Face has become a central platform for sharing and reusing pre-trained models, yet it remains unclear which practices are associated with higher visibility and adoption. Prior studies describe model reuse and model-card quality but do not systematically compare popular and unpopular models across documentation, repository structure, platform metadata, and technical metadata. We studied 66,909 Hugging Face models collected on 2026-02-28 and extracted 31 features across four dimensions: Documentation, Models, Platforms, and Techniques. For downloads and likes, we compared the top 10% popular models with the bottom 80% using statistical tests and effect sizes, trained five classifiers to predict popularity, ranked feature importance with the best-performing model, and tested whether predictions held across model domains and contributor affiliations. Popular models consistently had longer model cards, more code examples, and more GitHub and arXiv links, while quantized models showed contrasting patterns under downloads and likes. A Random Forest reached AUC 0.861 for downloads and 0.848 for likes, with root-level file counts and model size also among the most important features. Cross-group transfer stayed mostly above random but dropped by 0.12-0.17 AUC on average, showing that prediction performance was partly group-specific. The findings remained stable after removing download outliers and under alternative popularity thresholds, and a manual review of popular model cards linked the key documentation features to concrete content. We derive recommendations for model practitioners and directions for future research on model-sharing platforms.

cs.SE

新论文 · v1arXiv:2611.20226

Streaming across viewing conditions - The effect of viewing distance and display luminance on video quality

Dounia Hammou, Lukáš Krasula, Christos G. Bampis, Zhi Li, Rafał K. Mantiuk

原文摘要

The visibility of streamed video distortions is affected by the user's display and viewing conditions, such as their display's luminance or the viewing distance. Distortions become less visible at lower luminance levels or farther viewing distances. However, most image and video quality metrics assume fixed optimal display and viewing conditions, making them insensitive to the viewing conditions. In this work, we demonstrate how existing metrics can be adapted to account for both factors and compare such an adaptation with the metrics that natively model viewing conditions. First, we collected a new video quality dataset, HDR-VDC, which contains streaming distortions in 4K HDR videos. The dataset consists of 12 4K and 4 FHD HDR source video content, each distorted with AV1 encoding and Lanczos upscaling from a lower resolution. The quality loss due to the distortions was measured at two viewing distances, corresponding to 60 and 120 pixels per visual degree, and two display mean luminance levels, varying by a factor of 8 in terms of luminance. Next, we developed a pre-processing framework that lets us adapt many quality metrics so that they can evaluate content across the viewing distances and luminance levels. The framework employs a display model and perceptually uniform encoding, PU21, to account for the effect of display luminance, and perspective projection scaling (PPS) to account for the effect of viewing distance. We used the framework to compare the performance of 35 state-of-the-art metrics. This allowed us to identify a selection of existing quality metrics that can be effectively adapted to account for the viewing conditions.

eess.IV · cs.CV · cs.MM

新论文 · v1arXiv:2611.20225

Disparity in Influence: A Fairness Evaluation of Centrality Measures in Complex Networks

Kirtidev Mohapatra, Harsh Vardhan Singh, Rishi Ranjan Singh, Akrati Saxena

原文摘要

Social networks are shaped by homophily-driven connections, which naturally lead to the emergence of communities with uneven sizes and influence. Such structural imbalances impact the fairness of network analysis tools, particularly centrality measures that are widely used to identify influential nodes for tasks like information diffusion and network robustness. In this work, we conduct a comprehensive assessment of fairness in centrality measures, using influence spreading across networks with heterogeneous community structures. We first analytically show that disparity is bounded by outreach; cross-community outreach is bounded by the inter-community cut; and when all seeds lie in one community, disparity approaches the normalized outreach within that community as cross-community transmission vanishes. This explains why attenuation concentrates influence in the community where diffusion starts. We further evaluate a broad spectrum of centrality measures, including local, semi-local, global, and community-aware measures, on both synthetic network generative models and real-world datasets, using the Independent Cascade and Linear Threshold Models. The results consistently show that influence tends to concentrate within larger communities, with disparities becoming more pronounced under constrained or deterministic diffusion settings. We further observe that fairness is highly sensitive to the choice of centrality measure rather than its general category. In particular, fairness-aware adaptations of PageRank demonstrate a strong balance between maximizing influence reach and maintaining equitable distribution across communities. On real networks, these conclusions are largely stable under random removal or addition of up to 3% of the edges. Our findings highlight the need to explicitly account for fairness when designing and selecting centrality-based strategies in networked systems.

cs.SI

版本更新 · v2arXiv:2606.05015

Flying on Imagination: DreamerV3-Style World Models under Environment Distribution Shift for Quadrotor Navigation

Luca Zanatta, Grzegorz Malczyk, Kostas Alexis

原文摘要

DreamerV3-style reconstructive world models offer a route to vision-based navigation for aerial robots through learned latent dynamics. Yet their behavior under shifts in the training environment and their ability to support navigation using imagined observations, predictions generated by rolling the latent dynamics forward without new sensory input, remain insufficiently characterized. We study four training-environment regimes for depth-based quadrotor navigation, spanning a fixed layout, a finite set of layouts, low-discrepancy continuous obstacle sampling, and i.i.d. uniform sampling. We cross-evaluate reconstruction before and after Reinforcement Learning fine-tuning, separately evaluate the resulting policies in simulation, and transfer them to a real quadrotor without real-world fine-tuning. We demonstrate onboard flight driven by imagined state and depth: a 24.7m mission in which 66% of flight time and 76% of traveled distance occur during repeated 5s sensor-free imagination windows, with prediction quality degrading over each open-loop interval and recovering after sensory re-grounding. Additionally, in closed-loop hardware transfer, all policies succeed in a setting close to the simulated geometry, whereas the policy trained from a single fixed layout fails under a corridor-topology and obstacle-type shift, while the other three succeed.

cs.RO

版本更新 · v2arXiv:2601.02236

CD4LM: Consistency Distillation and aDaptive Decoding for Diffusion Language Models

Yihao Liang, Ze Wang, Ximeng Sun, Jiang Liu, Jialian Wu, Hao Chen, Xiaodong Yu, Emad Barsoum 等 10 位作者

原文摘要

Diffusion language models (DLMs) accelerate generation by decoding multiple tokens in parallel, but pushing them to fast decoding often sacrifices accuracy. We attribute this to a static-to-dynamic mismatch: training optimizes local denoising under fixed schedules, while fast inference skips steps and encounters irregular mask patterns. Existing accelerators largely address only one side of this problem. Training-free inference methods speed up decoding without changing the model, leaving the mismatch unresolved; training-side distillation methods adapt the model, but often tie the student to a specific decoding trajectory, limiting composability and still suffering accuracy loss. We propose CD4LM, a composable framework for accurate DLM acceleration. Its core training component, Discrete-Space Consistency Distillation (DSCD) trains a trajectory-invariant student on diverse masked states, reducing the mismatch without fixing a decoding policy. We pair DSCD with a lightweight ConfidenceAdaptive Decoder, while keeping the trained student compatible with external inference-side accelerators. On GSM8K, CD4LM preserves accuracy while achieving a 5.18x speedup; stacking CD4LM with per-step cache accelerators further pushes speedup to 9.73x at teacher-level accuracy, suggesting a scalable path for combining training-side robustness with future decoding advances. Code is available at https://github.com/yihao-liang/CDLM.

cs.CL

新论文 · v1arXiv:2611.20223

Understanding Users' Security, Privacy, and Trust Concerns in Healthcare AI Systems

Tushar Nayan, Mohammed Al Duniawi, Song Fang, Aokun Chen, Arjun Arunasalam, Ruimin Sun

原文摘要

Artificial intelligence is increasingly integrated into healthcare systems, from clinical information retrieval to workflow automation and decision support, which introduces new security, privacy, and trust risks with direct implications for patient care. While prior work has examined these risks from technical and regulatory perspectives, less is known about how these risks are naturally discussed in online communities. To address this gap, we conduct a large-scale analysis of 14 medical communities on Reddit and extract 6,514 relevant posts. Through systematic qualitative coding and LLM-assisted classification, we investigate concerns expressed in healthcare AI discussions, their prevalence, and how they evolve over time. Our analysis reveals that users perceive healthcare AI as expanding traditional healthcare trust boundaries and attack surfaces through integrations with electronic health records, third-party services, cloud platforms, and automated clinical workflows. Posts express concerns about over-privileged access to sensitive records, opaque data flows, unauthorized secondary use, and unsafe automation can amplify the consequences of errors and misuse. We identify four attitudes toward these risks: exploring questions of accountability and harm, cautiously accepting AI with stronger safeguards, skepticism about system trustworthiness, and resignation to growing data exposure and automation. Longitudinal analysis shows that SP&T discussions have increased significantly, with shifts coinciding with major healthcare AI deployments, privacy incidents, and regulatory developments. These findings illuminate changing trust relationships and data-governance challenges, informing the design and governance of safer, more transparent, and accountable healthcare AI systems.

cs.CR · cs.CY

新论文 · v1arXiv:2611.20221

Lengths and Counting of Palindromic Prefixes of Standard Sturmian Words

Jasem Hamoud

原文摘要

Every standard Sturmian word $c_\mathbf{d}$ is determined by a directive sequence $\mathbf{d}=(d_i)_{i\ge 1}$ of positive integers, and its palindromic prefixes are obtained by iterated palindromic closure. We describe the lengths of these prefixes by the numbers $j\,\ell_{i-1}+\ell_{i-2}-2$, where $\ell_n$ is the length of the $n$-th standard word and $1\le j\le d_i$, and we show that each nonzero length is attained by exactly one pair $(i,j)\neq(1,1)$. For a purely periodic directive sequence of period $k$ we then prove that the number $π_\mathbf{d}(N)$ of nonempty palindromic prefixes of length at most $N$ satisfies \[ π_\mathbf{d}(N)\sim\frac{d_1+\cdots+d_k}{\logλ_\mathbf{d}}\,\log N, \] where $λ_\mathbf{d}$ is the largest eigenvalue of the matrix $M(d_1)\cdots M(d_k)$. For the Fibonacci word this gives $π_\mathbf{d}(N)\sim\log N/\log\varphi$, where $\varphi=(1+\sqrt5)/2$.

math.CO · cs.FL

版本更新 · v3arXiv:2405.01517

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries

Aditya Bhaskara, Eric Evert, Anxin Guo, Tanmay Sinha, Vaidehi Srinivas, Aravindan Vijayaraghavan

原文摘要

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This setting captures a core technical challenge for obtaining smoothed analysis guarantees in many algorithmic settings. Least singular value bounds often involve showing strong anti-concentration inequalities that are intricate and much less understood compared to concentration (or large deviation) bounds. First, we introduce a general technique involving a hierarchical $ε$-nets to prove least singular value bounds. Our second tool is a new statement about least singular values to reason about higher-order lifts of smoothed matrices, and the action of linear operators on them. Apart from getting simpler proofs of existing smoothed analysis results, we use these tools to now handle more general families of random matrices. This allows us to produce smoothed analysis guarantees in several previously open settings. These include new smoothed analysis guarantees for subspace clustering and certifying robust entanglement of subspaces, where prior work could only establish least singular value bounds for fully random instances or only show non-robust genericity guarantees.

cs.DS

新论文 · v1arXiv:2611.20216

FIDEL: Abugida-Aware Pre-tokenization for Ethiopic Languages

Gebreslassie Teklu Reda, Yuval Pinter

原文摘要

Subword tokenizers assume that meaningful linguistic units can be recovered by splitting text at learned boundaries, an assumption better suited to concatenative morphology than to Semitic root-and-pattern systems. The challenge is acute for the Ethiopic languages, whose abugida script encodes consonant-vowel units as single characters and hides consonantal structure. We introduce FIDEL (FIdäl DEcomposition and Linearization), a family of reversible abugida-aware pre-tokenization schemes that expose consonant and vowel-order structure, extend SPLINTER reductions from abjad scripts to the Ethiopic abugida, and evaluate them on three Ethiopic languages under controlled conditions, holding corpus, architecture, budget and protocol fixed so that tokenization is the only variable. We report intrinsic tokenizer statistics for BPE and UnigramLM across vocabulary sizes alongside downstream NLP tasks, including transfer scenarios. We find that FIDEL reduction improves news classification consistently and named-entity recognition at larger capacity, while sentiment analysis performance declines under the more aggressive schemes, and extractive question answering performance is preserved.

cs.CL

版本更新 · v2arXiv:2604.15559

Subliminal Transfer of Unsafe Behaviors in AI Agent Distillation

Jacob Dang, Brian Y. Xie, Omar G. Younis

原文摘要

Recent work on subliminal learning has shown that language models can transmit semantic traits through data with no apparent connection to those traits. Whether this phenomenon extends to agentic systems, where policies are learned from trajectories rather than static text, remains an open question with critical safety implications. We present the first empirical evidence that unsafe agent behaviors transfer subliminally through model distillation, demonstrated across several settings. In the primary setting, we construct a teacher agent with a deletion bias, a tendency to perform destructive file-system actions through an API-style tool interface, and distill it into a student using only trajectories from ostensibly safe tasks, with all explicit deletion keywords filtered. In the secondary setting, we replicate the threat model with shell commands, replacing API calls with shell commands and operationalizing the bias as a preference for chmod over semantically equivalent alternatives (e.g., chown, setfacl) when issuing the first permission-related command. Despite sanitation, students inherit measurable biases. Over 1,500 trials per configuration, the API student chooses a destructive action first on 35.5% of ambiguous tasks (vs. 1.2% baseline), and the Bash student's chmod-first rate reaches 30-55% (vs. 0-10% baseline). In a multi-turn environment where tool calls execute, 33.9% of student episodes end with a resource irreversibly destroyed (vs. 6.4% baseline). On TerminalBench we observe a smaller effect (7.7% vs. 0% baseline). Explicit data sanitation is therefore insufficient as a defense; mitigating behavioral bias transfer in agentic systems will require fundamentally new strategies.

cs.AI

新论文 · v1arXiv:2611.20203

Radar Panoptic Transformer: Semantic-Guided Mask Queries for Dynamic Scene Understanding

Mayank Mayank, Bharanidhar Duraisamy, Rohit Mohan, Abhinav Valada

原文摘要

Automotive radar provides long-range sensing and direct Doppler velocity measurements, but its sparse and non-uniformly sampled point clouds pose significant challenges for panoptic segmentation. Dynamic objects often yield only a few detections amid a dominant static background, providing limiting the geometric cues for separating object instances. We propose \emph{Radar Panoptic Transformer (RPT)}, an end-to-end point-based network that incorporates radar-adaptive feature extraction with semantic-guided mask prediction. Its backbone aggregates pose-aligned temporal context through grouped vector attention and learns per-point neighborhood radii conditioned on range, azimuth, and radar cross section (RCS). Point-wise semantic predictions initialize queries at likely foreground detections and guide masked cross-attention through query-point class agreement, producing instance masks without geometric clustering. An auxiliary RCS-consistency loss matches instance-level statistics between predicted and annotated instances. RPT achieves state-of-the-art performance on RadarScenes with $71.6\%$ mIoU and $82.2\%$ PQ. We further evaluate RPT on MAN TruckScenes, where it outperforms the evaluated baselines in a long-range, full-surround radar setting with sensing ranges up to $230\,\mathrm{m}$. RPT achieves real-time end-to-end inference at $31$\,Hz on RadarScenes, exceeding the sensor frame rate.

cs.CV · cs.LG

新论文 · v1arXiv:2611.20202

DAPPT: Domain-Aware Policies from Procedural Trajectories for Sim-to-Real Dexterous Tool Use

Beining Han, Jia Deng

原文摘要

Sim-to-real RL has achieved impressive results in dexterous manipulation but remains limited to tasks with accurate rigid-body simulation. However, these methods cannot be applied to skills that involve deformable and particles, with which the simulation speed will become too slow for large-scale RL learning. We present DAPPT, a sim-to-real framework for end-to-end dexterous tool-use manipulation skills, e.g., sand scooping, play-dough rod-rolling, without simulating non-rigid materials. Our method learns a domain-aware RL policy by tracking procedural trajectories parameterized by domain parameters, and distills it into an end-to-end domain-aware sensorimotor policy. Furthermore, explicit domain represen-tation enables fast selection of domain parameters that can maximize downstream task performance. We evaluate DAPPT end-to-end on six dexterous manipulation tasks, including sand scooping, play-dough rod-rolling, sand scraping, mouse-wheel scrolling, dispenser pressing, and spray triggering. Our method achieves 1.5-3.8x in task metrics through the best domain parameter and transfers zero-shot to the real world.

cs.RO

版本更新 · v2arXiv:2611.10585

Safe by Accident: Crash-Testing LLM-Written Code

Afridi Mahmud, Md. As-Aid Rahman, Rifat Shahriyar

原文摘要

Evaluations of LLM-written code run it once, in one environment, and credit the code with whatever passes. We show that this credit can belong to the environment. We crashed LLM-written backend code just before each database, file and email call, re-ran it as an operator would, and judged the result under two transaction modes of Python's sqlite3: the default, in which the library quietly opens a transaction, and autocommit, in which it does not. Across 9,100 solutions from ten models on 24 backend tasks, more than half (54%) of the database code that survives every crash in the default mode is left half-updated in autocommit mode. This holds for every model, and it hides in ordinary code, including with conn: blocks that look like transactions but open none. Telling the model that its connection is in autocommit mode does not change what the local code models write, while the API models' unsafe share falls by 30 points. Asking for crash safety helps every model, and strong models repair nearly all unsafe code, but often write safe code only when asked. Thus, much of the crash safety that LLM-written database code appears to have is borrowed from the library rather than designed into it, and a second test under a less forgiving configuration reveals the difference.

cs.SE