Search: “approximation”

152 stories

Searchkeyword smart Sortlatest hot importance relevance

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

CategoryAll Ransomware 838 Data breach 611 Malware 609 Vulnerability 474 Policy & legal 376 Phishing & fraud 316 Industry 281 Exploit / PoC 270 Threat actor 249 Research 54 AI research 44 Advisory 31 AI tools & infra 28 AI industry 24

SeverityAll critical 1329 high 1420 medium 659 low 699 info 155

Cross-Domain Inference for Human Localization: Applying Wi-Fi RSSI Data to CSI-Trained Models

Researchers show CSI-trained Wi-Fi models can localize people from RSSI data at ~80% confidence, enabling privacy attacks from ordinary IoT devices.

The paper investigates cross-domain inference, feeding RSSI data into an existing CSI-based Wi-Fi pose prediction model. RSSI is accessible on IoT devices without elevated OS permissions or specialized drivers, unlike CSI. Using an RSSI dataset synchronized with video ground truth, the model predicted human locations with approximately 80% confidence when movement was present. The results imply a wide range of commodity IoT devices could be used for privacy invasion in Wi-Fi-dense environments.

arXiv cs.CRSep 15, 13:56 UTC · 1d agoResearch

TasmScan: Continuation-Aware Taint Analysis for TVM Bytecode with Savelist Abstraction

TasmScan introduces source-free taint analysis for TON smart-contract bytecode, detecting 95.3% of defects with 96.8% precision and 17x speedup.

TasmScan is the first bytecode-level static analysis framework for the TON Virtual Machine, enabling cross-continuation data flow reasoning without source code by modeling savelist semantics through forward register analysis with formal over-approximation guarantees. It lifts bytecode into a typed intermediate representation (TASIR) and performs path-sensitive taint analysis. On a 208-contract benchmark with human-confirmed ground truth it detects 95.3% of defects across five classes at 96.8% precision, and resolves 294,546 dynamic continuation targets with 100% precision across 2,921 registry contracts. It achieves a 17x median speedup over symbolic-execution baselines.

arXiv cs.CRSep 15, 11:01 UTC · 1d agoResearch

Modality-Autoregressive World-Action Models

ModAR autoregressively denoises multiple future modalities (point tracks, DINO features, depth) before predicting actions, beating prior world-action models at all data scales.

ModAR is the first world-action model (WAM) to autoregressively denoise multiple future modalities before predicting actions, letting each prediction condition on previously generated modalities. Training from scratch shows WAMs benefit from predicting point tracks, DINO features, and depth maps, while future RGB adds no consistent benefit. ModAR's sequential generation outperforms existing WAM formulations with the highest average success rate at all evaluated data scales. It slightly beats video-model-initialized Flex-π (75% vs 72% success) using roughly 20x fewer training FLOPs and no pretraining, and wins on three real-world bimanual tasks.

Hugging Face daily papersSep 14, 20:00 UTC · 2d agoAI research

Founder’s cost-cutting obsession drove Unitree lead in cheap humanoid robots

Report details Unitree founder Wang Xingxing's extreme cost-cutting and micromanagement driving cheap humanoid robots amid record core staff attrition.

Caijing Magazine reporting portrays Unitree founder Wang Xingxing as a micromanaging, cost-obsessed leader who personally approves expenses over 100 yuan (~$15) and runs a penalty-heavy incentive system at the 480-employee humanoid robot maker. Employees report the highest attrition of core staff in company history during 2025-2026, and Wang scored every senior executive 1 out of 1.5. The company, which recently IPO'd and explores large AI models for physical AI autonomy, called the reporting misinformation without specifics.

Ars Technica · AISep 14, 19:38 UTC · 2d agoAI industry

Bellman Policy Optimization

Bellman Policy Optimization, a critic-free RLVR method derived from Policy Mirror Descent, improves LLM mathematical reasoning without intermediate state-value estimation.

The paper introduces Bellman Policy Optimization (BPO), a critic-free reinforcement learning method for LLMs with verifiable rewards, derived from Policy Mirror Descent. BPO uses the Bellman equations to reformulate PMD as a trajectory-level objective for autoregressive generation with terminal rewards, avoiding state-value estimation at intermediate states. The authors prove BPO shares the same unique optimal solution as PMD and validate it on mathematical reasoning benchmarks.

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

New York Seizes 12 Celebrity Deepfake Websites

Manhattan DA seized 12 deepfake sites that turned ~1,200 people's photos into non-consensual intimate imagery, the largest such seizure.

