pith. sign in

On the origin of algorithmic progress in ai, 2025

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

fields

cs.LG 2 cs.AI 1

years

2026 3

verdicts

UNVERDICTED 3

clear filters

representative citing papers

Internal Data Repetition Destroys Language Models

cs.LG · 2026-06-23 · unverdicted · novelty 6.0

Repetition of training data produces a systematic eval loss peak at intermediate repeat counts whose location scales with model size, quantifiable as large compute-equivalent loss even at modest repetition fractions.

Dynamic Short Convolutions Improve Transformers

cs.LG · 2026-06-02 · unverdicted · novelty 6.0

Dynamic short convolutions applied to key/query/value projections and linear layers in Transformers yield consistent performance gains and 1.33-1.60x compute advantages over standard models on language modeling from 150M to 2B parameters.

Two AI Metrics Diverged: Will it Make All the Difference?

cs.AI · 2026-07-01 · unverdicted · novelty 5.0

Bounded performance metrics always favor convergence of AI capabilities to meek models while unbounded metrics allow frontier models to maintain leads indefinitely, with policy implications for capability concentration.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Internal Data Repetition Destroys Language Models cs.LG · 2026-06-23 · unverdicted · none · ref 14

    Repetition of training data produces a systematic eval loss peak at intermediate repeat counts whose location scales with model size, quantifiable as large compute-equivalent loss even at modest repetition fractions.

  • Dynamic Short Convolutions Improve Transformers cs.LG · 2026-06-02 · unverdicted · none · ref 32

    Dynamic short convolutions applied to key/query/value projections and linear layers in Transformers yield consistent performance gains and 1.33-1.60x compute advantages over standard models on language modeling from 150M to 2B parameters.