Theoretical Foundation of Hard Top-k Primal Routing

A pervasive misconception in deep learning router design is that discrete Top-k selection operates as an ad-hoc, non-differentiable heuristic necessitating continuous relaxations such as softmax smoothing. Here, we formalize the token-to-expert dispatch mechanism through convex optimization and network flow theory, demonstrating that the hard Top-k operator over duality-adjusted affinities is the exact, closed-form solution to a linear program, incurring a zero integrality gap.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24284083
Primary Topic
Advanced Neural Network Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Theoretical Foundation of Hard Top-k Primal Routing

Carl Johan Rehn
Zenodo (CERN European Organization for Nuclear Research)
Advanced Neural Network Applications
article

Theoretical Foundation of Hard Top-k Primal Routing

Carl Johan Rehn
article en

Abstract

A pervasive misconception in deep learning router design is that discrete Top-k selection operates as an ad-hoc, non-differentiable heuristic necessitating continuous relaxations such as softmax smoothing. Here, we formalize the token-to-expert dispatch mechanism through convex optimization and network flow theory, demonstrating that the hard Top-k operator over duality-adjusted affinities is the exact, closed-form solution to a linear program, incurring a zero integrality gap.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Neural Network Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon