Provides 23,625 semi-structured smart-contract audit findings (title, description, PoC, recommendation, normalized severity) for defensive-security research; requires cleaning, deduplication, and PoC filtering before model training.
Studies looping shared transformer layers in Mixture-of-Experts models under matched budgets and proposes SMELT: loop the middle half twice while matching per-token FLOPs, non-embedding parameters, and KV cache. Shows 6.8–18.0% training-FLOPs savings on the compute-optimal frontier, stronger downstream gains on code and long-context tasks.
Turns sparse per-student records into individualized simulators that both reproduce a student’s responses and update them under tutor guidance using pooled LLM pretraining followed by per-student specialization; releases StudentSimEval and reference simulators across chess, L2 writing, and math.
Compresses conversational histories and long documents into short sequences of continuous soft memory tokens that a frozen decoder can read directly without text reconstruction. Uses a small reader-matched writer that trains only a tiny adapter, achieving 4–16× compression and much faster write/read latencies.
Distills operational know‑how from ML GitHub repositories into compact, verified 'skills' that research agents can load and reuse. Produces a skill format (SKILL.md, references, scripts), the AREX‑Skill Library (5,000+ skills from 1,000 repos), and demonstrates sizable benchmark gains when agents use skills.
Provides 4.5 billion TikTok video records with captions, timestamps, music IDs and engagement counts for research; split across 27 zstd-compressed Parquet files (~289 GB) and sampled via TikTok's mobile API; released for research-use only with privacy and ToS caveats.
Provides an end-to-end, reproducible foundation for camera‑controllable, long‑horizon video world models — converting 1.43M clips from 10 datasets into a unified canonical corpus and releasing data, pipelines, recipes, and weights. Introduces backbone‑native adaptation and a three‑stage training recipe to produce 5B–33B models that enable minute‑to‑hour rollouts after training on 5s sequences.
Introduces Declarative Attention (DA), a zero-shot protocol that has LMs declare which parts of long context to attend to during chain-of-thought, letting the runtime build dynamic attention masks and skip most KV-cache reads. Produces large token savings (up to ~52% on Gemma-4-31B) with modest accuracy loss.
Uses lightweight discrete-diffusion adapters to draft blocks of tokens in parallel while keeping the original autoregressive model as the final arbiter, enabling lossless speedups (up to 3×) and compatibility with existing AR weights via a Diffusion Distillation phase.
Studies on-policy distillation (OPD) at the data-minimal limit by training on a single query, measuring state coverage and alignment dynamics, and showing OPD is often data-overfed but algorithm-starved.
Shows that fully quantizing all 496 linear layers—including the recurrent Gated DeltaNet—of a hybrid 27B LLM to 4-bit NVFP4 W4A4 preserves benchmark accuracy while reducing model size to 17.5 GiB and improving prefill speed; includes a calibrated NVFP4 checkpoint.
Compresses KV cache for long-chain reasoning by keeping prompt tokens and evicting remaining entries uniformly at random per attention head; across four models and six reasoning tasks it matches the strongest prior evictor while delivering 32–43% higher vLLM throughput. Relies on prompt protection and redundancy across heads/text to retain reasoning traces; suitable when static memory budgets and higher serving throughput are priorities.