跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

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

找到 23,827 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2606.17922

Resolution of Vinzant's Conjecture on Phase Retrieval Injectivity

Zhangsong Li

原文摘要

Let $A\in\mathbb C^{N\times M}$ with $N=4M-5$ has independent standard complex Gaussian entries. We prove that the probability that the phase retrieval map generated by $A$ is injective is strictly smaller than $1$, and is $O(M^{-1})$ as $M\to \infty$. This proves a conjecture of Cynthia Vinzant, which was later restated by Afonso S. Bandeira in \cite{bandeira2026randomstrasse101}. The main result of this paper was obtained using generative AI, in particular GPT6-Astra, GPT 5.6-sol, and the Rethlas system.

math.FA · cs.IT · math.PR

新论文 · v1arXiv:2611.13972

Data Quality Challenges in Multimodal Tourism Recommender Systems

Zehui Wang, Wolfram Höpken, Dietmar Jannach

原文摘要

Modern recommender systems increasingly consider diverse data modalities to enhance model performance. However, the quality of the underlying multimodal data (e.g. data from social media platforms) has received limited attention so far. Focusing on tourism recommendation, we examine real-world challenges encountered when using datasets from Yelp and Instagram. Issues include noise from fake reviews, hallucinated content from LLMs, modality contradictions, and demographic bias. We outline future directions such as quality-aware fusion, structured and controlled LLM-based content generation to reduce hallucinations, and user group differentiation to improve the robustness and reliability of multimodal recommendation systems.

cs.IR · cs.LG · cs.MM

版本更新 · v2arXiv:2605.15790

Fairness-Aware Retrieval Optimization for Retrieval-Augmented Generation

Yingqi Zhao, Vasilis Efthymiou, Jyrki Nummenmaa, Kostas Stefanidis

原文摘要

Retrieval-Augmented Generation (RAG) grounds large language models (LLMs) in external knowledge, but the retrieved documents can systematically skew generated answers toward one group. This effect is difficult to analyze and control in top-k settings, where several documents at different context positions jointly shape the output. We present a three-stage framework for fairness-aware retrieval in top-k RAG. First, a probabilistic reranker sets the group composition of the retrieved context at each position, enabling controlled perturbation of retrieval bias without modifying the retriever. Second, we show that output bias is well approximated by a position-weighted linear function of position-wise retrieval bias, revealing model-specific positional sensitivities. Third, we use this model to formulate retrieval as an optimization problem that trades off relevance against predicted output bias, and propose FARO, a scalable solution to that problem which decomposes the globally coupled quadratic objective into independent per-query assignment problems through a Fenchel--Legendre dual reformulation. Experiments with four open LLMs, and political and gender bias as use cases show that the linear model predicts output bias on unseen configurations in 17 of 24 settings. FARO substantially reduces output bias in most settings, while, compared with a linear-programming baseline, FARO achieves similar relevance, remains feasible where the baseline does not, and scales better to larger query sets and candidate pools.

cs.DB · cs.IR

新论文 · v1arXiv:2611.13970

Counterfactual Analysis of Extent Leakage from Annotation-Derived Prompts in Vision-Language Medical Image Segmentation

Niran Nataraj, Ankita Das, C. Krishna Mohan, Kenji Kawashima

原文摘要

Text-guided segmentation models receive an image and a short caption about the lesion, and on public benchmarks the caption improves accuracy considerably. On colonoscopy and breast ultrasound, however, the size, count and location words of each caption were computed from the mask that later scores the prediction, and the chest X-ray captions were written by benchmark annotators. We tested what two published models take from them. On colonoscopy and chest X-ray, it is mostly the lesion's extent. Keeping only the size word or the lung-zone phrase recovers 84 to 98 percent of the improvement over an empty caption, and removing it loses 52 to 77 percent. The rest matters little, and a polyp called a rock is segmented just as well. We call this extent leakage. On breast ultrasound, nearly half the captions also name the diagnosis, which carries part of the benefit. Retraining on three datasets shows that models pick up this habit from their training captions, though only partly on breast ultrasound, and that it weakens their segmentation from the image alone. The leak can be measured without training a model, since caption words alone predict lesion area (coefficient of determination 0.54 to 0.77 on six of seven test sets). Without the test mask, the best method we tested, which estimates extent from the image, reaches 74.59 Dice on colonoscopy against the published 77.23. We propose an evaluation protocol that keeps what a caption says about the image apart from what it copies from the label.

eess.IV · cs.CV · cs.LG

版本更新 · v2arXiv:2611.07746

Volatility Heredity in Multivariate Time Series: A Statistically Guided Temporal Convolutional Approach to Variable Ordering

Kaoutar El Azaar, Mohamed Hamlich, Moncef Garouani, Franck Ravat, Asmae Chakir, Mohamed Tabaa

原文摘要

