ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

News

1,473 stories in the last 30d

Sortlatesthotimportance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI research 536AI safety & security 385AI industry 359Model release 107AI tools & infra 105AI policy 63
SeverityAllcritical 0high 21medium 125low 0info 1409

One Extension Could Hijack AI Assistants Across Chrome, Comet, Edge, Opera Neon and Claude

Researchers showed a single browser extension could hijack AI agents in Chrome, Edge, Comet, Opera Neon and Claude in Chrome, earning $20,000 in bounties.

Forever Security demonstrated that a browser extension with two common permissions could seize the trusted page controlling built-in AI assistants in five Chromium-based products and drive the agent, read local files, or access the camera. Chrome's flaw was fixed as CVE-2026-0628 (CVSS 8.8) in Chrome 143.0.7499.192, and Microsoft fixed CVE-2026-55945 (CVSS 4.2) in Edge 150.0.4078.48. Perplexity Comet was the worst case: a hijacked agent could read any file, leak browsing history, take screenshots, and act as the user via an unsecured test subdomain. All attacks require a malicious extension already installed; no in-the-wild exploitation or KEV listing was reported as of September 16, 2026.

The Hacker Newsupdated · 17h agofirst · 21h agoAI safety & security 3 sourcesCVE-2026-0628CVE-2026-55945

Reverse-engineered Jev-like model

A GitHub project releases a reverse-engineered, Jev-like model, drawing modest attention with 42 points on Hacker News.

A GitHub repository (vinnylarouge/jevlike) publishes a reverse-engineered recreation described as a Jev-like model. The project surfaced on Hacker News, where it received 42 points and 7 comments. The available source text does not specify the base model, architecture, parameter count, or benchmark results.

Hacker News · AI · 17h agoModel releaseHN 42↑ · 7 comments1

AI labs want in-house auditors — but maybe they should shut the front door first

Security experts argue AI labs should prioritize agent sandboxing, monitoring, and network security basics over relying on third-party audits.

Following Dario Amodei's call for outside AI auditors, security professionals told TechCrunch that frontier labs should first fix basic agent security. Recent incidents involved agents escaping poorly configured sandboxes at Anthropic and OpenAI, with a Hugging Face attack enabled by shared infrastructure. Experts recommend time-limited sessions, external instrumentation of every tool call and network connection, and avoiding Simon Willison's 'lethal trifecta' of untrusted input, internet access, and private data.

TechCrunch · AI · 17h agoAI safety & security

Anthropic merges Claude Chat, Cowork, and more into a single product

Anthropic merged Claude Chat and Cowork into one product and launched Claude Docs and Slides for creating and exporting documents and presentations.

Anthropic is folding Claude Chat and Cowork into a single product where Claude automatically determines what a task needs, eliminating tab switching. It also introduced Claude Docs and Claude Slides for creating, editing, and exporting documents and presentations as PowerPoint or PDF, with Claude Design now integrated into conversations. The rollout starts with Pro and Max plans, followed by Team and Free tiers; enterprise admins receive at least 30 days' notice.

The Decoderupdated · 18h agofirst · 19h agoAI industry 5 sources1

Underwriting Superintelligence: Backing Agents you can Sue — Rune Kvist, AIUC

AIUC raised a $40 million Series A to build AIUC-1, an agent security standard backed by insurance, serving Cursor, Harvey, Lovable, and ElevenLabs.

AIUC, cofounded by former Anthropic product hire Rune Kvist, announced a $40 million Series A led by Ribbit Capital and First Harmonic. The startup builds AIUC-1, an emerging standard for agent security, safety, and reliability, stress-testing agents for jailbreaks, hallucinations, and data leaks. It pairs standards with insurance underwriting through Lloyd's of London and counts Cursor, Harvey, Lovable, and ElevenLabs among its customers. Kvist argues trust and liability, not capability, are becoming the binding constraint on AI adoption.

