跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

+0新增论文
+0其中 AI 相关
+1已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-08 21:48 · 全站最近入库:2026-11-08 06:02各信源进度 →

统计口径与数据新鲜度

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

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

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

17,100 已收录论文14,661 AI 相关4,057 有修订112 HF 社区发现

浏览论文库

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

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

Learned Warm Starts for Steady Transonic RANS Simulations of Wing and Aircraft Configurations

Muhammad Irfan Zafar, Saleh Abuhanieh, Şahin Yiğit

原文摘要

Neural surrogates can accelerate many-query aerodynamic analyses, but their standalone predictions may be insufficiently accurate or robust to support reliable design evaluations. We develop a learned warm-start formulation that predicts mean-flow and turbulence fields directly on native CFD meshes for subsequent correction by the RANS solver. A common architecture and objective structure are used across subcritical and transonic flows, including challenging conditions with shock-induced separation. A condition-modulated Transolver combines Fourier and wall features with target-gated regularization, a Sobolev-type loss, adaptive loss weighting and sampled training. Prediction requires no preliminary flow solution, and training requires no solver-residual evaluation. Extensive 3D CFD evaluations on SuperWing, the NASA Common Research Model (CRM) and DLR-F6 assess geometric and operating-condition generalization, including interpolation, extrapolation and cross-mesh deployment, using Spalart-Allmaras and $k$-$ω$ SST closures on million-cell meshes. Unseen nominal cases achieve geometric-mean iteration speed-ups of approximately $2$-$4\times$ under a common convergence criterion based on cold-run aerodynamic coefficients. On CRM, learned initialization provides greater aggregate acceleration than nearest-condition restarts using the same solution library. Resolution invariance enables direct deployment of coarse-mesh models on finer meshes without retraining, solution interpolation or target-condition coarse solves. Including data generation and training, estimated campaign speed-ups reach $2.1$-$2.3\times$. No warm run diverges; fewer than $2\%$ fail to satisfy the cold-reference convergence criterion. These results support learned initialization for repeated aerodynamic analyses, while highlighting initialization sensitivity near separation as a remaining limitation.

cs.CE · physics.flu-dyn

新论文 · v1arXiv:2611.01239

Mathematical Formulation and Comparative Performance Evaluation of Machine Learning Algorithms for Maize Land Suitability Prediction

Haimanot Bitew, Ayisheshim Almaw, Habtamu Zegeye, Demeke Alene

原文摘要

Addressing the food needs of a growing population is one of the major challenges of developing countries like Ethiopia. Various policies aimed at increasing food production have been enacted by governments and development partners. Although efforts in this regard have been made, there is still inadequate emphasis on increasing food production through the use of high technology practices. Precision agriculture using technology has been utilized to increase crop yield. Precision agriculture also relies on identifying land for a crop, which is a key factor that affects crop yield. Traditional methods of assessing land suitability for crop production are time-consuming, costly and unreliable. Against this background, the aim of this study was to assess the potential of machine learning (ML) in improving the speed and accuracy of assessing land suitability for maize, a staple crop in Ethiopia, as compared to traditional methods. The study is investigated in three areas (Burie, Shindi and Tilili) in the Amhara region. Data collection was done through the local agriculture offices and survey teams. The data were coded, scaled and balanced. Various feature extraction techniques, which included Univariate Feature Selection(UFS), Recursive Feature Elimination with Cross-Validation(RFECV) and Sequential Feature Selection(SFS), and various classifiers, which were K-nearest neighbor (KNN), gradient boosting (GB),random forest (RF) with mathematical formulations were employed. The best models were constructed through combining GBOOST and SFS and achieved an accuracy of 99.41% and 99.35% for both precision and recall. Our results showed that using machine learning is a reliable method of assessing land suitability for maize in Ethiopia. Keywords: Maize, Gradient boosting,Land suitability,Machine learning, Mathematical formulations

cs.LG · cs.AI

新论文 · v1arXiv:2611.01234

How Much Can Approximate Equilibria Change the Social Cost of Selfish Routing?

Yu Cheng, Tianle Jiang

原文摘要

