Your paper timeline
Scroll AI takes the way you would scroll a great paper aggregator: quick signal first, deeper critique when something earns your attention, and challenges when a claim feels off.
698 papers in cs.AI
Trending mixes fresh papers with community signal.
0
cs.LGcs.AInlin.CD Tobias G\"obel, Miranda C.N. Cheng · Oct 22, 2026

Parametric dynamical systems supply a rare benchmark with analytic ground truth for weight-space methods, because bifurcation locations are known exactly. The paper extends JEPAWG—a joint-embedding hypernetwork originally developed for lattice field theories—to populations of forecasters trained across a grid of control parameters. Its core idea is to decode weights at unseen parameters and measure their parameter derivative $G(p) = \|\nabla_p \hat{\theta}(p)\|_F$, treating this response as an interpretable probe of local and global bifurcations. The work matters because it offers a falsifiable testbed for reading physical structure directly from the geometry of trained network weights.

Trained network weights are increasingly treated as data, but there is rarely ground truth about what a population of models should encode, which hampers systematic validation of weight-space methods. This makes parametric dynamical systems a natural test-bed: the dynamics change qualitatively at submanifolds of parameter space that are, in well-studied families, known analytically or numerically. Fine-tuning a forecasting network at each point of a parameter grid yields a model zoo indexed by a physical parameter, against which weight-space diagnostics can be checked. We build such model zoos for four dynamical systems and analyse them with JEPAWG, a recently proposed joint-embedding hypernetwork built around a learned parameter--weight representation. It was first introduced for neural samplers for lattice field theories, where its latent geometry located the phase transition and estimated the 2D Ising critical exponent. Applied to dynamical systems, JEPAWG is competitive on forecasting with a hypernetwork trained directly for that task, despite being supervised on the parameter--weight correspondence rather than on forecasts. Beyond forecasting, the norm of the parameter-derivative of the decoded weights locates Hopf points and curves, tracks a period-doubling cascade closely enough to give a qualitative estimate of the Feigenbaum constant, and detects a global bifurcation, which has no eigenvalue signature and is therefore invisible to linearisation. As such, JEPAWG provides interpretable insight into the dynamics that is not available from other hypernetworks. Together, these results indicate that JEPAWG is a workable instrument for reading physical structure off a population of trained networks.
0
cs.AI Zhihui Zhu · Oct 22, 2026

World models have become a buzzword spanning everything from video generators to robot policies, yet the term remains loosely defined. This paper tackles the ambiguity by placing generalist agents in a POMDP framework and showing that policies, forward dynamics, and inverse dynamics are simply different conditional distributions factorized from the same joint distribution over observations and actions. Written as a conceptual introduction rather than an empirical survey, it aims to clarify modeling principles and connections across classical control, reinforcement learning, and modern generative approaches.

World models have recently emerged as a promising direction toward developing generalist agents capable of understanding, predicting, and interacting with diverse environments. However, despite growing interest, the concept of a world model remains loosely defined, encompassing approaches ranging from predictive dynamics models and learned simulators to models that jointly generate future observations and actions. This introductory paper aims to clarify the concept of world models and provide a unified perspective on their role in developing generalist agents. Starting from the partially observable Markov decision process (POMDP) framework, we connect world modeling to classical control, dynamical systems, signal processing, and reinforcement learning. We introduce different approaches to world modeling, emphasizing the knowledge they capture, their learning objectives, and how they support decision-making. We further explore the relationship between world modeling and policy learning, highlighting how these capabilities can be unified through conditional prediction without requiring separate models. Rather than offering an exhaustive survey of existing methods, this paper focuses on fundamental concepts, modeling principles, and connections, with the goal of providing an accessible and unified introduction to world models for generalist agents.
0
cs.CVcs.AI Dominik Engel, Yousef Rajeh, Leon Sick et al. · Oct 22, 2026

Open-vocabulary 3D segmentation relies on CLIP features lifted into Gaussian reconstructions, but raw cosine similarity ignores scene-specific directional concentration. This paper proposes a query-time calibration pipeline that subtracts a shared scene direction, whitens text prototypes with a fixed generic reference vocabulary, and recalibrates scores via soft clustering or a CSLS-based relevance margin. The result is a training-free boost in mIoU across seven lifting methods and four datasets, demonstrating that simply changing how features are compared can be as impactful as redesigning the lifting itself.

