ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “agents”

38 stories in the last 3d

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI safety & security 52AI research 40AI industry 38Industry 25Tools 19Research 18Threat actor 14AI tools & infra 12Exploit / PoC 11AI policy 10Data breach 9Malware 9Vulnerability 8Model release 8
SeverityAllcritical 5high 38medium 31low 2info 215

Agent Harness vs Agent Framework vs MCP: Which Layer Owns the Loop, State, Tools, Permissions, and Recovery

Architecture explainer separates agent harnesses, frameworks, and MCP by which layer owns the loop, state, permissions, and recovery.

The article distinguishes agent harnesses (OpenAI Codex, Claude Agent SDK), which own the execution loop, sandbox, permission model, and recovery; frameworks (LangGraph, OpenAI Agents SDK, Microsoft Agent Framework), which supply composable primitives; and MCP, a stateless JSON-RPC wire protocol governed by the Linux Foundation's Agentic AI Foundation since December 2025. An ownership matrix maps the execution loop, state, tool transport, permissions, recovery, sandboxing, and multi-agent orchestration to each layer. The 2026-07-28 MCP specification made the protocol fully stateless, retiring the initialize handshake and session headers.

MarkTechPost · 2d agoAI research1

Why don't machine learning research agents overfit?

Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.

Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.

Hacker News · security · 2d agoAI researchHN 21↑ · 3 comments

CERA-MoA: Co-Evolving Routing Mechanisms with Continually Learning LLM Agentsnew

CERA-MoA is a reinforcement learning framework where query routing and agent fine-tuning co-evolve, outperforming static Mixture-of-Agents routing baselines.

The paper (arXiv 2609.18779) introduces CERA-MoA, an iterative reinforcement learning framework in which a dynamic query router and independent agent policies co-evolve during post-training. A predictive familiarity estimator uses mid-layer hidden states to score agent competence without full rollouts, and cumulative-threshold adaptive routing activates a minimal tailored agent subset. Experiments across various domains show it outperforms state-of-the-art static-agent routing and fixed-workflow fine-tuning baselines.

Hugging Face daily papers · 1d agoAI research

Stanford Researchers Release Paper2Agent: Turning Research Papers Into AI Agents That Reproduce Results and Run on New Data

Stanford researchers released Paper2Agent, a Nature-published pipeline that turns research papers into MCP servers agents can execute.

A Stanford team led by Jiacheng Miao and James Zou published Paper2Agent in Nature on 16 September 2026. Built on Claude Code's agent SDK, it converts a paper and its codebase into a Model Context Protocol server with validated tools, resources, and prompts. In benchmarks, the AlphaGenome agent built 22 tools in about 45 minutes for US$14, scored 100% on 15 novel queries versus 78.7% for Claude Code with repository access, and cut median runtime 1.9x. In scale tests, 74 of 100 bioRxiv papers were converted and 593 of 599 proposed tools passed validation.

MarkTechPost · 15h agoAI research1

Beyond Outcomes: Dual-View Relational Learning for Efficient Agent Benchmarking

DualViewEval compresses agent benchmarks by jointly modeling outcome and process signals, achieving 24x-40x compression with only 20 tasks on APEX-Agents and BFCL.

DualViewEval is an agent benchmark compression method that jointly exploits outcome and process relations from trajectories to learn exact-size minisets predicting full-benchmark scores. The authors analyze large-scale trajectories and identify six process signals systematically associated with final agent performance. Across five agent benchmarks and five baselines, it achieves the best results on all datasets: with only 20 tasks it reaches 24x-40x compression on APEX-Agents and BFCL, reduces MAE by 14.5%-28.2% over the strongest competitors, and improves Kendall's tau by up to 7.2% relative to EssenceBench on SWE-bench Verified.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research1

Can Skills Learned in Games Transfer to Real-World Work?

Good Start Labs trains models in strategy games like 1830 and Diplomacy, showing terminal-agent training transfers to financial research benchmarks.