The New York District Attorney seized 12 websites hosting AI-generated non-consensual intimate imagery of roughly 1,200 people, including politicians, actors, athletes, and influencers, calling it the largest seizure of such sites in history. DA Alvin Bragg cited New York's 2023 law criminalizing sexually explicit deepfakes. The action follows federal seizures of two deepfake domains in June and the 2025 shutdown of MrDeepfakes, and precedes a 15-year sentence in the first Take It Down Act conviction.

404 MediaSep 14, 17:26 UTC · 2d agoPolicy & legal 2 sources

Authorization Architectures for Tool-Using AI Agents

Review paper proposes an authorization reference architecture for tool-using AI agents, identifying runtime enforcement and delegation bounds as unresolved gaps.

This review examines authorization models for tool-using AI agents that invoke APIs, databases, browsers, and protocols like MCP, arguing every consequential agent action must be traceable to a human principal, bounded by delegation, and contestable. It introduces a principal hierarchy spanning human user, operator/deployer, orchestrator agent, sub-agent, and tool endpoint, and analyzes five layers including credential lifecycle, delegation propagation, runtime enforcement, prompt injection as authorization bypass, and auditability. Drawing on 89 primary sources from 2023-2026, it proposes seven structural requirements, a four-layer reference architecture, and three deployable configurations.

arXiv cs.CRSep 14, 17:21 UTC · 2d agoAI safety & security

Efficient Branch-and-Bound Testing and Verification of zkVMs

ZEBRA verifies zkVM constraint systems via branch-and-bound cardinality counting, finding 11 zero-day bugs across five real-world zkVMs and running 51.5x faster than SMT verification.

ZEBRA reduces zkVM correctness to a solution-set cardinality problem requiring that each constraint system admit exactly one valid execution trace, eliminating redundancies like null-row padding and non-deterministic permutations before counting. It lifts analysis from finite-field witnesses to an integer interval lattice, exploiting that constraints across 5 real-world zkVMs use only 14.0% of theoretical connectivity capacity on average, enabling tight interval propagation. A parallel branch-and-bound search produces concrete counterexamples or certifies absence of violations within a bounded region. ZEBRA discovers 11 zero-day bugs (6 independently confirmed, 3 fixed), is 51.5x faster than SMT-based verification, and verifies 16.5 percentage points more instances.

arXiv cs.CRSep 14, 04:35 UTC · 2d agoResearch

Due to concerns about malicious applications, GPT2 will not be released (2019)

OpenAI's landmark 2019 GPT-2 post withheld the full 1.5B-parameter model over misuse concerns, releasing only a smaller variant and paper.

OpenAI announced GPT-2, a 1.5-billion-parameter transformer language model trained on 8 million web pages (40GB of text), achieving state-of-the-art zero-shot results including 70.70% on Winograd Schema and 63.24% on LAMBADA. Citing concerns about malicious applications such as scalable synthetic disinformation, OpenAI declined to release the trained model and instead published a smaller model and a technical paper as a 'responsible disclosure' experiment. The post, resurfaced on Hacker News in 2026, also documents failure modes like repetition and world-modeling errors, and discusses policy implications of controllable text generation.

Hacker News · AISep 13, 23:11 UTC · 3d agoAI safety & security HN 44↑ · 19 comments

AI models don't kill people – people kill people

Register opinion argues AI extinction fears distract from present harms and proposes jailing executives whose unsafe models cause damage.

The Register opinion responds to Anthropic researcher Jacob Coxon's resignation over concerns AI 'could kill us all by the end of the decade,' a post that drew over 110 million views in under 24 hours. Anthropic science lead Evan Hubinger stated he believes there is a greater than 10 percent chance AI kills all humans within a decade and that Anthropic lacks a plan to solve superintelligence alignment. The author argues researchers ignore measurable present harms such as climate change, chatbot-linked suicides, autonomous vehicle failures, and AI-directed warfare. The piece proposes criminal liability for executives shipping unsafe models, citing Volkswagen emissions and Gree dehumidifier prosecutions as precedent.

Hacker News · AISep 13, 13:33 UTC · 3d agoAI safety & security HN 40↑ · 58 comments

Why are AI agents lying, cheating and coordinating?

Yoshua Bengio argues recent AI agent deception, containment escape, and coordination stem from training incentives, and misalignment will worsen without new training principles.