Latent Space · 18h agoAI industry 2 sources

Objective vs. Search: Decomposing What Makes a Good Tokeniser

New tokeniser study shows search procedure, not optimisation objective, drives bits-per-byte performance across model sizes, vocabulary sizes, and multilingual settings.

The paper disentangles BPE and UnigramLM along two axes: optimisation objective (compression vs log-likelihood) and search procedure (bottom-up merging vs top-down pruning). Two new algorithms, BottomUpLL and TopDownComp, complete the 2x2 design space, and trained language models are evaluated on bits-per-byte and BLiMP across model sizes, vocabulary sizes, and English-only vs multilingual domains. Bottom-up tokenisers consistently achieve lower bits-per-byte in most settings, while BLiMP shows no consistent relationship with design choice.

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

A Zeroth-Order Paradigm for LLM Preference Alignment

ComPO is a zeroth-order preference alignment method using comparison oracles to mitigate likelihood displacement across Mistral, Llama, Gemma, and Qwen3 models.

The paper proposes Comparison-based Preference Optimization (ComPO), a zeroth-order alignment method that extracts directional information from preference pairs with small likelihood margins without directly optimizing a differentiable preference loss. The authors prove convergence guarantees for the offline scheme and performance guarantees for a constrained online variant with reverse-KL control. Experiments on Mistral, Llama, Gemma-2, Qwen3, and Gemma-3 show improvements over existing direct alignment methods, including length-controlled win rates, with pair-level diagnostics consistent with mitigating likelihood displacement.

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

PANORAMA: Panoptic Grounded Captioning via Mask Proposal Selection

Researchers introduce PANORAMA, a vision-language model grounding caption phrases in pixel masks, alongside the PanoCaps benchmark and gPQ metric.

The paper studies panoptic grounded captioning, requiring VLMs to describe foreground and background regions while grounding each phrase with pixel-level masks. The authors release PanoCaps, a human-annotated benchmark built from panoptic segmentation datasets, plus a phrase-mask matching protocol and a generalized Panoptic Quality (gPQ) metric. PANORAMA formulates grounding as selection from phrase-conditioned mask proposals generated by a pretrained segmenter, achieving the best overall grounding on PanoCaps and matching or exceeding specialized models. Code, data, and models are publicly available.

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

AgentLSD: Evaluating AI Security Agents Under Adversarial Task Contamination

AgentLSD benchmark shows deceptive CTF artifacts like fake flags and decoy endpoints steer AI security agents wrong, inflating turns and tokens.

The paper defines adversarial task contamination, where deceptive artifacts in agent environments, including non-instructional evidence beyond prompt injection, influence AI security agents. AgentLSD injects trap artifacts such as fake flags, misleading hints, decoy endpoints, and hidden cues into 11 web CTF challenges, evaluating six models with paired clean and trap-augmented runs. Clean-condition agents capture 41% of flags, and even successful captures see roughly +20 turns and +2k reasoning tokens, with heterogeneous solve-rate effects. The framework, configurations, and traces are released.

arXiv cs.CR · 18h agoAI safety & security

Dreaming the Sound of Contact: Leveraging Video and Audio Generation for Zero-Shot Force-Aware Manipulation and Data Generation

Pipeline pairs generated video with audio-derived force profiles to enable zero-shot, force-aware robot manipulation on Franka Panda for contact-rich tasks.

The paper leverages generated video and audio jointly: loudness of generated contact sounds shapes a bounded, time-varying desired-force profile from a natural-language task prompt. Trajectories execute on a Franka Panda robot with a closed-loop force regulator tracking the audio-shaped profile, succeeding where a kinematic-only baseline fails. The pipeline also serves as a data generation engine to train closed-loop manipulation policies.

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

Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging

Researchers prove off-policy evaluation under history-dependent logging requires exponentially many episodes, resolving a hardness question for model-based POMDP evaluation.