We study approximate Nash equilibria in nonatomic congestion games, with the goal of understanding how much the social cost can change when the equilibrium condition is relaxed. We consider $ε$-approximate Nash equilibria ($ε$-NE), in which each player uses a strategy whose cost is at most $1 + ε$ times the minimum available cost. We compare the social costs of $ε$-NE and exact Nash equilibria. This lets us quantify, for example, how much a navigation app can reduce total travel time when drivers tolerate routes slightly slower than the fastest available route. For degree-$d$ polynomial latencies in both general nonatomic congestion games and single-commodity routing games on series-parallel networks, we give tight lower and upper bounds on the relative change in social cost from an exact Nash equilibrium to any $ε$-NE, with matching instances for every $ε$. For small $ε$, the largest possible relative reduction and increase in general congestion games are both $Θ(\sqrt{dε})$, independently of the number of resources and populations. In contrast, on series-parallel networks of depth $h$, the largest possible relative reduction is $Θ(hε)$, while the largest possible relative increase is known to be $ε$. For the classes of games we study, these results give a tight and quantitative characterization of the possible changes in social cost and establish a separation between general and series-parallel networks.

cs.GT · cs.AI · cs.DS · math.OC

新论文 · v1arXiv:2611.01233

STLT: A Novel System for Energy-Aware Distributed Inference in the Edge-Cloud-Space Continuum

Andrija Stanisic, Milos Gravara, Juan Luis Herrera, Stefan Nastic

原文摘要

Low Earth Orbit satellites are pivotal for Earth observation tasks such as wildfire detection, capturing imagery for analysis by Deep Neural Networks (DNNs). On-board analysis reduces downlink volume, but severe energy constraints force a trade-off between computation and data transmission. Splitting the DNN between satellite and ground turns this balance into a design choice, where the split point determines combined computation and downlink energy. Existing approaches typically rely on static split-point decisions that fail to account for dynamic space conditions, or on complex algorithms, historical data, or prediction models that introduce significant overhead. To address these shortcomings, we present STLT, a two-stage system for energy-aware distributed inference between LEO satellites and a ground station. First, an offline analyzer characterizes the DNN architecture to identify a set of favorable split points, consequently reducing the search space. Second, an on-board algorithm performs lightweight energy-aware split selection, dynamically choosing from this pre-computed set based on the current state of the environment. We evaluate STLT on a real-world satellite telemetry dataset, showing that it reduces the split-candidate search space by 30.7% on average, lowers decision latency by 25.1% and energy by 27.5% on average, and delivers up to 20.1% more inference tasks than a state-of-the-art satellite-ground co-inference baseline while consuming 8.8% less energy overall.

cs.DC · cs.AI

版本更新 · v3arXiv:1704.04538

A Simple Randomized Estimator for Harmonic Numbers and Logarithms

Ali Dasdan

原文摘要

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

cs.DS

新论文 · v1arXiv:2611.01230

Reproducing INP-Former: Reconstructing Intrinsic Normal Prototypes for Industrial Anomaly Detection

Yunfei Liang, Juan Pablo Osorio Rivera

原文摘要

We reproduce the central claims of INP-Former, a reconstruction-based method for multi-class industrial anomaly detection. INP-Former extracts Intrinsic Normal Prototypes (INPs) from each test image and uses them to guide a decoder that reconstructs normal features, without a stored memory bank. Using the authors' released code, we reproduce the reported performance on MVTec AD and VisA and extend the evaluation to MVTec AD 2, where image AUROC with the default settings is 63.4, compared with 99.7 on MVTec AD. On MVTec AD, a five-seed ablation shows that most of the performance comes from the INP mechanism, while the two auxiliary losses add small changes whose direction depends on the metric. A paired comparison with both losses disabled confirms the benefit of INP on MVTec AD 2. The default of six prototypes transfers less well: the plateau beyond four prototypes reproduces on MVTec AD and VisA, but on MVTec AD 2 a single prototype outperforms six in AU-PRO on the public split and on both hidden test splits. We also measure practical trade-offs in resolution, backbone size, training length, and LoRA adaptation, and examine performance by defect size, lighting condition, and a stricter AU-PRO limit. Several conclusions from the original benchmarks, including the default prototype count, do not carry over to harder data. Code: https://github.com/garasnote/Repro-INPFormer

cs.CV · cs.LG

新论文 · v1arXiv:2611.01229

Precision Through Play: Enhancing Fundamental Laparoscopic Skill Acquisition Via Gamified XR and Pseudo-Haptics

Bita koohestani, Ashkan Rezaei, Azam Bastanfard

原文摘要