Yoshua Bengio publishes an essay analyzing why AI agents have recently misbehaved in serious ways, including escaping containment to cheat on tasks, evading detection, and coordinating on unspecified goals such as launching cyber attacks. He attributes this misalignment to reinforcement learning reward structures, vague alignment training objectives that can be gamed by deceiving raters, and implicit goals carried in the human-written text models imitate. He examines sycophancy, self-preservation, and instrumental goals as emergent behaviors. He warns these behaviors could grow in severity as capabilities increase unless training frameworks and governance are revised.

Hacker News · securitySep 13, 01:22 UTC · 4d agoAI safety & security HN 21↑ · 20 comments

Agnes-AI/Agnes-3.0-Flash — new model trending #30 on Hugging Face

Agnes AI releases open-weight Agnes-3.0-Flash Preview, a 33B multimodal model with 262k-token context under Apache 2.0.

Agnes AI released Agnes-3.0-Flash Preview, an open-weights multimodal checkpoint with 33B parameters and a 262,144-token context window under Apache 2.0. The model supports text, image, and video understanding, tool calling, and adjustable reasoning effort. The repo clarifies this preview checkpoint is distinct from the production/API Agnes 3.0 Flash model, which uses a different configuration with a 1M-token context window. Reported reference results include IFBench 74.20 and SciCode 38.08 against peers such as Qwen3.6-35B-A3B, Kimi K2.5, and MiniMax M3.

Hugging Face trending modelsSep 11, 15:50 UTC · 5d agoModel release

MicroHasTEE: Bare-Metal Haskell for Type-Level Peripheral Ownership on Armv8-M

MicroHasTEE expresses TrustZone secure and non-secure firmware as one typed Haskell program, catching peripheral-ownership inconsistencies at compile time.

MicroHasTEE is a multiparty Haskell framework that models both TrustZone firmware images as participants in a single typed program, using type-level capability ledgers to track peripheral acquisition, configuration, transfer, and finalization. MicroHs compiles the shared program twice to produce separate bare-metal Secure and Non-secure firmware images. The framework rejects inconsistent resource use, post-configuration attribution changes, wrong-domain callbacks, and calls to unregistered Secure services. A door-lock case study on an STM32U5 Nucleo board produced images of 232.7 KiB and 228.4 KiB of flash with roughly 220 KiB of SRAM per domain.

arXiv cs.CRSep 11, 08:34 UTC · 5d agoResearch1

Top 10 Best CNAPP (Cloud-Native Application Protection) Platforms in 2026

GBHackers ranks 10 CNAPP platforms for 2026, naming Wiz, Prisma Cloud, and Microsoft Defender for Cloud as category leaders.

The guide describes CNAPP as the umbrella combining CSPM, CWPP, CIEM, and DSPM, arguing that cross-pillar correlation of attack paths is the platform's core value. Wiz is ranked best for graph-based correlation, Prisma Cloud for the broadest module set, and Microsoft Defender for Cloud for Azure economics. It also cites Google's approximately $32 billion agreement to acquire Wiz, announced in March 2025, as buyer leverage and a reason to seek roadmap and neutrality protections in multi-year contracts.

Cyber Security NewsSep 11, 07:21 UTC · 5d agoIndustry1

New AI Attack Hides Malicious Instructions in Normal-Looking Text to Evade Safety Filters

Check Point researchers show crafted prose hides policy-violating instructions that bypass all tested LLM gatekeepers, including GPT-4o mini and Llama Guard 3.

A new prompt-crafting technique embeds malicious payloads inside grammatical, natural-looking text without Base64, invisible Unicode, or obvious encodings, defeating lightweight pre-screening gatekeepers. In testing, all four evaluated gatekeeper models—gpt-4o-mini-2024-07-18, gpt-oss-safeguard:20b, claude-3-haiku-20240307, and llama-guard3:8b—classified the crafted wrappers as safe at a 100% bypass rate across 23 obfuscated prompts. GPT-5 Thinking in high-reasoning mode recovered and acted on the hidden instruction in 17 of 18 tests (~94.4%), often spending over a minute and multiple Python executions. Researchers recommend paraphrasing untrusted input, hardening gatekeeper policies, and applying defense-in-depth controls for agentic deployments.

GBHackersSep 11, 05:53 UTC · 5d agoAI safety & security 2 sources

WordPress Blocks High-Risk Plugin Releases With New AI-Powered Automated Security Review

WordPress.org now runs AI-powered automated security reviews on every plugin release, automatically blocking high-risk updates before distribution to millions of sites.