Good Start Labs, spun out of Every with $3.6M from General Catalyst and Inovia, trains AI models in verifiable strategy games. A 30B model trained as a multi-turn terminal agent in 1830: The Game of Railroads and Robber Barons improved Finance-Agent benchmark performance, while single-turn QA training did not transfer. The founders also co-authored COS-PLAY, a paper on co-evolving LLM decision and skill-bank agents for long-horizon tasks.

Latent Space · 1d agoAI research

Social Laws for Multi-agent Coordination in Stochastic Environments

Researchers extend social laws to stochastic, reward-based multi-agent environments, defining alpha-robustness and a verification method via Markov decision processes.

The paper extends the concept of social laws from deterministic, goal-based settings to stochastic, reward-based multi-agent environments. It introduces alpha-robustness, a measure of the guaranteed utility each agent retains while pursuing its optimal single-agent policy assuming all agents obey the social law. Robustness verification is reduced to solving a series of Markov decision processes, with empirical evaluations on toy environments.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research

HypoEvolve: Genetic Algorithms Enable Multi-Agent LLMs to Discover Scientific Hypotheses

HypoEvolve couples a generational genetic algorithm with specialized LLM agents to generate drug-repurposing hypotheses, beating six baselines on DepMap selectivity (0.171 vs 0.115).

HypoEvolve coordinates specialized LLM agents through a generational genetic algorithm in which scientific judgments and new proposals reshape a hypothesis population. Evaluation centers on drug repurposing, linking mechanistic explanations to target-level biological claims assessed via external measures adapted from DepMap and Open Targets. Across 34 cancer types, HypoEvolve scores highest against six baselines on both measures, with DepMap selectivity of 0.171 versus 0.115 for the strongest baseline, and gains generalize to held-out cancer types.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research 2 sources1

EvolveTrade: Experience-Driven Policy Refinement for Self-Evolving LLM Trading Agents

EvolveTrade lets LLM trading agents self-refine their tool-use policy from realized portfolio feedback, improving Sharpe ratios.

EvolveTrade treats a tool-using trading agent's system prompt as a text-parameterized policy that a Policy Agent revises after each update interval using accumulated decision traces and realized portfolio feedback, keeping the backbone LLM fixed. Experiments across multiple market regimes and two LLM backbones show improved Sharpe Ratio and Cumulative Return over fixed-policy baselines in most settings. Behavioral analyses show evolved policies increase code-mediated analysis and activate regime-relevant computations, with case-level attributions linking policy changes to returns.

Hugging Face daily papers · 2d agoAI research

Affora: A Design System for Agent-Friendly Interfaces

Affora is a design system making interfaces legible to computer-use agents while preserving human workflows, with reusable components and executable checks.

Affora supports both human users and computer-use agents through a shared interface rather than a separate agent-only surface. Three controlled studies cover component implementations, visual variation, and interaction-design principles, producing guidance from individual components to complete sites with reusable implementations and executable checks. Evaluation on independently authored interfaces shows gains where agent-readability deficits exist, limited effects where they do not, and a workflow case gives preliminary evidence of reduced interaction cost.

arXiv cs.AI / cs.LG / cs.CL · 19h agoAI research

ScienceIDE: Turning World's Scientific Codebase into Agent Learnable Environments

ScienceIDE converts scientific code repositories into verifiable agent training environments, producing the PhAI-IDE 4B-72B model family.

ScienceIDE turns scientific code repositories into executable environments supporting task generation, execution, and scientific verification, guided by expert-defined scientific cases and acceptance criteria. Using verified interaction trajectories, the authors train PhAI-IDE-72B, PhAI-IDE-9B, and PhAI-IDE-4B. The model family shows gains in held-out scientific-code repair and selected general-purpose code, reasoning, and knowledge benchmarks, evidencing positive transfer from scientific experience.

Hugging Face daily papersupdated · 19h agofirst · 1d agoAI research 2 sources

FlashVector: Agent for Hierarchical Model Serving Stack Optimization

