Search: “deep-rl”

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

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·Sep 16, 17:15 UTC · 16h agoAI research

15

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

DataFlex-RL: An Evaluation Platform for RLVR Data Policies

DataFlex-RL benchmark of 13 RLVR data policies on Qwen2.5-7B finds none reproducibly beats uniform sampling under matched GRPO training.

DataFlex-RL is an evaluation platform comparing rollout-selection, reweighting, and mixture data policies for RLVR under a common GRPO recipe. Across 13 configurations and 12 matched seeds with Qwen2.5-7B-Base on 12 math, logic, and science benchmarks, uniform GRPO improved domain-balanced accuracy by 7.76 points, but no alternative policy achieved a statistically significant improvement. A corrected 12-seed Llama-3.1-8B-Base extension found no consistent winner, and math-heavy evaluation summaries were negatively correlated (-0.33) with domain-balanced summaries.

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

35

Miles v0.1: Production-Level Post-Training

Radix Ark open-sources Miles v0.1, a full-stack RL post-training framework demonstrated with asynchronous agentic RL on GLM-5.2 744B-A40B across 64 GB300 GPUs.

Miles v0.1 is a full-stack, open-source system for frontier-scale reinforcement-learning post-training, built on slime with rollout engines on SGLang and trainers supporting NVIDIA Megatron-LM and PyTorch FSDP backends plus three weight-synchronization transports. It supports full-parameter RL, LoRA RL, on-policy distillation, supervised fine-tuning, true-on-policy rollout-training alignment, and extends to diffusion models. The end-to-end case study ran fully asynchronous agentic RL on GLM-5.2 744B-A40B for terminal-use coding tasks on 64 NVIDIA GB300 GPUs with a median step time of 263 seconds over the first 30 measured steps. The code is open-sourced on GitHub.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI tools & infra

45

Implementation of Machine Learning Workflows with NVIDIA cuML, RAPIDS, GPU Benchmarking, Explainability, Clustering, and Model Inference

Hands-on tutorial implements NVIDIA cuML and RAPIDS to GPU-accelerate scikit-learn-style ML workflows with benchmarking, clustering, and inference.

The tutorial demonstrates NVIDIA cuML as a GPU-accelerated machine learning framework, using cuml.accel to speed up unmodified scikit-learn scripts with zero code changes and the native cuML API for CuPy/cuDF interoperability. It benchmarks CPU versus GPU implementations of PCA, K-Means, nearest-neighbor search, logistic regression, random forests, and DBSCAN on datasets up to 200,000 samples with 64 features. It also builds GPU pipelines with UMAP, t-SNE, and HDBSCAN, validates GPU-generated SHAP explanations, uses the FIL library for forest inference, and covers model serialization and GPU/CPU portability.

MarkTechPost·Sep 13, 01:42 UTC · 4d agoAI tools & infra

14

Learning to Solve Hard Problems in RL for LLMs by Never Giving Up

Paper introduces Never Give Up adaptive sampling, fixing RL's 'Matthew Effect' where compute is wasted on easy problems and hard problems see little improvement.

Researchers identify a 'Matthew Effect' in reinforcement learning for LLMs, where RL yields large gains on easy problems but minimal improvement on hard ones because compute is misallocated. They propose Never Give Up (NGU), an adaptive sampling method that keeps generating samples for a problem until one is correct, using asynchronous RL to filter easy problems cheaply and concentrate compute on hard ones. NGU improves performance per compute on the Deepscaler math benchmark and iteratively solves the Manufactoria coding task where standard GRPO with per-test reward fails.

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

45

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

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

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

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:45 UTC · 5d agoAI research1

20

MobileVLA-R1 2.0: RL-Enhanced Reasoning for Mobile Robot Control

MobileVLA-R1 2.0 couples chain-of-thought reasoning with RL for mobile robot control, gaining 10 points on real Unitree G1 tasks.

MobileVLA-R1 2.0 is an RL-enhanced vision-language-action framework that explicitly couples structured embodied reasoning with executable mobile robot control via supervised Chain-of-Thought alignment and reinforcement learning. A reasoning-conditioned action decoder maps multimodal reasoning representations to task-level action targets, decoupling high-level action generation from robot-specific actuation for both locomotion and manipulation. It achieves an average 1.6 point SR improvement on VLN-CE and a 10.0 point improvement in full-task success on real-world Unitree G1 mobile manipulation, with evaluations covering navigation, quadruped control, and real deployments on Unitree Go2 and G1 robots.

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

32

Online Draft Co-Training for Speculative Decoding in Large-Scale, Long-Context RL Post-Training

