ZeroHour

Search: “overfitting”

6 stories in the last 7d

Why don't machine learning research agents overfit?

Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.

Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.

Data Scarcity and Model Sparsity: Mixtures-of-Experts Overfit More to Repeated Data

Study finds Mixture-of-Experts models overfit faster than dense Transformers under repeated training data, with degradation tied to total parameter sparsity.

Across models from 80M to 1B active parameters (8.5B total), MoE architectures degrade more rapidly than dense models when training data is repeated, with the effect increasing with sparsity as dictated by total parameters. Dense 80M models tolerate 8x repetition with minimal loss while MoEs suffer at 4x and underperform dense models beyond 32x. Masking-based regularization such as dropout mitigates overfitting, letting MoEs beat dense models even at over 64x repetition, though no method matches all-unique training data. Routing stabilizes early and expert specialization correlates with overfitting to repeated data.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research

Jev: New frontier model 40-400x cheaper and 20-200x faster

TypeSafe AI launches Jev, an early-access 'System One' model delivering calibrated structured outputs claimed 40-400x faster and cheaper than LLMs.

TypeSafe AI, founded by former OpenAI researcher Diogo Almeida, released its first 'System One Model' called Jev in early access. Jev forgoes string generation and is trained with Reinforcement Learning for Calibrated Decisions (RLCD) to produce type-safe structured values with calibrated probabilities. The company claims 70-500ms response times (40-200x faster), input pricing of $0.042 per million tokens, and free output tokens via a parallel sampling architecture. Target use cases include AI-powered workflows, real-time applications, and verification/guardrail tasks.

Ex-Deepmind VP Vinyals says AI self-improvement is coming but won't trigger an intelligence explosion

Ex-DeepMind research VP Oriol Vinyals says recursive self-improvement is coming but slow, and co-founds Discovery Loop with Jeff Dean to automate research.

Oriol Vinyals, former VP of Research at Google DeepMind who worked on AlphaStar, AlphaCode, and Gemini, argued at Agentic AI Summit 2026 that recursive self-improvement will progress gradually without an intelligence explosion. He identifies idea generation ('research taste') and evaluation as the two biggest bottlenecks, noting benchmarks like SWE-Bench Pro and ML-Bench mostly test the already-working steps and suffer from overfitting and scheming. He is co-founding Discovery Loop with Jeff Dean as CEO, Sanjay Ghemawat, and Quoc Le to automate the full research cycle, starting with AI research.

The Decoder · 5d agoAI industry1

Predicting Privacy Leakage from Weight Spectral Density

Study shows WeightWatcher spectral metrics like stable rank correlate with membership inference vulnerability, enabling cheaper ML privacy auditing.

The paper tests whether spectral metrics from the heavy-tailed self-regularisation framework can proxy membership inference attack (MIA) vulnerability without training expensive shadow models. On image and tabular classification tasks, stable rank correlates positively with overall MIA success, while Log alpha-Norm correlates negatively at the low false-positive regime. These correlations are stronger than those obtained from the generalisation gap, suggesting weight spectra capture leakage information overfitting measures miss. The authors propose spectral analysis as a scalable direction for privacy auditing.

arXiv cs.CR · 6d agoResearch

T1: Terminal Agent Reinforcement Learning for Long-Horizon Tasks

T1, a 122B MoE terminal agent trained with reinforcement learning, reaches 64.0% on Terminal-Bench 2.1, surpassing GPT-5.4 and GLM-5.1 on long-horizon tasks.

T1 is a 122B mixture-of-experts model trained with reinforcement learning to operate a real shell in a cloud sandbox for up to 300+ tool-call turns per task, rewarded by executing each task's own verifier. The recipe combines aggressive warm starts, dense process rewards, TITO construction, and rollout routing replay, cutting the training-to-inference log-probability difference from 0.021 to 0.013 with zero token drift. Training used an out-of-distribution corpus disjoint from Terminal-Bench 2.1. Post-training raised the base model from 43.8% to 64.0% resolved on Terminal-Bench 2.1 and 27.9% on Long-Horizon Terminal Bench.

Hugging Face daily papers · 6d agoAI research1