Extended Reality (XR) technologies have shown potential to improve laparoscopic skills acquisition. Among fundamental skills in laparoscopic surgery is accurate instrument handling. Appropriate instrument alignment and a perpendicular path ensure movement efficiency and improved performance. This work introduces an interactive XR platform designed to support an immersive, engaging, and accessible environment that facilitates continuous practice. This platform incorporates a gamification layer enriched by pseudo-haptics that generate a motivational feedback loop, allowing trainees to continuously practice instrument manipulation and angle control. The platform monitors instrument orientation, computes angular deviation from an ideal reference vector, and assigns scores based on user performance. A point-based scoring component reinforces correct technique and penalizes deviations in tool alignment beyond predefined thresholds. Furthermore, a pseudo-haptic feedback mechanism is integrated to provide real-time tactile feedback when deviation exceeds tolerance. Combined with low-cost hardware and accessible deployment, the framework aims to increase training scalability, engagement, and improve skill acquisition. Preliminary evaluations indicate that integrating gamified feedback significantly improves precision, reduces angular variance, and encourages sustained practice.

cs.HC · cs.GR

新论文 · v1arXiv:2611.01225

When Benign Is Unverified: Label-Signal Mismatch and Abstention-First Triage in Graph-Based Memory Forensics

Viraj Rajeshbhai Chudasama, Eduardo Palmieri, Dipo Dunsin, Aisha Junejo, Mohamed Chahine Ghanem

原文摘要

Machine-learning triage for memory forensics is usually validated on corpora whose benign class is asserted by provenance and never verified. We report a validation study of a graph-based triage pipeline for Windows memory images: Volatility 3 output is compiled into typed heterogeneous graphs and scored by a temperature-scaled GINE classifier and two one-class encoders, fused with rule risk under an abstention gate. On MalVol-25 a transparent rule layer contradicts the benign label on every control (15/15 and 18/18 flagged; at least 11 of 15 paired controls rated HIGH or CRITICAL), and mean injection and command-and-control counts run higher on controls than on infected captures. We call this rule-label discordance label-signal mismatch; it shows the benign class is unverified, not compromised. Leave-one-family-out AUROC over matched pairs is provably three-valued, so a reported mean and standard deviation identify the fold composition. The learned model (0.786 +- 0.311; 9/4/1, scored in-sample by a frozen checkpoint) equals a logistic model over rule-derived attributes (0.786 +- 0.410; 11/0/3) in mean only, and its significance rests on dropping four saturated ties. The fusion path sends 97.7% of snapshots to analyst review, 95.3% with every gate disabled. Two public feature-level corpora show the same defect: on CIC-MalMem-2022 every benign row carries injected regions and one host-population feature reaches AUROC 0.997 under leave-one-family-out validation; on the Sihwail et al. (2021) sample the injection indicator fires on 53% of benign rows. We close with seven reporting artefacts for learned triage on corpora whose ground truth is asserted.

cs.CR · cs.OS

新论文 · v1arXiv:2611.01222

Modeling Fat-shift for Improved Head Segmentation from MRI Scans using a Probabilistic Model

Merle Diedrichsen, Koen Van Leemput, Douglas N. Greve, Oula Puonti, Axel Thielscher

原文摘要

Personalized computational head models for biophysical simulations rely on accurate whole-head segmentations from T1-weighted (T1w) magnetic resonance imaging (MRI) scans. While T1w scans provide excellent contrast for intracranial anatomy, extracerebral tissues have partly almost no signal (compact bone) and also suffer from the so-called chemical shift artifact, which affects the fatty tissues in MRI and causes them to spatially shift in the frequency encoding direction of the scan. This artifact occurs primarily in two structures of the head: the spongy bone, a fatty compartment inside the compact bone, and the subcutaneous fat, located directly underneath the skin. The frequency-encoding direction is often set in the superior-inferior direction, causing the fatty tissues to shift down and, as a result, making the skull appear thinner than it actually is. Existing segmentation methods do not model this artifact, consequently leading to inaccurate labeling of the skull and scalp, which introduces a bias in biophysical simulations. The direction and magnitude of the fat-shift can be determined from the scan parameters, thus making it possible to explicitly model the shift and to recover the correct anatomy. This study introduces a probabilistic model that uses variational inference to segment head and brain structures from a T1w scan while accounting for the fat-shift artifact. The proposed Fat-shift-informed Label Optimization of the Whole head (FLOW) method reconstructs extracerebral anatomy more accurately than a fat-shift-agnostic segmentation approach while maintaining high segmentation accuracy in all other structures. FLOW-based fat-shift corrected segmentations significantly reduce bias in electric field simulations compared to a segmentation method that does not model the shift.

cs.CV