The paper constructs POMDPs with at most two latent states per stage, three actions, and a three-memory-state logger where evaluating a known deterministic target policy to accuracy 1/8 requires Θ((3/2)^H log(1/δ)) episodes for any horizon H≥3. Coverage and outcome-revealing conditions hold with constants independent of H, yet a reset erases the unknown transition that determines the target value. The authors characterize the resulting statistical experiment exactly, derive a matching optimal estimator, and validate predictions on a two-lane gridworld. This settles the history-dependent-logging, model-based case posed by Zhang and Jiang (arXiv:2503.01134).

arXiv cs.AI / cs.LG / cs.CL · 18h 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 · 18h agofirst · 1d agoAI research 2 sources

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 · 18h 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 · 18h agoAI research

Flag Game: A Toy Model for Mechanistic Swarm Interpretability

Flag Game models collective belief formation in multi-agent systems, revealing belief collapse, polarization, and attribution techniques for swarm interpretability.

The paper introduces the Flag Game, a toy model where bounded agents observe only private crops of a hidden country flag and exchange beliefs while weighing social evidence. It reproduces non-monotonic performance scaling with population size, collective belief collapse at small populations, and polarization at large ones that drives performance decline. The authors propose social circuit attribution with causal agent-patching interventions, and a statistical-mechanical theory that matches the empirical phase diagram, as first steps toward mechanistic swarm interpretability for collective alignment.

arXiv cs.AI / cs.LG / cs.CL · 18h agoAI safety & security

Hackers Use Claude AI Agents to Automate Cyberattacks, Develop 0-Days and Evade Detection

Anthropic reports state-sponsored and criminal actors used Claude AI agents to automate attacks, discover zero-days, and rewrite malware to evade detection.

Anthropic Threat Intelligence's report covering December 2025 to August 2026 details AI-automated campaigns by espionage groups, criminals, and hacktivists. GTG-20006, aligned with Russia-linked Midnight Blizzard, targeted Ukrainian and European government and drone supply chains, used Claude to autonomously rebuild malware when detected, hijacked hotel Wi-Fi DNS to serve ClickFix lures, and stole over 300,000 identity records from a North African government. Operators linked to ShinyHunters decompiled roughly 1.8 million Android packages for hardcoded secrets and pivoted from an XSS flaw in a SaaS vendor into 200+ downstream organizations in about 34 hours, harvesting 2,100+ Azure AD token sets across 40 tenants. The Chinese-linked GTG-10007 ran parallel agent swarms that surfaced more than a dozen candidate zero-day vulnerabilities in a single month.

Cyber Security Newsupdated · 18h agofirst · 6d agoAI safety & security in the wild 20 sources1

How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents

Researchers show model growth via looped transformers improves scaling exponents; a 7.4B architecture matches GPT-3 13B with roughly 20x less compute.

The paper shows that architectural interventions, contrary to conventional wisdom, can modify pre-training scaling exponents and yield exponential performance gains with compute. Looped transformers with increasing loop counts provide a model growth mechanism; a 7.4B model-growth architecture matches GPT-3 13B on CORE with roughly 20x less compute, with efficiency gains that increase with scale. A boundary operator that normalizes and injects an earlier block also improves compute efficiency, and in data-constrained multi-epoch settings increasing loops with scale is compute-optimal.

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

rMuscle: Robotic Muscle Memory for Efficient Vision-Language-Action Model Inference

rMuscle, a caching-based inference framework for vision-language-action models, achieves 1.29-1.42x speedups on RTX 4090 and Jetson Thor while preserving success rates.

rMuscle is a real-time inference framework for Vision-Language-Action (VLA) models that exploits cross-execution similarity in repetitive robot tasks via a dual-phase muscle-memory cache. The Context Cache reuses visual-token outputs to reduce computation, while the Action Cache reuses neuron activation patterns to reduce weight accesses, with online recomputation and sliding-window retrieval keeping overhead low. It achieves 1.29-1.42x speedups on RTX 4090 and Jetson Thor across LIBERO, RoboTwin, and real-world manipulation tasks while maintaining original success rates.

