Unverified
2026
Ensemble-Averaged Sparse Graph Search
Replace a binary neural connectivity mask by independent Bernoulli edge probabilities and optimize a deterministic expected message-passing objective before discretization. The resulting module can search sparse GNN edges or expert-to-token routes without repeatedly sampling many discrete architectures during training.
Paper: Learning LDPC codes with quantized density evolution over relaxed protographs
arXiv:2607.08484