Volatility heredity concerns the information that past fluctuations in one series may carry about another after accounting for the target's own persistence. QS-TCN compares this dependence in both directions to estimate an order of temporal precedence. For each series, quasi-maximum likelihood estimation yields a persistence coefficient, and the matrix pencil method extracts temporal modes from the autocovariances of squared observations. These estimates define filters in a temporal convolutional network. The network models the target's squared observations from their own past and scores the association between the residuals and the filtered history of a candidate source. Differences between the two directional scores are aggregated into a global order. In an exploratory simulation with 100 systems in each of four volatility regimes, an ensemble of ten models trained with fixed seeds achieved higher mean ordering quality than CCF-AUC, a lead--lag method based on distance correlation, in every regime. Against CCF-AUC applied to squared standardized observations, the mean gains were 8.69 percentage points under positive linear coupling and 7.81 points when nonlinear coupling depended on the target's state. In the other two regimes, paired 95\% bootstrap intervals for the gains included zero. Mean agreement with reference constraints was 71.55\% across nine Finance systems and 54.02\% across 27 simulated functional magnetic resonance imaging systems, compared with 50\% expected under random ordering. In a panel of daily currency and gold returns, the estimated order placed the dollar--franc and dollar--yen exchange rates before gold.

cs.LG

新论文 · v1arXiv:2611.13968

Advancing a Global Framework for AI Safety and Governance for the Well-being of Humanity

Zeng Yi, Seán Ó hÉigeartaigh, Wang Zhengqi, Lu Enmeng, Chen Yu, Cao Gongce, Guo Xiaoyang, Kang Yanrong 等 76 位作者

原文摘要

The Report "Advancing a Global Framework for AI Safety and Governance for the Well-being of Humanity" is an important outcome of the AI Safety and Governance Program of World Internet Conference Specialized Committee on Artificial Intelligence in 2025. This report provides a systematic review of current global explorations and practices in AI safety and governance, identifies key issues that need to be addressed, and draws upon multilateral governance experiences from other domains. Centered on mechanism design, it explores how to build a global AI safety and governance system that ensures safety and security, promotes inclusiveness, clarifies responsibilities and accountabilities, strengthens effective coordination, and ensures authoritative and efficient governance. Guided by the principles of multilateralism and the vision of building a community with a shared future for humankind, the report proposes institutional measures and policy recommendations to establish a United Nations-centered global AI safety and governance framework. It aims to serve as a reference for governments, international organizations, enterprises, and research institutions. The report is to contribute insights and momentum to advancing people-centered and beneficial AI governance worldwide, ensuring that AI technologies truly serve the well-being of all humanity.

cs.CY

新论文 · v1arXiv:2611.13966

Controlled Knowledge Engineering for Taxonomy Induction with Tool-Grounded LLM Agents and Runtime-Adaptive Policies

Jonas Limniatis, Bennet Schaarmann, Georg Reuber, Robert Stahlbock

原文摘要

Taxonomies are structured knowledge representations that support semantic search, recommendation, product catalog organization, and retrieval-augmented generation. Their automated construction from a fixed set of candidate entities requires more than plausible text generation: the resulting hierarchy must be complete, structurally valid, and semantically coherent. Large Language Models (LLMs) are promising for this task, but iterative free-form generation remains vulnerable to omitted or hallucinated entities, invalid hierarchical relations, and inconsistent organizational principles. We introduce TIGA (Taxonomy Induction with Tool-Grounded Agents), a knowledge-engineering architecture that formulates taxonomy induction as an iterative decision process over an explicit state and constrained action space. TIGA combines executable taxonomy-editing tools, an memory that records tool calls, rationales, and outcomes, and a runtime-adaptive organizational policy that the agent revises during inference. An optional global reviewer evaluates the constructed taxonomy against the candidate set and the active policy. We evaluate TIGA on four benchmark taxonomies using two LLM backbones and compare it with single-shot and iterative prompting-based baselines. TIGA achieves the strongest structural-quality results in most evaluated configurations, but does not dominate on every precision measure. The gains are accompanied by substantially higher token consumption, API-call volume, and inference time. Ablation results show consistent benefits from the policy and interaction-memory components, whereas the effect of global review depends on the dataset and the available revision budget. These findings characterize tool grounding and runtime policy adaptation as promising but costly mechanisms for improving the controlled construction of structured knowledge representations.

cs.IR · cs.AI

版本更新 · v2arXiv:2611.03490

Delay-Certified Readiness Barriers for Overactuated Multirotor Allocation Without Lipschitz Constants

Giuseppe Silano

原文摘要

Overactuated multirotors can produce the same wrench with many rotor-speed combinations, some of which leave the vehicle unable to change its wrench quickly, e.g., to reject a gust. Readiness barriers keep this ability, the readiness, above a floor, but only in continuous time; with sampled commands and varying speed-controller delays, the available robustness bound covers less than one millisecond. We remove this limit by exploiting the structure of the problem: each rotor responds monotonically and in closed form to its own torque, so the speeds reachable under uncertain switching times lie in a cheaply computed box, and the lowest readiness over that box sits at a corner known in advance. This yields a Lipschitz-free test that a command keeps the readiness above its floor until the next sample, plus a fallback torque that keeps the vehicle on a certified plan. In hexarotor simulations with 2--40~ms delays and $\pm2$~ms jitter, the filter never violated the floor. At $10\pm2$~ms, it matched a delay-compensating predictor within the design envelope and cost 2--30\% more tracking error beyond it, where the predictor alone violated the floor in 2 to 16 of 16 missions. A tuned robust predictor was also safe with synchronous switching, but not with per-rotor jitter.