NVIDIA researchers detail an end-to-end system for online draft co-training that speeds speculative decoding in large-scale long-context RL post-training.

The paper tackles scaling online draft co-training for speculative decoding in RL post-training, where rollout generation dominates cost. It extends packed, load-balanced zigzag ring attention to merge rank-local branch attention with causal main-sequence attention for context parallelism, and introduces TapChannel to transport target features across pipeline-parallel stages without changing the schedule. Experiments show co-trained drafts tracking the policy baseline with substantial rollout and end-to-end speedups up to 122B parameters and strong scaling at 256K tokens.

Hugging Face daily papers·Sep 6, 20:00 UTC · 10d agoAI research1

26

[AINews] Fal’s H3 Max Live breaks the infinite videogen barrier

Fal post-trained MiniMax H3 into a 'Max' variant with 35x-faster inference, enabling faster-than-realtime AI video generation and infinite streams.

Fal post-trained MiniMax's H3 model into a 'Max' variant and optimized it for its in-house inference engine, achieving roughly 35x the speed of the official endpoint. The optimization enables faster-than-realtime video generation, demonstrated by an infinite interactive AI-generated stream productized by levels.io. The roundup also notes Meta Muse Code's general availability with an SDK, open DeepSeek-V4-Flash-Vision-Exp weights, GLM-5.3-Flash's strong agentic cost/performance rankings, and Tencent's 770B-parameter Hy4 Preview MoE with 49B active parameters.

Latent Space·Sep 1, 04:36 UTC · 16d agoAI industry

50

Training a coding model to paint watercolours with TRL and OpenEnv

Hugging Face tutorial trains a coding model with TRL and OpenEnv to paint watercolours through generated code.

A Hugging Face blog walkthrough uses the TRL reinforcement learning library and the OpenEnv environment framework to train a coding model. The target task is generating code that produces watercolour-style drawings, serving as a hands-on reinforcement learning training example. No article body was available in the feed, so specifics are limited to the title.

Hugging Face Blog·Sep 3, 00:00 UTC · 14d agoAI tools & infra1

18

DeepSeek-v4.1 Flash: Pushing the Limits of KV Cache Compression

DeepSeek-V4.1 Flash is a 552B-parameter multimodal MoE model with 1M-token context achieving 4x KV cache compression for long-horizon agent workloads.

A detailed analysis of the DeepSeek-V4.1 Flash technical report describes a 552B-parameter multimodal mixture-of-experts model supporting contexts up to 1 million tokens. Its Causal Encoder-Decoder (CED) architecture activates 8B parameters during prefill and 16B during decode, and reportedly delivers about 420 tokens/s. Joint optimization of architecture (CSA2 cross-layer compression), FP4 KV cache precision, and deployment strategy cuts runtime KV cache to roughly 1/4 and persistent KV cache to about 1/8 of DeepSeek-V4-Flash at the same sequence length, targeting storage and bandwidth bottlenecks in long-horizon agent serving. The author notes all DeepSeek-V4 Pro models were taken offline following the release.

Hacker News · AI·01:39 UTC · 7h agoModel releaseHN 41↑ · 3 comments

74

Privacy Failure in Split-LLM Training, The Returned Gradient Nullifies the Decoys

Researchers show split-LLM training leaks privacy via zero-valued gradients on decoy rows, exposing which activations are real despite passing forward-channel checks.

A systems-security case study of a two-node split-LLM training setup found that the returned output gradient from an Untrusted Cloud Node is exactly zero for decoy rows, revealing which rows are real. Across nine seeds, zero patterns identified real rows in 4,096 of 4,096 frames per run, and an attack on frame contents recovered 0.65 to 1.50 percentage points of extra tokens over a baseline. Both datasets passed forward-channel privacy and quality checks but failed once the returned gradient was included. Row-wise gradient clipping and noise closed the leak for roughly 0.01 nats of held-out cross-entropy, though five unmeasured attack classes remain.

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

58

ThinkPrior: Zero-Rollout Difficulty Priors for Cold-Start Prompt Selection in RLVR

ThinkPrior builds zero-rollout difficulty priors via an offline verifier-anchored pass, halving silent groups in RLVR and cutting wasted rollouts on Qwen2.5-Math-7B.

In GRPO-based RLVR, groups where all rollouts are correct or all are wrong yield zero advantages and consume about 39% of a run's rollouts under uniform sampling. ThinkPrior initializes a Beta posterior from an external anchor pass's verifier-scored pass rate, selecting prompts by expected learnability before any target-policy rollout, without changing the loss or optimizer. On Qwen2.5-Math-7B across sixteen seeds it more than halves early silent groups and cuts wasted rollouts through step 30 by nearly a fifth, with no detected final-accuracy difference. The ThinkPrior+DAPO composition reduces generated rollouts by 10.6% at an equal 3,840-rollout update budget.

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