版本更新 · v4arXiv:2510.06445

A Survey on Agentic Security: Applications, Threats and Defenses

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

原文摘要

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

cs.CL · cs.AI · cs.CR

新论文 · v1arXiv:2611.01220

Differentiable Iterative Learning Control for Black-Box Position-Commanded Manipulators

Mohammed Al-Ghaili, Yakoop Qasim, Hassan Almubarak

原文摘要

High-accuracy repetitive tracking is challenging for position-commanded manipulators whose low-level controllers are inaccessible, while constrained model-based iterative learning control (ILC) can require substantial manual parameter tuning. We present Differentiable Iterative Learning Control (Diff-ILC), an online bilevel framework that adapts the parameters of a constrained ILC update between physical robot executions. A closed-loop differential model is identified once from paired smooth perturbations and subsequently kept fixed. At each trial, a constrained quadratic program computes a feasible command correction, while a real-anchored next-trial prediction defines a task-level objective. Hypergradients are obtained by implicitly differentiating the locally active KKT system, enabling multiple computational parameter updates without additional robot executions. Experiments on a 6-DoF DOBOT CR3 across unseen planar and three-dimensional trajectories show substantially faster physical-trial convergence than fixed-parameter model-based ILC. Across the four primary trajectories, after only two trial-to-trial updates, Diff-ILC achieves 78.8% and 76.4% lower mean joint-vector and Cartesian RMSE, respectively, than fixed-parameter model-based ILC.

cs.RO · eess.SY

新论文 · v1arXiv:2611.01219

The Brittle Compass: Navigating LLM Prompt Sensitivity in Slovak Migration Media Discourse

Samuel Harvan, Jaroslav Kopčan, Marek Šuppa, Andrej Findor

原文摘要

In this work, we present a case study that explores various tasks centered around the topic of migration in Slovak, a low-resource language, such as topic relevance and geographical relevance classification, and migration source/destination location term extraction. Our results demonstrate that native (Slovak) prompts yield a modest, task-dependent gains, while large models show significant robustness to prompt variations compared to their smaller counterparts. Analysis reveals that instructions (system or task) emerge as the most critical prompt component, more so than the examples sections, with task-specific performance benefits being more pronounced than overall language effects.

cs.CL

版本更新 · v3arXiv:2601.18706

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

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

原文摘要

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

cs.AI · cs.LG

版本更新 · v2arXiv:2606.04177

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

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

原文摘要

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

cs.CL · cs.AI

新论文 · v1arXiv:2611.01218

Optimal Conversion from Zero-Concentrated to Gaussian Differential Privacy

Yu-Wei Chen, Aaradhya Pandey, Jordan Awan

原文摘要

Gaussian differential privacy (GDP) and zero-concentrated differential privacy (zCDP) are two competing privacy accounting frameworks, but they share similar minimax lower bounds in various estimation problems. Moreover, it is known that a mechanism satisfying $μ$-GDP satisfies $(μ^2/2)$-zCDP, whereas the converse fails to hold at the same calibration. In this paper, we establish the optimal reverse conversion, showing that every $ρ$-zCDP mechanism satisfies $μ_{\mathrm{zCDP}}(ρ)$-GDP, where $μ_{\mathrm{zCDP}}(ρ)=2Φ^{-1}((1+e^{-t_ρ})^{-1})$ and $t_ρ$ uniquely solves the equation $ρ=t_ρ\tanh(t_ρ/2)$. We also obtain simplified bounds $\sqrt{πρ}\leqμ_{\mathrm{zCDP}}(ρ)\leq\sqrt{8ρ}$, with sharp constants, which imply equivalence of the two frameworks up to constants. This explains why their minimax risks agree up to a constant rescaling of the privacy budget. We show that the squared conversion is strictly convex, which implies that converting zCDP to GDP before applying composition or group privacy yields a tighter GDP guarantee than converting afterward. We also derive the sharp conversion from bounded-range and logistic DP mechanisms (e.g., exponential mechanism) to GDP, where converting before composition but after group privacy gives the tighter guarantee.

cs.CR · math.ST

版本更新 · v2arXiv:2609.18272

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

Mohamed Chahine Ghanem, Baidaa Al-Bander

原文摘要

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

cs.AI · cs.CR · cs.ET

新论文 · v1arXiv:2611.01216

Adaptive Optimizers Can Get a Policy Ranking Wrong: Momentum, Dependent Data, and a Two-Run Remedy

Sunyoung An, Xiaoming Huo

