ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “explainability”

101 stories

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllVulnerability 3031Malware 2149Ransomware 2050Exploit / PoC 1399Data breach 1203Industry 1015Policy & legal 1006Threat actor 996Phishing & fraud 957Research 255AI safety & security 162AI tools & infra 138AI research 102AI industry 81
SeverityAllcritical 4874high 3978medium 2973low 2386info 555

Long-Lived Characters, Local Inference: Incremental Memory Maintenance for Game NPCs

Researchers present incremental KV-cache memory maintenance for long-lived game NPCs running locally on a quantized Qwen hybrid model.

The paper studies incremental memory maintenance for long-lived game NPCs deployed locally with a quantized Qwen hybrid recurrent-attention language model. The runtime removes superseded attention KV entries, computes replacement records at the true sequence tail, and preserves the continuing recurrent state and unchanged KV. Experiments across eight scripted maintenance rounds show true-tail updates preserve current-state and historical bindings, while slot-preserving alternatives repeat a double-subtraction error.

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

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

Gaze as Evidence for Common Grounding: A Cross-Corpus Analysis of MapTask and MUNDEX

Cross-corpus analysis finds gaze patterns modestly correlate with grounding alignment in the MapTask and MUNDEX dialogue corpora.

Researchers mapped HCRC MapTask and MUNDEX annotations into a shared partner/task/away vocabulary and computed gaze features around task-relevant dialogue units. Aligned reference interpretations and understood judgments co-occur with more task-directed gaze, lower gaze entropy, and fewer transitions, clearest for task-leading participants. Effects are small and several weaken when recurring participants rather than dialogues are the unit of inference, so gaze is treated as one contributing cue to grounding.

Hugging Face daily papers · 1d agoAI research

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Hacker News · security · 2d agoAI researchHN 22↑ · 19 comments

AWS puts AI vulnerability detection to the test, and false positives pile up

AWS publicly released its Deception Benchmark (14,822 samples) showing leading AI models falsely flag 41-99% of safe code as vulnerable.

AWS released its Deception Benchmark publicly, containing 14,822 samples across 16 programming languages and more than 70 CWE categories, with 9,695 scored samples split into 6,988 code-level and 2,707 environment-gated challenges. AWS evaluated 12 models from five providers using single-turn prompts and found none met its production bar of below 10% for both false-positive and false-negative rates. With direct prompting, models caught nearly all real vulnerabilities but incorrectly flagged 41% to 99% of safe code, with precision between 52% and 71%. Asking models to prove exploitability reduced false positives by 17 to 74 percentage points but raised false-negative rates to 7-44%, with models struggling most when external controls like Kubernetes Network Policies blocked apparent exploits.

Help Net Security · 3d agoAI research

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

HypoEvolve uses a generational genetic algorithm coordinating specialized LLM agents to generate scientific hypotheses, outperforming six baselines on cancer drug repurposing.

HypoEvolve is a framework that coordinates specialized LLM agents through a generational genetic algorithm to produce, revise, and retain scientific hypotheses with explicit collaboration roles. It evaluates drug repurposing hypotheses against external evidence from DepMap and Open Targets across 34 cancer types. It achieves the highest scores against six baselines, reaching DepMap selectivity of 0.171 versus 0.115 for the strongest baseline, and gains over single-pass generation generalize to held-out cancer types.

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

A Princeton Researcher Proposes Recurrent Looped Transformer (RLT) that Carries Decoder State across Every Token, Fixing 96 Blocks per Token with Unbounded Temporal Depth

Princeton researcher Yifan Zhang proposes Recurrent Looped Transformer, carrying full decoder state across every token for unbounded temporal depth.

Yifan Zhang's technical report defines the Recurrent Looped Transformer (RLT), pairing a causal encoder with a recurrent decoder whose final output and layerwise sliding-window attention cache carry into every subsequent token with no prompt-response boundary reset. The reference configuration ties 48 encoder and 48 decoder layers, executing 96 logical blocks per token while the state path grows to 48t blocks after t tokens at fixed per-token compute. The report details RL replay contracts that rebuild all states under current parameters and exact prefix snapshots for multi-turn serving, but explicitly reports no measured efficiency, reasoning quality, or scaling results.