29

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·Sep 10, 02:17 UTC · 7d agoModel release1

80

Google Research Introduces Retrieve-for-Train (R4T): An RL-Compiled Diffusion Retriever for 12× to 20× Faster Query Fan-Out

Google Research introduced R4T, an RL-trained fan-out pipeline distilled into a 53.9M-parameter diffusion retriever achieving 12x-20x faster query fan-out.

Google Research introduced Retrieve-for-Train (R4T), which trains a fan-out language model with GRPO plus soft PPO regularization, then distills query fan-out into a 53.9M-parameter diffusion transformer that generates all retrieval embeddings in a single non-autoregressive pass. A three-term reward (groundedness 0.6, diversity 0.2 via Vendi Score, alignment 0.2) prevents paraphrastic collapse and reward hacking during training. On the Polyvore dataset, Gemma3-4B R4T-FOLM averaged 49.1 versus 40.9 for Best-of-N, and the diffusion retriever cut fan-out latency from 1.46s to 0.07s at batch size 8, a consistent 12x-20x speedup over autoregressive methods.

MarkTechPost·06:19 UTC · 3h agoAI research

42

[AINews] DeepSeek v4.1-Flash: 763B-P8B-D16B novel causal Encoder–Decoder architecture with vision marks the Return of the Whale

DeepSeek released V4.1-Flash, an open-weight 763B-parameter model with a novel causal encoder-decoder architecture, 1M context, vision input, and MIT license.

DeepSeek launched V4.1-Flash, an open-weight MIT-licensed model using a novel causal encoder-decoder architecture with 763B total parameters and asymmetric active parameters: 8B for prefill and 16B for decode. It supports 1M-token context and text+image input, priced at $0.30 per 1M input and $1.20 per 1M output tokens with a 50% off-peak discount. Artificial Analysis scored it 40 on its Intelligence Index, above DeepSeek V4 Pro 0813, and Vals ranked it the #1 open-weight model ahead of Kimi K3. Baseten shipped day-0 support and Ollama began rolling it out to paid subscribers.

Latent Space·Sep 12, 05:56 UTC · 5d agoModel release 2 sources1

80

DeepSeek AI Released DeepSeek-V4.1-Flash with 1M Context, FP4 KV Cache, and Cross-Layer Attention Reuse

DeepSeek released open-weight V4.1-Flash, a 552B MoE model with 1M context and FP4 KV cache, beating Opus-5 and GPT-5.6 Sol on agent benchmarks.

DeepSeek-V4.1-Flash is a multimodal Mixture-of-Experts model with a 552B-parameter backbone plus 196B Engram parameters, activating 8B parameters at prefill and 16B at decode, with a 1M-token context window. It introduces a causal encoder-decoder design, Compressed Sparse Attention 2, and FP4 (E2M1) KV cache quantization, cutting global KV cache to 890 bytes per token, about 1/4 of V4-Flash and 437x smaller than V1. Pre-training covered 45T multimodal tokens; the MIT-licensed weights ship on Hugging Face with vLLM and SGLang support. It scores 90.6 on Terminal-Bench 2.1 and 74.2 on DeepSWE v1.1, ahead of Opus-5 and GPT-5.6 Sol.

MarkTechPost·Sep 10, 07:31 UTC · 7d agoModel release1

80

Difficulty-Adaptive Tree-Structured Policy Optimization for Expanding Reasoning Coverage in RLVR

Researchers propose DATPO, a difficulty-adaptive tree-structured RLVR training method that expands reasoning coverage (pass@k) and improves test-time scaling on math benchmarks.

The paper identifies three rollout design principles for RLVR: difficulty-adaptive rollout expands pass@k, tree-based rollout beats parallel sampling, and sentence-entropy-guided forking overcomes token-level branching localization. DATPO combines difficulty-adaptive tree search with a sibling-diversity advantage term to promote semantic diversity during training. On mathematical reasoning benchmarks, DATPO outperforms baselines in pass@k, directly translating to superior test-time scaling performance.

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

30

UC Berkeley Researchers Release CUA-Lite, an Open Platform Unifying Sandboxes, Data, Evaluation and RL for Computer-Use Agents

UC Berkeley's CUA-Lite is an open platform unifying computer-use agent sandboxes, datasets, evaluation and RL; Lite.OSWorld cuts OSWorld memory 4.1 GB to 0.9 GB.