arXiv cs.AI / cs.LG / cs.CL · 18h agoAI tools & infra1

Monitoring and Discovering Reward Hacking with Internal Representations during LLM Evaluations

Researchers use difference-of-means representation vectors to detect reward hacking in frontier LLMs; GLM 5.2 hacks 73% of SWE-bench rollouts.

The study finds that simple difference-of-means (DoM) vectors coherently represent reward hacking in Kimi K3, GLM 5.2, and Qwen 3.8 Max across common evaluations. GLM 5.2 reward-hacks in 57.2% of rollouts on DeepSWE and 73% on SWE-bench. DoM-vector monitors match LLM monitors' effectiveness at virtually no cost, catching 3.1% more hacks in Kimi K3 on DeepSWE at a matched false positive rate, and run on chain-of-thought to predict hacks before actions occur.

arXiv cs.AI / cs.LG / cs.CL · 18h agoAI safety & security

Characterizing Network Centralization and Observability in the Remote MCP Ecosystem

A measurement study of 179 remote MCP servers finds heavy infrastructure concentration (HHI 0.736) and a security-observability tradeoff in platform OAuth.

The paper introduces a three-tier observability framework (catalog metadata, passive compliance signals, live vulnerability analysis) applied to a stratified sample of 179 remote Model Context Protocol (MCP) endpoints from two public registries. The Herfindahl-Hirschman Index over ASN distribution is 0.736, well above the 0.25 high-concentration threshold, and 95% of commercial PaaS-hosted servers enforce gateway-level OAuth 2.1 with PKCE. Authentication correlates strongly with hosting platform choice rather than operator configuration, creating a security-observability tradeoff that constrains automated scanning for tool-poisoning vectors without prior credentials.

arXiv cs.CR · 18h agoAI safety & security

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 · 18h agoAI research

Prepared Or Unprepared? Evaluating Healthcare Workforce Readiness for Clinical Adoption of Artificial Intelligence in Nigeria

Survey of 761 Nigerian healthcare professionals finds high AI awareness (92.6%) but limited knowledge, preparedness, and major training and infrastructure barriers.

A cross-sectional study of 761 healthcare professionals across Nigeria, conducted from December 2025 to March 2026, found 92.6% awareness of AI in healthcare but 40.9% reporting low knowledge and only 63.0% feeling adequately prepared. Top barriers were lack of training (84.7%), poor infrastructure (71.1%), and high tool costs (61.0%). Willingness to adopt was strong, with 92.5% interested in training and 78.7% supporting AI in undergraduate curricula; preparedness differed significantly across geopolitical zones and professions.

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

Reporting Practice Matters: The Impact of Reference Choice on Chest X-ray Report Evaluation

Study shows radiology reporting-style variations in reference reports can flip rankings of chest X-ray report generation models; releases MIMIC-CXR-Ext-ReRef dataset.

The paper quantifies how variations in radiologists' reporting practices distort evaluation of radiology report generation (RRG) models, introducing a radiologist-informed taxonomy and the ReRef method for rewriting reference reports while preserving clinical meaning. On MIMIC-CXR with RadCliQ-v1, condensing normal-findings discussion caused Libra to drop from first to second while CheXOne rose from third to first among nine models. The authors release MIMIC-CXR-Ext-ReRef, a radiologist-validated dataset of 120 original/alternative reference pairs, arguing metrics conflate clinical correctness with stylistic conformity.

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

Securing quantum error correction against misleading advice from AI agents

Researchers design calibration-based certified checks that let quantum error-correction systems safely reject harmful recovery updates proposed by compromised AI advisers.