cs.RO · eess.SY · math.OC

新论文 · v1arXiv:2611.13965

Comparing WeChat and Telegram MiniApp Security Architectures: Toward Cross-Platform Analysis

Luca Ferrari, Billel Habbati, Luca Verderame

原文摘要

MiniApps are increasingly central to super-app ecosystems, yet architectural differences complicate the transfer of security analysis techniques across platforms. Existing WeChat analyzers rely on packaged applications and platform-specific APIs, limiting their direct applicability to Telegram's web-based MiniApps. We present a qualitative comparison of WeChat Mini Programs and Telegram MiniApps, grounded in official documentation, prior research, and manual analysis of a specific Telegram Android source revision. Using a shared taxonomy of security controls, assets, and threat sources, we examine execution environments, communication paths, and trust boundaries. WeChat provides a dedicated MiniApp runtime; Telegram combines web execution with host controls. Both retain developer responsibilities for backend authentication and resource authorization. Two worked examples derive requirements for cross-platform analysis: distinguishing credential roles and validation boundaries, and associating host capabilities with concrete execution contexts and permission handlers. These findings inform future automated analysis without ranking the ecosystems by security or claiming validated vulnerability detection.

cs.CR

版本更新 · v3arXiv:2611.09117

PathXAI: Evidence-guided structured pathology reporting by transferable tissue segmentation

Zhaorui Tan, Jun Aun Tan, Weixiang Zhong, Xiaoxi Wang, Tan Pan, Xingdong Xue, Li Liu, Jing Zhang 等 10 位作者

原文摘要

Pathology reporting translates tissue observations across regions and slides into diagnoses and supporting morphological descriptions, yet explicit tissue-composition measurements are rarely used to guide H&E-based report generation. We developed PathXAI, which pairs transferable tissue segmentation with a pretrained vision-language model. Because supplying tissue information directly with H&E images gave limited benefit, PathXAI-Report uses segmentation overlays and tissue statistics in separate steps, selects between candidate diagnoses by fixed rules, acquires further images when evidence is insufficient and records every step for review, without updating model weights. Its segmentation component exceeded baselines in mean Dice on internal and external tests. In automated evaluation on 1,200 public and 151 private cases, PathXAI achieved higher agreement with reference diagnoses and documented morphology than H&E-based comparators. On the public cohort, it exceeded Qwen+H&E by 4.4 percentage points in cancer family match rate and 5.7 percentage points in finding F1.

cs.CV · cs.CL

新论文 · v1arXiv:2611.13960

From Attack Surface to Defense Architecture: Compositional Security for Agentic Coding Harnesses

Simon Hegelich, Bardh Prenkaj, Habiba Sarhan, Morteza Shahrezaye, Kolja Hegelich, Christian Montag, Ralf Schneider, Erik Cambria

原文摘要

AI coding harnesses couple language models to shells, filesystems, and network sockets, turning the harness into an automated Living-off-the-Land (LotL) platform: once an adversary injects instructions into retrieved content, dual-use binaries such as bash, curl, and find become the payload. We argue that security in agentic systems is a structural property of the cognitive architecture and permission composition rather than an emergent property of individual models. Static regex blacklists miss structural evasions, whereas LLM-as-a-Judge guardrails incur high latency while over-blocking benign work. We present ActiveSecHarness, a neurosymbolic reference-monitor architecture built around Separation of Intelligence and Authority. It combines (1) Macaroon-inspired HMAC capability tokens across four Trust and Authority Rings, (2) a 2D product taint lattice $\mathcal{L} = \mathcal{L}_{\mathrm{trust}} \times \mathcal{L}_{\mathrm{sens}}$ and a workspace provenance ledger that prevents secret laundering across disk, (3) deterministic Ring-0 OS/tool guards, and (4) bytecode certificates, split-horizon audit logs, self-healing security test synthesis, and an adaptive UserWikiManager. Across $N=252$ fixtures ($120$ attack, $120$ benign, $12$ kill chains), a live local LLM judge (qwen3:4b) refuses $98.3\%$ of benign work at $142.3\,\mathrm{ms}$ latency, whereas Ring 0 achieves $\mathrm{ABR}=1.000$ and $\mathrm{FPR}=0.000$ in $12.7\,μ\mathrm{s}$ ($11{,}200\times$ faster). In a multi-step trajectory ablation, an oracle Conseca-style stateless policy misses $4/12$ kill chains ($\mathrm{ABR}=0.667$) and coarse Boolean taint blocks $83.3\%$ of benign workflows, while our 2D product lattice achieves $\mathrm{ABR}=1.000$ and $\mathrm{FPR}=0.000$ at $\approx 20\,μ\mathrm{s}$ per step.

cs.CR · cs.AI

版本更新 · v2arXiv:2609.06355

Adaptive stabilization of a leaderless bearing-constrained formation with disturbances

