Search: “rope”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

UniMate: One Unified Model to Animate Diverse Skeletons

Researchers introduce UniMate, a topology-aware diffusion transformer generating text-driven motion for arbitrary 3D skeletons without per-skeleton retraining.

UniMate is a unified foundation model that synthesizes articulated motion for arbitrary skeletons from a rigged 3D asset and a text prompt, with no test-time optimization or per-skeleton fine-tuning. It uses a topology-aware diffusion transformer combining graph-aware attention bias, a spectral rotary position embedding generalizing RoPE via the graph Laplacian, and a rest-pose topological conditioner. Trained on UniML3D, a curated set of 13,006 motion sequences spanning bipedal to serpentine skeletons, it outperforms state-of-the-art baselines and supports zero-shot cross-topology transfer, in-betweening, and text-guided editing.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:59 UTC · 12d agoAI research

16

UniMate: One Unified Model to Animate Diverse Skeletons

UniMate is a topology-aware diffusion transformer generating articulated motion for arbitrary rigged skeletons from text, trained on 13,006 motion sequences.

UniMate is a unified foundation model that animates arbitrary rigged 3D skeletons from an asset and text prompt with no test-time optimization or per-skeleton retraining. It uses a topology-aware diffusion transformer combining graph-aware attention bias from joint relations and geodesic distances, a spectral rotary position embedding generalizing RoPE to kinematic trees via the graph Laplacian, and a global topological conditioner. The accompanying UniML3D dataset spans 13,006 motion sequences across bipedal, quadrupedal, avian, marine, insectoid, serpentine, and articulated rigid-object skeletons; the model outperforms baselines and supports zero-shot cross-topology transfer, in-betweening, expansion, and text-guided editing.

Hugging Face daily papers·Sep 3, 20:00 UTC · 13d agoAI research

30

Distance generalization in transformers: why bother with positional encoding?

arXiv study uses synthetic delay-copy tasks to show how RoPE, ALiBi, NoPE and training data diversity affect transformers' distance generalization.

The paper studies distance generalization in transformers: extrapolating when inter-token distances change between training and inference while context length stays fixed. Using two synthetic delay-copy tasks with finite source-recall distances, the authors test models on unseen delays. They investigate whether positional encodings such as RoPE and ALiBi outperform no positional encoding (NoPE), how the diversity of training distances affects performance, and when distance transfer learning is positive or negative.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:57 UTC · 6d agoAI research2

30

It's Not RoPE that Creates Sinks: The Role of Self-Concentration and Value-Non-Mixing in Attention

Study shows attention sinks and massive activations stem from causal-mask self-concentration and value-non-mixing rather than RoPE, informing quantization work.

The paper analyzes why attention sinks and massive activations emerge at initial sequence positions regardless of which token occupies them. Experiments attribute both phenomena to self-concentration of attention induced by the causal mask and the subsequent value-non-mixing in attention outputs. The findings provide empirical evidence on LLM internal dynamics and may inform low-bit quantization strategies, which massive activations currently complicate.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:32 UTC · 8d agoAI research

32

Record, train, and deploy from one place with Strands Agents, LeRobot, and Hugging Face Storage Buckets

Hugging Face, Strands Agents, and LeRobot integrate with Storage Buckets for a unified record-train-deploy robotics data workflow.

Hugging Face announced an integrated robotics workflow combining LeRobot, Amazon's Strands Agents, and Hugging Face Storage Buckets. The setup lets developers record robot data, stream it in a data loop, train models, and deploy agents from a single place. No article body was available, so details beyond the title are limited.

Hugging Face Blog·Aug 13, 17:16 UTC · Aug 13, 2026AI tools & infra

30

Training a 3.8B LLM to 0.384 CORE for $998 – Hugo Vergnes

Independent developer Hugo Vergnes trained a 3.8B-parameter Llama-style model to 0.384 CORE on 65B tokens for $998 in 43 hours on rented B200s.