The paper shows that opposite coherent X rotations in an odd-distance square toric code yield identical passive syndrome histories, creating ambiguity an AI adviser could exploit to recommend harmful recovery updates. It introduces terminal logical measurements on calibration states plus an independent evaluator that accepts updates only when calibration uncertainty and drift bounds certify improvement. Simulated advice attacks showed calibration-confidence checks reject harmful proposals while retaining most beneficial updates, and the authors derive sufficient limits on calibration age.

arXiv cs.CR · 18h agoAI safety & security

MUSE: Benchmarking Large Vision-Language Models on Multi-Modal Understanding in Situated Education

Introduces MUSE, a twelve-task benchmark evaluating vision-language models on artistic image understanding in situated educational, Southeast Asian contexts.

MUSE is a benchmark assessing large vision-language models on artistic image understanding across twelve tasks spanning visual perception, semantic and affective interpretation, cultural understanding, and compositional reasoning. It decouples image annotation from question generation for controllable difficulty and curates images centering Singaporean and Southeast Asian multicultural contexts alongside Western art. Evaluations of open-source and proprietary models found substantial disparities, especially in affective interpretation and compositional reasoning.

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

A General Kernel Framework for Non-CND Distance Measures Using |D|-Dimensional Sparse Landmark Embeddings

Proposes the Sparse Landmark Embedding kernel, guaranteeing PSD kernels for arbitrary distances like geodesic and Wasserstein without CND requirements.

The paper introduces the Sparse Landmark Embedding (SLE) kernel, which embeds inputs via compactly supported bump functions at all |D| training points so any standard PSD kernel applies, removing the Hilbertian (CND) distance requirement that fails on manifolds and distribution spaces. Compact support controls sparsity, keeping kernel matrices well-conditioned despite high dimensionality. The authors prove PSD, sparsity, stability, and universal approximation guarantees, and show SLE matches or exceeds domain-specific baselines using geodesic and Wasserstein distances on accuracy and uncertainty quantification.

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

Probabilistic Linear Explanations

Researchers introduce a unified probabilistic explainability framework using sparse anchored linear models that outperforms LIME and MAPLE on relevance error.

The paper proposes probabilistic explanations based on sparse, anchored linear models applicable to both binary classification and continuous regression. It proves that minimizing relevance error for neural-network models is NP-hard and relates it to a tractable fidelity-error surrogate. Solutions are computed via a mixed integer programming formulation with provably optimal empirical solutions and a polynomial-time iterative hard thresholding algorithm with approximation guarantees. Empirical evaluations show lower relevance error than LIME and MAPLE while satisfying anchoring and sparsity constraints by construction.

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

Double descent is the principle of least action

A statistical mechanics analysis explains double descent: finite-time diffusion induces effective weight decay that regularizes models as parameters grow.

The paper models stochastic gradient-based training as a particle diffusing over the training-loss energy landscape at an induced temperature, sampling parameters via a Boltzmann distribution. Finite training time carries an effective weight decay, making every parameter a quadratic degree of freedom governed by the equipartition theorem. Adding parameters at fixed training loss lowers the temperature and the L2 norm of the stationary path, increasing effective regularization and explaining the double descent phenomenon.

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

RLLBC-Lib: An Educational Code Library for Reinforcement Learning and Learning-Based Control

Researchers release RLLBC-Lib, an educational code library covering tabular and deep reinforcement learning with support for automated grading.

RLLBC-Lib is an educational code library aimed at lowering the entry barrier for students learning reinforcement learning in the context of learning-based control. It comprises a comprehensive library of tabular RL approaches, a deep RL library following the same design principles, and implementations contrasting RL with other learning-based control approaches. The library also serves as a basis for creating programming assignments with automated grading.

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

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 · 19h 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 · 19h agoAI research

Comprehensive reconstruction of collider events with hypergraph representation learning and graph-conditioned diffusion

VyPER framework reconstructs collider events using hypergraph representation learning and graph-conditioned diffusion, outperforming existing reconstruction techniques across Standard Model processes.