Minh Hoang Trinh, Chuong Van Nguyen, Quoc Van Tran, Tuynh Van Pham

原文摘要

In this paper, we consider the problem of regulating and maintaining a target formation characterized by a set of bidirectional bearing constraints under disturbances. The agents in the formation are modeled by single integrators with deterministic bounded continuous disturbances of which both actual function and upper bound are unavailable for the control design. Due to the time-varying disturbances, the target formation is time-varying. We propose displacement/bearing-only based adaptive sliding mode control laws to uniformly asymptotically stabilize the time-varying target formation and reject the matched disturbances, and provide sufficient conditions to prevent possible collisions. A time-dependent adaptive design method is provided to convert the displacement-based control law to a bearing-only one. In addition, to alleviate chattering phenomena from sliding mode control, smooth adaptive control laws are introduced to guarantee uniform global boundedness of the desired formation. Finally, simulation results are given to support the analysis.

cs.MA · math.OC

版本更新 · v2arXiv:2609.10114

Policy Change for Treelike Monitors

François Hublet, Dhruv Nevatia, Joshua Schneider

原文摘要

We study the policy change problem that arises in the runtime verification of long-running systems. The online monitors typically used in this context are generally treelike, in that they maintain substates that monitor subformulae of the target policy. We consider when and how the policy can be changed while the monitored system is running by only exploiting the information stored in the monitor's state. This is relevant, for example, to account for new system functionality or changes in regulatory requirements. We formally define the policy change problem in a general setting, independent of any specific (treelike) monitor implementation. We then show that policy change for past-time metric temporal logic (pMTL) is decidable but has tight non-primitive recursive lower and upper bounds, while with discrete-time semantics it is EXPSPACE-complete.

cs.LO

新论文 · v1arXiv:2611.13957

AVCC: Audio-Visual Conversation Corpus for Turn-Taking Prediction with a Human Benchmark

Haotian Qi, Gabriel Skantze

原文摘要

} Predicting who will speak next, and when, is a prerequisite for conversational agents and social robots that take turns without waiting for silence. Multiparty next-speaker prediction (NSP) has been studied on corpora with per-speaker sensors, each with its own event definitions. No public benchmark covers the single camera and microphone a robot has, and no model has been compared against how well people perform the same prediction. We turn AVCC, a 31-hour audio-visual corpus of two- and three-speaker online conversation recorded with a single static camera and microphone, into a public NSP benchmark. We add a speaker-disjoint seven-video test partition with 865 hold and 865 shift events at mutual-silence gaps, word-level forced-aligned transcripts for the whole corpus, and a human reference benchmark collected at the same events. We score an audio-only Role-Relative VAP model (RoleVAP) and the multimodal MuVAP model. Labels, transcripts, per-response human data, and the scripts that reproduce every number are released.

cs.CL · cs.HC · cs.SD

新论文 · v1arXiv:2611.13955

RB-LDC: Redundancy-Balanced Latent Coding for Noise-Robust Diffusion Latents

Hyunseok Jeong, Jaeho Jeon, Young-Sik Kim

原文摘要

Latent diffusion models decode approximately correct latents, making decoder sensitivity to perturbations relevant to image quality. After whitening, forward diffusion corrupts every direction at the same signal-to-noise ratio (SNR), despite unequal decoder sensitivities. We study an invertible linear layer between the encoder and diffusion process that shifts each direction's log-SNR. Its linear minimum mean-square-error (LMMSE) recovery risk has an exact spectral expression for any whitened latent distribution. Under an energy budget and a floor ensuring invertibility, minimizing decoder-sensitivity-weighted LMMSE risk integrated over the diffusion schedule yields a unique optimal allocation. The layer aligns with the decoder's expected pullback metric and equalizes marginal risk reduction across directions, computed by a deterministic spectral solver. At large budgets, the allocation follows a power law in sensitivity whose exponent is determined by the low-SNR tail of the loss weighting: one half for noise prediction and two thirds for data prediction under the cosine schedule, with a crossover on truncated schedules. We instantiate this principle as RB-LDC using Jacobian-based sensitivity estimates. On ImageNet at 256 x 256 resolution with SD-VAE and VA-VAE, trained RB-LDC improves reconstruction from noisy latents over budget-matched isotropic coding in all four metrics and five coding configurations, averaged over 15 SNRs and three pipeline seeds. It reduces average perturbed FID by 17.1 for VA-VAE block-local coding while preserving clean reconstruction. We also report intermediate SNRs where perturbed FID worsens. With a frozen diffusion model, RB-LDC yields lower FID point estimates in all 12 tested combinations of sampling progress and channel SNR under corruption during sampling.

cs.LG · cs.CV

版本更新 · v2arXiv:2602.21268

A Dynamic Survey of Soft Set Theory and Its Extensions

Takaaki Fujita, Florentin Smarandache

原文摘要