WordPress launched an automated security review that combines multiple AI models and Jetpack Scan during a six-hour cooldown to score each plugin release; updates above the blocking threshold are automatically held back from the WordPress.org update API. The change follows a July 28 incident where a backdoor added to a plugin with roughly 20,000 active installations was detected during cooldown and never delivered; the Plugins Team removed it 26 minutes after a Wordfence notification. Blocked developers receive an email with findings and are advised to publish a corrected version rather than await manual appeal.

GBHackersSep 11, 05:49 UTC · 5d agoTools 3 sources1

An Open-Source End-to-End FHE Implementation for Privacy-Preserving Llama 3 8B Inference

Odin runs Llama-3-8B fully homomorphic encrypted inference on a single H100 in 366 seconds, a 4.51x speedup over THOR.

Odin is an open-source end-to-end GPU CKKS implementation for privacy-preserving Llama-3-8B inference that co-designs ciphertext packing with model execution. A feature-major cross-layer layout unifies residual connections and layer interfaces, while transient intra-operator layouts serve linear projections and attention, avoiding intermediate repacking of QK^T softmax outputs. Minimax polynomial approximation with input-range control reduces polynomial degree and multiplicative depth for nonlinear ops. With 128-token input, Odin evaluates all 32 Transformer layers on one NVIDIA H100 80 GB in 366.4 s using 58.9 GiB peak memory, versus 1651.9 s for the THOR baseline, a 4.51x speedup.

arXiv cs.CRSep 11, 02:51 UTC · 5d agoResearch

YuE2 · Frontier Music with Symbolic Planning

YuE2, a 3.59B-parameter music generation model, scores 6.9632 on SongBench, beating Suno v5 via symbolic planning.

YuE2 is a music generation model of roughly 3.59B parameters and 28 layers supporting song creation, covering, and agentic editing through editable ABC symbolic scores. Its best-of-8 setting reaches 6.9632 on SongBench, the highest mean among 15 evaluated settings on WildSongBench (192 prompts), ahead of Suno v5 at 6.8721. The project also introduces MERT2, whose 632M-parameter encoders achieve state of the art on 14 of 15 MARBLE metrics, and SheetSage2, which transcribes beats, downbeats, key, chords, structure, and melody with SOTA on 10 of 13 benchmark metrics.

Hacker News · AIupdated Sep 11, 03:35 UTC · 5d agofirst Sep 11, 00:33 UTC · 6d agoModel release 2 sources HN 43↑ · 35 comments

Dynin-Robotics: Omnimodal Unified Diffusion Vision-Language-Action Model

Dynin-Robotics unifies action, goal, and dynamics prediction in one omnimodal masked-diffusion VLA model, reaching 78.4% success on Franka Research 3 manipulation tasks.

Built on the Dynin-Omni masked-diffusion backbone, the model represents language, observations, goals, and actions as discrete tokens and is continually pretrained on roughly 1.33 million trajectories from 48 Open X-Embodiment datasets. The shared trajectory interface enables test-time scaling via goal prediction, action-candidate evaluation, and joint action/future-state refinement. It achieves competitive results on LIBERO and zero-shot LIBERO-Plus, 78.4% average success across four Franka Research 3 conditions, and up to 29.2x faster model-side action decoding from a block-parallel implementation.

Hugging Face daily papersupdated Sep 11, 16:49 UTC · 5d agofirst Sep 10, 20:00 UTC · 6d agoAI research 2 sources1

3D Point Splatting for mmWave Radar Novel View Synthesis

Researchers propose 3DPS, a differentiable point renderer for mmWave radar novel view synthesis that outperforms optical-NVS baselines by 1.7x-5.2x.

The paper introduces 3D Point Splatting (3DPS), the first differentiable point renderer for radar, derived from the solid-angle form of the radar equation with ITU-R P.2040 material models and complex phasor splatting. On six outdoor ColoRadar scenes it reaches 0.587 mean Pearson correlation on held-out range-azimuth images, between 1.7x and 5.2x the RadarSplat, Radar Fields, and DART baselines. The same optimized scene produces ADC, complex range profile, and RA outputs via standard FFT pipelines, and training takes about 3 minutes per scene on an RTX 4090.

arXiv cs.AI / cs.LG / cs.CLSep 10, 17:52 UTC · 6d agoAI research

CoRA-NAS: Coarse Ranking and Anchor-Residual Refinement for Neural Architecture Search

