Initialization of a Polyharmonic Cascade, Launch and Testing

Yuriy N. Bakhvalov
12/22/2025
cs.LGmath.NA

No confident code implementation found for this paper.

Abstract

This paper concludes a series of studies on the polyharmonic cascade, a deep machine learning architecture theoretically derived from indifference principles and the theory of random functions. A universal initialization procedure is proposed, based on symmetric constellations in the form of hyperoctahedra with a central point. This initialization not only ensures stable training of cascades with tens and hundreds of layers (up to 500 layers without skip connections), but also radically simplifies the computations. Scalability and robustness are demonstrated on MNIST (98.3% without convolutions or augmentations), HIGGS (AUC approximately 0.885 on 11M examples), and Epsilon (AUC approximately 0.963 with 2000 features). All linear algebra is reduced to 2D operations and is efficiently executed on GPUs. A public repository and an archived snapshot are provided for full reproducibility.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{bakhvalov2025initialization,
  title  = {Initialization of a Polyharmonic Cascade, Launch and Testing},
  author = {Yuriy N. Bakhvalov},
  year   = {2025},
  eprint = {2512.19524},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.19524v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.19524.svg)](https://codeofpaper.com/paper/2512.19524)

Discussion