arXiv:2607. 03860v1 Announce Type: new Abstract: The Strong Lottery Ticket Hypothesis (SLTH) asserts that sufficiently overparameterized, randomly initialized neural networks contain sparse subnetworks that, even without any training, can match the performance of a small trained network on a given dataset.
arXiv:2603. 02234v3 Announce Type: replace-cross Abstract: The Strong Lottery Ticket Hypothesis (SLTH) states that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initialization without training, suggesting that pruning alone is sufficient.
arXiv:2607. 20555v1 Announce Type: new Abstract: The lottery ticket hypothesis proposes that large random neural networks contain sparse subnetworks that can match the performance of dense models after comparable training.
The paper investigates the generalization behavior of the OPTQ quantization algorithm and its stochastic variant. It derives bounds on the expected squared error when a test point is drawn from a fixed distribution, linking this error to the calibration dataset and to the regularization parameter λ. The authors use these theoretical insights to propose a new recommendation for choosing λ, which shows improved performance in experiments compared to previous suggestions.
arXiv:2505. 18113v2 Announce Type: replace Abstract: Training quantized neural networks requires addressing the non-differentiable and discrete nature of the underlying optimization problem.
The paper investigates how sparsity impacts the expressivity of graph neural networks, focusing on relational and temporal variants. It extends the Strong Expressive Lottery Ticket Hypothesis to multi-relational and temporal domains, proving that sufficiently large RGNNs contain sparse subnetworks that preserve 1‑RWL expressivity and providing a probabilistic bound for random pruning. Experiments validate the theoretical bounds, compare them to empirical results on synthetic data, and explore the relationship between pre‑training expressivity, optimization behavior, and prediction quality on temporal and molecular benchmarks.
arXiv:2510.08999v2 Announce Type: replace-cross Abstract: Compressing large-scale neural networks is essential for deploying models on resource-constrained devices. Most existing methods adopt weight...
The paper extends the Strong Expressive Lottery Ticket Hypothesis to relational and temporal graph neural networks by proving that sufficiently large RGNNs contain sparse subnetworks preserving 1‑relational Weisfeiler‑Leman expressivity. It derives a probabilistic lower bound for random pruning to achieve such subnetworks and shows that common TGNNs and cross‑graph message passing can be reformulated as RGNNs to inherit these guarantees. Experiments validate the bound, compare it to empirical probabilities on synthetic data, and explore the relationship between pre‑training expressivity, optimization behavior, and prediction quality on temporal and molecular benchmarks.
arXiv:2505. 22988v3 Announce Type: replace-cross Abstract: The goal of quantization is to produce a compressed model whose output distribution is as close to the original model's as possible.
The paper presents a Quadratic Constrained Binary Optimization (QCBO) framework that provides provable guarantees for training quantized neural networks. It characterizes the topology of zero‑loss level sets, compiles finite‑depth architectures into bounded QCBOs, and introduces a sample‑wise Decomposed Lower‑Bound Optimization (DLBO) to scale Ising‑based optimization. Experiments on a coherent Ising machine show high accuracy on binary Fashion‑MNIST at 1.1‑bit precision and validate the approach on multi‑class datasets.
arXiv:2606. 04980v1 Announce Type: new Abstract: Mixture-of-Experts (MoE) architectures scale model capacity through sparse expert activation, but their deployment remains memory-bound because all expert weights must reside in memory.
arXiv:2606. 00289v1 Announce Type: new Abstract: Quantization is a fundamental tool used to compress datasets, neural network weights, and memory usage in a range of computational tasks.
arXiv:2510. 22021v3 Announce Type: replace Abstract: Safety-critical applications of machine learning require uncertainty estimates that support reliable worst-case analysis.