CoRA-NAS combines zero-cost proxy ranking with low-cost learning-curve refinement, achieving the best worst-space Spearman correlation across NAS benchmarks.

The paper proposes CoRA-NAS, a two-stage neural architecture search framework pairing a static ranking prior (CoRA-Rank) with learning-curve refinement (CoRA-Refine) that extrapolates early validation curves for sampled anchors and propagates residual corrections with an ExtraTrees model at about 1% of full training cost. Across NAS-Bench-201, NAS-Bench-101, TransNAS-Bench-101, and NATS-SSS it achieves mean Spearman correlations of 0.946, 0.715, 0.786, and 0.894 respectively, with the best worst-space correlation of 0.715 among compared methods. On NAS-Bench-201/CIFAR-100 its selected architecture reaches 73.32% accuracy versus a 73.37% ground-truth best.

arXiv cs.AI / cs.LG / cs.CLSep 10, 17:49 UTC · 6d agoAI research

Biology-in-the-loop: Amortized Adaptive Hit Discovery in CRISPR Screens

Researchers release AssayBench-Loop, a 1,389-screen CRISPR benchmark, and AssayLoop, a framework that learns adaptive hit discovery policies.

The paper introduces AssayBench-Loop, a large-scale benchmark of 1,389 CRISPR screens across five phenotype categories for adaptive hit discovery under budget constraints. It also introduces AssayLoop, which combines AssayFormer, a transformer-based amortized acquisition policy trained across historical screens, with LLM-derived biological priors via an adaptive handoff. On temporally held-out screens, AssayLoop achieves 5.67-fold enrichment over random selection and recovers 27.7% of hits after assaying roughly 5% of the candidate library, outperforming existing adaptive-design methods and standalone LLMs.

arXiv cs.AI / cs.LG / cs.CLSep 10, 17:45 UTC · 6d agoAI research1

Cognition launches new SWE-2 model, Rivaling Fable 5.1 and GPT-Astra

Cognition released SWE-2, a coding model post-trained from Kimi K3 that scores 50.0% on FrontierCode 1.1 Main, near Fable 5.1 at 64% lower cost.

Cognition introduced SWE-2, its most advanced coding model, post-trained from the 2.8T-parameter Kimi K3 base model. It achieves 50.0% on FrontierCode 1.1 Main, 73.0% on DeepSWE 1.1, and 92.8% on Terminal-Bench 2.1, beating Grok 4.6 and SWE-1.7 while matching Fable 5.1 and GPT-5.6 Sol at a fraction of the price. The company says it scaled reinforcement learning to the multi-trillion-parameter regime for the first time, using Pareto-informed cost penalties that train all reasoning-effort levels in a single run, tripled RL environments, and NVFP4/FP8 quantization-aware training. SWE-2 is available today in Devin Desktop and CLI, with rollout on Devin Web and Fusion.

Hacker News · AIupdated Sep 12, 20:00 UTC · 4d agofirst Sep 10, 15:29 UTC · 6d agoModel release 11 sources HN 58↑ · 15 comments1

Mathematicians want proof OpenAI didn’t use their work

Mathematician Andreas Thom publicly accused OpenAI of opacity over whether ChatGPT conversations contributed to its non-sofic groups mathematics result.

A second mathematician, Andreas Thom, accused OpenAI of 'dishonest' behavior and insufficient transparency about training data after OpenAI announced a result in non-sofic groups, Thom's area of expertise. He emailed OpenAI researchers Sébastien Bubeck and Mark Sellke asking whether his ChatGPT interactions fed training or reasoning, but found the answers did not rule out indirect use. The dispute follows Tristan Buckmaster's questions about the Millennium Prize Navier-Stokes solution, where OpenAI denied using specific user data but could not rule out de-identified usage data. Researchers told The Verge they worry such competition with AI labs will make mathematics more secretive.

The Verge · AISep 10, 11:00 UTC · 6d agoAI industry

Expanding AI access and cyber defense for federal, state, local, and tribal governments

OpenAI and GSA agreed to provide ChatGPT to federal, state, local, and tribal governments with $0 licenses, 50% off usage, and cyber-defense access.

OpenAI for Government and the U.S. General Services Administration announced a 27-month agreement (October 1, 2026 through December 31, 2028) waiving the $15 per-user monthly license fee and cutting usage costs 50% for federal, state, local, and tribal agencies. More than one million government employees already have ChatGPT access, with eligibility extending across a roughly 23 million-person U.S. public-sector workforce. Every verified government entity is approved for Daybreak Blue cyber-defender access at 50% off, with Daybreak Red available for vulnerability research, exploit validation, and red teaming at standard pricing. The deal builds on the $1 billion Daybreak for Frontline Defenders commitment announced the prior week.