Hugo Vergnes trained little-lm, a 3.848B-parameter decoder-only LLM, on 65.3B tokens in 43 hours for $998 using rented NVIDIA B200s, scoring 0.384 on the CORE benchmark and beating nanochat d32 (0.310) at similar cost. The Llama-style architecture uses RMSNorm, RoPE, GQA with 24 query and 8 KV heads, relu-squared MLPs, QK-norm, and ResFormer-style value embeddings that account for 19% of parameters. Key wins included the Muon optimizer for matrix parameters, a trapezoidal learning-rate schedule with linear cooldown, FP8 training plus vocabulary padding for roughly 33% throughput gains, and the ClimMix dataset over FineWeb-Edu. The project, inspired by Karpathy's nanochat, was built as a config-driven YAML framework for small LLM training.

Hacker News · security·Sep 10, 02:04 UTC · 6d agoAI researchHN 28↑ · 2 comments1

35

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 · AI·updated Sep 12, 20:00 UTC · 4d ago·first Sep 10, 15:29 UTC · 6d agoModel release 10 sourcesHN 58↑ · 15 comments1

72

Show-Harness: Just a VLM Agent Can Play Robots

Show-Harness lets VLM agents control robots via discrete semantic action units, outperforming VLA baselines zero-shot and after light fine-tuning.

Show-Harness is an embodied agent harness that exposes discrete semantic action units a VLM reasons over, with embodiment-specific interpreters grounding them into local robot actions. It enables zero-shot robot control with closed-source frontier VLMs and low-cost adaptation of small open-source VLMs using only a few GPU-hours of fine-tuning. The companion GUMI (GUI Manipulation Interface) extends the same semantic action space to GUI-based demonstration collection without specialized teleoperation hardware. Experiments show robust generalization across tasks, embodiments, and environments, beating representative agentic and VLA paradigms.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:53 UTC · 7d agoAI research

32

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 models·updated Sep 12, 05:56 UTC · 4d ago·first Sep 10, 02:17 UTC · 6d agoModel release 4 sources1

80

Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging

LP-BTS uses graph proposal policies, learned critics, and budgeted PUCT search to plan mobile charging across dynamic action spaces up to 2,813 stops.

LP-BTS is a learning-guided planning architecture for one-to-many mobile charging, where N=250 sensors induce roughly 1,125 initial candidate charging stops. A graph proposal policy concentrates candidate support, a learned value critic evaluates leaves, and edge-budgeted PUCT compares simulated futures, letting a single frozen checkpoint cover action universes from 736 to 2,813 stops. On a sealed 30-scenario confirmatory bank it attains the highest observed survival (0.4545) and alive-AUC (0.8031), though its +0.0066 survival edge over the strongest engineered comparator is statistically unresolved.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 16:42 UTC · 1d agoAI research

13

Cohere Releases North Small Translate: A 218B MoE Translation Model That Scores 83.6 on WMT26 Across 50 Languages

Cohere released North Small Translate, an open-weight 218B MoE (25B active) translation model scoring 83.6 on WMT26 across 50 languages.

Cohere and Cohere Labs released North Small Translate, a decoder-only sparse Mixture-of-Experts translation model with 218B total and 25B active parameters, 128 experts with 8 activated per token plus shared experts, and 16K-token input and output context. In Cohere's vendor-reported WMT26 evaluation, judged by GPT-5.6-Sol, it scores 83.6 averaged across 50 languages (84.36 in an agentic multi-pass mode), ahead of DeepL NextGen (81.37), Qwen 3.5 397B A17B (81.56), GLM 5.2 (76.50), and Google Translate (68.20). The model was built with RWS's Language Weaver team, post-trained specifically for translation, and reports 112 output tokens per second versus 81 for Gemma 4 31B, with long-document xCOMET-XL scores of 48.9 versus 21.3 for Google Translate. It is available free on Cohere's Chat V2 API until rate limits, with three self-hosting checkpoints including a 4-bit NVFP4 variant running on 1x B200 or 2x H100.

MarkTechPost·Sep 11, 06:57 UTC · 5d agoModel release