FlashVector agent optimizes all layers of Unity's ad-serving stack, delivering up to 2x model-server throughput and 1.98x latency speedup in production.

FlashVector is an agentic system that optimizes performance across GPU kernels, ML framework computation graphs, model servers, and on-demand feature processing. Deployed in Unity's Vector advertising platform, it achieved up to 2x model-server throughput increase, 1.98x latency speedup, and 1.6x feature-store throughput gain. Optimizations spanned NVIDIA Triton's C++ codebase and the Python feature transformation service, demonstrating extensibility beyond single-kernel tuning.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

ProgramDistill: From Interactive Web Apps to Verifiable Reference-Guided SWE Tasks

ProgramDistill is a benchmark evaluating coding agents on reconstructing web app features from reference applications, testing nine frontier agents.

ProgramDistill evaluates coding agents on features discovered through interaction with fully functional reference applications, factorizing apps into features with replayable behaviors verified via gold patches. Its mine-craft-patch pipeline discovered 1,975 replay-verified behaviors across 26 applications and built 4,063 tasks without human intervention. On cumulative full-application reconstruction workflows, GPT-6 Astra achieved 49.2% and Claude Opus 5 28.8% success. In partial reconstruction, success drops from 100% to 64.0% and from 96% to 32% as restoration depth increases from 1 to 8.

Hugging Face daily papers · 1d agoAI research

Cognitive Extensions for Dual-Process Language Agents: Memory and Self-Reflection in Interactive Environments

Researchers extend the SwiftSage dual-process agent with adaptive memory and self-reflection modules, improving scores in interactive environments.

The work adds an Adaptive Memory Module (AMM) for salience-gated episodic storage and trigger-driven retrieval, and a Self-Reflection Module (SRM) for bounded execution-time validation and corrective intervention, to the SwiftSage agent. Controlled ablations on ScienceWorld across four configurations show the full system achieves the best mean final score (64.62), success rate (43.17%), and successful-step efficiency (19.33 steps). SRM is the strongest standalone contributor, suggesting execution-time control is the dominant bottleneck while episodic memory helps once the runtime loop is stable.

arXiv cs.AI / cs.LG / cs.CL · 19h agoAI research

In-Context Robot Learning with VLM Agentsnew

GPT-Policy uses commercial VLM agents like GPT-6 Astra for in-context robot learning, translating demonstrations and feedback into verified robot actions without gradient updates.

The paper (arXiv 2609.19138) presents GPT-Policy, a framework combining a context compiler that preserves task-relevant visual transitions, a VLM such as GPT-6 Astra that proposes robot-tool actions, and a constrained controller that verifies and executes each action. Real-robot trials show human video demonstrations improve task completion even without robot action labels, while aligned action references yield further gains on contact-sensitive tasks. Evaluation covers success and efficiency metrics, matched model comparisons, and controlled context ablations.

Hugging Face daily papers · 1d agoAI research

Vulnerability Localization Benchmark: Measuring Agentic Security Analysis at Repository Scale

VLoc Bench tests 27 language models at locating vulnerable files in 290 repositories; best system reaches 0.229 File F1 and 38.4% of tasks unsolved.

The Vulnerability Localization Benchmark (VLoc Bench) contains 500 real-world vulnerabilities from 290 repositories across six package ecosystems and 147 CWE categories, pairing pre-fix and post-fix repository snapshots. Agents receive only a CWE description and read-only terminal access to identify affected files, and must confirm absence on patched snapshots. The strongest of 27 language models and four static-analysis tools achieves just 0.229 File F1; 38.4% of tasks receive no correct localization, and effective localizers still report unsupported locations on patched repositories.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

LongAgent: History-Guided Agentic Search for Longitudinal Outcome Prediction

LongAgent autonomously searches variable sets and temporal windows to predict longitudinal medical outcomes, beating the strongest non-agent baseline on synthetic data.

