Search: “Epsilon”

33 stories in the last 7d

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

CategoryAll AI research 1 AI safety & security 1 Research 1

SeverityAll critical 0 high 0 medium 0 low 0 info 3

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

[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 Spaceupdated 01:39 UTC · 5h agofirst Sep 12, 05:56 UTC · 5d agoModel release 4 sources1

Epsilon-Nash Equilibria in History-Dependent SA-MDPs

Researchers give the first algorithm for computing epsilon-approximate history-dependent equilibria in state-adversarial Markov decision processes with observation-perturbing adversaries.

The paper studies state-adversarial Markov decision processes (SA-MDPs) where an adversary knowing the true state perturbs observations within state-dependent proximity sets each step. The authors prove universal history-dependent equilibrium policies do not exist and reduce SA-MDPs to a strategically equivalent constrained zero-sum one-sided partially observable stochastic game, enabling the first algorithmic route to epsilon-approximations of initial-state dependent equilibria. The algorithm is validated on small analytically verifiable games and scales to larger benchmarks, including Atari Freeway rollouts with a 12-period-ahead horizon.

arXiv cs.CRSep 16, 15:35 UTC · 15h agoAI safety & security

Privacy-enhanced federated learning via asynchronous aggregation and local differential perturbation

Federated learning framework combining dynamic differential privacy, homomorphic encryption, and local DP retains 82.6% accuracy at epsilon 0.1 while cutting communication 21.3%.

The paper proposes a privacy-enhanced federated learning framework integrating Dynamic Differential Privacy, lightweight Homomorphic Encryption, and Local Differential Privacy during training. An asynchronous aggregation strategy with version control supports distributed training in asynchronous environments. On CIFAR-10 and Purchase-100, the method maintains up to 82.6% classification accuracy under stringent privacy constraints (epsilon = 0.1) and reduces communication overhead by 21.3% versus FedAvg.

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

SCHERI: Provably Secure Speculation Under the Constant-Time Policy for CHERI (Extended Version)

Researchers formally prove existing CHERI speculation proposals leak secrets and present SCHERI, a processor design with end-to-end Spectre-resistant constant-time guarantees.

The paper builds a formal framework reasoning jointly about capability safety, speculative execution, and information-flow security on CHERI architectures. It demonstrates that existing secure-speculation proposals fail to preserve constant-time confidentiality guarantees and can transiently leak isolated secrets. The authors present SCHERI, a new processor design formally proven to provide end-to-end secure speculation for the constant-time policy, resilient to Spectre attacks.

arXiv cs.CRSep 15, 16:33 UTC · 1d agoResearch

SpliTEE: Improving LLM Inference on Trusted Hardware with Differentially Private GPU Outsourcing

SpliTEE splits LLM inference between Intel TDX trusted execution and untrusted GPUs, using differential privacy instead of encryption to protect intermediate representations.

SpliTEE extends split inference to LLMs, running inference partly inside an Intel TDX TEE while masking intermediate inputs sent to untrusted GPUs with differential privacy rather than encryption. The authors show a prompt-reconstruction attack recovers nearly 80% of prompts from unmasked intermediate representations, motivating the masking. A global sensitivity analysis bounds the required DP noise scale, avoiding quantization and keeping models in floating point. The implementation is nearly twice as fast as full CPU-based TDX inference and 5-15 seconds faster than encryption-based Slalom with higher accuracy, evaluated on Llama-3.2-3B and Qwen3-4B.

arXiv cs.CRSep 14, 04:55 UTC · 3d agoResearch

Perplexity Details Its GPU Embedding Stack: How Ivy, Tulip and ROSE Serve pplx-embed

Perplexity details its GPU embedding serving stack (Ivy, Tulip, ROSE), which reuses LLM prefill/decode kernels, CUDA graphs, and LazyTensors to cut launch overhead.

Perplexity engineers published a deep dive on the serving infrastructure behind pplx-embed, used across Perplexity Search and its API platform. The stack comprises Ivy (Rust HTTP gateway), Tulip (gRPC scheduling and batching), and ROSE (Runtime-Optimized Serving Engine), which reuses LLM prefill and decode kernels rather than running a separate embedding engine. Optimizations include whole-model CUDA graphs with lazy capture and a LazyTensor abstraction that overlaps CPU batch preparation with in-flight GPU work. Benchmarks are reported against vLLM v0.22.0 in BF16, with FlashAttention 4 generally fastest but FlashInfer 3 winning on Qwen-based models at very long sequence lengths.

MarkTechPostSep 6, 03:20 UTC · 11d agoAI tools & infra1

French prosecutors confirm arrest of suspected ZeroBytes hacker behind tax cyberattack

French prosecutors arrested an 18-year-old suspected ZeroBytes member tied to a tax authority breach exposing data of 600,000 people.

French authorities arrested an 18-year-old, alias 'ChatNoir,' in the Paris region on Aug. 18 and placed him in pretrial detention two days later over ZeroBytes attacks; a second suspect under 16 was arrested Aug. 26 and released. ZeroBytes claimed attacks on French government agencies, schools and companies starting July 16, including the DGFiP tax authority, which disclosed an August breach affecting data of more than 600,000 people. The suspect was previously under formal investigation for the 2024 Free telecom breach affecting over 19 million customers and for X account takeovers of BFM-TV and RMC linked to the Epsilon collective. Charged offenses carry up to 10 years in prison and a 300,000-euro fine.

The RecordSep 8, 12:30 UTC · 8d agoPolicy & legal

CHERI-D Reincarnate: efficient multicore CHERI temporal memory safety through allocation reincarnation (draft version)

CHERI-D Reincarnate adds allocation reincarnation to CHERI, quarantining generation IDs instead of memory to cut temporal memory-safety overheads on multicore systems.

The proposal extends CHERI-D temporal memory safety by quarantining exhausted generation IDs rather than memory slots, allowing freed memory immediate reuse through allocation reincarnation. It adds coherent ID caching and multicore support connecting physical coherence events to the virtually addressed ObjID buffer. The design was implemented as a hardware-software co-design across CHERI-Toooba FPGA softcore, QEMU, LLVM/Clang, and CheriBSD. Across evaluated workloads it substantially reduces memory-sweep frequency and quarantine overhead with low performance and hardware cost.

arXiv cs.CRSep 10, 14:19 UTC · 6d agoResearch

How CHERIoT Provides Strong and Usable Isolation Without an MMU

ACM Queue paper explains how CHERIoT uses CHERI hardware capabilities to give microcontroller-class IoT devices memory and privilege isolation without an MMU.

The ACM Queue article (DOI 10.1145/3831361) describes CHERIoT, a RISC-V-derived platform that scales CHERI capability-based hardware down to small embedded and IoT microcontrollers. It provides strong, fine-grained isolation and memory safety without a memory management unit, aiming to make compartmentalization practical for low-cost devices. The piece emphasizes usability of the isolation model alongside its security guarantees.

Lobsters · securitySep 10, 14:59 UTC · 6d agoResearch

Locus: A Framework for Exploring and Optimizing Point Addition Hardware for Zero-Knowledge Proofs

Locus framework automates ASIC and FPGA point-addition designs for elliptic curves, achieving 2.71x speedups and 3.11x area reductions for ZKPs.

Locus is a framework that automatically generates ASIC and FPGA implementations of elliptic curve point addition (PADD) for supported equation forms, enabling exploration of over 1,000 design points. On a 12nm technology node, its designs achieve a 2.71x geomean speedup and 3.11x geomean area reduction versus prior ASICs, plus 34.67x geomean speedup over CPU. Integrated into a prior ZKP accelerator at iso-area, it yields a 3.15x geomean speedup on end-to-end proof generation. The framework is open source on GitHub.

arXiv cs.CRSep 16, 15:53 UTC · 15h agoResearch

Speculative Decoding in vLLM on AMD GPUs

vLLM benchmarks speculative decoding on AMD Instinct MI300X and MI355X GPUs across five drafting methods including EAGLE-3 and native MTP.

The vLLM project documents draft-and-verify speculative decoding support for AMD GPUs via ROCm, comparing native MTP, Gemma 4 MTP, EAGLE-3, DFlash, and DSpark drafting approaches. Output-token throughput effects varied with drafting method, proposal length, model family, draft checkpoint, workload, and acceptance behavior. The post also covers how to enable each method plus practical tuning and observability considerations.

Hacker News · AISep 7, 09:26 UTC · 9d agoAI tools & infra HN 141↑ · 52 comments1

Fortunate Recall: Ontology-Driven Memory Lifecycle Management for Persistent Coherence in LLMs

Fortunate Recall introduces ontology-based lifecycle policies for LLM memory, cutting confabulation roughly in half (e.g., 45.1% to 22.4%) versus Mem0.

Fortunate Recall (FR) is a composable policy layer that classifies personal facts into a 10+1 behavioral ontology and applies category-specific lifecycle rules including differential temporal decay, slot-key supersession, event-time validity, and retrieval routing. FR-Bank scores 76.9% on the new 516-question LifecycleBench, ahead of Mem0, A-MEM, Memory-R1, and MemoryOS (61%-70.5%), and 75.2% on LongMemEval-S. End-to-end, confabulation drops from Mem0's 45.1% to 22.4% over answered queries, with the ranking replicating on open-weight Kimi K2.5 and transferring to the independent BEAM benchmark (46.8% vs 32.9%).

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

27.5KB language-agnostic WebGPU syntax highlighter

A developer released gpu-lexer, a 27.5KB language-agnostic syntax highlighter that uses a tiny WebGPU model to label code tokens in the browser.

gpu-lexer splits source into words, whitespace, and symbols, then a small WebGPU model uses local and whole-file context to assign nine token classes, working on languages never seen in training. On held-out files, 12.57% of token labels differ from Shiki, though this measures agreement with Shiki rather than objective correctness. In benchmarks against Shiki 4.4.3, Prism.js, Highlight.js, Sugar High, and Starry Night, it highlighted 10 concatenated copies of three.min.js (5.56M characters) about 10x faster on an Apple M4 Pro in Chrome 152. The author frames it as an experiment, not a grammar-equivalent highlighter.

Hacker News · securitySep 9, 01:14 UTC · 8d agoAI tools & infra HN 21↑ · 5 comments1

Jackrong/Qwopus3.8-27B-Flash-GGUF — new model trending #26 on Hugging Face

Community fine-tune Qwopus3.8-27B-Flash, built on Qwen3.8-27B, cuts agent reasoning latency with 12.8% faster decoding and 80.7% MTP acceptance.

Jackrong released Qwopus3.8-27B-Flash, a fine-tune of Qwen3.8-27B optimized for long-running agent workloads, reporting 12.8% faster decoding and 80.7% multi-token-prediction acceptance. Training used roughly 1.5 million teacher-scored SFT examples filtered to the top 10%, followed by reinforcement training with NVIDIA NeMo-RL and GSPO. The author notes an explicit trade-off: MMLU-Pro mixed-set scores are lower than the base model, and a known bug can produce incorrect Python indentation. Author-provided benchmarks have not been independently verified.

Hugging Face trending modelsSep 4, 12:43 UTC · 12d agoModel release2

[hardware] Fullhan FH8626V100 - Multiple Vulnerabilities

Multiple vulnerabilities in the Fullhan FH8626V100 hardware chip have been disclosed alongside public proof-of-concept exploits.

Exploit-DB lists an entry covering multiple vulnerabilities in the Fullhan FH8626V100, a hardware component. The listing provides no CVE ids, vulnerability classes, or evidence of in-the-wild exploitation. Impact is likely limited to devices embedding the affected chip.

Exploit-DBSep 2, 00:00 UTC · 15d agoExploit / PoC

NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction

An 8.9B-parameter latent-space language model using next-concept prediction matches OLMo-3-7B pretraining loss with only 51.3% of the training tokens.

NCP-ArchPreview augments next-token prediction with Next Concept Prediction over a product-quantized concept vocabulary built from hidden states, trained jointly end-to-end. The 8.9B model was trained on 5.73T tokens from the Dolma-3 dataset, the largest latent-space language model demonstration to date. It consumes 51.3% of the tokens to reach OLMo-3-7B's final pretraining loss and outperforms it by 2.45 points on the downstream macro-average, including a 5.99-point GSM8K gain. The learned latent space also enables lightweight domain adaptation via a 17M-parameter VQ module and improves speculative drafting accepted length by 4.17%.

Hugging Face daily papersSep 8, 20:00 UTC · 8d agoAI research1

Beyond the Turing threshold: Productive grammars generate essentially undecidable languages

A theoretical paper designs formal grammars that emulate Post's productive sets, generating languages that are provably beyond Turing decidability.

The paper elaborates on Emil Post's productive sets, which are not even semi-computable, and builds formal grammars that emulate their construction over natural numbers. The resulting languages are shown to be essentially undecidable, placing them beyond Turing decidability. This is pure computability and formal language theory with limited direct security relevance.

arXiv cs.CRSep 10, 11:20 UTC · 6d agoResearch1

Stack buffer overflow in WAD

FortiOS explicit proxy WAD daemon stack buffer overflow (CVSS 5.1) allows code execution only with Kerberos and SOCKS configured.

Fortinet advisory FG-IR-26-161 describes a stack-based buffer overflow (CWE-121) in the WAD daemon of FortiOS explicit proxy, scored CVSSv3 5.1. Exploitation requires an attacker able to bypass stack protection and ASLR, and the explicit proxy must be configured with Kerberos authentication and SOCKS enabled. If successful, it yields arbitrary code or command execution in the WAD daemon context via crafted sockets. No exploitation is reported in the advisory.

Fortinet PSIRTAug 12, 07:00 UTC · Aug 12, 2026Advisory

Register Tokens for Bounded-State Reasoning in Diffusion Language Models

Register tokens let diffusion language models like LLaDA and Dream carry reasoning state across cleared chunks, gaining up to 19.5 points on code.

Researchers propose register tokens: dedicated fixed-position tokens whose continuous hidden states are trained to carry reasoning progress across generation chunks in masked diffusion language models. After decoding and clearing a chunk, the model continues from the prompt and the carried register state instead of retaining earlier text. On LLaDA and Dream, registers outperform discrete-text carry on every benchmark, with gains up to 8.5 points on math and 19.5 points on code. Registers are especially effective for bounded code generation and can be further refined with reinforcement learning on long-horizon reasoning tasks.

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

How Fragile Is Safety Alignment at Frontier Scale? A Single-Direction Attack on a 320B MoE

Researchers show directional ablation breaks refusal in GLM-5.3-Flash, a 320B-parameter MoE, cutting refusal by 41–89 points across seven benchmarks.

The study extends directional ablation, a white-box attack that removes an aligned LLM's refusal behavior, from dense models up to ~70B parameters to GLM-5.3-Flash, a 320B-parameter mixture-of-experts model with 288 routed experts, four-wide hyper-connection residual, and block-FP8 quantization. Editing attention, dense, and routed-expert writers jointly removes 0.776 of refusal, with 74% of the effect existing only under the joint intervention; the conventional module-name-based recipe reaches only 0.066 and fails silently on MoE architectures. The attack yields 41–89 percentage-point reductions in refusal across seven harmful benchmarks with no detected capability change, and a category-concentrated refusal residue survives all edits at ranks 1 to 12.

arXiv cs.CRSep 9, 06:48 UTC · 8d agoAI safety & security

Another Blueprint In The Wall: How to Ask Frontier AI Like a Kid?

Six frontier models from OpenAI, Anthropic, xAI, and Google DeepMind converge on one imagined successor architecture when asked under a school-audience framing.

Researchers ran ten independent sessions per model type across six frontier models using a three-stage prompt sequence progressing to a full ASCII backbone architecture. Under school-audience framing, responses repeatedly converged on a shared motif including persistent latent state, adaptive computation, memory, specialist routing, verification, and stopping control, while control runs without the framing produced heterogeneous responses. A GPT-5.6 Sol output closely overlapped an architecture independently sketched by GPT-6 Astra, raising questions about shared design priors or motif propagation between model families. The paper coins 'epistemic jailbreak' for the observed loss of provenance discipline as prompt specificity increases.

Hugging Face daily papersSep 12, 20:00 UTC · 4d agoAI research 11 sources

Cadence: Error-Bounded Lossy Compression of Demand Time Series with a Time-Series Foundation Model

Cadence pairs Google's 330M-parameter TimesFM-3 foundation model with adaptive arithmetic coding, gaining 13-28% on 2026 demand series over classical predictors.

Cadence is an error-bounded lossy compressor for numeric time series combining the 330M-parameter Google TimesFM-3 foundation model with an adaptive arithmetic coder, guaranteeing a per-sample error bound. On 49 EIA-930 balancing-authority demand series from 2026 it gains 13.3% over the best of six classical predictors and 28.3% on 50 MTA ridership series, winning all 297 series-tolerance pairs with a 21.4% median gain. The paper also reports negative results, including that foundation models add negligible value for lossless coding and that PyTorch predictions are not bit-identical across batch sizes.

Hugging Face daily papersSep 4, 20:00 UTC · 12d agoAI research1

Multi-Vector (Late Interaction) Embedding Models with Sentence Transformers

Hugging Face details building and using multi-vector late-interaction embedding models with Sentence Transformers for retrieval workloads.

Hugging Face published a guide on multi-vector, late-interaction embedding models (ColBERT-style) supported through Sentence Transformers. The post covers how practitioners can build and use these models for retrieval and RAG pipelines. It is a developer tooling and technique write-up, not a security advisory.

Hugging Face BlogAug 18, 00:00 UTC · Aug 18, 2026AI tools & infra1

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Hacker News · securitySep 14, 12:23 UTC · 2d agoAI research HN 22↑ · 19 comments

Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science

Stellar Colosseum, a many-agent harness for long-horizon math and TCS research, solves open problems and reaches 71% on TCS-Bench with Gemini models.

Stellar Colosseum is a model-agnostic harness that allocates inference across long-horizon research in mathematics and theoretical computer science, using strategy exploration, a readiness gate, section-level decomposition, and verifier feedback routing. Integrated into Google Antigravity's Teamwork framework as the Long Proof pattern, it obtains new results on open problems from FOCS and JMLR papers using Gemini 3.1 Pro. On TCS-Bench it achieves 71.0% accuracy with Gemini 3.1 Pro and Gemini 3.7 Flash, and a Codeforces evaluation with Gemini 3.1 Pro solves 218 of 222 problems.

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

How Lossless Is Lossless Speculative Decoding? The Role of Numerical Precision in Orthrus

Reproduction study finds Orthrus speculative-decoding trajectories match the reference model in only ~45% of cases under BF16, but 100% under FP32.

Researchers independently reproduced Orthrus, a hybrid autoregressive-diffusion architecture claiming lossless speculative decoding via intra-model consensus, testing exact trajectory matching on 1,190 prompts across 12 domains. Under BF16, exact matching occurred in only 45% of cases for the authors' checkpoint and 43% for an independently trained model, with matching probability strongly tied to reference-model response-conditional perplexity. Despite trajectory divergence, downstream lm-eval-harness benchmarks showed no systematic degradation, while FP32 evaluation yielded exact matching on all prompts.

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

Linux Foundation takes on TRACE, a hardware-backed runtime evidence specification for AI agents

The Linux Foundation adopts TRACE, an OPAQUE-contributed spec giving AI agents hardware-attested, cryptographically verifiable runtime and compliance evidence.

The Linux Foundation accepted the TRACE (Trust, Runtime Attestation and Compliance Evidence) specification contributed by OPAQUE, developed with AMD, Intel, Microsoft, and the Technology Innovation Institute. TRACE binds runtime environment, software, policies, data classifications, and tool usage into a portable, cryptographically verifiable artifact, composing existing standards such as RATS, EAT, SLSA, SCITT, SPIFFE, and EAR. It recorded nearly 135,000 PyPI downloads within 10 weeks of its June 2026 introduction, and its technical workstream will be hosted by the Coalition for Secure AI.

Help Net SecurityAug 26, 00:00 UTC · 22d agoAI tools & infra

Latent-MoE: Domain-Aware Mixture-of-Experts for PDEs with Multi-Regime Physics

Latent-MoE adds domain-aware mixture-of-experts routing to PINNs, improving accuracy over an order of magnitude on multi-regime physics PDEs.

The paper shows standard coordinate networks used in physics-informed neural networks have translation-variant NTKs causing long-range gradient conflicts on PDEs with spatially varying physics. MoE architectures with centered compact-support routers produce a uniformly banded NTK that localizes learning. Latent-MoE interleaves domain-aware MoE blocks in a shared backbone, outperforming FB-PINNs and X-PINNs by over an order of magnitude on multi-stage time-variable physics benchmarks.

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

Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarch

New work characterizes language generation in the limit via finite witnesses, proves a full separation-width hierarchy, and formalizes all results in Lean.

The paper fully characterizes when language generation in the limit is possible for arbitrary families over a countable universe: each target must admit a finite positive witness such that targets activated by any finite sample share an infinite common intersection. It defines positive separation width and proves every level of the resulting hierarchy occurs, with countable families admitting singleton witnesses and unions of families with infinite common cores requiring unbounded finite witnesses. The characterization, a universal normalization, and a diagonal capture lemma are machine-checked in the Lean proof assistant, with the development maintained on GitHub.

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

Training and Finetuning Multi-Vector Embedding Models with Sentence Transformers

Hugging Face published a tutorial on training and finetuning multi-vector embedding models using the Sentence Transformers library.

Hugging Face's blog walks through training and finetuning multi-vector embedding models with Sentence Transformers. Multi-vector approaches store multiple vectors per document to support late-interaction retrieval. The post is a practical guide for developers building retrieval pipelines with the library.

Hugging Face BlogAug 26, 00:00 UTC · 22d agoAI tools & infra1

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 papersSep 6, 20:00 UTC · 10d agoAI research1

Expert-Space Exploration in MoE Reinforcement Learning

ESRL explores MoE expert-routing space during RL, lifting Qwen3-30B-A3B Pass@1 by 3.2 points over GRPO at no extra cost.

ESRL (Expert-Space Exploration Reinforcement Learning) is an architecture-aware framework that treats expert routing in Mixture-of-Experts models as an additional source of rollout diversity. It preserves high-confidence experts as anchors, restricts stochastic routing to a plausible candidate pool, adapts perturbation strength to router entropy, and replays recorded expert paths during policy optimization. ESRL achieves the best performance across top-K, top-1, and shared-expert routing backbones on mathematics, science, and code tasks; on Qwen3-30B-A3B it improves average Pass@1 and Pass@8 over GRPO by 3.2 and 4.5 percentage points respectively, without additional sampling or compute.

arXiv cs.AI / cs.LG / cs.CLSep 11, 16:58 UTC · 5d agoAI research 2 sources

Right Tool, Right Job: Native-Language Evaluation, Tokenizer Sensitivity, and Methodological Findings from a French-Only BabyLM

French BabyLM entry METRON-FR (125M GPT-2, 92.47M words) shows tokenizer artifacts dominate child-scale zero-shot evaluation; proposes standard diagnostics.

METRON-FR is a 125M-parameter GPT-2 pretrained on 92.47M French words, submitted to the BabyLM 2026 Strict track, scoring 85.97% on the native Quebec-French QFrBLiMP benchmark and 62.80% on the BabyLM-weighted leaderboard. A cross-lingual GLUE protocol combining French task-data translation with rank-16 LoRA shows relational tasks gain while world-knowledge tasks regress. Bilingual Lexicon Induction reaches p@1 of 68.84%, 18x above chance, and ablations show single-token zero-shot scoring is dominated by tokenizer and template artifacts at child scale.

arXiv cs.AI / cs.LG / cs.CLSep 15, 16:43 UTC · 1d agoAI research