Systematic Exploration of Power-Augmented Feedforward Layers in Transformer Networks
Bibliographic record
Abstract
Multi-layer perceptrons (MLPs) represent the foundational architecture of deep learning neural networks, consisting of fully-connected layers organized in a hierarchical structure. While activation functions between layers introduce non-linearity to the overall network, the fundamental computation within each layer remains strictly linear, where each neuron computes a weighted sum of its inputs. This linear nature of individual layer operations is a defining characteristic that constrains the expressiveness of each layer to linear transformations, with the network’s overall representational capacity determined by its depth (number of layers) and width (number of neurons per layer). In this thesis, the efficiency of using power-augmented networks in transformer models will be investigated. Power-augmented networks utilize trainable powers on their connections, allowing powers to be any real numbers. This introduces a more expressive form of learning non-linearity in neural networks and enables the learning of complex curves using non-linear power-augmented connections potentially enabling capturing of intricate patterns more efficiently. While conventional networks are fundamentally limited to learning piecewise linear functions, power- augmented functions can capture complex curves with fewer resources than traditional approaches. A crit- ical challenge addressed in this work involved ensuring numerical stability, particularly when dealing with fractional powers and small input values. Through systematic experiments, this thesis delivers an optimized NVIDIA CUDA implementation for the power-augmented perceptron layer and novel solutions to training stability challenges inherent in networks with dynamic power parameters. The presented evaluation framework demonstrates that power-augmented networks can achieve optimal performance with significant trade-offs across measurable metrics such as parameter count, validation loss, training time, and inference time. Key findings show that power-augmented networks can achieve superior or comparable validation loss performance to deeper baseline models while requiring fewer parameters and offering reductions in computation time and latency.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".