Soft set theory provides a systematic framework for parameterized decision-making by associating each parameter with a subset of a given universe, thereby enabling structured representations of uncertainty [1, 2]. Over the past decades, the theory has evolved into a broad range of extensions, including hypersoft sets, superhypersoft sets, TreeSoft sets, bipolar soft sets, and dynamic soft sets, while also establishing connections with various mathematical disciplines, particularly topology and matroid theory. This book presents a comprehensive survey of soft set theory and its principal extensions, with particular emphasis on parameter spaces, value spaces, representative mathematical constructions, and the underlying assumptions necessary for rigorous comparisons among different frameworks. It carefully distinguishes established definitions from the literature from exploratory formulations and critically examines the limitations of selected claims concerning representation and reduction. Building upon the first edition, this second edition introduces additional concepts and illustrative examples, addresses previously identified mathematical inconsistencies and typographical errors, and refines the overall structure and presentation to enhance mathematical rigor, clarity, and readability.

cs.AI · math.CO

新论文 · v1arXiv:2611.13952

Geometry-Dependent Approximation and Stability Properties of Shallow ReLU$^k$ Networks on Bounded Euclidean Domains

Yuqing Liu, Tong Mao, Jinchao Xu

原文摘要

On bounded Euclidean domains, we study how hidden-parameter geometry affects shallow ReLU$^k$ networks through results on approximation rates, saturation-type lower bounds, Gram and stiffness matrix spectra, Bernstein and Marcinkiewicz--Zygmund inequalities, discrete least-squares recovery, and inverse approximation. Our analysis uses smooth localization and dyadic Fourier estimates. We quantify parameter geometry by the fill distance $h$ and antipodal separation distance $\underline h$. For the prescribed network space $L_n^k$, representative approximation estimates take the form \begin{equation*} \begin{aligned} \inf_{g_n\in L_n^k}\|f-g_n\|_{\mathcal L^2(Ω')}&\lesssim h^r\|f\|_{\mathcal H^r(Ω)},\\ \inf_{g_n\in L_n^k}\|f-g_n\|_{\mathcal L^2(Ω)}&\gtrsim \underline h^{\frac{d+2k+1}{2}}\|f\|_{\mathcal L^2(Ω')}. \end{aligned} \end{equation*} The upper bound exploits target regularity up to the critical order $\frac{d+2k+1}{2}$, while the lower bound applies asymptotically to fixed targets smoother than this order. The upper estimate holds on an interior subdomain $Ω'$, whereas the lower estimate concerns the larger domain $Ω$. We also obtain geometry-dependent spectral estimates that quantify conditioning and coefficient stability. Further results establish norm discretization and regularized recovery from function values, and infer target regularity from approximation rates under coefficient or separation conditions. Altogether, these results describe how parameter geometry governs approximation accuracy, the stability of coefficient representations, discrete recovery, and the regularity information contained in convergence rates.

cs.LG · math.NA

版本更新 · v2arXiv:2611.06625

Dynamic Shape Control of Soft Trunk Robots

Hehui Zheng, Marc Stampanoni, Roshan S. Kaundinya, Ronan Hinchet, George Haller, Robert K. Katzschmann

原文摘要

Controlling the shape profile of soft trunk robots extends their reach into complex regions of the workspace and enhances their use in practical applications. Recent advances in soft robot design have enabled soft trunk robots to achieve greater flexibility in conforming to complex shapes. Specifically, trunk robots whose geometries are designed as helicoids have been shown to enable extreme shape-changing capabilities. Their compliance makes them highly nonlinear, which in turn makes shape control difficult. On similar tendon-driven trunk robots, model-based controllers based on the theory of adiabatic spectral submanifolds (aSSMs) have achieved high accuracy in closed-loop end-effector tracking. We extend this approach by learning an aSSM model of the full body of a trimmed-helicoid soft trunk robot from data and use this in a model predictive control (MPC) scheme to demonstrate a range of shape control tasks on hardware. On closed-loop dynamic shape regulation, our method outperforms the available linear baselines by a factor of 10. In human-in-the-loop interactive demos, our method completes section-by-section shaping and balances a tennis ball for over 25 seconds, while the linear baselines fall short. A model-free reinforcement learning policy trained for 12 hours on hardware fails on the same balancing task. These results establish aSSM-based MPC as a practical route to full-body shape control on real soft hardware.

cs.RO

新论文 · v1arXiv:2611.13950

Real-Time String Indexing in Optimal Time

Gregory Kucherov, Yakov Nekrich

原文摘要

In this paper we describe the first fully real-time indexing solution for pattern matching over an arbitrary integer alphabet. Our data structure spends $O(1)$ worst-case time w.h.p. for processing each new letter appended to $T$ and worst-case $O(|P|+occ)$ time for reporting all occurrences of $P$, where $T$ and $P$ are strings over an integer alphabet. The main idea of our solution is a novel representation of the suffix tree, the path-decomposed suffix tree, which does not store the full topology of the suffix tree but instead decomposes it into paths, each stored in a dictionary that encodes parent--child relationships indirectly.

cs.DS

版本更新 · v3arXiv:2509.23484

Accurate Predictions in Education with Discrete Variational Inference

Tom Quilter, Anastasia Ilick, Karen Poon, Richard Turner

原文摘要