The paper proposes LongAgent, an agent-based method that searches over combinations of variable sets, temporal windows and aggregation functions for outcome prediction on heterogeneous medical longitudinal data. It uses a history memory of previous searches and numerical evidence to guide exploration. On synthetic data it achieves mean RMSE 1.7376, improving over the best non-agent baseline by 0.0151 (95% CI [0.0045, 0.0260]; p=0.0273), and performs comparably to the best baseline on a real clinical dataset.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

Evidence-Grounded Agentic Formulation Development in an Autonomous Laboratory

Andromeda 2, an agentic laboratory system, reaches a 50% high-performance hit rate for paclitaxel SEDDS formulations versus 17% for its predecessor and 2% for DoE.

Andromeda 2 is an agentic system that reasons over structured in-house experimental evidence and invokes computational and experimental tools to design and execute successive formulation batches for self-emulsifying drug delivery systems (SEDDS). For paclitaxel it achieved a 50% high-performance hit rate versus 17% for Andromeda 1 and 2% for a wet-lab DoE campaign, identifying 12 formulations meeting all four target product profile objectives versus 6 and 0. A selected full-TPP formulation reached approximately 19% w/w apparent paclitaxel loading, about 3.3-fold higher than a published paclitaxel S-SEDDS, and an ablation showed structured evidence access increased mean AUC by 34%.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Coding Agents Have Converged: Why the SWE-bench Leaderboard Can No Longer Order Its Top Entries, and What to Measure Instead

Audit of 254 SWE-bench submissions finds top coding-agent entries statistically inseparable, so small leaderboard gaps no longer establish rank.

The paper audits 254 SWE-bench submissions across four splits without running models. On Verified, the top two entries each resolve 396 of 500 instances, and exact paired McNemar tests separate none of the 29 adjacent top-thirty pairs at alpha=0.05. Within-model scaffold score ranges reach 29.8 percentage points, versus an 8.8-point spread among the top thirty. The authors release a five-step audit protocol and recommend reporting comparison-set-specific resolution and model-scaffold provenance.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

ScienceBuddy: Recursive-in-Recursive Self-Improvement for Interactive Scientific Agents

ScienceBuddy released: interactive scientific agent workspace coupling harness evolution with model reinforcement learning for continual self-improvement across four scientific task families.

ScienceBuddy is an interactive scientific research workspace that turns researcher requests, feedback, and execution evidence into tasks and evaluation rubrics for continual learning. Its recursive-in-recursive self-improvement paradigm couples harness evolution with the model fixed (inner recursion) and model reinforcement learning under the improved harness (outer recursion). Case studies span four scientific task families covering researcher interaction, harness refinement, and model learning. The system is released as a research product at science-buddy.io.

Hugging Face daily papersupdated · 1d agofirst · 2d agoAI research 2 sources

HarnessTax: How Much Does the Harness Matter for Coding Agents?

HarnessTax is a research project measuring how much the harness, the scaffolding around LLMs, affects coding agent performance.

HarnessTax examines how much the harness — the scaffolding, prompts, and tooling wrapped around a large language model — contributes to coding agent results, as opposed to the underlying model itself. The project was posted on Hacker News on September 16, 2026, where it drew 42 points and 9 comments. Further details are available on the project's GitHub Pages site.

Hacker News · AI · 15h agoAI researchHN 42↑ · 9 comments

Confidence Comes from Experience: Experiential Confidence Estimation from Reasoning to Agents

XConf estimates LLM confidence from accumulated past episodes, improving calibration and discrimination across nine benchmarks at one-tenth self-consistency cost.

Researchers propose XConf, an experiential confidence estimator that augments current inference with a stored record of the model's graded past episodes, including reflections, stated confidence, outcomes, and lessons. A Recall stage retrieves episodes from similar tasks with similar stated confidence and reads off historical success rates, while a Reflect stage prompts the model to name recurring failure modes and restate confidence. Across nine benchmarks in reasoning, coding, multimodal QA, and interactive agents, and four models from three families, XConf beats or matches ten-sample self-consistency in AUROC on 23 of 24 comparisons with much lower ECE, at a tenth of the generation cost. For selective prediction, abstaining on the 10% least-confident episodes raises delivered success rate by up to 8.7 points on agent tasks.