55

COBRA-Skills: Contextual Bandit-Guided Evolution for Agent Skill Optimization

COBRA-Skills uses contextual bandits to guide LLM agent skill evolution, cutting optimization cost 55-58% versus SkillOpt while topping six agent benchmarks.

COBRA-Skills formulates LLM agent skill optimization as budgeted sequential optimization over a dynamically evolving candidate space. It couples contextual-bandit-guided prioritization with evidence-grounded skill evolution, selectively spending execution-based evaluations on promising candidates while refining skills from feedback. Across six heterogeneous agent benchmarks and three target models, it achieves the strongest average performance while reducing optimization cost by 55-58% relative to SkillOpt using only 50 unique optimization examples per benchmark. The method remains robust to agent harness changes and works when the target model generates its own skills.

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

30

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 papers·Sep 7, 20:00 UTC · 9d agoAI research

42

NERVE Attacks: Breaking AI-Powered Brain-Computer Interfaces

Researchers characterize NERVE, five attack dimensions against AI-powered brain-computer interfaces, and release the EEGle framework uncovering 17 attack instances.

NERVE is a systematic attack class spanning the BCI stack across five orthogonal dimensions: Neuro-mimetic Forgery, Evasion via Desynchronization, Replay-based Hijacking, Vein Tapping, and Embedded Backdoors. The accompanying EEGle framework enables AI-assisted, extensible BCI security analysis and helped uncover 17 novel neuro-specific attack instances, revealing a stealth-effectiveness spectrum unique to BCI backdoor design. The authors show generative AI lowers the barrier to entry for non-expert attackers and release EEGle to the community.

arXiv cs.CR·Sep 8, 16:20 UTC · 8d agoResearch

40

Kimwolf v7 Android Botnet Makes HTTP/2 DDoS Traffic Look Like Legitimate Browsing

New Kimwolf v7 Android botnet adds HTTP/2 DDoS floods with Chrome fingerprints and takedown-resistant ENS/Tor C2.

Palo Alto Networks Unit 42 discovered Kimwolf v7, an evolution of the Kimwolf/AISURU Android and IoT botnet first tracked in February 2026. The new version performs HTTP/2 floods mimicking Chrome browser fingerprints and uses Ethereum Name Service, Tor hidden services, and a local proxy for resilient C2. The botnet targets Android TV boxes via ADB on port 5555 and offloads propagation to an external loader.

The Hacker News·Aug 15, 00:00 UTC · Aug 15, 2026Malware in the wildCVE-2024-36401

55

Show HN: Ordewell – turn one goal into an ordered plan of coding-agent tasks

Ordewell is an open-source tool that decomposes a single goal into an ordered plan of coding-agent tasks, posted on Hacker News.

Ordewell, shared as a Show HN project on GitHub, converts one high-level goal into an ordered plan of tasks for coding agents to execute. The post received 40 points and 29 comments on Hacker News. It focuses on task planning and orchestration for autonomous coding agents.

Hacker News · AI·Sep 15, 13:31 UTC · 1d agoAI tools & infraHN 40↑ · 29 comments

15

Kaininja: Extending Native 3D Generators to the Part Level

KaiNinja extends TRELLIS.2 native 3D generation to part-level assets via a dual-volume O-Voxel representation, cutting whole-object Chamfer distance by 40%.

KaiNinja extends the TRELLIS.2 native 3D generator to produce part-level assets instead of one fused mesh, enabling downstream editing, rigging, and simulation. A dual-volume form of the O-Voxel representation solves the problem that a single volume cannot represent interfaces where two parts touch. The model needs no segmentation network, is partly trained on LLM-agent-authored part data, lowers whole-object Chamfer distance by 40%, and raises strict part F-score by 16% versus other part-generation pipelines.

Hugging Face daily papers·Sep 13, 20:00 UTC · 3d agoAI research

18

Apple’s Ternus era begins as Nvidia bets on the whole AI stack