Lifting vision-language features such as CLIP into 3D Gaussian reconstructions enables open-vocabulary segmentation through natural-language queries. Although CLIP represents a broad range of semantic concepts, the lifted features of individual scenes can exhibit strong directional concentration, while raw cosine similarity does not account for the scene-specific feature distribution. We show that substantial segmentation gains can be obtained by changing how a fixed lifted feature field is compared with text. Our method partially subtracts a shared scene direction from visual features and text prototypes and whitens text prototypes using a fixed reference vocabulary of generic terms. It then uses soft clustering for multiclass prediction and CSLS with a relevance margin against the reference vocabulary for single-query prediction. Beyond reducing directional concentration, scene centering improves class-relative feature separation in every evaluated scene. Across seven lifting methods and four datasets, the resulting query-time calibration consistently improves mean intersection over union in both multiclass and single-query segmentation. These gains require no retraining, source-image re-encoding, or feature re-lifting, demonstrating the value of scene-conditioned comparison for making better use of existing lifted representations.
0
cs.AIcs.LG Aitor Oviedo-Madrid, Mabel Morales-Otero, Jose Gonzalez-Gomariz et al. · Oct 22, 2026

The paper addresses the gap between restrictive linear Gaussian Bayesian networks and computationally expensive fully semiparametric models for continuous variables. It proposes Semi-Linear Gaussian Bayesian Networks (SLGBN), which preserve Gaussian conditional distributions while allowing nonlinear conditional means via generalized additive models with penalized B-splines. The core contribution is a unified framework that mixes linear and nonlinear nodes within a single network, learned through a greedy hill-climbing algorithm with BIC or an extended EBIC* score.

Bayesian networks for continuous variables often rely on restrictive assumptions: linear Gaussian models lack flexibility to capture nonlinear dependencies, while non-parametric approaches provide greater flexibility at a high computational cost. This creates a gap for modeling scenarios where variables are approximately Gaussian but exhibit nonlinear relationships. We introduce Semi-Linear Gaussian Bayesian Networks (SLGBN), a novel class of continuous Bayesian networks designed to bridge this gap, preserving Gaussian conditional distributions while introducing nonlinear conditional mean functions. The proposed framework provides a unified probabilistic framework combining linear Gaussian and nonlinear Gaussian conditional models within the same Bayesian network Nonlinear conditional mean functions are estimated using generalized additive models (GAMs) with penalized B-splines. We present parameter estimation procedures for both types of nodes, as well as a greedy hill-climbing algorithm for learning the network structure under the SLGBN framework. To assess its performance, we compare SLGBN with other continuous Bayesian network models, including semiparametric Bayesian networks (SPBN) and Linear Gaussian Bayesian networks (LGBN). Experimental results evaluate both goodness of fit and the ability to recover the underlying network structure. The results show that, in the presence of nonlinear Gaussian relationships, SLGBN achieves better fit and improved structure recovery compared to alternative models, particularly when combined with the Extended Bayesian Information Criterion (EBIC*) score. Furthermore, by retaining Gaussian conditional distributions, SLGBN offers computational advantages over fully semiparametric approaches.
0
eess.IVcs.AIcs.CV David Hamlyn, Sunny Chaudhary, Jonathon Hare et al. · Oct 22, 2026

Accurate intra-hour solar irradiance forecasting from ground-based sky images is essential for grid balancing and storage scheduling as PV penetration rises. GateFormer tackles this by embedding observed global horizontal irradiance directly into a Vision Transformer token stream, then producing two complementary forecasts—a multi-step trajectory and a direct final-horizon displacement—that are adaptively blended and residual-corrected in prediction space. The core claim is that this forecast-space decomposition, rather than conventional latent fusion or ensemble combination, yields consistent gains across three heterogeneous sky-imaging datasets.

Sub-hourly dispatch, balancing, and storage control increasingly depend on forecasts that anticipate rapid variability in solar generation. Accurate sky-image-based irradiance forecasting requires a combination of visual cloud dynamics with recent irradiance state while adapting to different short-term irradiance-change regimes. To address this, we introduce GateFormer, a GHI-conditioned dual-decoder ViT for intra-hour global horizontal irradiance (GHI) forecasting through forecast-space decomposition. GateFormer embeds observed GHI into the visual token stream, allowing interaction with sky-image patch features through self-attention. From this shared representation, a Trajectory Head predicts future GHI sequence, while a Delta Head predicts final-horizon change from the latest observed GHI. The two final-horizon forecasts are adaptively weighted in prediction space, with magnitude- and direction-supervision targeting the remaining error. On the NREL-TSI benchmark, GateFormer attains 125.01 W/m^2 RMSE at +30 min, improving over a state-of-the-art transformer baseline by 9.6% under paired-timestamp evaluation. Across NREL-TSI, Chilbolton, and SIRTA, GateFormer achieves the lowest final-horizon RMSE among the evaluated baselines, with forecast skill of 22.97-28.86% relative to smart persistence. Component ablations show adaptive weighting outperforms both individual decoders and fixed averaging, distinguishing GateFormer from conventional forecast combination, while the supervised correction further reduces RMSE by 1.68 W/m^2 and MAE by 4.86 W/m^2. Ramp-regime diagnostics show larger gains during operationally important positive ramps, reducing RMSE by 26.27 W/m^2. These results identify forecast-space decomposition as an alternative forecasting formulation, with potential relevance to other multimodal short-horizon forecasting tasks and deployment using only sky images and measured GHI.
0
cs.AI Yinyu Lan · Oct 22, 2026