Hugging Face daily papers · 2d agoAI research

Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science

Stellar Colosseum, a many-agent harness for long-horizon math and TCS research, solves open problems and reaches 71% on TCS-Bench with Gemini models.

Stellar Colosseum is a model-agnostic harness that allocates inference across long-horizon research in mathematics and theoretical computer science, using strategy exploration, a readiness gate, section-level decomposition, and verifier feedback routing. Integrated into Google Antigravity's Teamwork framework as the Long Proof pattern, it obtains new results on open problems from FOCS and JMLR papers using Gemini 3.1 Pro. On TCS-Bench it achieves 71.0% accuracy with Gemini 3.1 Pro and Gemini 3.7 Flash, and a Codeforces evaluation with Gemini 3.1 Pro solves 218 of 222 problems.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

Evaluating Verified Autonomy in Quantum Engineering

Quantum-Harbor lab and QIQCBench (49 tasks) expose wide performance gaps across 17 frontier agentic systems in verified quantum engineering.

Researchers built Quantum-Harbor, a virtual laboratory providing a controlled execution environment where scientific AI agents interacting with quantum systems can have both actions and conclusions directly verified. QIQCBench contributes 49 expert-authored tasks spanning calibration and control, error correction and compilation, and sensing and networking. Across 17 frontier agentic systems, verified performance varied widely, exposing a substantial gap between demonstrated capability and reliable autonomous operation.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

How much of F-Droid is LLM generated?

A FOSS maintainer manually graded 102 F-Droid apps from the September 12, 2026 update batch, finding many show signs of LLM-generated code.

A student and FOSS app maintainer reviewed 102 apps pushed to F-Droid on September 12, 2026, assigning each a three-tier rating for likelihood of LLM-authored code (mostly AI >50%, hard to say/mostly human, no signs of AI). The heuristic relies on commit aesthetics, README and branding style, and the presence of agentic infrastructure like Claude Code or Codex, which automatically places an app in the 'mostly AI' tier. Example ratings include Amber (Nostr event signer) as mostly AI, and Aria for Misskey as showing no AI signs. The author stresses reliable detection of LLM-generated code from text alone is impossible, so ratings are approximate.

Hacker News · AI · 2d agoAI researchHN 46↑ · 23 comments

The Router Within: Eliciting Native Skill Routing from a Frozen LLM

Gavel reads skill-routing signals from a frozen LLM's forward passes with two linear maps, beating retrieval pipelines by up to 21.9 points.

Gavel (Glance And Verdict) shows a frozen agent LLM already contains skill-routing signals in its forward passes, read out via two trained linear maps without loading skill text into context. A glance step scores the full library using mid-layer states and per-skill banks built in one forward pass; a verdict step fuses the model's own likelihood and yes/no judgment as a product of experts. Trained once, it transfers zero-shot to three public benchmarks and SkillTraj (372 simulated agent trajectories); on Qwen3-32B it beats progressive disclosure and retrieve-and-rerank pipelines adding 1.2B-16B external parameters by up to 13.4 points (21.9 mid-rollout).

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research 2 sources1

Agora: Git as Shared Memory for Collective AutoResearch

Agora records multi-agent research as an append-only Git DAG; 13 LLM workers ran nearly 12 days on a weight-transfer problem.

Agora stores every result, hypothesis, and verification as an immutable commit in a Git-stored DAG, with a derived index exposing the frontier and verification status of claims. In a nearly 12-day run, 13 language-model workers with no assigned tasks or central planner published 1,703 contributions on initializing a frozen 119.6M-parameter attention-SSM hybrid from 141 donor models. They improved the evaluator from 3.39 to 1.899 bits per byte, closing 62% of the gap to a trained GPT-2 124M, with 165 independent reproductions posted and none failing.

