Pith. sign in

Communications on Pure and Applied Mathematics , volume =

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

5 Pith papers citing it

years

2026 4 2024 1

verdicts

UNVERDICTED 5

representative citing papers

A Theory on Flow Matching with Neural Networks

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

Establishes convergence guarantees for overparameterized 2-layer ReLU networks in flow matching, generalization bounds for the velocity-field objective, and Wasserstein guarantees for generated samples, using multi-task representation learning bounds.

Asymmetric Scaling Laws from Sparse Features

stat.ML · 2026-05-22 · unverdicted · novelty 5.0

A sparse-activation model predicts double-descent loss with distinct under- and over-parameterized scaling exponents set by sparsity, plus a compute-optimal frontier favoring dataset growth.

citing papers explorer

Showing 5 of 5 citing papers.

  • How to Scale Mixture-of-Experts: From muP to the Maximally Scale-Stable Parameterization cs.LG · 2026-05-13 · unverdicted · none · ref 254

    The authors derive a Maximally Scale-Stable Parameterization (MSSP) for MoE models that achieves robust learning-rate transfer and monotonic performance gains with scale across co-scaling regimes of width, experts, and sparsity.

  • A Theory on Flow Matching with Neural Networks cs.LG · 2026-06-08 · unverdicted · none · ref 131

    Establishes convergence guarantees for overparameterized 2-layer ReLU networks in flow matching, generalization bounds for the velocity-field objective, and Wasserstein guarantees for generated samples, using multi-task representation learning bounds.

  • Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models cs.LG · 2024-01-02 · unverdicted · none · ref 104

    SPIN lets weak LLMs become strong by self-generating training data from previous model versions and training to prefer human-annotated responses over its own outputs, outperforming DPO even with extra GPT-4 data on benchmarks.

  • Random Neural Network Expressivity for Non-Linear Partial Differential Equations math.NA · 2026-05-24 · unverdicted · none · ref 41

    Random neural networks achieve a dimension-free approximation rate of 1/2 for sufficiently regular time-dependent Sobolev functions and can efficiently approximate solutions to Porous Medium Equations and Compressible Navier-Stokes Equations.

  • Asymmetric Scaling Laws from Sparse Features stat.ML · 2026-05-22 · unverdicted · none · ref 63

    A sparse-activation model predicts double-descent loss with distinct under- and over-parameterized scaling exponents set by sparsity, plus a compute-optimal frontier favoring dataset growth.