Skip to content

Radar

Daily bookmarks: relevant news, facts and discoveries.

Engineering ·

On-policy self-distillation for reasoning in LLMs

Published on September 28, 2026, the material presents Self-Distilled Reasoner, an on-policy self-distillation approach for language models. Its preview describes student-sampled trajectories and dense teacher supervision at token level.

Engineering ·

SIGReg and repulsion in JEPA training

A September 28, 2026 post describes how SIGReg, used by LeJEPA and LeWM, approximates a sliced MMD whose expansion reveals repulsion between pairs of samples in a batch.

Engineering ·

HySparse2 proposes two-level KV sharing

Published on September 27, 2026, HySparse2 is described as a hybrid sparse-attention method with two-level KV sharing, aimed at efficient prefill and compact KV-cache storage for agents with long contexts and multiple interactions.

Engineering ·

Memory Attention reuses keys in V=K+M

A September 27, 2026 publication reports preliminary ablations suggesting V=K+M is an effective architectural choice; the result still needs validation at larger scales.

Engineering ·

Post claims IPA decryption without a physical iPhone

A report claims that FairPlay-protected iOS IPAs can be decrypted without a physical iPhone or jailbreak. The claim may interest people studying app protection, but the briefing does not verify it.

Engineering ·

Xtrace: intra-kernel GPU tracing

A paper on intra-kernel GPU tracing through binary-level instruction splicing; its preview describes probes inserted into kernels to record execution data.

Engineering ·

Native sparse attention for long contexts

An article presents NSA, a trainable sparse-attention mechanism that combines algorithmic choices with hardware-aligned optimizations for efficient long-context modeling.

Engineering ·

Sparse layers and looping in language models

Published on September 26, 2026, the article compares standard Transformers and Mixture-of-Experts, with and without looping. The authors report that Looped-MoE scales better than the standard baseline, while dense-looping models do not.

Engineering ·

JAZ explores minimalist recursive agents

Published on September 26, 2026, the note presents JAZ, a framework using a single recursive code primitive for agent loops, and reports a claim of lower cost and better performance than two alternatives.

Engineering ·

PolaFormer++ proposes polarity-aware features

Published on September 26, 2026, the work presents a theoretical criterion for feature-map spikiness and a channel-wise polarity-aware feature map. The authors evaluate the approach across six families of visual tasks.

Engineering ·

Reducing Transformer loop redundancy

An article reports three kinds of computational redundancy across loops in looped Transformers. The authors say exploiting them reduces latency by 1.65× and memory use by 6×.

Get the essentials

Privacy, AI engineering and security in your inbox.

At most one digest per day, when there is news. Cancel at any time. We use your account's verified email.

Privacy

Looking for something else?DocumentationContact