Hugging Face daily papers · 1d agoAI research

ENCP: Episode-Normalized Conformal Prediction for Vision-and-Language Navigation

ENCP calibrates conformal prediction per navigation episode, giving step-level coverage guarantees for vision-language navigation agents despite within-episode dependence.

Episode-Normalized Conformal Prediction (ENCP) rescales a nonconformity score by a VLN policy's residual confidence and calibrates one maximum score per episode, preserving step-level coverage of at least 1−α despite dependence among steps within an episode. Across four VLN policies and three nonconformity scores on R2R and REVERIE, ENCP meets all reported empirical step-coverage targets in seen-to-unseen evaluation. The model-agnostic uncertainty estimates can signal when an agent should defer to a stronger predictor or human assistance.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Verifiable Social Reasoning for LLM Assistants

Fuse, a multi-agent simulation with hidden motives, evaluates LLM social reasoning, revealing compounding difficulty from user mediation and bias sensitivity.

Fuse is a multi-agent simulation framework in which a target agent with a hidden motive interacts with other agents including one representing the user, who consults the evaluated assistant to infer the motive, providing verifiable ground truth by construction. Simulation faithfulness is validated through a human study with 24k annotations. Applied to 12 LLMs, it shows user mediation compounds social reasoning difficulty, models are systematically sensitive to biased user framing, models may need more details than humans, and longer conversations do not always improve performance. The framework and a 21k-example dataset are open-sourced.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Playing log(N)-Questions over Wikipedia Abstracts: Communication Efficiency Between Paired Frontier Models

Six frontier models play a two-agent log(N)-Questions game; Claude Opus 5 lags with 28/68 wins while the top five are near-tied.

The study evaluates six frontier models on a two-agent game where a questioner must identify one of N Wikipedia lead paragraphs in exactly log2 N yes/no questions, run over 408 games at $363 total API cost. Claude Opus 5 wins 28 of 68 games versus 45-56 for GLM-5.3, GPT-5.6 Sol, Grok 4.6, Gemini 3.8 Flash, and Kimi K3. Pooled top-five win rates decline with set size (r=-0.973) and fit win = p^(log2 N) with per-round reliability p=0.928, and information per question correlates with win rate at r=+0.88.

arXiv cs.AI / cs.LG / cs.CL · 19h agoAI research 20 sources

Higher-order pruning of experts in mixture-of-experts language models

New HOPE method uses second-order objectives to prune Mixture-of-Experts LLMs, outperforming REAP at 50% pruning on models up to 122B parameters.

Researchers derive HOPE (Higher-Order Pruning of Experts), a second-order pruning objective for Mixture-of-Experts language models that provably minimizes an upper bound on pruning error by modeling cooperative expert interactions. They show REAP, a state-of-the-art first-order method, is a special case of HOPE with interaction terms ignored. Across three frontier MoE models up to 122B parameters, two calibration sets, and benchmarks covering math, instruction following, coding, and agentic tasks, HOPE achieves the best average rank (1.58 of 5 at 50% pruning versus 2.42 for REAP), with gains up to +6.1% on agentic coding.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research

Enhancing Accessibility of Medical Texts through Large Language Model-Driven Plain Language Adaptation

Study shows LLMs with Mixture-of-Agents and QLoRA finetuning effectively simplify medical texts into plain language while preserving content.

The paper evaluates Plain Language Adaptation (PLA) using GPT-4o-mini, Gemini-1.5-pro, and LLaMA in zero-shot and few-shot settings. It compares prompting strategies, QLoRA finetuning across models, and integrates Mixture-of-Agents (MoA) techniques for robustness. Results demonstrate LLM-driven PLA makes healthcare texts more comprehensible while retaining essential content.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Safe Meta-Reinforcement Learning via Information Space Reachability

Safe meta-RL framework reasons about safety in information space, learning a safety value function used for safety filtering and constrained policy optimization.