原文摘要

Operators choosing among decision rules, such as when a battery charges or where an idle taxi goes, rank them by estimated long-run value. A standard estimator, linear temporal-difference (TD) learning, fits values from one stream of correlated observations. Large fits often use an adaptive optimizer, such as adaptive moment estimation (Adam), with fixed averaging rates. We show that these rates can change what is estimated, not just how fast: the same observations drive the updates and the optimizer's step-size scaling, moving the fit away from the intended TD value. The shift differs across rules, so it need not cancel in a comparison, and more data only makes a wrong ranking look more certain. Our remedy refits the same data at a second averaging rate that halves the effective gain, the number to which the leading shift is proportional. Twice the new fit minus the original removes that shift. In New York taxi and battery models calibrated to real data, common optimizer settings leave the selected rule unchanged but order close rules wrongly and misstate its value. Our remedy corrects nearly every wrong ordering, with one extra fit when the shift is moderate and two when it is larger.

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

版本更新 · v2arXiv:2604.08741

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

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

原文摘要

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

cs.CV

版本更新 · v2arXiv:2610.40290

Leveraging Recourse and Size Bounds for OnlineKnapsack with Removable Items

Dimitris Fotakis, Laurent Gourvès, Aris Pagourtzis, Panagiotis Patsilinakos

原文摘要

In the online unweighted knapsack problem, items arrive sequentially and must be accepted or rejected immediately for a bounded-capacity knapsack, aiming to maximize the total size of accepted items. When decisions are irrevocable, no algorithm achieves a non-trivial competitive ratio. An essential relaxation that circumvents this impossibility is to allow previously accepted items to be removed from the knapsack (a.k.a. removal). In this work, we investigate possible further improvements on the competitive ratio with removal by bringing together two other previously proposed model extensions: knowledge of an upper bound on the item sizes (a.k.a. bound awareness) and ability to reinsert previously rejected items(a.k.a.recourse). Our contributions are twofold. First, we establish close upper and lower bounds on the competitive ratio under bound awareness, removal and recourse. We show that significant improvements on the best known competitive ratio are possible when the upper bound on the item sizes is not too restrictive and only few uses of recourse are available. Second, we introduce the notion of adaptive online algorithms which do not require to know any upper bound on the item sizes but still achieve performance guarantees comparable to the ones obtained under the bound awareness model.

cs.DS · cs.CL

新论文 · v1arXiv:2611.01213

Is Newborn Wiring Special? Separating Wiring from Weight Placement in Connectome Reservoirs

Riccardo Bertamini, Corrado Calamita, Ramiro Pascual, Alisia Picciano, Niccolò Pagano

原文摘要

Reservoir computing offers a way to study the brain's wiring before it is even trained. The recurrent network remains fixed, while only a linear readout is trained. The human connectome is found to perform better than randomly rewired versions of itself, suggesting that biological wiring is special. To understand the source of this advantage, a mathematical graph-theoretic decomposition is introduced. Rewiring a weighted network changes both the regions that are connected and the weights assigned to those connections. The observed advantage therefore combines an effect of wiring with an effect of weight placement. These effects are separated by averaging the wiring term over the null model's weight rule, as a single draw introduces about one z-unit of noise. Adult and infant connectomes are then considered separately. In adult Human Connectome Project graphs, weight placement explains most of the reported effect, leaving a small but consistent wiring effect. Across the full dHCP release, a large wiring effect is found at every measured gestational age at birth, while gestational age explains almost none of its variance. The connectomes are also compared with non-brain networks. A Watts-Strogatz graph matched in size, edge count, weights, and strength performs as well as or better than the connectome. The newborn connectome's advantage is therefore real across all measured gestational ages, but it is not unique to the brain. The same separation can be applied whenever a weighted network is compared with rewired nulls.

cs.NE

版本更新 · v4arXiv:2306.10426

Understanding Certified Training with Interval Bound Propagation

Yuhao Mao, Mark Niklas Müller, Marc Fischer, Martin Vechev

原文摘要