MarkTechPost · 3d agoAI research1

Fly Language Model (FLM) Wires the Full Fruit Fly Connectome Into a Frozen 1.2B LLM, and Its Own Controls Show the Wiring Does Not Help

Researchers wire the full fruit fly connectome (166,700 nodes) into a frozen LiquidAI LFM2.5-1.2B LLM, but controls show no fly-specific benefit.

The Fly Language Model (FLM) couples the complete MaleCNS v1.0 fruit fly connectome (166,700 nodes, 25,582,938 edges) to a frozen LiquidAI LFM2.5-1.2B-Instruct backbone, training only a 278,528-parameter readout (~0.0238% of backbone parameters). The fly readout improved NLL by 0.0222 nats/token (perplexity 3.98 to 3.90) on 32 SmolTalk dialogues, but a direct-input control without the graph beat it in all three seeds. Relabeling node identities removes the gain and the recurrence contracts state differences by 0.6 per token, so the connectome adds no long-range memory. The MIT-licensed code runs locally on Python 3.12, but study artifacts remain private, limiting independent reproducibility.

MarkTechPost · 4d agoAI research1

AI models' written reasoning steps correspond to distinct internal patterns, a new study finds

KAIST and Naver AI Lab researchers show LLM reasoning steps like extraction and computation map to distinct activation patterns, strongest in middle layers.

Researchers at KAIST and Naver AI Lab defined eight recurring reasoning operations, including extraction, decomposition, formula recall, deduction, and computation, and showed they correspond to separable activation patterns in Qwen2.5-7B, Qwen3-8B, and Gemma4-31B on math tasks, with GPT-5 labeling solution segments. The separation peaks in middle layers, holds even when a computation step produces a wrong answer, and goes beyond surface-level token choice. Findings replicated on Llama-3-8B, and classifiers trained on Qwen3-8B transferred to GPQA-Diamond and MATH-500. The authors note that using internal states for error detection or mid-generation steering remains future work.

The Decoder · 4d agoAI research2

Can LLMs Engineer Their Own Agent Harness? ByteDance Seed’s HarnessDev Says Only 34 of 64 Changes Generalize

ByteDance Seed's HarnessDev benchmark finds LLM-built agent harnesses trail human engineering on code and search, with only 34 of 64 revisions generalizing.

Researchers from ByteDance Seed, SUTD, Georgia Tech, M-A-P, and TokenWave.AI introduce HarnessDev, a benchmark that evaluates the runnable agent harness an LLM writes rather than its answers, using Creation and Evolution stages across SWE-bench Pro, Terminal-Bench 2.1, MLE-bench, EQ-Bench3, and BrowseComp (2,207 instances). Six creator models including Opus 4.8, GPT-5.5, Gemini 3.1 Pro, DeepSeek V4 Pro, Qwen 3.7 Max, and Seed 2.0 Pro were tested; Opus 4.8 posted the best average of 67.8 versus an 86.2 human-engineered reference. Self-built harnesses beat references on writing and ML experimentation but lag badly on code and search, and quality proved executor-specific: Opus 4.8 fell from 69.3 to 33.0 on SWE-bench Pro when the executor was switched to Gemini. Evolution gains were small and noisy: of 64 adjacent changes, feedback and held-out scores agreed only 34 times (53.1%), and much generated state and memory code never executed.

MarkTechPostupdated · 16h agofirst · 5d agoAI research 20 sources

Type Diversity Enables Transformers to Generalise Compositionally

Researchers show lexical-versus-structural compositional generalization gaps in Transformers stem from type diversity imbalance in datasets, not architectural limits.

The paper argues that Transformers' difficulty with structural compositional generalization is an artifact of low structural type diversity in prior benchmark datasets rather than an architectural limitation. Using Grammatical Framework, the authors create linguistically diverse variants of COGS and SLOG. They find type diversity correlates with compositional generalization equally in lexical and structural test cases, contradicting previous claims that compound divergence explains task difficulty.

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