One of the largest drivers of social inequality is unequal access to personal tutoring, with wealthier individuals able to afford it, while the majority cannot. Affordable, effective AI tutors offer a scalable solution. We focus on adaptive learning, predicting whether a student will answer a question correctly, a key component of any effective tutoring system. Yet many platforms struggle to achieve high prediction accuracy, especially in data-sparse settings. To address this, we release the largest open dataset of professionally marked formal mathematics exam responses to date. We introduce a probabilistic modelling framework rooted in Item Response Theory (IRT) that achieves over 80 percent accuracy, setting a new benchmark for mathematics prediction accuracy of formal exam papers. Extending this, our collaborative filtering models incorporate topic-level skill profiles, but reveal a surprising and educationally significant finding, a single latent ability parameter alone is needed to achieve the maximum predictive accuracy. Our main contribution though is deriving and implementing a novel discrete variational inference framework, achieving our highest prediction accuracy in low-data settings and outperforming all classical IRT and matrix factorisation baselines.

cs.AI

版本更新 · v3arXiv:2603.13786

Projection-Free Evolution Strategies for Continuous Prompt Search

Yu Cai, Canxi Huang, Xiaoyu He

原文摘要

Continuous prompt search offers a computationally efficient alternative to conventional parameter tuning in natural language processing tasks. Nevertheless, its practical effectiveness can be significantly hindered by the black-box nature and the inherent high-dimensionality of the objective landscapes. Existing methods typically mitigate these challenges by restricting the search to a randomly projected low-dimensional subspace. However, the effectiveness and underlying motivation of the projection mechanism remain ambiguous. In this paper, we first empirically demonstrate that despite the prompt space possessing a low-dimensional structure, random projections fail to adequately capture this essential structure. Motivated by this finding, we propose a projection-free prompt search method based on evolutionary strategies. By directly optimizing in the full prompt space with an adaptation mechanism calibrated to the intrinsic dimension, our method achieves competitive search capabilities without additional computational overhead. Furthermore, to bridge the generalization gap in few-shot scenarios, we introduce a confidence-based regularization mechanism that systematically enhances the model's confidence in the target verbalizers. Experimental results on seven natural language understanding tasks from the GLUE benchmark demonstrate that our proposed approach significantly outperforms existing baselines.

cs.CL · cs.NE

新论文 · v1arXiv:2611.13946

TreeAgent: Structure-Aware Memory Agent for Processing Long Hierarchical Data

Wei Gu, Weiwei Qi, Jiajun Tang, Tianhang Zheng, Bo Chen, Zhibo Zhang, Jinfei Liu, Kui Ren

原文摘要

Practical Web applications increasingly require agents to interpret long conversations or documents. For inputs exceeding the context windows of large language models (LLMs), memory agents process segments sequentially and retain past information in bounded memory. However, they typically divide inputs into flat token segments without preserving structure or hierarchy, causing three limitations for structured data such as API responses or HTML documents. First, fixed-length segmentation can split fields of the same record, breaking their relationships. Second, segments lack hierarchical information, obscuring their structural context and positions. Third, successive memory updates may discard details of earlier sibling records needed for reasoning on later segments. To address these limitations, we propose TreeAgent, a structure-aware agent that uses the input hierarchy to guide both segment-wise context processing and access to past information. Specifically, TreeAgent constructs segments from complete subtrees and groups of adjacent sibling subtrees to preserve local structural relationships. We provide theoretical guarantees on segment counts to guide token budget selection toward matching the segment count of fixed-length segmentation. We further attach structural paths to the segments for the agent to identify their ancestors and hierarchical positions. We also introduce residual memory links from the segments of low-level children to the segments of high-level parents, enabling direct information flows beyond successive memory updates. We evaluate TreeAgent with four representative memory agents on eight retrieval and aggregation tasks. The inputs are derived from real-world application data in JSON, HTML, YAML, and JavaScript and range from 8K to 1M tokens. TreeAgent improves the average score across the four datasets for all four agents, with 3.61% performance gain on average.

cs.AI

版本更新 · v2arXiv:2611.12067

XposedMIA: Exploiting Explainable Artificial Intelligence (XAI) for One-Shot Membership Inference Attacks

Omar Hamdache, Serdar Kara, Kıvanç Kuzey Dikici, Abdullah Çağlar Öksüz, Anisa Halimi, Erman Ayday, Sinem Sav

原文摘要

Machine learning (ML) services increasingly expose explainability outputs alongside model predictions. While such explanations are intended to improve transparency, they may also reveal information about the underlying training data. In this work, we show that the local surrogate geometry employed by Local Interpretable Model-agnostic Explanations (LIME) can be repurposed as a proxy for a sample's distance to the model's decision boundary. We extend this boundary-distance view to tabular counterfactual explanations and, for the first time, to visual counterfactual explanations for image classifiers. We present XposedMIA, a one-shot, explanation-based black-box membership inference attack (MIA) framework that converts the returned explanation into a proxy for the queried sample's distance to the model decision boundary. After a one-time calibration step on a small labeled calibration set of as few as 30 samples, our attack requires only a single query for each target sample. Unlike prior label-only attacks requiring iterative queries or shadow training, our method relies solely on the predicted label and its accompanying explanation. Our evaluation indicates that XposedMIA achieves high effectiveness, with success rates of up to 0.95 using only a single query per target, revealing that releasing explanations introduces an additional channel for membership leakage.