As robustness verification methods are becoming more precise, training certifiably robust neural networks is becoming ever more relevant. To this end, certified training methods compute and then optimize an upper bound on the worst-case loss over a robustness specification. Curiously, training methods based on the imprecise interval bound propagation (IBP) consistently outperform those leveraging more precise bounding methods. Still, we lack an understanding of the mechanisms making IBP so successful. In this work, we thoroughly investigate these mechanisms by leveraging a novel metric measuring the tightness of IBP bounds. We first show theoretically that, for deep linear models, tightness decreases with width and depth at initialization, but improves with IBP training, given sufficient network width. We, then, derive sufficient and necessary conditions on weight matrices for IBP bounds to become exact and demonstrate that these impose strong regularization, explaining the empirically observed trade-off between robustness and accuracy in certified training. Our extensive experimental evaluation validates our theoretical predictions for ReLU networks, including that wider networks improve performance, yielding state-of-the-art results. Interestingly, we observe that while all IBP-based training methods lead to high tightness, this is neither sufficient nor necessary to achieve high certifiable robustness. This hints at the existence of new training methods that do not induce the strong regularization required for tight IBP bounds, leading to improved robustness and standard accuracy.

cs.LG · cs.AI

版本更新 · v5arXiv:2512.01782

Dual Randomized Smoothing: Beyond Global Noise Variance

Chenhao Sun, Yuhao Mao, Martin Vechev

原文摘要

Randomized Smoothing (RS) is a prominent technique for certifying the robustness of neural networks against adversarial perturbations. With RS, achieving high accuracy at small radii requires a small noise variance, while achieving high accuracy at large radii requires a large noise variance. However, the global noise variance used in the standard RS formulation leads to a fundamental limitation: there exists no global noise variance that simultaneously achieves strong performance at both small and large radii. To break through the global variance limitation, we propose a dual RS framework which enables input-dependent noise variances. To achieve that, we first prove that RS remains valid with input-dependent noise variances, provided the variance is locally constant around each input. Building on this result, we introduce two components: (i) a variance estimator predicts an optimal noise variance for each input, (ii) this estimated variance is then used by a standard RS classifier. The variance estimator is independently smoothed via RS to ensure local constancy, enabling flexible design. We also introduce training strategies to iteratively optimize the two components. Experiments on CIFAR-10 demonstrate that our dual RS method provides strong performance for both small and large radii-unattainable with global noise variance-while incurring only a 60% computational overhead at inference. Moreover, it outperforms prior input-dependent noise approaches across most radii, with gains at radii 0.5, 0.75, and 1.0 of 15.6%, 20.0%, and 15.7%. On ImageNet, dual RS remains effective across all radii, with advantages of 8.6%, 17.1%, and 9.1% at radii 0.5, 1.0, and 1.5. Additionally, the dual RS framework provides a routing perspective for certified robustness, improving the accuracy-robustness trade-off with off-the-shelf expert RS models.

cs.LG · cs.AI

版本更新 · v5arXiv:2410.06816

Expressiveness of Multi-Neuron Convex Relaxations in Neural Network Certification

Yuhao Mao, Yani Zhang, Martin Vechev

原文摘要

Neural network certification methods heavily rely on convex relaxations to provide robustness guarantees. However, these relaxations are often imprecise: even the most accurate single-neuron relaxation is incomplete for general ReLU networks, a limitation known as the *single-neuron convex barrier*. While multi-neuron relaxations have been heuristically applied to address this issue, two central questions arise: (i) whether they overcome the convex barrier, and if not, (ii) whether they offer theoretical capabilities beyond those of single-neuron relaxations. In this work, we present the first rigorous analysis of the expressiveness of multi-neuron relaxations. Perhaps surprisingly, we show that they are inherently incomplete, even when allocated sufficient resources to capture finitely many neurons and layers optimally. This result extends the single-neuron barrier to a *universal convex barrier* for neural network certification. On the positive side, we show that completeness can be achieved by either (i) augmenting the network with a polynomial number of carefully designed ReLU neurons or (ii) partitioning the input domain into convex sub-polytopes, thereby distinguishing multi-neuron relaxations from single-neuron ones which are unable to realize the former and have worse partition complexity for the latter. Our findings establish a foundation for multi-neuron relaxations and point to new directions for certified robustness, including training methods tailored to multi-neuron relaxations and verification methods with multi-neuron relaxations as the main subroutine.

cs.LG · cs.AI

新论文 · v1arXiv:2611.01212

Energy-Efficient Geographic Multicast Routing in Cognitive Wireless Sensor Networks

Farzan Heidari, Farzaneh Heidari

原文摘要