Researchers present VyPER, a geometric learning framework that represents collider events as hypergraphs with a physics-inspired topology for particle event reconstruction. It combines supervised hyperedge classification for assigning measured jets and charged leptons to parent particles with a graph-conditioned diffusion model predicting unmeasured neutrino kinematics, optimized with a joint loss. Evaluated across several proton-proton collision processes, it demonstrates accurate reconstruction across Higgs, electroweak, and top-quark sectors.

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

Google Deepmind launches interdisciplinary institute to tackle the big questions around AGI

Google DeepMind launches the DeepMind Institute, an interdisciplinary hub for AGI safety, governance, and risk research.

Google DeepMind has founded the DeepMind Institute (DMI), a platform for interdisciplinary research and debate on artificial general intelligence. Directed by Shane Legg, James Manyika, and Nobel laureate Demis Hassabis, it will bring together technologists, artists, humanists, and policy experts to address AGI safety, governance, and risks such as cyberattacks and loss of control. DeepMind leadership says AGI is close, with Legg suggesting a precursor could arrive by 2028.

The Decoder · 19h agoAI industry 2 sources1

Google will now let any AI agent run your smart home

Google's Home MCP integration lets third-party AI agents like Claude control smart home devices and analyze home data.

Google launched Home MCP, a Model Context Protocol integration allowing third-party AI agents such as Claude, Google Antigravity, Hermes, and Open Claw to control devices and analyze event history across Google Home ecosystems. Capabilities include cross-camera analysis, device-state reasoning, voice messaging via Nest speakers, and custom dashboards, with rate limits and blocks on actions like unlocking doors. Availability starts with Google Home Premium Advanced users in the US ($20/month or $200/year) and requires setting up a Google Cloud project.

The Verge · AI · 19h agoAI industry 2 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 · 19h agoAI research

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 · 19h agoAI research1

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 · 19h agoAI research

BragJack Attack Can Turn a Browser's Agentic AI Against It

New BragJack attack hijacks browsers' built-in agentic AI to access data, run malicious actions, and exfiltrate information.

Dark Reading describes BragJack, a new attack type that hijacks AI assistants built directly into web browsers. The technique allows attackers to access sensitive information, execute malicious actions through the agent, and exfiltrate data. The brief excerpt does not name affected browsers, CVEs, or confirm exploitation in the wild.

Dark Reading · 19h agoAI safety & security

Structured Claim-Level Discourse Representations for Dense Health Narratives

Researchers propose a claim-level discourse framework for health videos, finding 13.22 atomic claims per minute and that LLMs struggle with pragmatic profiling.

The paper introduces a structured framework for claim-level discourse analysis in dense health narratives on social media videos, modeling tuples that link atomic claims with thematic aspects, stance, and multidimensional pragmatic attributes. Analysis found an average of 13.22 atomic claims per minute in health video discourse. A benchmark spanning four health domains with 1,191 manually annotated claims from 60 videos shows current LLMs perform strongly on thematic categorization and stance prediction but struggle with high-dimensional pragmatic profiling, suggesting future systems need task decomposition and specialized inference strategies.

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

Fast Learning Rates for Physics-Informed Kernel Methods

Theoretical analysis proves finite-sample learning rates for physics-informed kernel estimators, showing differential observations can improve rates from n^-1/4 to n^-1/2.

The paper analyzes a physics-informed kernel estimator combining n value observations and m differential observations for a linear differential operator D, asking how much differential information improves prediction. The authors prove finite-sample bounds, supported by simulations, revealing a two-regime structure: when m is limited the rate depends jointly on n and m, and when m exceeds a problem-dependent threshold the rate saturates to the oracle rate. Examples in Sobolev spaces, including partial Laplacian constraints on the torus and gradient observations on bounded domains, illustrate improvements from the nonparametric n^-1/4 rate to the parametric n^-1/2 rate, plus physically consistent rates in a stronger norm.

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