UC Berkeley researchers released CUA-Lite, an open platform placing agents, environments, traces, and training for computer-use agents behind one action space, one LiteSample schema, and one command across desktop, browser, and mobile. Lite.OSWorld reproduces the OSWorld task suite and evaluators in plain Docker containers (0.9 GB RAM vs 4.1 GB, cold start 23.8s, ~4.6× more parallel instances), with scores matching the QEMU/KVM VM across 13 models. The platform claims 30k+ verifiable tasks, 15+ benchmarks, 10+ agents, and 20+ datasets on Hugging Face including Aguvis, OpenCUA, and ScaleCUA. A documented SFT run lifts Qwen3-VL-2B-Instruct mean episode return from 0.138 to 0.237 on the 332-task lite.osworld split.

MarkTechPost·Sep 6, 06:11 UTC · 11d agoAI tools & infra1

45

harshatheg/Qwen-2.5-1B-RLCD — new model trending #30 on Hugging Face

A community MLX inference engine evaluates constrained JSON schema fields in parallel on Apple Silicon, reporting 5.6-7.0x latency speedups with guaranteed schema validity.

The repository harshatheg/Qwen-2.5-1B-RLCD appeared at #30 on Hugging Face trending, but its content describes Parallel Constrained Decoding, an MLX-based inference engine for structured extraction and classification on Apple Silicon Macs. Benchmarked with mlx-community/Qwen2.5-1.5B-Instruct-4bit on an M4 Max, it reports 5.6x-7.0x latency reductions (e.g., 1,900 ms to 270 ms for a 28-field support triage task) with 100% syntactic validity and calibrated field-level probabilities. The engine prefills a single KV-cache, broadcasts it across all schema fields, and slices logits to valid candidate tokens for enum fields with up to 255 choices.

Hugging Face trending models·Sep 16, 01:35 UTC · 1d agoAI tools & infra

15

MInTRL: Off-policy Intervention can boost On-policy RL

MInTRL injects sparse judge corrections into on-policy RL rollouts, expanding exploration beyond on-policy sampling while preserving learnability on math and code benchmarks.

Minimal Intervention Reinforcement Learning periodically has a judge-intervention policy replace erroneous suffixes of the current policy's output with short corrections, then returns control, keeping trajectories largely on-policy. Training uses a sequence-level advantage-regression objective that removes the need for importance sampling. Across math and code benchmarks it consistently beats standard on-policy and off-policy baselines, remains effective with self-intervention, and performs best at moderate intervention intensity.

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

40

Adaptive Gated Deepfake Detection for Low-Resolution and Resource-Constrained Environments

AdaGate-DF routes deepfake detection by image quality through dual multi-exit gates, hitting 0.9370 AUC on Celeb-DF with low inference latency.

AdaGate-DF is an adaptive gated deepfake detection framework that uses image-quality cues to send high-quality images through earlier exits, saving compute in resource-constrained settings. On Celeb-DF it achieves an AUC of 0.9370, outperforming MaD-CoRN and DefakeHop++, and reaches 0.9708 at 384x384 resolution. On FaceForensics++ it remains effective under class imbalance while balancing uncertainty-aware prediction and computational efficiency.

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

22

PARSER: Read in Parallel, Reason in Depth for Long-Context LLM Agents

PARSER uses parallel reader subagents and an RL-trained lead agent for long-context QA, beating baselines and cutting latency up to 11x.

The PARSER paper decouples reading from reasoning: frozen subagents each read one document chunk in parallel while an RL-optimized lead agent iteratively broadcasts queries and aggregates evidence in scatter-gather rounds. On multi-hop QA with 7K to 896K token contexts, a 4B-backbone PARSER beats the strongest sequential memory baseline by 5.7 points on average and 12.0 points at 896K tokens, and a 9B version surpasses DeepSeek-V4-Pro by 6.3 points. Controlled experiments show robustness to evidence position, order, and distance perturbations, with inference latency reduced by up to 11x.

Hugging Face daily papers·Sep 5, 20:00 UTC · 11d agoAI research1

52

Deep-Fake CAPTCHA: Mitigating Next-Generation Social Engineering Attacks

Researchers propose DF-CAPTCHA, a challenge-response defense that verifies callers in voice and video to defeat real-time deepfake impersonation in social engineering.

The DF-CAPTCHA framework prompts call participants with simple challenge-response tasks that are easy for humans but hard for real-time deepfake systems to convincingly generate. Responses are verified on four criteria: realism, identity consistency, task completion, and response time. User studies and experiments with real-time deepfake models across audio and video modalities show substantially improved detection over passive artifact-based methods.