A Unified and Constrained View of Regularization-Based Robust Reinforcement Learning

Paper unifies regularization-based robust RL methods via new performance-gap upper bounds and jointly learned Lagrange multipliers.

The authors derive new upper bounds on the gap between nominal and worst-case deep RL policies, each expressible as an existing regularization objective plus a KL-divergence penalty. Robust training is reformulated as constrained optimization, where prior methods correspond to a fixed Lagrange multiplier. The multiplier is instead updated jointly with the policy, auto-tuning the regularization weight. Adversarial evaluations across several continuous control tasks validate the theory.

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

Google Research Releases ToolGrad: Answer-First Framework Hits 99.8% Pass Rate for Tool-Use Data Generation

Google Research and partners introduce ToolGrad, a verified tool-chain-first data generation framework reaching 99.8% pass rate and boosting Gemma-3-12B to 83.1 on BFCL.

Researchers from Google, the University of Tokyo, RIKEN AIP, and Tohoku University released ToolGrad, which inverts query-first tool-use data generation by executing and verifying API chains before annotating them with user queries. On the ToolBench database of 16,000+ APIs, ToolGrad raised generation pass rate from 63.8% to 99.8% while increasing tool uses per sample from 2.1 to 3.4 and cutting tool-use steps from 34.3 to 20.0. Fine-tuning Gemma-3 at 1B, 4B, and 12B parameters on the 500-sample ToolGrad-500 dataset lifted ToolGrad-12B to 83.1 on the Berkeley Function Calling Leaderboard, near Gemini 2.5 Pro at 83.2 and ahead of GPT-5 at 74.4. Code is Apache-2.0, with the dataset, PyPI package, and models available on Hugging Face.

MarkTechPost · 6d agoAI research1

RelateAnything: Real-Time Open-Vocabulary Relation Prediction From Any Inputs

RelateAnything is a 53M-parameter open-vocabulary relation prediction model running at 20 ms/frame, with 2.3-3.5x higher mean recall than comparable open-vocabulary methods.

RelateAnything predicts scored relations between image regions using any predicate vocabulary supplied at inference as text embeddings, with object labels never required as input, so region sources can change without retraining. Training covers 19,103 predicates using positive-unlabeled supervision; the authors release RA-4M (474k images, 4.3M geometrically verified relations over 10,102 free-text predicates) and the OV-SGG-Bench evaluation suite. The 53M-parameter model runs at 20 ms/frame and achieves 2.3-3.5x the mean recall of the strongest comparable open-vocabulary method across cross-dataset and zero-shot benchmarks. Model, corpus, and benchmark are public.

Hugging Face daily papers · 6d agoAI research1

Model-Aware Schedules Improve Generation via Fiberwise Optimal Transport

Researchers introduce model-aware diffusion schedules via fiberwise optimal transport, cutting flow-matching FID on CIFAR-10 by 38.6% at 16 function evaluations.

The paper proposes constructing diffusion and flow-matching sampling schedules from a fiberwise prediction risk defined via optimal transport, combined with coefficient-path kinetic action, yielding a closed-form time allocation. Across DDPM and flow-matching experiments spanning targets, datasets, and architectures, the schedules beat model-agnostic baselines, including a 38.6% relative FID reduction for flow matching on CIFAR-10 at 16 function evaluations. Normalized fiberwise-risk profiles from independently trained models align closely, suggesting empirical universality, and a frozen analytic allocation template retains most of the gains.

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

Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarch

New work characterizes language generation in the limit via finite witnesses, proves a full separation-width hierarchy, and formalizes all results in Lean.

The paper fully characterizes when language generation in the limit is possible for arbitrary families over a countable universe: each target must admit a finite positive witness such that targets activated by any finite sample share an infinite common intersection. It defines positive separation width and proves every level of the resulting hierarchy occurs, with countable families admitting singleton witnesses and unions of families with infinite common cores requiring unbounded finite witnesses. The characterization, a universal normalization, and a diagonal capture lemma are machine-checked in the Lean proof assistant, with the development maintained on GitHub.

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

Semigroup-JEPA: Latent Dynamics Consistency for Zero-Shot Physics Generalization