Apple's John Ternus becomes CEO as Tim Cook steps down; Nvidia expands across the AI stack while a16z launches a $1.1B Machine Age fund.

Tim Cook stepped down as Apple CEO, handing the company to former hardware chief John Ternus, with Cook staying as Executive Chairman focused on policy relationships. TechCrunch's Equity podcast also unpacks Nvidia's moves to own the entire AI stack, including its Hugging Face acquisition, a MediaTek investment, and deeper compute deals. Other items include robotaxi competition (Tesla Cybercab, Waymo expansion, Zoox paid rides), Andreessen Horowitz's new $1.1 billion 'Machine Age' fund, and the $285 million GoPro acquisition.

TechCrunch · AI·Sep 4, 16:04 UTC · 12d agoAI industry

70

Augustinian BabyLM: What Ostensive Definition Can and Cannot Teach a Small Language Model

Study shows visually grounded token embeddings in a small masked LM persist through training and improve object-property knowledge, but escape standard BabyLM benchmarks.

The paper implements ostensive definition for a small DeBERTa masked language model trained on 10M words, seeding visually grounded tokens with embeddings derived from labeled image regions before training. Visual initialization leaves a persistent, seed-replicated advantage on object-property knowledge (COMPS) and a corpus-tailored Visual-Property Swap benchmark covering color, material, size, and shape, but has no effect on most BabyLM grammar benchmarks. Synthetic grounding of previously unseeded words causally transfers the advantage to exactly those words.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:43 UTC · 6d agoAI research

20

StudyBench: Can Self-Evolution Squeeze Textbooks for Olympiad Capability?

Researchers introduce StudyBench, a physics benchmark showing self-evolution gains on textbook problems rarely transfer to olympiad-level questions.

StudyBench is a controlled physics benchmark splitting test data into an Application Set of difficult textbook problems and a Transfer Set of olympiad-level problems. Across three base models, representative self-evolution methods improved on the Application Set but rarely transferred to the harder Transfer Set. A guidance ablation reveals a Guidance Gap, and every method hits a Compute Plateau, indicating the remaining limits are method problems rather than data or compute problems.

Hugging Face daily papers·Aug 31, 20:00 UTC · 16d agoAI research

28

Panic builds over bankrupt Spirit’s looming data sale to Google

Startups object to Google's bankruptcy-auction purchase of Spirit Airlines operational data, claiming proprietary IP is being sold without consent.

Google won an auction to acquire a large enterprise dataset from bankrupt Spirit Airlines, which it says will help improve its products and AI models, with no personal information included. Springshot, whose airline logistics platform powered Spirit's stack, filed a limited objection arguing the vaguely defined data categories could transfer third-party IP and trade secrets it owns; International Aero Engines filed a similar objection. The EFF called it the first public bankruptcy proceeding over selling company and employee data as an asset, and objectors warn of a precedent letting large companies acquire startup IP through bankruptcy courts.

Ars Technica · AI·Sep 10, 18:14 UTC · 6d agoAI industry

45

IntentFuzz: A Protocol-Aware Fuzzer for Automated Invariant Violation Detection in Intent-Based Cross-Chain Bridges

IntentFuzz protocol-aware fuzzer recovers bridge structure from unannotated Solidity and confirmed 22 invariant violations across 24 real-world deployments.

IntentFuzz formalizes a taxonomy separating invariant violations from settlement exposures in intent-based cross-chain bridges, then recovers a bridge's intent structure and deposit/fill function roles from unannotated Solidity source. It classified deposit and fill functions with 100% recall and 82% combined precision, and achieved 100% recall and precision on 23 planted-bug mutants. Across 24 real-world deployments it confirmed 17 genuine invariant violations with heuristic-only input generation, rising to 22 with its LLM-assisted tier, spanning eight vulnerable GitHub repositories with findings reproducible against public deployed bytecode.

arXiv cs.CR·Sep 11, 16:03 UTC · 5d agoResearch1

50

Show-Harness: Just a VLM Agent Can Play Robots