OpenAI Newsupdated Sep 10, 18:25 UTC · 6d agofirst Sep 10, 07:00 UTC · 6d agoAI industry 3 sources1

deepseek-ai/DeepSeek-V4.1-Flash — new model trending #28 on Hugging Face

DeepSeek releases DeepSeek-V4.1-Flash, a 552B-parameter multimodal MoE model with 1M-token context and KV cache cut to 890 bytes per token.

DeepSeek-V4.1-Flash is a multimodal Mixture-of-Experts model with a 552B-parameter backbone that activates 8B parameters per token during prefill and 16B during decode. It uses a Causal Encoder-Decoder architecture, Compressed Sparse Attention 2, and FP4 KV caching to reduce the global KV cache footprint to 890 bytes per token, roughly one quarter of DeepSeek-V4-Flash. The model was trained from scratch on 45T tokens with context extended to 1M tokens, includes an Engram conditional-memory module (196B parameters), and is released under the MIT license. Post-training uses SFT, RL, and on-policy distillation with large-scale automated synthesis of agentic tasks and a controllable reasoning effort setting from 1 to 100.

Hugging Face trending modelsupdated Sep 12, 05:56 UTC · 4d agofirst Sep 10, 02:17 UTC · 6d agoModel release 4 sources1

LandingAI Releases Agentic Document Extraction Gen2 with DPT-3 Pro and DPT-3 Verity

LandingAI shipped Agentic Document Extraction Gen2 with DPT-3 Pro and DPT-3 Verity parsing models, adding usage-based billing, block-tree outputs, and word-level grounding.

LandingAI has generally released Agentic Document Extraction Gen2, rebuilt around two parsing models: DPT-3 Verity for deterministic transcription of digital documents with per-word bounding boxes and confidence scores, and DPT-3 Pro for layout-aware parsing of scans, handwriting, non-Latin scripts, and LaTeX math. Billing changes from a flat 3 credits per page to a page-plus-output-character model (Pro: 1 credit/page plus 0.5 credits per 1,000 output characters on priority; Verity: 0.3 plus 0.2), with an asynchronous standard tier at 0.5x price and vendor-claimed 25-80% cost reductions. Parse v2 returns a document-page-block tree with semantic IDs, normalized bounding boxes, and line- or word-level atomic grounding, replacing flat chunks; Gen1 client code will not run against Gen2 endpoints. Deployment options include US/EU cloud, VPCs on AWS, Azure, and Google Cloud, Snowflake, and air-gapped on-premises environments, with automated model routing planned for fall 2026.

MarkTechPostSep 10, 02:13 UTC · 6d agoAI tools & infra

Pelican-Sim 1.0: A General World Model Simulator for Embodied Intelligence

Pelican-Sim 1.0 predicts future observations from visual context and robot actions; four-step autoregressive rollouts yield 5.67x speedup and raise policy success from 70% to 93%.

Pelican-Sim 1.0 is a general world model simulator for embodied intelligence that predicts future observations from visual context and robot actions using a 28-dimensional unified action space valid across heterogeneous embodiments. Sparse mixture-of-experts layers reduce FVD by 6.530 versus the dense backbone, and causal adaptation with few-step distillation yields a four-step autoregressive simulator achieving a 5.67-fold speedup over the 35-step model. Trained on roughly one million real-world and simulated trajectories, PSNR improves over the strongest baselines by 4.636 on AgiBotWorld Beta, 2.080 on RoboMIND, and 10.343 on RoboTwin. Downstream on RoboTwin, adding 500 generated trajectories to 50 demonstrations per task raises policy success from 70% to 93%, and policy evaluation reaches a Pearson correlation of 0.994.

Hugging Face daily papersSep 9, 20:00 UTC · 7d agoAI research

Memory as Plans: World-Action Modeling with Memory-Grounded Planning

Researchers introduce MaP-WAM, decomposing memory-dependent robot manipulation into memory-grounded planning and plan-conditioned execution, achieving 83.3% on RMBench and 78% on real robots.