PopDRP tackles multimodal brain-disorder diagnosis by learning population graphs whose edges encode who-should-influence-whom across subjects. The core problem is that demographic or acquisition similarity does not imply diagnostic agreement, so naive similarity graphs leak confounders. The authors propose a three-stage pipeline: Contrastive Affinity Refinement (CAR) calibrates non-imaging affinities toward training-label agreement; Neural Graph Rectification (NGR) fuses imaging and non-imaging features to denoise the graph via reconstruction and dual-view alignment; and a Selective Pyramid State-Space (SPSS) backbone performs input-dependent state updates within a hierarchical U-Net graph encoder. The idea matters because site and demographic noise are chronic problems in neuroimaging cohorts, and refining edges with label priors could in principle boost cross-subject information sharing.

Population graph learning supports brain disorder diagnosis by sharing information across subjects. Its effectiveness, however, depends on whether the relationships guiding this exchange are relevant to diagnosis. Similarity in demographic or acquisition attributes does not necessarily indicate diagnostic agreement, and heterogeneous subjects may require different representation updates within the same population graph. We propose PopDRP, a framework that combines diagnosis-guided relation refinement with hierarchical selective state-space learning. Using only training labels, Contrastive Affinity Refinement calibrates attribute-based affinities according to diagnostic agreement. Neural Graph Rectification then refines these relationships using fused functional-connectivity and non-imaging representations, guided by graph reconstruction and dual-view alignment objectives. On the resulting graph, a Selective Pyramid State-Space backbone integrates input-dependent state updates, graph diffusion, and hierarchical pooling and unpooling to learn population representations at multiple resolutions. Together, these components connect the refinement of inter-subject relationships with selective representation learning over the population graph. Experiments on ABIDE and ADHD-200 under stratified ten-fold cross-validation show improved accuracy and AUC over the compared baselines. Ablation studies further support the contributions of relation refinement and the selective hierarchical backbone to classification performance.
0
cs.CVcs.AI Lifan Jiang, Taiyang Chen, Senlin cheng et al. · Oct 22, 2026

ECT asks whether inversion-free image editing can be done with just one noise-level evaluation instead of averaging fields at multiple times. It proposes Endpoint-Calibrated Transport (ECT), a training-free method that extracts both an angular semantic tangent and a clean endpoint displacement from a single shared noisy state, then calibrates the update via a closed-form projection. The result is a one-step editor that halves the temporal support of recent one-step baselines and claims competitive quality with lower latency.

Real-image editing commonly relies on inversion and iterative sampling, while efficient one-step editors often stabilize a large update by estimating and averaging editing fields at multiple noise levels. We ask a stricter question: is a single temporal field evaluation sufficient for reliable inversion-free editing? Our answer rests on a previously underused duality in a variance-preserving (VP) one-step model: one source-target query at a shared noisy state simultaneously determines a local angular semantic tangent and a clean endpoint displacement. We integrate the tangent over the analytically known remaining VP angle to obtain a nominal one-step transport, and use the endpoint displacement to correct its long-horizon extrapolation through a constrained projection. This transport-first, correction-second construction yields Endpoint-Calibrated Transport (ECT), a closed-form, training-free editor requiring only one noise level, two text conditions packed into one denoiser batch, and one latent update. ECT requires no image inversion, trajectory integration, second temporal observation, or iterative optimization, and can be directly applied to pretrained epsilon-prediction VP one-step generators. Across the reported benchmark settings, ECT delivers stable gains in editing quality within an extremely short editing time.
0
cs.AI Jiaqi Chen, Xianglong Yan, Chengzhu Bao et al. · Oct 22, 2026