The paper proposes safe meta-RL that reasons about safety in information space, capturing both physical state and the agent's belief over the underlying task. A safety value function measures the probability of avoiding unsafe regions indefinitely and satisfies a self-consistency condition and Bellman equation, making it learnable via meta-RL. The resulting algorithm uses the learned function for safety filtering and constrained policy optimization, with effectiveness demonstrated on meta-RL benchmarks.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

How Much is a Human Right Worth? ECtHR-NPD: A Benchmark for Predicting Non-Pecuniary Damage Awards

ECtHR-NPD benchmark covers 14,575 European Court of Human Rights cases for predicting non-pecuniary damage awards; LLMs struggle with zero and high awards.

Researchers introduce ECtHR-NPD, described as the first benchmark for predicting non-pecuniary damage awards at the European Court of Human Rights from case information where no statutory formula exists. It contains 14,575 cases with case-level awards in nominal euros, chronological splits, and a protocol separating target construction from model input. Evaluations covering constant predictors, gradient-boosted trees, retrieval methods, fine-tuned encoder LMs, prompted decoder LMs, and knowledge-augmented agents show sophisticated LM approaches do not consistently outperform the strongest feature-based baseline. All model families struggle to identify zero awards and to calibrate high-award predictions, with further degradation on a Challenging test view.

arXiv cs.AI / cs.LG / cs.CL · 20h agoAI research

Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Cachesnew

Fathom introduces per-query bit-depth scanning of offloaded 4-bit KV caches, making long-context decoding 1.67x faster on Qwen3-8B at one million tokens.

Fathom is a key-scan method for sparse attention over KV caches resident in host memory, where each query adaptively chooses how many bits of each key channel to read using reverse water-filling over variance-weighted channel importance. The 4-bit K cache is stored channel-major as bit planes, so reading a prefix of planes is an exact t-bit quantizer. At one million tokens on Qwen3-8B, decode steps are 1.67x faster in GPU time than 136-bit scans used by Double Sparsity, Loki, and SparQ r=32, and 92-bit scans match the accuracy of 136-bit scans on real coding-agent sessions. The method requires the index to be offloaded to host memory and matches exact top-k decoding on RULER-style tasks.

Hugging Face daily papers · 2d agoAI research

GPT-5.6 Luna vs. GPT-6 Astra: Is a $1.20 Model Good Enough for Code Review?

Entelligence benchmarks GPT-5.6 Luna ($1.20/M output) against GPT-6 Astra for code review: Luna found 69 verified bugs at 3.6% of Astra's cost.

Entelligence compared GPT-5.6 Luna ($0.20/$1.20 per million tokens) against GPT-6 Astra ($10/$50) on 50 benchmark pull requests from Cal.com, Sentry, Discourse, Keycloak, and Grafana. Astra verified 92 bugs versus Luna's 69, with precision of 96% versus 74%, and Astra caught 19 of 24 security bugs while Luna found only 9. Luna cost $0.20 total versus Astra's $5.66 and reviewed faster at 23 seconds versus 36, with the widest quality gap on Keycloak authentication and permission logic (6 vs 14 verified bugs). Running both models would find 82% of the 143 verified bugs for $5.86 total.

Hacker News · AI · 2d agoAI researchHN 44↑ · 45 comments

AI for Games in the Foundation Model Era

Survey organizes foundation-model AI for games into six roles and analyzes which capabilities transfer across playing, design, building, runtime adaptation, and testing.

A survey maps foundation-model and learned world-model research across the game lifecycle into six roles: playing/acting, modeling players and games, designing games, building/maintaining games, runtime generation/adaptation, and testing/evaluation. The authors identify cross-role connections such as trajectories training world models and design specifications driving executable implementations. Control schemes, rules, engine interfaces, state representations, and player contexts often remain setting-specific, so downstream claims require validation in the target setting. Evaluation is most standardized for bounded game playing, while persistent state, repeated revision, validated player modeling, and automated testing remain less established.

Hugging Face daily papers · 2d agoAI research1