arXiv:2511. 04514v2 Announce Type: replace Abstract: The phenomenon of linear mode connectivity (LMC) links several aspects of deep learning, including training stability under noisy stochastic gradients, the smoothness and generalization of local minima (basins), the similarity and functional diversity of sampled models, and architectural effects on data processing.
arXiv:2606. 19941v1 Announce Type: new Abstract: Compositionality is believed to be the foundation for generalization, enabling models to reuse meaningful primitives in novel combinations.
Mode Dynamics is a framework that links coordinated parameter motion during neural network training to changes in model outputs. By decomposing recorded parameter trajectories into collective modes and mapping each mode to its state‑dependent output effect, the framework uses decomposition, reconstruction, and concentration mechanisms to analyze how behavior emerges from parameter updates. Experiments on CIFAR‑100 autoencoding and a Pythia‑70M pretraining trajectory show that a small set of leading modes can reconstruct behavior, that induced effects depend on the training path, and that modal complexity varies with task and data.
arXiv:2608.28948v1 Announce Type: cross Abstract: Over the course of the last decade, neural networks have grown from an academic curiosity to moving the markets of nations. Despite this explosion in...
arXiv:2607. 23970v1 Announce Type: cross Abstract: Machine Unlearning aims to remove undesired information from trained models without full retraining from scratch.
arXiv:2504. 06407v2 Announce Type: replace Abstract: Machine Unlearning aims to remove undesired information from trained models without full retraining from scratch.
The paper introduces a pointwise generalization theory for fully connected deep neural networks, using a pointwise Riemannian Dimension derived from eigenvalues of learned feature representations across layers. This framework provides hypothesis-dependent, representation-aware generalization bounds that are significantly tighter than traditional size- or norm-based approaches, both theoretically and experimentally. The authors analytically identify structural properties that explain deep networks’ tractability and empirically show that the pointwise Riemannian Dimension captures feature compression, over‑parameterization effects, and optimizer bias.
We study the topology of learned representations in predictive coding networks (PCNs), a neuro-inspired bidirectional architecture, using a quantitative layer-wise persistent homology analysis. We train well-performing PCNs on a synthetic classification dataset ($\geq 99.
arXiv:2602.09009v2 Announce Type: replace-cross Abstract: Scaling network depth has been a central driver behind the success of modern foundation models, yet recent investigations suggest that deep l...
Machine Unlearning aims to remove undesired information from trained models without full retraining from scratch. Despite recent progress, the loss landscape and optimization geometry of unlearning are poorly understood.
arXiv:2509. 01235v2 Announce Type: replace Abstract: Balancing training accuracy and adversarial robustness has beeen a challenge since the birth of deep learning.
arXiv:2608.30978v1 Announce Type: new Abstract: Modularity in deep neural networks has been proposed as a means of improving both interpretability and training by promoting disentangled representatio...