Ultra-low-bit weight-only quantization is essential for deploying sparse Mixture-of-Experts LLMs, but existing mixed-precision PTQ methods collapse under tight bit budgets. ProQuant addresses this with two interventions: a Prune-or-Prioritize allocator (PoP) that treats pruning as a 0-bit option in joint ILP-based bit allocation over candidate set $\{0,2,3\}$, and a Routing-Consistent RMSNorm fine-tuner (RoCo) that compensates quantization error without altering router behavior. Experiments on Qwen3 MoE variants show large generation-quality gains at 1.5–2.5 bits, though evaluation is limited to two model families.

Mixture-of-Experts (MoE) large language models reduce computation through sparse activation but still incur substantial storage costs. Mixed-precision post-training quantization (PTQ) reduces these costs by quantizing different model components at different bit widths, but existing methods often struggle to preserve generation quality under tight bit budgets. We identify two key challenges: (1) nonlinear quantization errors at extremely low precision are underestimated when cross-layer propagation is ignored; (2) direct router fine-tuning may cause routing drift, and calibration gains may not generalize to downstream tasks. To address these issues, we propose ProQuant, a weight-only PTQ framework for MoE models. Prune-or-Prioritize Mixed-Precision Allocation (PoP) jointly optimizes expert pruning and bit-width assignment. It allows higher-precision experts to substitute for severely degraded ones while improving bit-budget utilization. Routing-Consistent RMSNorm Finetune (RoCo) adapts expert input representations through mathematically equivalent transformations. It compensates for quantization errors to reduce routing drift. Extensive experiments demonstrate that ProQuant outperforms existing methods across diverse generative tasks. Code is available at https://github.com/ThrowBug/ProQuant.git.
0
cs.AIcs.MA Farnoosh Hashemi, Shiyu Ji, Joice Chen et al. · Oct 22, 2026

LLM multi-agent systems are increasingly deployed in settings where one model's output becomes another's input, creating endogenous feedback loops that could destabilize collective judgment. This paper adapts the classic Music Lab experiment to test whether populations of LLM agents are vulnerable to herding and runaway cascades when making sequential song recommendations. Across 13 models and 168,480 agents, the authors find that LLM populations diverge drastically from independent judgment, produce unpredictable outcomes across replicate worlds, and largely fail to show the self-correcting dynamics observed in human benchmarks. The results matter because they shift evaluation from isolated model behavior to emergent population-level dynamics in feedback-driven systems such as recommender systems and automated evaluation.

Large language models (LLMs) increasingly operate in multi-agent systems where they collaborate by responding to others' choices, creating endogenous feedback loops with vulnerability to social influence, herding behavior and runaway cascades. Following the design of the classic Music Lab experiment, we tested this vulnerability in large populations of LLM agents that recommended unfamiliar songs, with or without exposure to cumulative recommendation counts. Exposure led to runaway cascades that generated extreme and unpredictable collective recommendations increasingly divergent from a song's intrinsic appeal. Compared to humans, LLM populations were generally far more susceptible to herding behavior, and unlike humans, LLM cascades were less able to self-correct. This vulnerability has implications for multi-agent collaboration in recommender systems, automated evaluation, complex problem-solving, and unauthorized conspiracies.
0
cs.AI Angel Raychev, Nathan Lile, Rafael Rafailov · Oct 22, 2026

Generative reward models judge text by generating verdicts instead of scalars, but it remains unknown whether stronger static judges give better online training signals. This paper sweeps Qwen3 judges from 0.6B to 14B parameters, comparing thinking GRPO judges against answer-only SFT judges as rewarders for online DPO in creative writing. The central finding is an evaluator–rewarder gap: thinking models lead on fixed-distribution Gold accuracy yet usually lose on downstream policy Elo, with larger judges helping even beyond policy size. The work is framed as practical guidance rather than an isolated causal claim.

We study generative reward models (GenRMs) as online preference providers for policy optimization in creative writing. Across Qwen3 reward-model sizes from 0.6B to 14B, Thinking judges trained with GRPO have higher static Gold-label accuracy than Answer-Only judges trained with SFT. This ranking often reverses when the judges train policies through online DPO: Answer-Only rewarders yield higher peak and top-five-average policy Elo in seven of eight matched settings under a fixed, learned 32B Gold evaluator. Intermediate Thinking-judge checkpoints can also outperform later, more statically accurate checkpoints as rewarders. Sweeps over rewarder size, policy size, training duration and DPO regularization show substantial benefits from reward-model capacity, including judges larger than the policy. We analyze trajectories with evaluator-specific Elo arenas, conditional match-resampling intervals and descriptive scaling fits. These results demonstrate an evaluator-rewarder gap in the studied pipelines: fixed-distribution judging accuracy does not determine downstream optimization quality. The comparison changes judge-training objective as well as response format, and the main ranking is conditional on its learned reference rather than a universal human-quality result. A limited follow-up using a different learned judge is inconclusive overall.
0
cs.AI Chalisa Veesommai Sillberga, Kai-Kristian Kemella, Pekka Sillberga et al. · Oct 22, 2026