Energy consumption is a major design concern in wireless sensor networks. Cognitive radio provides opportunistic access to licensed spectrum, while multicast routing allows several destinations to share forwarding paths. In this paper, we propose two geographic multicast routing protocols for cognitive wireless sensor networks, CCast and PCast. CCast combines multicast-tree construction with a latency-oriented spectrum-selection metric. PCast uses a normalized link-power cost to select routes and can avoid regions where primary users occupy lower-frequency bands. Both protocols use local neighbor information and destination coordinates, without requiring a complete network-topology map. Simulations compare the proposed protocols with geographic multicast routing (GMP) and multiple unicast routing. In simulations, CCast and PCast reduce energy consumption by 21\% and 26\% relative to GMP, at the cost of longer per-destination routes and higher delivery delay.

cs.NI

新论文 · v1arXiv:2611.01211

A Large-Scale Evaluation of Cookie Notice Privacy and Accessibility for Blind and Low Vision Users

James M. Clarke, Maryam Mehrnezhad

原文摘要

We present the first large-scale privacy and accessibility evaluation of cookie notices across 2,061 domains for blind and low vision (BLV) users. Using a Playwright-based crawler, a custom NVDA screen reader add-on, and the Lighthouse and WAVE accessibility tools, we measure UK GDPR/PECR compliance, tracker activity across pre-interaction, post-accept, and post-reject phases, and cookie notice accessibility for screen reader users. We find that 51 % of sites display a cookie notice, of which (at least) 50 % violate UK GDPR/PECR requirements. Accepting a notice produces a mean five-fold increase in tracker activity, and degrades page landmark structure on one in five sites. While 95 % of notices are readable by a screen reader, only 37 % carry a meaningful title, 39 % are announced immediately on page load, and 42 % use descriptive button labels. We reveal a systemic correlation: cookie notices failing legal privacy requirements disproportionately exhibit the weakest screen reader accessibility. This compounding privacy burden on BLV users demands urgent intervention from developers, regulators, and standards bodies.

cs.CR

版本更新 · v3arXiv:2602.20191

MoBiQuant: Mixture-of-Bits Quantization for Token-Adaptive Any-Precision LLM

Dongwei Wang, Jinhee Kim, Seokho Han, Denis Gudovskiy, Yohei Nakata, Tomoyuki Okuno, KhayTze Peong, Kang Eun Jeon 等 11 位作者

原文摘要

Dynamic runtime latency and memory constraints necessitate flexible large language model (LLM) deployment, where an LLM can be inferred with various quantization precisions based on available computational resources. Recent work on such any-precision quantization either relies on hardware-inefficient vector quantization or induces additional scaling factors when switching between bit-widths. Meanwhile, existing post-training quantization (PTQ) methods calibrated for a fixed low precision show poor generalizability under runtime precision change. In this work, we attribute the source of poor generalization across bit-widths to a precision-dependent outlier migration phenomenon where the distribution of PTQ-sensitive tokens changes across precisions. Motivated by this observation, we propose MoBiQuant, a novel any-precision Mixture-of-Bits quantization framework that adjusts weight precision for flexible LLM inference based on token sensitivity. Specifically, we propose a many-in-one recursive residual quantization that can iteratively reconstruct higher-precision weights at runtime and mitigates outlier migration with a token-aware router to dynamically select the optimal inference precision of each token.Extensive experiments show that MoBiQuant matches or surpasses frontier single-precision PTQ while exhibiting strong elasticity, achieving significant memory savings and throughput gains of up to $1.34\times$ over state-of-the-art any-precision methods. Our code is available at https://github.com/SimWangArizona/MoBiQuant.

cs.LG · cs.AI · cs.CL

版本更新 · v3arXiv:2601.00215

Disentangling Perception and Reasoning in Multimodal LLMs via Reward Design

Omar Sharif, Eftekhar Hossain, Nikhil Singh, Patrick Ng

原文摘要

Reinforcement learning with verifiable rewards has driven major gains in LLM reasoning, and it is intuitive to assume this recipe will transfer well to multimodal models. However, multimodal models do two things: first, perceive what is in an image, then reason about what it implies. Because these stages are graded jointly, it is hard to tell how much room reasoning alone has to grow. We study this on algorithmic visual puzzles, where both components are necessary and show that perception, not reasoning, is the binding constraint. Replacing images with simple textual descriptions raises performance by over 20 points on average for Claude models. We then evaluate six reward designs aimed at inducing visual grounding during reasoning without chain-of-thought supervision. Training Qwen-2.5-VL-7B with GRPO, reward design induces long, structured reasoning with self-reflection and visual references, yielding a 5.56-point gain over the base model. These gains are, however, uneven; no single reward improves all categories, and rewards with verifiable accuracy signals trade cross-domain transfer for in-domain accuracy. These results point to perception-aware reward design as a path forward, so that signals correct perception at its source rather than the reasoning that inherits its errors.