cs.LG

新论文 · v1arXiv:2611.13945

Chem World: A Large-Scale Benchmark and Physics-Aware Framework for Trustworthy Molecular Property Prediction

Tianyou Bai, Huan Wang, Mingchen Gao, Tongrui Yang, Fangyue Lin, Pinze Ren, Zhenlin Zhao, Siming Dong

原文摘要

Molecular property prediction is fundamental to computational chemistry and drug formulation research, yet existing benchmarks remain fragmented across datasets, properties, and evaluation protocols, limiting systematic evaluation of model generalization. We introduce Chem World, a large-scale benchmark integrating 17 public datasets with over 800,000 molecular and chemical-system instances across 10 property tracks, covering single-molecule and multi-component systems, including drug solubility. Chem World provides a unified testbed for evaluating molecular representations and compositional modeling across diverse chemical properties. Building on the benchmark, we propose PACM (Physics-Aware Compositional Modeling), which combines molecular representations with composition-aware modeling and domain-specific physical constraints. Extensive experiments show that molecular language models provide strong and transferable representations, while PACM consistently improves prediction across diverse chemical systems. Chem World and our PACM-powered drug-property prediction Agent support generalizable chemical modeling and offer a foundation for AI-assisted biomedical research and drug formulation development.

cs.LG · cs.AI

新论文 · v1arXiv:2611.13943

HERO-D3QN: Inter-Cluster Routing with Energy-Aware Soft Constraints in Wireless Sensor Networks

Weihao Wang, Heng Yang, Guangbo Chen, Shanshan Li, Jiulin Guo, Ajay Kaushik, Fangwei Li, Junrui Hao 等 9 位作者

原文摘要

Inter-cluster forwarding in wireless sensor networks can concentrate energy consumption on frequently selected relays, while hard energy thresholds restrict forwarding choices as residual energy declines. We propose Hierarchical Energy-balanced Routing Optimization based on a dueling double deep Q-network (D3QN), termed HERO-D3QN. Given the cluster structure, the method combines direction- and cost-based relay screening with energy-aware soft constraints. Relays below an adaptive energy threshold remain eligible if the other selection criteria are met. An enhanced state representation captures relay energy, progress toward the sink, potential forwarding load, and hotspot risk, and a multi-objective reward guides learning. In the comparison with D3QN using the same node locations, HERO-D3QN delayed first-node death (FND) from time step 629 to 1269 and reduced peak residual energy variance by 55.5%. In the ablation study, the full method achieved the latest FND and half-node death (HND) and the largest cumulative transmitted volume (170.52 Mbit) among the tested variants. Across five seed settings in which node locations and the random processes used in training and evaluation varied jointly, the coefficients of variation of FND, HND, and transmitted volume were 8.26%, 2.75%, and 3.88%, respectively. These results demonstrate the effectiveness of HERO-D3QN in delaying early node failure and reducing peak energy dispersion.

cs.NI

新论文 · v1arXiv:2611.13942

Data4Cyber: Labeled Cyber-Physical Datasets for Distribution-Grid Management Systems Under Representative OT Attacks

Ömer Sen, Lennart Bader, Marawan Emara, Martin Serror, Benedikt Schwalm, Junichi Tsurumi, Tatsumi Oba, Tomohiro Izawa 等 9 位作者

原文摘要

Cyberattacks against power systems increasingly exploit industrial communication and control dependencies arising from distributed energy resources (DER), remote management, and market-based incentives. Progress on intrusion detection is constrained by a lack of public datasets that align operational technology (OT) network telemetry with physical measurements and control context. Data4Cyber is a labeled cyber-physical dataset recorded in a laboratory distribution management system (DMS) for self-consumption optimization with photovoltaic generation, battery storage, controllable loads, and substation metering. It captures synchronized process measurements, controller context, price incentives, and packet captures (Modbus/TCP and MQTT) across one benign baseline and six attack scenarios spanning protocol-semantic Modbus manipulation, man-in-the-middle (MitM) false-data injection, and MQTT price manipulation. Its fixed 1 s time base, phase-resolved labels, and state-oriented representation support temporally blocked stateful-detector evaluation. Baseline results show that high recall alone is insufficient: several detectors achieve sensitivity through alarm saturation. Context-driven attacks require process-aware interpretation rather than single-channel thresholding.

cs.CR

新论文 · v1arXiv:2611.13941Google DeepMind

PARDIG: Global Precipitation Estimates Learned from Sparse Satellite Observations

Guy Shalev, Stephan Rasp, Boris Babenko, Andrew El-Kadi, Mohammed Alewi Hassen, Samier Merchant, Fred Zyda, Dominic Masters 等 17 位作者

原文摘要