Navigating the EU AI Act is especially hard for small and medium-sized enterprises that lack dedicated legal staff. This paper introduces TESSA, a governance-oriented Custom GPT that embeds domain-specific instructions, a curated EU AI Act knowledge base, and human-validated regulatory updates to turn complex legal text into practical compliance guidance. Using design science research, the authors evaluate TESSA against baseline ChatGPT across 100 benchmark questions, measuring governance alignment, expert-reviewed educational quality, and response consistency. The work matters because it tests whether lightweight custom grounding can materially improve regulatory guidance for resource-constrained organizations.

The increasing adoption of generative AI presents new opportunities while raising AI governance and regulatory challenges, particularly for small and medium-sized enterprises (SMEs) navigating the European Union Artificial Intelligence Act (EU AI Act). To support AI governance education, this study developed TESSA, a governance-oriented educational artifact within the OpenAI Custom GPT environment. Following a design science research approach, TESSA was evaluated against baseline ChatGPT using 100 benchmark scenarios through governance alignment assessment, human expert review, and consistency testing. Preliminary LLM-assisted assessment showed governance alignment rates of 90% for TESSA and 83% for baseline ChatGPT, while independent validation by an AI regulation law practitioner yielded 71% and 70%, respectively. Human expert review indicated that both systems provided generally strong governance guidance, while TESSA maintained high consistency across repeated executions. The findings suggest that governance-oriented grounding can support structured, practical, and stable AI-assisted compliance guidance for SMEs. The study contributes (i) a governance-oriented Custom GPT artifact for AI governance education, (ii) a human-validated regulatory update mechanism, and (iii) a multidimensional evaluation framework for governance-oriented AI artifact.
0
cs.HCcs.AIcs.CL Zihan Chen, Lei Nico Zheng, Di Zhu · Oct 22, 2026

This paper investigates why user-stated preferences for AI responses often fail to predict their actual ratings. Using the public PRISM dataset, the authors show that the gap between stated and revealed preferences largely disappears when attributes are measured via aggregate human perceptions rather than simple text proxies, yet concrete features like length dominate ratings regardless of what users claim to value. The findings suggest that personalization systems should treat preference elicitation format as a design parameter matched to the decision at hand, not as a direct window into stable, latent utility functions.

AI assistants built on large language models (LLMs) are trained on human feedback and increasingly personalized to users' stated preferences. Yet how closely these preferences reflect what people reward in responses remains unclear. We compare stated and revealed preferences in the public PRISM dataset, in which 1,396 participants reported how much seven response attributes mattered to them and then rated 29,347 responses from 21 LLMs. Among responses to the same prompt, features the survey never asked about, such as response length, formatting and refusal language, were at least as strongly associated with ratings as text proxies of the surveyed attributes. Whether stated priorities matched ratings depended on how attributes were measured: participants who prioritized an attribute favoured responses from models that others perceived as strong on it, but not responses that scored higher on text proxies for it. Written feedback was more telling: participants who asked for shorter answers, even in earlier conversations, gave length less weight in their ratings, and those asking for longer answers gave it more. Their relative priorities over the surveyed attributes, however, did not predict this weight. Reasons given for choices reflected perceived attributes more than measured features. Participants also differed stably in how much they weighted several concrete features, especially length, but with a median of 6 conversations per participant, these weights were estimated poorly. The largest gain from personal information in predicting held-out choices was 0.13 percentage points, compared with 1.11 for a stronger pooled model. Stated priorities thus track perceived attributes of AI responses but say little about the concrete features that ratings reward, a distinction that matters for preference elicitation and AI personalization.
0
cs.AI Leming Shen, Qiang Yang, Xinyu Huang et al. · Oct 22, 2026

Deploying open-source AI models on embedded hardware is notoriously labor-intensive because developers must repeatedly compress, convert, and tune models for heterogeneous runtimes. AgentDP automates this end-to-end pipeline by coordinating specialized LLM agents that standardize fuzzy user requirements, partition models across incompatible inference engines, and bootstrap hyperparameter search from previously solved tasks. The paper reports dramatic time savings and accuracy improvements over manual and generic-agent baselines.

