Search: “messaging”

4 stories in the last 3d

Searchkeyword smart Sortlatest hot importance relevance

DomainAll Cyber AIWindow24h 3d 7d 30d AllIn the wild Important only Show duplicates

CategoryAll AI industry 30 Advisory 22 AI safety & security 21 Vulnerability 18 Malware 17 Threat actor 14 Exploit / PoC 13 Phishing & fraud 11 Research 9 Data breach 8 Policy & legal 6 AI research 4 Industry 4 AI tools & infra 3

SeverityAll critical 14 high 47 medium 42 low 7 info 72

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 · securitySep 14, 16:32 UTC · 2d agoAI research HN 21↑ · 3 comments

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.

MarkTechPostSep 14, 21:54 UTC · 2d agoAI research1

Disentangling Representation Evolution in Transformers through Directional Decomposition

Decomposes transformer representation updates into parallel and perpendicular components, linking geometry to editing robustness and better pretraining.

The paper decomposes learned transformer updates into parallel and perpendicular components relative to the hidden state, finding substantial parallel components beyond the residual identity path across pretrained models. Targeted edits reveal exclude-self value-space parallel manipulation is more robust than residual-space or perpendicular alternatives, and perpendicular error separates compression methods more clearly. Applying full-aggregate parallel suppression during from-scratch pretraining lowers validation loss and improves downstream averages, with the value-space variant strongest. Code is released on GitHub.

arXiv cs.AI / cs.LG / cs.CLSep 14, 17:56 UTC · 2d agoAI research 2 sources1

Recurrent GraphNeural NetworkswithSet-BasedAggregation

Paper proves two-directional equivalence between recurrent GNNs with set-based aggregation and Boolean closure of reachability/safety properties in modal mu-calculus, checkable from weights.

The authors study recurrent graph neural networks with set-based aggregation and identify sufficient conditions, checkable directly from network weights, for compiling networks into logical formulas and formulas into networks. They establish an effective two-directional equivalence with the Boolean closure of reachability and safety properties, the fragment BΣ°1 of the modal μ-calculus, shown to be the exact expressive level of stabilization over finite vocabulary. The correspondence needs no counting logic, external halting signal, or non-effective acceptance condition, yielding a verifiable path from weights to symbolic explanations.

arXiv cs.AI / cs.LG / cs.CLSep 14, 17:39 UTC · 2d agoAI research