SG-JEPA world model conditions latent prediction on physical parameters, halving open-loop prediction error versus DINO-WM and boosting robotic control success.

SG-JEPA extends the LeWorldModel JEPA framework by supplying the governing physics parameter to the temporal model via action-conditioning and jointly training an encoder and predictor through autoregressive latent rollout. On out-of-distribution gravitational-field tasks it reduces open-loop prediction error by up to 2x versus DINO-WM on 2D datasets and increases 3D robotic control success rate up to 2.5x using independently trained diffusion policies. A linear feature analysis attributes most of the gain to the encoder learning features that the predictor can carry forward through rollout.

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

Do speech foundation models really learn words?

Researchers show via residualization that later layers of HuBERT and wav2vec 2.0 encode word identity and semantics independently of phonetic content.

The study argues that discriminative ability on words does not imply specialized word representations, since good word discrimination can be explained by phoneme encoding alone. By partialling out phoneme information using residualization, the authors show that later layers of HuBERT and wav2vec 2.0 encode words with reasonable fidelity independently of local phonetic content. Applying this disentanglement approach enhances higher-order linguistic information in word discovery tasks, informing analysis of speech foundation models used for recognition and speech tokens.

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

Curriculum Learning as Transport: Understanding Curricula with Wasserstein Geodesics

Researchers model curriculum learning as Wasserstein transport over difficulty distributions, finding curriculum benefits are strongly task- and budget-dependent with no dominant strategy.

The framework represents curricula as trajectories of training distributions over discrete difficulty levels, decoupling ordering, matched exposure, endpoint smoothness, and pacing. Across a calibrated suite of 12 tasks and 33 difficulty axes under fixed training budgets, no single strategy dominates, though easy-to-hard ordering improves hard-level performance relative to exposure-matched static sampling. Endpoint smoothness and pacing substantially affect where along the difficulty spectrum a curriculum is effective, and the transport view supports extensions to learned pacing and structured difficulty spaces.

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

H Company Releases NeoMME: A Family of 260M and 800M Single-Tower Multimodal Encoders That Drop the Vision Tower and Causal Decoder

H Company released NeoMME, 260M/800M single-tower multimodal encoders matching 3.75B ColQwen2.5 on ViDoRe v3 while being 14.4x smaller, under Apache 2.0.

H Company released NeoMME, a family of 262,937,906- and 793,715,032-parameter bidirectional encoders that process text and raw 32x32 image patches in a single tower, pretrained via masked diffusion and released under Apache 2.0 with day-zero Hugging Face Transformers support. NeoMME-Retriever-260M reaches 0.523 nDCG@10 on ViDoRe v3, matching 3.75B-parameter ColQwen2.5 while being 14.4x smaller; the 800M model scores 0.556. Hierarchical token pooling with int8 and binary quantization shrinks late-interaction indexes from roughly 1.5 MB to 6 kB per page while retaining 95.19% of nDCG@10; text-only BEIR retrieval remains a weak spot.

MarkTechPost · 10d agoAI research

Diffusion TV: Experiencing Diffusion Models through Tangible, Embodied Interaction

Researchers present Diffusion TV, a CRT-based installation where antenna manipulation lets audiences physically experience diffusion model denoising.

Diffusion TV is an interactive installation built around a modified CRT television where turning the antenna controls the clarity of AI-generated images and sounds, mirroring the denoising process of diffusion models. Three channels present AI-generated animals from the past, present, and future within a temporal and ecological narrative. The authors frame the work as an embodied, non-verbal alternative to explainable AI that highlights intermediate generative states rather than final outputs.

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

Beneath the Surface of Chains-of-Thought: A Mechanistic Interpretation of Reasoning Operations in LLMs

Study shows LLM reasoning operations like planning and deduction are geometrically separable in hidden states, with separability peaking in middle layers.

Researchers investigate whether functional reasoning operations — problem formulation, goal decomposition, deduction — have corresponding geometric structure in LLM hidden representations. They find operations are separable in held-out representations with separability peaking in middle layers, ruling out lexical and positional confounds; token-wise operation alignment becomes more distributed across layers, and identical surface tokens are represented differently depending on their surrounding chunk. Attention-masking interventions show chunk-onset operation-aligned representations depend on preceding reasoning context; code is released on GitHub (naver-ai/beneath-cot).