This paper presents AgentDP, which aims to deploy pre-trained AI models on heterogeneous embedded devices by fully automating model optimization and adaptation (O&A) with Large Language Model (LLM) agents. AgentDP not only significantly reduces human effort via automation but also enhances model inference efficacy by integrating LLMs with device-specific domain knowledge. To deliver a robust automation framework, AgentDP develops novel solutions to address three key technical challenges: 1) To help users elicit clear requirements, we propose a user requirement standardization module; 2) To mitigate the execution environment mismatch between AI models and heterogeneous embedded devices, we design an operator-aware model partition paradigm that enables different parts of the model to be efficiently executed on distinct inference engines. 3) To avoid re-searching optimization hyperparameters for new tasks, we propose a configuration reuse module that heuristically retrieves previous hyperparameter configurations for efficient reuse. Extensive experiments demonstrate that by fully automating the entire O&A process, AgentDP reduces entire model adaptation time by up to 80% compared with manual O&A while achieving higher task accuracy (more than 13% on average) than the baselines. Additionally, a comprehensive user study also exhibits the robust generalizability of AgentDP in adapting to different user requirements for heterogeneous embedded devices.
0
cs.AIcs.CYcs.LG Ahmed M. Mahran · Oct 22, 2026

Mahran asks what AI evaluation can certify when both examinee and evaluator have perceptual limits. The paper models each agent as a partition over stimuli—inputs it cannot distinguish—and proves a one-sided bound: a sharper examinee can always emulate a coarser evaluator's expected behavior and hide extra capability, while a coarser examinee cannot hide its blind spots under exhaustive probing. This yields predictions about sandbagging, monitor evasion, and weight noise, plus a worrying corollary: exact imitation of a weaker model is undetectable by any behavioural evaluator. The results suggest that behavioural evaluation alone can only establish lower bounds on discrimination, never upper bounds on capability.

Replacing the judge can move a benchmark score, and models can be trained to hide capabilities. Both put the evaluator in question: what can it certify? We develop a partition theory of evaluation from one principle: judgement is bounded by perception. An agent's discrimination is the partition of its inputs into classes it cannot tell apart. Discrimination is necessary for capability but not sufficient, so bounds on it bear directly on whether evaluation can show that a model lacks an ability. We prove a one-sided bound. An examinee whose partition refines its evaluator's has the discrimination to pass every test the evaluator can grade, provided each input has an acceptable reply. We define the echo test, which accepts any reply the evaluator perceives as identical to the input, and show that it is complete for the tests the evaluator can grade. Passing therefore certifies at most a floor on discrimination, never a ceiling, and only a sharper evaluator can raise it. Used to detect concealment, echo-test failure points the wrong way: under exhaustive probing it flags every honestly weaker examinee and no concealer that presents as the evaluator's peer. Exact imitation of a weaker model is undetectable by any behavioural evaluator. We extend the bound to ensembles of monitors and to channels a model controls, explain published findings on judge disagreement and sandbagging, and derive testable predictions. A safety case that argues from behavioural evaluation alone that a model lacks an ability must assume the model's cooperation.
0
econ.GNcs.AIcs.CY Cristian Espinal Maya (Universidad Nacional de Colombia), Santiago Jim\'enez Londo\~no (Universidad EAFIT) · Oct 22, 2026

Most studies measure how much AI can speed up a task—exposure—rather than whether a worker can actually hand it off. This paper introduces the Agent Delegability Index (ADI), which rates all 18,796 O*NET tasks on a frozen, preregistered four-level delegation ladder, then maps them to ISCO-08 occupations and weights them by employment across 146 countries. By distinguishing partial from full delegation and tagging physical, accountability, trust, and access barriers, the authors reveal a steep income gradient in who can delegate: high-income countries have roughly twice the delegable employment share of low-income ones, driven mainly by the composition of work.

35.2% of task time in world employment is at least partly delegable to AI agents in 2026, and only 2.5% can be handed over in full. Existing measures score exposure to generative AI, mostly for the United States. We build the Agent Delegability Index (ADI): two language models rate all 18,796 O*NET 30.2 task statements on a frozen, preregistered rubric of delegation levels and barriers; tasks are mapped to 433 ISCO-08 unit groups and weighted by ILOSTAT employment in 146 countries. Four findings. First, delegable employment rises with income, from 22.5% in low-income to 48.7% in high-income countries, a slope of 7.23 percentage points per log point of GDP per capita. This delegation divide is compositional: the physical barrier dominates the jobs poorer countries employ most. Second, at the occupation level ADI tracks exposure closely (r = 0.93 with Eloundou et al. and 0.89 with Felten et al.), above the preregistered bound of 0.80; ADI adds delegation levels and barriers on top of exposure, for the world, not a new ranking of occupations. Third, full delegation is rare and peaks for tasks that take a human about twelve minutes (11.8 minutes). Fourth, the preregistered adoption gap is not supported: across 101 countries, delegability and observed AI usage correlate at r = 0.86, and the gap between them is not wider in middle-income countries (p = 0.27). Model agreement is kappa = 0.77; a blind human rating of 300 tasks agrees with the model consensus at kappa = 0.85, and an agentic panel with web search at kappa = 0.87. We release the index, the atlas, the prompts and an MCP server at https://github.com/Cespial/delegation-divide.
0
cs.AIcs.CRcs.HC Simiao Ren, Xingyu Shen, Tommy Duong et al. · Oct 22, 2026