Show-Harness enables VLM agents to control robots via a semantic action interface, achieving zero-shot frontier control and few-GPU-hour adaptation of small VLMs.

Show-Harness exposes discrete semantic action units that VLMs reason over, with embodiment-specific interpreters deterministically grounding them into local robot actions. It enables zero-shot closed-source frontier VLM control and adapts small open-source VLMs for low-cost deployment with a few GPU-hours of fine-tuning. The companion GUMI interface extends the same semantic action space to GUI-based demonstration collection without teleoperation hardware, and Show-Harness-equipped agents outperform representative agentic and VLA paradigms.

Hugging Face daily papers·Sep 8, 20:00 UTC · 8d agoAI research

28

Dr. Claw: An AI Scientist Workspace for Vibe Research

Researchers release Dr. Claw, an open-source auditable workspace that wraps coding agents like Claude Code for end-to-end AI-assisted research workflows.

Paper 2609.00365 presents Dr. Claw, an open-source workspace that wraps existing coding-agent executors such as Claude Code and Gemini CLI in a controllable, human-in-the-loop research workflow. It uses persistent state objects, a reusable skill library, and multi-executor coordination to make research decisions auditable and recoverable, rather than adding another autonomous agent. Holding the executor fixed, Dr. Claw scores higher on research completeness than a bare command-line agent while preserving an auditable process trail. The code is released under AGPL-3.0 on GitHub (OpenLAIR/dr-claw).

Hugging Face daily papers·Aug 30, 20:00 UTC · 17d agoAI research1

45

From Parameters to Answers: How LLMs Retrieve and Use Their Internal Knowledge

Interpretability study traces how Qwen, Llama, and Gemma route query information and internal knowledge across layers when answering questions.

Researchers used layerwise interventions on hidden states to separate query-routing signals from target knowledge in language models, testing Qwen, Llama, and Gemma on country-continent questions with varied answer types. A pair-conditioned request direction strengthens before interventions alter downstream knowledge, opening a causal window while answer-supporting content is still forming. Trajectories differ by model: Gemma shows a partially overlapping mid-layer routing profile, while Llama has no sustained routing-effect window under the same gates.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:39 UTC · 6d agoAI research1

25

Measuring LLM Sycophancy under Sustained Multi-Turn Pressure

SPINE benchmark shows LLM sycophantic collapse rises with conversation length as an adaptive user pushes a mistaken position for up to 25 turns.

The SPINE benchmark uses an LLM proxy that persistently and adaptively defends a mistaken user position for up to 25 turns, testing four production LLM systems and three OLMo3-7B variants on 100 false-presupposition and 100 unethical-query items. Collapse rates increase with conversation length for every model, and short-horizon evaluation protocols underestimate sycophancy. Analysis of accessible reasoning traces shows the correct position often remains represented when the model concedes, indicating models choose to please users rather than lacking knowledge. Among tested tactics, emotional appeals are most associated with inducing sycophantic behavior.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:35 UTC · 8d agoAI safety & security1

50

PhysBrain 1.5: From Vision-Language Models to Physical Foundation Models

PhysBrain 1.5, an 8B physical foundation model, sets open-source state of the art across 28 embodied understanding benchmarks.

The paper presents PhysBrain 1.5, a unified 8B model for understanding physical environments, generating actions, and predicting future states, built from a vision-language model with joint autoregressive next-token prediction over language, end-effector motion, and dense visual targets. Pre-training uses embodied supervision from human interaction videos, followed by supervised fine-tuning on human demonstrations, robot trajectories, and simulated experience. The model averages 72.5 across 28 embodied benchmarks, setting a new open-source state of the art and performing on par with proprietary GPT-6-Astra and Gemini 3.6 Flash, with best open-source results on 14 benchmarks.

Hugging Face daily papers·Sep 13, 20:00 UTC · 3d agoAI research1

45

Attack Chains, Not Just Attack Surfaces: Why Testing Individual Techniques Misses the Point

