Initialization of a Polyharmonic Cascade, Launch and Testing

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Bakhvalov, Yuriy N.
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914214590808064
author Bakhvalov, Yuriy N.
author_facet Bakhvalov, Yuriy N.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2512_19524
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Initialization of a Polyharmonic Cascade, Launch and Testing
Bakhvalov, Yuriy N.
Machine Learning
Numerical Analysis
68T05, 41A15, 65D07, 62M45, 65D05
I.2.6; G.1.2
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.
title Initialization of a Polyharmonic Cascade, Launch and Testing
topic Machine Learning
Numerical Analysis
68T05, 41A15, 65D07, 62M45, 65D05
I.2.6; G.1.2
url https://arxiv.org/abs/2512.19524