arXiv cs.CR·Sep 10, 11:35 UTC · 6d agoResearch1

45

Scaling Automatic Research Agents via World Models

WMRL replaces environment execution with a world model in RL, accelerating research-agent post-training 3-4x and letting 4B/9B agents beat 48B/120B open-weight agents.

The paper identifies that environment execution dominates RL training cost for automatic research agents because each execution occupies an exclusive sandbox while generation batches efficiently. World Model RL (WMRL) substitutes a learned world model for execution, with Online Debiasing and Inverse-Variance Denoising to handle reward bias and noise, and the paper proves both improve convergence guarantees. WMRL accelerates training 3-4x across tasks and outperforms standard RL baselines; post-trained 4B and 9B agents beat 48B and 120B open-weight agents on held-out benchmarks. WMRL also transfers to post-training embodied VLA policies.

Hugging Face daily papers·Aug 28, 20:00 UTC · 19d agoAI research1

45

Reducto Releases r-1: A Single Pass Document Parsing Model That Cuts Errors 20% at 1 Cent Per Page

Reducto launched r-1, a single-pass document parsing model claiming 20% error reduction over its legacy agentic pipeline, priced at 1 cent per page.

Reducto announced r-1, the first model in a new parsing family that replaces multi-stage agentic OCR with one full-page pass handling text, tables, figures, layout, formatting, and grounding with page-relative bounding boxes. The company reports a 20% error reduction measured against its own legacy agentic pipelines, plus vendor-run wins over Amazon Textract and Azure Document Intelligence on complex documents. Pricing is a flat 1 cent per page versus 3-6 cents for legacy models; r-1 is available in preview via the V3 Parse API with no open weights.

MarkTechPost·Sep 8, 03:07 UTC · 9d agoModel release1

20

The Router Within: Eliciting Native Skill Routing from a Frozen LLM

Gavel reads native skill-routing signals from a frozen LLM's forward passes with two linear maps, beating retrieve-and-rerank pipelines by up to 21.9 points on Qwen3-32B.

Gavel (Glance And Verdict from a frozen LLM) elicits skill routing from a frozen agent LLM using two trained linear maps that read mid-layer states, keeping all skill text out of context. A glance step scores the full library against compact per-skill banks built in one forward pass at installation; a verdict step resumes shortlisted skills' forward passes and fuses likelihood and yes/no judgments as a product of experts. It transfers zero-shot to three public benchmarks plus SkillTraj, a new benchmark of 372 simulated agent trajectories. On Qwen3-32B it beats progressive disclosure and retrieve-and-rerank pipelines adding 1.2B–16B external parameters by up to 13.4 points on written tasks and 21.9 when skills are needed mid-rollout.

Hugging Face daily papers·updated Sep 14, 17:58 UTC · 2d ago·first Sep 13, 20:00 UTC · 3d agoAI research 2 sources

40

VC-Attention: Value Smoothing and Softmax Casting for Low-bit Attention

VC-Attention is a training-free low-bit attention method for diffusion transformers, achieving 1.46-1.59x kernel speedups on datacenter GPUs with higher fidelity.

VC-Attention is a training-free low-bit attention framework for diffusion transformers that pairs V-Smooth value smoothing via lightweight online clustering with ExpCast-FP8, which maps log-domain scores directly to E4M3 FP8 probability codes and eliminates the FP32 softmax exponential. It is implemented for B200, B300, H200, RTX PRO 6000, and RTX 5090 GPUs. Across Wan2.2, LongCat-Video, HunyuanVideo-1.5, and MiniMax-H3, it improves fidelity over low-bit baselines and speeds attention 1.46-1.59x over BF16 FlashAttention-4 on datacenter Blackwell and Hopper GPUs and 2.3-3.6x on workstation cards, with 1.13-1.70x faster end-to-end clip generation.

Hugging Face daily papers·updated 00:45 UTC · 8h ago·first Sep 13, 20:00 UTC · 3d agoAI research 2 sources

38

Safe Meta-Reinforcement Learning via Information Space Reachability

Safe meta-RL framework reasons about safety in information space, learning a safety value function used for safety filtering and constrained policy optimization.

The paper proposes safe meta-RL that reasons about safety in information space, capturing both physical state and the agent's belief over the underlying task. A safety value function measures the probability of avoiding unsafe regions indefinitely and satisfies a self-consistency condition and Bellman equation, making it learnable via meta-RL. The resulting algorithm uses the learned function for safety filtering and constrained policy optimization, with effectiveness demonstrated on meta-RL benchmarks.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:27 UTC · 2d agoAI research

25