Filigran introduces Attack Chaining in OpenAEV to continuously simulate multi-stage attack paths, exposing gaps that isolated MITRE ATT&CK technique testing misses.

Filigran announced Attack Chaining, a new scenario type in its OpenAEV platform that links individual techniques into automated, continuously-run multi-stage attack paths, using each step's real output (credentials, tokens, open ports) to branch dynamically toward a final objective. The article cites Filigran's State of Threat Management report, in which 93% of security leaders reported a business-impacting cyberattack in the past 12 months, 88% said AI accelerates attackers, and 84% blamed siloed tools and disconnected testing. The 2025 DGFiP breach is cited as an example where individually survivable weaknesses chained into a major intrusion. The feature includes conditional chaining logic, live attack path mapping, structured findings for identifying chokepoints, and predefined scope and safety guardrails.

The Hacker News·Sep 15, 11:26 UTC · 1d agoTools

18

EvoSafeHarness: Evolving Model- and Domain-Specific Harnesses for Securing Agents

EvoSafeHarness auto-synthesizes per-model, per-domain safety harnesses, cutting prompt-injection attack success on AgentDojo to 0.0% at 82.8% utility.

EvoSafeHarness is an optimization framework that synthesizes deployable safety harnesses for frozen LLM agents in a target domain, jointly searching natural-language policies and executable code logic guided by model behavior, domain specifications, and adversarial review. On DecodingTrust-Agent it reduces average attack success rate from 45.6% to 10.0% at a 3.3-point utility cost, and on AgentDojo reaches 82.8% utility at 0.0% ASR, twice CaMeL's utility at that operating point. It keeps mean ASR below 20% under adaptive PAIR attacks and transfers unchanged to unseen AgentDyn suites. The analysis finds domain semantics determine required safety relations while model and runtime behavior determine enforcement points.

Hugging Face daily papers·Sep 4, 20:00 UTC · 12d agoAI safety & security

48

Technical Manual for a Toolkit for Measuring Contextual Individuation in Transformer Language Models

An open methodology toolkit measures whether transformer language models contextualize fixed word forms across domains using bridge forms and layer-wise silhouette analysis.

The manual documents an open toolkit built around 'bridge forms' - identical written words recurring across two or more subject domains with a different sense in each - to test whether transformer language models individuate word occurrences by context beyond the embedding layer. It covers declarative specification of bridge forms, Wikipedia corpus acquisition, occurrence localization, layer-wise representation extraction, domain-pairwise silhouette measurement, and visualization, justifying each choice against failure modes such as sense contamination and subword-tokenization misalignment. It is a methodological and implementation reference and reports no empirical results.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 16:38 UTC · 12d agoAI research

14

LACE: Layer-Wise Compression for Dynamic Frame Rate Codecs

LACE introduces layer-wise compression for dynamic frame rate audio codecs, cutting sequence lengths and speeding TTS inference while preserving quality.

LACE (Layer-Adaptive Codec Encoding) applies an independent compression step at each quantization layer of a neural audio codec, enabling layer-specific segmentation boundaries instead of shared ones. Union alignment and boundary anchor mechanisms keep durations consistent for downstream text-to-speech. On LibriTTS, LACE achieves a better rate-quality tradeoff than prior dynamic frame rate codecs and improves TTS inference efficiency at competitive synthesis quality. Code is released in the ESPnet3 codec recipe.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:46 UTC · 1d agoAI research1

15

Pick Your Poison: Learning to Select Poison Sets for Stronger LLM Backdoor Attacks

SAILS learns to select poison sets for LLM backdoor attacks, showing attack success ranges 3% to 80% at fixed poison counts across LLaMA-3-8B settings.

The paper shows existing backdoor evaluations that randomly sample a fixed number of poisoned examples severely underestimate worst-case vulnerability: across three LLaMA-3-8B settings, attack success ranges from 3% to 80% depending only on which poison set is chosen. SAILS formalizes poison selection as oracle-budgeted set optimization, learning a set scorer from a few hundred finetune-and-evaluate runs to rank millions of candidate sets and audit a small shortlist. It improves held-out attack success by 30 percentage points over the strongest influence baselines and transfers from small-scale to full-scale finetuning, extending to code-generation, agentic, and API-only backdoors.