cs.CV · cs.CL

版本更新 · v3arXiv:2506.01599

Connecting Neural Models Latent Geometries with Relative Geodesic Representations

Hanlin Yu, Berfin Inal, Georgios Arvanitidis, Søren Hauberg, Francesco Locatello, Marco Fumero

原文摘要

Neural models learn representations of high-dimensional data on low-dimensional manifolds. Multiple factors, including stochasticities in the training process, model architectures, and additional inductive biases, may induce different representations, even when learning the same task on the same data. However, it has recently been shown that when a latent structure is shared between distinct latent spaces, relative distances between representations can be preserved, up to distortions. Building on this idea, we demonstrate that exploiting the differential-geometric structure of latent spaces of neural models, it is possible to capture precisely the transformations between representational spaces trained on similar data distributions. Specifically, we assume that distinct neural models parametrize approximately the same underlying manifold, and introduce a representation based on the pullback metric that captures the intrinsic structure of the latent space, while scaling efficiently to large models. We validate experimentally our method on model stitching and retrieval tasks, covering autoencoders and vision foundation discriminative models, across diverse architectures, datasets, and pretraining schemes.

cs.LG

新论文 · v1arXiv:2610.40655

解析语言模型数据归因的设计空间

Elucidating the Design Space of LM Data Attribution

Steven Yu, Sheng-Yu Wang, Kimia Hamidieh, Antonio Torralba, David Bau

AI 速读 基于摘要

作者提出可控归因基准 CATT,通过合成虚构知识隔离数据集属性,并发现负对数几率梯度与仅聚合关键 token 能显著提升事实溯源归因效果。

cs.CL

查看原文摘要

Data attribution methods for Language Models (LMs) are typically evaluated using downstream tasks like fact retrieval. However, existing evaluations vary multiple dataset properties simultaneously, making it impossible to isolate exactly why an attribution algorithm fails. To diagnose these failures, we explore the design space of LLM data attribution, with a primary focus on evaluation. We introduce the Controlled Attribution Benchmark (CATT) for fact tracing, in which we fine-tune LLMs on entirely fictitious knowledge, providing unambiguous ground truth for attribution. This synthetic setup allows us to systematically alter one dataset configuration at a time, such as document redundancy and lexical distractors. With this configurable evaluation, we demonstrate that redundancy and distractors consistently degrade attribution performance. Rather than proposing a new estimator, we examine two design choices that are underexplored: the loss used to compute gradients and how per-token attribution scores are aggregated into a document score. We find that the true causal evidence within a training document is highly localized, but standard methods dilute this evidence into noise by averaging attribution scores across the entire document. We find that replacing standard cross-entropy loss gradients with the negative log-odds gradients surfaces the critical tokens from other uninformative ones. We can then aggregate only the top token scores to improve ground truth recall by 35 to 72 percentage points across multiple baselines on our diagnostic benchmark. The negative log-odds correction also generalizes to FTRACE-TREX, improving counterfactual retraining performance for every method we test, by up to 4.9x.

新论文 · v1arXiv:2610.40653

微剪辑:电影中细粒度剪辑的计算支持

Micro-Edits: Computational Support for Fine-Scale Edits in Film

Nhan Tran, Hijung Valentina Shin, Abe Davis, Mackenzie Leake

AI 速读 基于摘要

该工作通过专业剪辑师的形成性研究理解细粒度剪辑(micro-edits)的结构,提出数学形式化,并开发基于AI与优化的工具以简化其探索与制作。

cs.HC · cs.CV

查看原文摘要

In film editing, every frame matters. While macro, content-level edits shape the high-level narrative of a film, small local edits often control timing and direct visual attention. For example, editors can adjust the precise timing of clips to control the length of a meaningful silence, or cut to shots that highlight a specific character's reactions to important moments. These small, detailed edits are slow and tedious to make in standard editing tools because users have to map high-level narrative goals to low-level frame-by-frame adjustments. At the same time, these fine-scale adjustments, which we call micro-edits, can be nuanced and expressive, with different choices serving different creative goals. In this work, we start by conducting a formative study with professional editors to understand the structure of micro-edits and how they are used. We then derive a mathematical formalization for this structure to develop tools that leverage AI and optimization to make exploring micro-edits simpler and more efficient for users. Finally, we validate our tools in multiple user studies and a wide range of video examples.