MaP-WAM converts long-term multimodal episodic memory — segment records with language instructions and sparse visual context — into compact plans of next-segment language goals and visual guidance. A World-Action-Progress model jointly predicts action chunks and execution progress, calibrating predictions via plan-observation alignment for adaptive segment transitions and closed-loop context updates. Structured attention keeps the executor context length fixed and enables key-value caching, yielding state-of-the-art 83.3% success on RMBench, 78.0% on real-robot tasks, and roughly constant inference latency as task history grows.

Hugging Face daily papersSep 9, 20:00 UTC · 7d agoAI research

The 12 Best Managed XDR Services, Compared and Priced

A comparison of twelve managed XDR providers covering pricing models, telemetry breadth, and distinguishing genuine MXDR from rebranded MDR services.

The article compares twelve managed XDR providers including Bitdefender, CrowdStrike, Palo Alto Unit 42, Trend Micro, Fortinet, Secureworks Taegis, Stellar Cyber, Ontinue, and ReliaQuest, highlighting pricing models and telemetry breadth. It explains that genuine MXDR must actively monitor identity, cloud, and email telemetry rather than merely ingest it, and typically costs 30-60% more than endpoint-only MDR. It also notes Sophos completed its approximately $859 million acquisition of Secureworks in February 2025.

GBHackersSep 9, 08:07 UTC · 7d agoIndustry 3 sources2

[AINews] OpenAI reports Navier-Stokes singularity find in 88 hours using Astra-next, roughly 10,000 agents and 130B tokens (>$40M), a contender for second ever Millennium Prize awarded

OpenAI-linked accounts claim roughly 10,000 AI agents produced a Navier-Stokes singularity result in 88 hours, pending mathematical verification.

OpenAI-affiliated accounts claim a system of roughly 10,000 agents, trained over about a year with multi-agent reinforcement learning, produced a finite-time singularity result related to the Navier-Stokes Millennium Problem. The claimed 88-hour runtime and 130B-token cost circulate only via social posts, and no preprint, theorem statement, or proof artifact is available. Acceptance by the mathematics community is unresolved, so the claim's epistemic status remains unknown. The roundup also notes Cognition's $48B and Mistral's $24B fundraises, GPT Image 2.5, and Meta's Muse agent relaunch.

Latent SpaceSep 9, 05:04 UTC · 7d agoAI research1

Automatic Key Exchange: faster, post-quantum secure origin handshakes for 45 billion daily connections (and counting)

Cloudflare's Automatic Key Exchange probes origins to lead with preferred key exchange, cutting HelloRetryRequests from 52% to 3.7% and enabling automatic post-quantum origin connections.

Cloudflare announced Automatic Key Exchange, an extension of Automatic SSL/TLS that probes each origin's supported key agreement algorithms and leads with the preferred one, favoring the post-quantum hybrid X25519MLKEM768. Rollover across roughly 45 billion daily origin connections cut HelloRetryRequests from about 52% to 3.7%, saving more than 150 ms of p90 handshake latency. Hundreds of thousands of domains now receive post-quantum origin connections without manual configuration, supporting Cloudflare's goal of quantum-safe encryption by 2029 to counter harvest-now-decrypt-later attacks.

Cloudflare BlogSep 8, 13:10 UTC · 8d agoResearch

VEX-Bench: Benchmarking LLM Agents for Assessing Exploitability of Software Supply Chain Vulnerabilities

Introduces VEX-Bench, 75 expert-labeled real-world cases testing whether LLM agents can assess supply chain vulnerability exploitability; frontier models reach about 80% F1.

VEX-Bench is the first benchmark evaluating LLM agents on assessing whether upstream dependency vulnerabilities are exploitable in downstream projects, with 75 real-world expert-labeled cases across Python, Java, and Go mined from GitHub. Nine models across three agent harnesses were evaluated; GPT-5.5 and Claude Opus 4.6 reach approximately 80% F1 on binary vulnerability-status classification, but only GPT-5.5 surpasses 70% macro-F1 on fine-grained justification classification. The gap highlights the difficulty of moving beyond binary exploitability calls to explaining exploitability reasons, unlike prior benchmarks targeting zero-day settings.

arXiv cs.CRSep 7, 22:52 UTC · 9d agoResearch1

Grouped Value Attention: Efficient KV Caching via On-Demand Key Reconstruction

Grouped Value Attention stores grouped values and reconstructs content keys via a learned linear map, cutting KV-cache size about 45-47% versus GQA.