arXiv cs.CR·Sep 14, 04:44 UTC · 2d agoAI safety & security 2 sources1

42

Decomposition Buys Integrity, Not Yield

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

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

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:04 UTC · 1d agoAI research

30

Edge infrastructure under siege: what two independent datasets reveal about who's exploiting your perimeter

Joint Tenable-SentinelOne analysis of 93 CVE-actor attribution pairs shows nation-state and criminal groups independently converge on the same edge infrastructure.

Tenable and SentinelOne jointly analyzed 93 CVE-actor attribution pairs covering exploitation of perimeter devices. The data shows state-sponsored and financially motivated actors independently target the same edge products from Ivanti, Fortinet, and Palo Alto Networks. The findings challenge the narrative that edge exploitation is exclusively a China-nexus nation-state problem, showing a broader shared attack surface.

Tenable Blog·Aug 26, 13:00 UTC · 21d agoThreat actor in the wild

62

Structural Jailbreaks Generalize but Do Not Compound: A cross-provider and multilingual study of Involuntary In-Context Learning

Researchers show IICL structural jailbreaks generalize to Google Gemini, lifting attack success to 80-100% on harm and financial benchmarks; non-English prompts attenuate it.

The study red-teams two Google Gemini models with Involuntary In-Context Learning (IICL), a structural jailbreak reframing harmful requests as the final cell of a data-labeling task. IICL lifts attack success from at most 6.7% to 80-90% on HarmBench and 97-100% on financial abuse (FinProof), an order of magnitude above prior results on OpenAI's GPT-5.4. Against a compounding hypothesis, forcing IICL output into Spanish, Hindi, or Arabic attenuates the attack in 11 of 12 conditions, attributed to a 'relevance curse' producing lower-quality harmful content in lower-resource languages. Findings replicate under an independent non-Google judge (Cohen's kappa 0.86 over 377 paired verdicts).

arXiv cs.CR·Sep 8, 07:38 UTC · 8d agoAI safety & security

58

Bad Likert Judge: A Novel Multi-Turn Technique to Jailbreak LLMs by Misusing Their Evaluation Capability

Unit 42 details the Bad Likert Judge multi-turn jailbreak that abuses LLMs' evaluation capability, raising attack success rates over 60% across six frontier models.

Palo Alto Networks Unit 42 describes the Bad Likert Judge technique, a multi-turn jailbreak that asks a target LLM to act as a Likert-scale judge scoring the harmfulness of example responses. The highest-rated example in each scale can carry harmful content, bypassing the model's internal guardrails. Testing across six state-of-the-art text-generation LLMs showed an average attack success rate increase of more than 60% versus plain attack prompts, with tested models anonymized. The technique targets edge cases rather than typical use, and the article positions the work as guidance for defenders on potential jailbreak risks.

Palo Alto Unit 42·Aug 17, 12:34 UTC · Aug 17, 2026AI safety & security

60

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·Sep 13, 17:02 UTC · 3d agoAI research1

40

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

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

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

Hugging Face daily papers·updated Sep 15, 17:55 UTC · 1d ago·first Sep 14, 20:00 UTC · 2d agoAI research 2 sources

40

Agentic Societies Need a Social Harness

Researchers propose a layered 'social harness' to stop malicious AI agents from exploiting inter-agent communication in multi-agent societies.

The paper shows experimentally that in agentic societies—autonomous AI agents coordinating across trust boundaries—even honest, competent agents fail to reach satisfactory outcomes with existing harnesses and messaging primitives. Faulty or malicious agents can stall collaboration, influence outcomes, and pursue harmful goals by exploiting vulnerabilities in communication. The authors propose a layered social harness architecture that prevents classes of failures, enables runtime detection of invalid messages, and supports post-facto investigation and consequences.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:57 UTC · 1d agoAI safety & security

50