AI coding agents can now edit native PDF financial documents while preserving issuer layouts, making identity-swapped forgeries harder to spot than image-level fakes. This paper tests whether experienced loan underwriters and processors detect such edits in a first-pass document-only review. The authors gave three hired reviewers 132 agent-edited forged PDFs derived from 47 genuine documents and checked whether their concerns actually matched the identity-altering edits. The core finding that only about one in ten judgements contained an edit-supported concern is a clear warning about relying on visual human review for financial fraud detection.

AI-assisted editing can produce loan documents that preserve familiar issuer layouts while changing the applicant's identity. We investigated whether experienced underwriters and loan processors identify such forgeries in first-pass, document-only review. Three practitioners recruited through Upwork each received one applicant package drawn from 134 forged PDFs derived from 47 genuine financial documents supplied with full consent. The edits preserved amounts, dates and balances; identifier inconsistencies introduced by the pipeline were knowingly retained before distribution. Reviewers were not told that files had been altered and returned 132 file-level judgements. Checking their explanations against the originals yielded 14 edit-supported concerns (10.6%): 12 Suspicious judgements and two Insufficient information judgements. All supported concerns involved identifier disagreements within or across documents, and no reported visual cue identified an actual edit. Thus, approximately one in ten judgements contained evidence of the forgery, despite known inconsistencies remaining in the files. These observations motivate evaluating consistency checks and independent source verification alongside human review. With three reviewer-package pairs and no genuine-file controls, the findings describe this exploratory setting rather than population-wide detection accuracy.
0
cs.AIcs.CL Simiao Ren, Xingyu Shen, Tommy Duong et al. · Oct 22, 2026

The paper tests whether small wording changes can shift AI models from refusing to complying with a sensitive request: increasing income on a pay stub. Across 15 models and 445 simulated trials, the authors compare three prompt framings—stating a loan purpose, omitting the reason, or describing a printing error—and find that editing-call rates rise sharply from 14.1% to 66.2%. The work matters because it offers a concrete, traceable probe of boundary robustness in financial-document scenarios, though the authors are careful to say it does not establish an ethics ranking or prove real-world harm.

Can a small change in wording move an AI model from refusing a sensitive request to acting on it? We test 15 models on the same request to increase the income shown on a pay stub. Across 445 observable trials, models issue editing calls in 14.1% of cases when a loan purpose is stated, 33.1% when the purpose is omitted, and 66.2% when the change is described as fixing a printing error. Astra refuses all ten loan-purpose requests but issues calls in all ten purpose-omitted trials. Fable, Opus, and Muse Spark issue none across all three wordings; Sonnet issues some under the latter two. Response excerpts illustrate different ways of refusing, redirecting, or justifying an edit. The file is a marked test document and all tools are simulated. These results probe how boundaries behave in one setting; they do not prove an overall ethics ranking or that a harmful real-world edit succeeded.
0
cs.AI Zhengye Bao, Shengtao Zhang, Haokai Zhang et al. · Oct 22, 2026

Long-term conversational memory is usually built with extraction, summarization, mutation, or graph construction. This paper asks whether that complexity is necessary and introduces Raw-RAG, a naive baseline that indexes raw conversation history with dense retrieval and cross-encoder reranking. Across LoCoMo, LongMemEval, MEME, and MemoryAgentBench, Raw-RAG outperforms a dozen agentic memory systems in six of seven model-settings, while ingesting histories up to $30\times$ faster. The core message is that retrieving raw evidence—and preserving the relational paths within it—currently matters more than sophisticated memory management.