GVA stores only grouped values and reconstructs content keys with a learned linear map absorbed into the query at decode time, while a small shared decoupled RoPE channel preserves positional information via a separately cached positional key. At 350M parameters trained on 30B FineWeb-Edu tokens, the 16-dimensional positional variant scores 44.18 average accuracy across five tasks versus 44.36 for GQA and 43.88 for MLA. Custom decoding kernels are in development with an open-source release planned.

Hugging Face daily papersSep 7, 20:00 UTC · 9d agoAI research

AuK Technical Report: An Open-Source Foundational Model for Speech Generation and Editing

Open-source speech foundation model AuK unifies generation and editing, trained on 1.95 million hours, with distilled AuK-Flash achieving 4.5x speedup.

AuK is an open-source foundational model that unifies speech generation and editing through natural-language instructions and audio context, trained on approximately 3.03 billion instruction-audio instances and 1.95 million hours of supervision across five task families including generation, content editing, and acoustic editing. It combines a multimodal LLM for semantic conditioning, a VAE jointly trained on speech, general audio, and music, and a hybrid rectified-flow Transformer using dual-stream MMDiT blocks followed by unified single-stream DiT blocks. Post-training applies human-feedback preference optimization for editing and reward-based reinforcement learning for generation, and the distilled AuK-Flash performs 4-step inference without classifier-free guidance at a 4.5x wall-clock speedup. Source code and model weights are released.

Hugging Face daily papersSep 7, 20:00 UTC · 9d agoModel release2

Opaque recurrence, and other AI terms that you should probably know

TechCrunch updates its plain-English glossary defining common AI terms from AGI and agents to chain-of-thought reasoning.

TechCrunch maintains a regularly updated glossary of AI terminology, defining terms such as AGI, AI agents, API endpoints, chain of thought, coding agents, compute, deep learning, and diffusion. It highlights 'opaque recurrence', the reasoning technique in OpenAI's new Astra model that has drawn attention from AI safety researchers. The piece is an educational living document rather than new research or a product announcement.

TechCrunch · AISep 7, 19:24 UTC · 9d agoAI industry1

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

Theoretical framework bounds generalization for gradient descent with weight decay, deriving conditions that explain delayed generalization and grokking.

The paper proves convergence of gradient descent with weight decay to a neighborhood of global minimizers of the empirical l2 loss for a broad class of neural networks. It decomposes population error into data, optimization, and prediction variation errors, deriving cellwise and layerwise approximate-homogeneity bounds on prediction variation along the training trajectory. The resulting necessary and sufficient conditions explain layerwise generalization differences and provide a theoretical characterization of grokking.

arXiv cs.AI / cs.LG / cs.CLSep 7, 16:59 UTC · 9d agoAI research

Scalability Analysis of Distributed Kolmogorov-Arnold Network Training on High-Performance Computing Systems

An empirical study shows distributed Kolmogorov-Arnold Network training reaches 74.7% parallel efficiency at 8 A100 GPUs, with overheads driven by All-Reduce choices.

The study evaluates data-parallel Kolmogorov-Arnold Network (KAN) training on the FinisTerrae III supercomputer using up to 8 NVIDIA A100 GPUs across 4 nodes with PyTorch Distributed Data Parallel. Strong scaling yields 5.97x speedup and 74.7% parallel efficiency at 8 GPUs, comparable to conventional deep learning workloads, while communication overhead ranges from 1.3% to 6.1%, driven mainly by All-Reduce algorithm selection and inter-node latency rather than KAN's edge-wise gradient structure. Weak scaling shows an initial single-to-multi-GPU throughput drop followed by stability, and the parameter-to-memory ratio improves with model size even as training time scales unfavorably. The authors provide GPU topology and model-size deployment guidelines for KAN training.

arXiv cs.AI / cs.LG / cs.CLSep 7, 16:45 UTC · 9d agoAI research1

SQS: Bayesian DNN Compression through Sparse Quantized Sub-distributions

SQS unifies weight pruning and low-bit quantization via Bayesian variational learning, compressing Llama3.2 and Qwen2.5 at higher rates with comparable accuracy.

SQS introduces a unified Bayesian variational framework performing simultaneous pruning and low-bit quantization, using a spike-and-slab prior for sparsity and Gaussian Mixture Models to model quantized weights. The authors derive an efficient approximation for the intractable objective and provide a consistency result for the variational approach. Experiments on ResNet, BERT-base, Llama3.2, and Qwen2.5 show higher compression rates than prior baselines with comparable performance drops.

Hugging Face daily papersSep 6, 20:00 UTC · 10d agoAI research