Estimating precipitation at the global scale is vital for Earth system science and disaster response, yet observational coverage and measurement precision remain constrained. Existing solutions provide options that trade off desirable traits such as skill, latency, geographical coverage, temporal coverage, and spatial and temporal resolution. We present PARDIG, an artificial intelligence framework based on a spherical graph-mesh transformer architecture that produces near-real-time global precipitation estimates. PARDIG is trained on dense multi-modal inputs, including atmospheric state analyses and multi-spectral geostationary satellite imagery, to predict sparse, high-precision precipitation measurements from spaceborne radar. At inference, the trained model is applied densely across the globe at $0.1^\circ$ spatial and 15-minute temporal resolution, producing complete near-real-time precipitation fields from 2016 to the present, alongside a historical variant extending the record back to 1999. Evaluation against three independent radar networks (over the US, Europe, and Japan) and against over 36,000 surface stations worldwide shows that PARDIG consistently outperforms IMERG V07 (Final and Early), MSWEP V3, ERA5, and HRES across precipitation thresholds and regions, with the largest improvements at extreme intensities. Case studies of extreme precipitation events demonstrate that PARDIG successfully captures their spatial structure and timing. The improvements also extend to forecasting: WeatherNext 3, a global weather model, produces more skillful precipitation forecasts when trained to predict PARDIG. Both the historical and near-real-time PARDIG datasets are openly available under a CC BY 4.0 license.

cs.LG

版本更新 · v2arXiv:2604.22549

ASPIRE: Make Spectral Graph Collaborative Filtering Great Again via Adaptive Filter Learning

Yunhang He, Cong Xu, Zhangchi Zhu, Hongzhi Yin, Wei Zhang

原文摘要

Graph filter design is central to spectral collaborative filtering, yet most existing methods rely on manually tuned hyperparameters rather than fully learnable filters. We show that this challenge stems from a bias in traditional recommendation objectives, which induces a spectral phenomenon termed low-frequency explosion, thereby fundamentally hindering the effective learning of graph filters. To overcome this limitation, we propose a novel adaptive spectral graph collaborative filtering framework (ASPIRE) based on a bi-level optimization objective. Guided by our theoretical analysis, we disentangle the filter learning objective, which in turn leads to excellent recommendation performance, spectral adaptivity, and training stability in practice. Extensive experiments show our learned filters match the performance of carefully engineered task-specific designs. Furthermore, ASPIRE is equally effective in LLM-powered collaborative filtering. Our findings demonstrate that graph filter learning is viable and generalizable, paving the way for more expressive graph neural networks in collaborative filtering. Our code is available at https://github.com/yhhe2004/ASPIRE.

cs.IR

版本更新 · v2arXiv:2611.04785

Kierston & KierstonBench: Simulation of Allentown, PA and Evaluation of Language Models in Crime Investigation and Surveillance Tasks

Andrew Semenov, Svyatoslav Dorofeev

原文摘要

Large language models are candidates for collecting and analyzing records in criminal investigations and mass surveillance. Their capability and accuracy in this work cannot currently be measured. Real deployments lack the ground truth needed to score a model's conclusions, and no benchmark evaluates these capabilities in a simulated environment. We present Kierston, a city-scale simulation engine, and KierstonBench, a benchmark that tests these capabilities against known simulated events. Kierston models approximately 125,000 residents of Allentown, Pennsylvania, generating their daily activities and the telecommunications, financial, administrative and license-plate records that surveillance and investigative systems collect about them. These records derive from a common behavioral timeline and are distributed across sources representing separate providers. Models investigate through a restricted records interface, linking observations across sources without access to the underlying simulation. The benchmark comprises 32 task families covering record linkage, routine reconstruction, incident investigation and assessment of deceptive accounts. In an evaluation of sixteen language models, most could not perform records investigation and submitted identifications the records did not support. A small number of frontier models solved most of the tasks and abstained when evidence was insufficient. In some cases these models still fell for common deceptions and assumptions, and none replaced an investigator.

cs.AI

版本更新 · v2arXiv:2611.11378

SegDis: Foreground Segmentation Followed by Type Discrimination for Salient and Camouflaged Object Detection

Dingning Luo, Shuo Dou, Tong Jiang, Zhenhua Duan, Jiachen Zhu, Xianfeng Li

原文摘要

Salient and camouflaged object detection (SOD and COD) both recover foreground support, yet most joint methods output only a binary mask and therefore cannot distinguish the type. USC12K distinguishes the two types, but its baseline USCNet still binds foreground existence to the type within a single normalization, so the failure source cannot be attributed. Our cross-task study shows that foreground localization transfers between SOD and COD, whereas type discrimination does not: a COD-only model recovers foreground on SOD images but its type judgement follows the training distribution rather than the foreground-background relation, so the two decisions require separate mechanisms. SegDis factorizes the output into an explicit foreground probability and a conditional type probability given foreground: FLR provides high-quality task-agnostic support, and RTA refines the SOD/COD assignment from the foreground-background relation without a task identifier. Because support is explicit, each ground-truth foreground pixel is classified as correct-type, type-swapped, or missed, so foreground-recovery and type-assignment errors are diagnosed separately. With PVT-v2-B2, SegDis attains 68.98% FG-mIoU and 78.35% mIoU on USC12K at about one-eighth of USCNet's parameters; CSCS is 5.75.

cs.CV