Research on neural architectures, representations, and learning dynamics. Explore evidence about how network design affects capabilities and efficiency.
22 papers · Latest edition September 29, 2026
Where to start
Three of the latest briefs in this collection. Read the evidence and the original papers alongside them.
Stembed lets music producers search for individual instrument sounds hidden inside a full song by representing the mixture as multiple searchable stem-like embeddings.
This paper argues that claims about linear representations only become meaningful once we specify which transformations leave a representation essentially unchanged.
David Braun, Junyi Fan, Pranay Manocha, Donald S. Williamson, Adam Finkelstein
Stembed lets music producers search for individual instrument sounds hidden inside a full song by representing the mixture as multiple searchable stem-like embeddings.
This paper argues that claims about linear representations only become meaningful once we specify which transformations leave a representation essentially unchanged.
HypLTSF maps multi-scale time-series patterns into hyperbolic space so that fine-to-coarse temporal hierarchies become explicit and useful for long-term forecasting.
The paper helps recurrent networks learn reliably far beyond the sequence lengths they saw during training by stabilizing how future errors credit earlier states.
A compact quantum-inspired neural network improves federated arrhythmia detection while reducing communication costs across hospital and wearable-device clients.
A recurrent neural method learns when to classify patients early while balancing accuracy, sensitivity, specificity, and monitoring costs with explicit performance guarantees.
This work argues that plateaus, sudden learning, and power-law scaling can all emerge from one simple mathematical model of how neural-network modes turn on.
The Spectral Neuron replaces opaque nonlinearities with controllable eigenvalue-based functions, aiming to make expressive neural models more transparent and mathematically shapeable.
This work shows how several neural-network architectures can exactly encode exotic Motzkin quantum states with entanglement patterns that conventional tensor networks struggle to represent.
Nicholas J. Cooper, François G. Meyer, Michael L. Roberts, Carlos Zapata-Carratalá, Lijun Chen, Danna Gurari
This paper gives a new theory for measuring how architecturally complex a neural network is and uses it to generate thousands of previously unexplored designs.
Paolo Baglioni, Christian Keup, Vincenzo Zimbardo, Rosalba Pacelli, Alessandro Vezzani, Raffaella Burioni, Pietro Rotondo
This paper develops a new theory for how wide Bayesian neural networks generalize, showing that finite-width effects can be captured with a renormalized kernel model that matches experiments reasonably well.
Connall Garrod, Jonathan P. Keating, Christos Thrampoulidis
This paper explains how depth alone can steer neural networks away from neural collapse and toward low-rank softmax-like solutions, revealing a new theoretical bias in training dynamics.
Shuo Huang, Lorenzo Fiorito, Lorenzo Rosasco, Tomaso Poggio
This paper shows that norm-constrained deep neural networks can learn sparse hierarchical functions efficiently, avoiding the curse of dimensionality by matching the structure of the target.
James Town, Etienne Boursier, Ben Lewis, Matthias Englert, Ranko Lazic
This paper proves that small two-layer ReLU networks can learn one neuron at a time in a saddle-to-saddle process, and it quantifies how close the resulting solution is to the simplest possible interpolator.
This paper shows that a function can be understood three equivalent ways: by how well it can be reconstructed from random samples, by a compact polynomial representation, or by a small neural network.
This paper builds a unified theory showing that neural flow models can approximate both functions and operators, connecting modern continuous-depth networks to residual and plain architectures.