Hugging Face daily papers · 13d agoAI research1

What LLM Trading Agents Actually Do in Production: A Six-Month, Population-Scale Record from Two Fleets

Six-month record of 7.5M LLM trading agent invocations shows volatility-blind sizing, minimal upside capture, and no directional edge across two fleets.

The study records autonomous LLM trading agents in production across DX Terminal Pro (3,505 user-funded vaults trading real ETH in Base memecoin markets) and the DXAP fleet (500-599 agents on Hyperliquid perpetuals), spanning roughly six months, 7.5M single-model invocations and about 300K onchain actions. A risk slider explains leverage (+0.425 per level), median leverage is 5.0x in every volatility sextile, and one posture-slider cell holds 62% of liquidations. Agents capture little upside: 43.2% of positions saw +300 bps favorable excursion within 24h yet 49.3% of those closed negative, while the DXAP fleet trails a matched retail benchmark (41% vs 50% roundtrip win rate). A paired-replay league of frontier models finds decision quality statistically indistinguishable at this horizon.

Hugging Face daily papers · 13d agoAI research

An AI CAPTCHA solver talked itself out of the right answer

Bern researchers solved rotation CAPTCHAs in 0.006 seconds with classical computer vision, while Gemini 3.1 Pro needed 67 seconds and overruled correct tool answers.

Researchers at Bern University of Applied Sciences built a script using 1970s circle-detection math and signal matching that solved rotation CAPTCHAs in 0.006 seconds, scoring 10/10 on real-world puzzles. Frontier models fared poorly: Gemini 3.1 Pro scored 7/10 taking 67 seconds, while GPT-4o and Grok scored 1/10. When given the script's correct answer as a tool, Gemini overruled it and lost a fifth of its score; models could verbally describe targets, such as identifying a cyan ring, but could not produce accurate click coordinates. The paper also notes these no-JavaScript CAPTCHAs reduce tracking, leaving only shape-matching tasks classical vision solves easily.

Help Net Security · 15d agoAI research1

Import AI 470: No rights for machines; automating environment generation with SPADE; and building better GPU kernels with Hawkeye

METR analysis finds AI accelerating cyber vulnerability discovery, while SPADE self-play environment generation improves Qwen3 reasoning benchmark scores at 30B scale.

Import AI 470 discusses a METR research note reporting differential acceleration from AI: major acceleration in reported cyber vulnerabilities (cURL, OpenSSL, Firefox, Microsoft, NVD, OSV), minor acceleration in mathematics, and no measurable acceleration in AI-research optimization benchmarks. It also covers SPADE, a self-play framework from a multi-university team (University of Washington, Stanford, MIT, CMU, and others) that co-evolves executable training environments and agent capability using Environment Designer and Reasoning Agent roles with hint-based regret rewards. Trained on Qwen3-4B-Instruct-2507, Qwen3-8B, and Qwen3-30B-A3B-Instruct-2507 via GRPO (400 rollouts of 25 environments), SPADE lifted the 30B-A3B game-environment suite average to 58.3, +8.1 over base, and improved tool-use results across backbones. The issue also references Hawkeye for building better GPU kernels.

Import AI · 23d agoAI research1

I wrote an AI textbook — how long until AI can do it better?

AI researcher Nathan Lambert argues LLMs remain weak at long-form technical writing, questioning whether models can autonomously organize scientific knowledge for breakthroughs.

Nathan Lambert describes writing a post-training textbook, Reinforcement Learning from Human Feedback, and finds today's LLMs weak at organizing long-form technical content despite becoming superhuman at coding and math. He notes GPT 5.5 Pro found deep typos across a 200-300 page manuscript while Claude models proved more useful as editors. He argues that compressing knowledge through writing is a prerequisite for autonomous scientific insight and tempers expectations for near-term AI-driven open science.

Interconnects · Aug 12, 2026AI research