{
 "artifacts": null,
 "category": "regularization",
 "description": "Train normalized class prototypes or embedding vectors with a temperature-dependent Gaussian soft-packing energy instead of optimizing only the minimum pairwise distance. The objective permits a small reduction in a few worst distances when this substantially reduces the number of pairs remaining near the minimum, potentially improving aggregate confusion probability and hard-negative robustness.",
 "formulas_latex": [
  "$$P_{\\mathrm{e}}^{\\ast}(M,n;\\gamma)=B_{\\gamma}^{\\ast}\\bigl(K^{\\ast}_{M,n}+o(1)\\bigr),\\qquad P_{\\mathrm{e}}^{\\mathrm{fix}}(M,n;\\gamma)=B_{\\gamma}^{\\ast}\\bigl(K^{\\mathrm{fix}}_{M,n}+o(1)\\bigr).$$",
  "$$K^{\\ast}_{M,n}\\leq K^{\\mathrm{fix}}_{M,n},\\qquad K^{\\mathrm{fix}}_{M,n}=\\text{the smallest number of ordered closest-pair indices among packing-optimal codebooks}.$$",
  "$$E_{\\gamma}(z)=\\sum_{i\\neq j}\\exp\\!\\left[-\\frac{\\gamma}{8}\\left(d_{ij}^{2}-d_{\\min}^{2}\\right)\\right],\\qquad d_{ij}=\\|z_i-z_j\\|_2,\\quad d_{\\min}=\\min_{a\\neq b}d_{ab}.$$",
  "$$\\lim_{\\gamma\\to\\infty}E_{\\gamma}(z)=\\#\\{(i,j):i\\neq j,\\ d_{ij}=d_{\\min}\\}=K(z).$$"
 ],
 "id": 183,
 "implementation": "Integrate this into a hyperspherical prototype classifier or supervised metric-learning model. Let the network output h(x) in R^n and normalize it as z(x)=h(x)/(||h(x)||_2+10^-8). Maintain M normalized class prototypes c_i, or use all class representatives in a minibatch as codewords. At each step compute d_ij^2=||c_i-c_j||_2^2 for i not equal to j. Compute d_min as the minimum off-diagonal distance; initially use stop-gradient on d_min so the reference value does not create unstable competing gradients. Add L_pair=log(sum_{i not equal to j} exp(-gamma_t(d_ij^2-d_min^2)/8)), implemented with a stabilized logsumexp. Combine it with the task objective: L=L_CE+lambda*L_pair. Start gamma_t at a small value, such as 1, and increase it geometrically or linearly to gamma_max, for example gamma_t=min(gamma_max,gamma_0*1.01^step). This realizes the paper's finite-SNR optimization and progressively emphasizes near-closest-pair multiplicity. Renormalize prototypes after every update. The exact paper-derived quantity is E_gamma and its high-gamma closest-pair interpretation; no unknown theorem constants are required. Log d_min, the number of pairs with d_ij^2 less than d_min^2+epsilon, E_gamma, class-margin quantiles, validation accuracy, and robustness under Gaussian input noise. First test on CIFAR-10 using a small ResNet or 2-layer MLP with 16- or 32-dimensional embeddings, comparing cross-entropy plus ordinary hyperspherical separation against cross-entropy plus this annealed loss at equal steps and FLOPs. Success requires lower validation error or better nearest-prototype accuracy at comparable d_min, with a reduced near-closest-pair count and lower error under additive embedding noise.",
 "math_summary": "The paper gives P_e^*(M,n;gamma)=B_gamma^*(K^*_{M,n}+o(1)) for the SNR-wise optimum and P_e^fix(M,n;gamma)=B_gamma^*(K^fix_{M,n}+o(1)) for the best fixed packing-optimal codebook. Here M is the number of codewords, n is the spherical embedding dimension, gamma is SNR, B_gamma^* is the common Gaussian-tail exponential factor and prefactor, K^* is the optimal leading coefficient, and K^fix is the smallest number of ordered closest-pair indices among fixed minimum-distance-optimal codebooks. For normalized vectors z_i in R^n, let d_ij=||z_i-z_j||_2 and d_min=min_{a not equal to b} d_ab. The Gaussian pairwise-error proxy is exp(-gamma d_ij^2/8). After factoring out the smallest-distance exponent, define E_gamma(z)=sum_{i not equal to j} exp[-gamma(d_ij^2-d_min^2)/8]. As gamma tends to infinity, every pair at exactly d_min contributes one while every pair separated from d_min by a fixed positive amount contributes zero, so E_gamma converges to K(z), the ordered closest-pair count. The transferable property is that finite-gamma minimization can reduce this multiplicity by slightly sacrificing selected closest distances and moving many other pairs farther away.",
 "math_tags": [
  "geometry",
  "probability",
  "optimization"
 ],
 "ml_areas": [
  "embedding",
  "loss",
  "regularization"
 ],
 "paper": {
  "arxiv_id": "2608.25805",
  "arxiv_url": "https://arxiv.org/abs/2608.25805",
  "summary_what_math_gives_to_ml": "The paper distinguishes maximizing the minimum pairwise distance from minimizing the full high-SNR error asymptotic: once the dominant exponent is fixed, the number and arrangement of nearly closest pairs determine the leading coefficient. Its constructive insight is that allowing a vanishing sacrifice in a few pair distances can create geometric freedom to move many other pairs farther away, reducing their aggregate error contribution. This suggests an SNR- or temperature-annealed hyperspherical embedding objective that tracks soft pairwise error mass rather than only the single worst pair. The most credible transfer is to normalized class prototypes or metric-learning embeddings, where the objective can be tested against ordinary max-margin and contrastive losses.",
  "title": "Beyond Minimum Distance: The Optimal Leading Coefficient in the High-SNR Error-Probability Expansion for AWGN Spherical Codes",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 4,
  "novelty": 5,
  "usefulness": 5
 },
 "solves": [
  "accuracy",
  "generalization",
  "stability"
 ],
 "title": "Asymptotic Pair-Multiplicity Loss",
 "url": "https://synthcore.org/idea/183/asymptotic-pair-multiplicity-loss",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}