pith. sign in

Title resolution pending

A vector-contraction inequality for rademacher complexities, in: Algorithmic Learning Theory: 27th International Conference, ALT · 2016

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.LG 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Upper Generalization Bounds for Neural Oscillators

cs.LG · 2026-03-10 · conditional · novelty 6.0

Upper generalization bounds for neural oscillators scale polynomially with MLP size and time length, avoiding the curse of parametric complexity, with numerical validation on a Bouc-Wen nonlinear system.

citing papers explorer

Showing 1 of 1 citing paper.

  • Upper Generalization Bounds for Neural Oscillators cs.LG · 2026-03-10 · conditional · none · ref 12

    Upper generalization bounds for neural oscillators scale polynomially with MLP size and time length, avoiding the curse of parametric complexity, with numerical validation on a Bouc-Wen nonlinear system.