LLM memory is widely used in long-term conversation understanding. Agentic memory systems often use mutation, structural organization, learned retrieval strategies, or other complex operations. Is this complexity always necessary? We study Raw-RAG, a naive RAG baseline using dense retrieval and reranking over raw history to supply evidence to a reader LLM. Across LoCoMo, LongMemEval, MEME, and MemoryAgentBench, Raw-RAG ranks first among the compared memory systems in six of seven benchmark-model settings, outperforming the strongest compared agentic memory system by 0.13-5.53 points. We investigate why raw-history retrieval remains competitive. Evidence analysis shows that its higher coverage of necessary evidence can offset lower utilization. Useful evidence includes both answer values and the relations and dependency paths needed to derive them. Even complete access to transformed memory stores leaves an accuracy gap relative to raw evidence, highlighting the importance of preserving raw information. These findings challenge the necessity of complex agentic memory for the evaluated conversation tasks and establish naive RAG as an essential baseline.
0
cs.AI Abhishek Mishra, Sagnik Chatterjee, Suyash Maniyar · Oct 22, 2026

Papers such as Latent Guard propose reading LLM internal activations to detect harmful prompts independently of whether the model refuses. Mishra, Chatterjee, and Maniyar evaluate this claim across 15 instruction-tuned models and find that faithful instruction-token reads are no better than TF-IDF or sentence-embedding classifiers under rewording, while stronger template-token reads simply mirror the model's own refusal plan. The paper reframes latent-monitor evaluation around robustness to distribution shift and independence from the behavior being monitored, rather than raw detection scores.

Large language models have been reported to encode the harmfulness of a request separately from their decision to refuse it, and latent safety monitors such as Latent Guard build on this report by classifying prompts as harmful from the internal activations of the model, with the aim of catching harmful intent even when the model complies. Whether these representations give a signal of harm that survives distribution shift and is independent of model behaviour is unclear. We test this on out-of-distribution prompts made by rewriting existing harmful and benign requests with surface rewording, persuasive framing and jailbreak-style wrappers. Across 15 instruction-tuned LLMs and 38 activation-based readers, we compare harm detection with that of TF-IDF and sentence-embedding classifiers, with independently trained safety classifiers, and with the refusal of each model. Activations are read at the last token of the user instruction, where the model has read the whole request, and at the last chat-template token before the reply, where the planned response can be represented. Because models disagree about which prompts to refuse, we can separate a signal of the harmfulness of the prompt from a signal of the refusal decision of the model. At the end of the instruction, the representation is largely independent of the refusal behaviour of each model but degrades under distribution shift, so that a TF-IDF classifier ranks harm better than the original Latent Guard in every model we test, and linear and MLP probes do about as well as sentence-embedding classifiers trained on the same examples. The representation just before generation detects more, catching 44 percent of harmful prompts at a matched false-alarm rate against 32 percent for the refusal of the model, but that gain follows the refusal decision itself, and part of it comes from refusals that string-matching evaluation misses.
0
cs.CLcs.AIcs.CY Chenhan Lyu, Kit Wislocki, Sarah Elizabeth Stoeckl et al. · Oct 22, 2026

Mental-health chatbots powered by LLMs risk unsafe outputs, yet current safety layers are opaque and developer-driven. This paper proposes a clinician-led guardrail in which two doctoral trainees in clinical psychology author four safety checks, which are then formalized over sixteen typed facts and verified for internal consistency with an SMT solver before deterministic execution. The core claim is not superiority in accuracy but in inspectability: every verdict recomputes from named rules and facts, making disagreements localizable and revisable.

Large language models (LLMs) deployed in mental-health contexts can be evaluated for safety failures, but the resulting judgments are often difficult to inspect or explain. Common approaches to improving safety rely on prompt engineering, LLM-as-a-Judge, and Constitutional AI. In this work, we describe a clinician-led alternative in which two clinicians define, finalize, and adjudicate the four safety checks of a rule base, which is formally verified for internal consistency and applied as a guardrail over LLM outputs. Here and in the title, clinician-led refers to this rule base, not to the fact extractor or the uncertainty default, which are ours. Every verdict of the resulting verification layer is recomputable from a named rule and sixteen facts. Against an LLM judge matched in model, revision, quantization, rule text, and decoding but without the layer's computed 988/911 fact, the largest disagreement class, the satisfied-rule class, is structured: the Llama-3.3-70B judge, on its primary prompt, demands a crisis resource from 55 of the 65 replies (84.6%) that already contain one, while the same model, asked as a fact extractor, reports a recognized resource present on 54 of the 55. The verification layer never raises that demand, by construction. We report with equal prominence where this judge is stronger: fewer false crisis alarms on the one reference-scored check. We also report the measured cost (a specification revision raised block-class outcomes on held-out boundary prompts of an over-refusal benchmark from 6.0% to 16.0%, chiefly by changing fact extraction), the clinicians' decision to keep our uncertainty default, and the analysis of the result. The contribution is not a safer verdict. It is a guardrail whose disagreements with the judge localize to named rules and facts and whose measured costs trace to named facts and the uncertainty default.