{
 "artifacts": null,
 "category": "regularization",
 "description": "Use the reciprocal arrangement as a probe of whether a learned representation has the intended angular response, and penalize deviations from the paper's universal beta distribution. This converts the theorem into a distribution-level regularizer rather than assuming that the reciprocal layer itself improves task loss.",
 "formulas_latex": [
  "$$q(U)=\\{U^{\\top}N_{a,w}(U)\\}^{2}=\\frac{1}{\\|g_{a,w}(U)\\|^{2}},\\qquad q(U)\\sim\\operatorname{Beta}\\!\\left(\\frac12,\\frac{p-1}{2}\\right).$$",
  "$$f_{\\mathrm{Beta}}(q)=\\frac{q^{-1/2}(1-q)^{(p-3)/2}}{B\\!\\left(\\frac12,\\frac{p-1}{2}\\right)},\\qquad 0\u003cq\u003c1.$$",
  "$$\\mathbb E[q]=\\frac1p,\\qquad \\operatorname{Var}(q)=\\frac{2(p-1)}{p^{2}(p+2)}.$$",
  "$$\\mathcal L_{\\mathrm{mom}}=\\left(\\frac1B\\sum_{b=1}^{B}q_b-\\frac1p\\right)^2+\\lambda_v\\left(\\frac1B\\sum_{b=1}^{B}(q_b-\\bar q)^2-\\frac{2(p-1)}{p^2(p+2)}\\right)^2.$$"
 ],
 "id": 2981,
 "implementation": "1. Integration point: attach the loss to a representation tensor h in a contrastive learner, classifier penultimate layer, or transformer residual stream. Use a small fixed probe dictionary A with k=8 or 16 unit vectors and uniform weights w_j=1/k; keep the probe out of the task prediction path. 2. Pseudocode: u_b=normalize(h_b); t_bj=A_j dot u_b; t_bj=sign(t_bj)*clamp(abs(t_bj),eps); g_b=sum_j w_j*A_j/t_bj; q_b=clamp(1/(norm(g_b)^2+delta),0,1); qbar=mean(q_b); compute L_mom from the target mean 1/p and variance 2(p-1)/(p^2(p+2)); optimize L_task+lambda*L_mom, with lambda ramped from zero during the first 10 percent of training. A stronger version uses a soft histogram and cross-entropy against the beta density, but the moment loss is cheaper and less sensitive to poles. 3. The target moments are analytic; estimate q moments, clipping rate, and validation correlations empirically. Sweep lambda over {1e-4,1e-3,1e-2}, use fixed random probes for a clean diagnostic, and compare against learned probes. 4. First experiment: train a 2-layer 512-wide MLP on CIFAR-10 or MNIST with and without the regularizer, using identical optimizer, seeds, and parameter budget. Compare cross-entropy, validation accuracy, expected calibration error, feature covariance spectrum, and gradient spikes. Success requires at least 0.5 percentage-point test improvement or lower calibration error without instability, while q mean and variance move toward the analytic targets. If the regularizer changes q but not task metrics, reject the method.",
 "math_summary": "Given a normalized feature U=x/||x|| and a reciprocal arrangement, define q(U)=1/||g_{a,w}(U)||^2, equivalently q(U)={U^T N_{a,w}(U)}^2. Under Haar-uniform U and simplex weights, the paper proves q has Beta(alpha,beta) with alpha=1/2 and beta=(p-1)/2. Its density is f(q)=q^{alpha-1}(1-q)^{beta-1}/B(alpha,beta) on (0,1), where B is the beta function. The target moments are E[q]=alpha/(alpha+beta)=1/p and Var(q)=alpha beta/((alpha+beta)^2(alpha+beta+1))=2(p-1)/(p^2(p+2)). For arbitrary network features this is a geometric prior rather than an unconditional guarantee, so the loss should be tested as a regularizer and not treated as an identity.",
 "math_tags": [
  "probability",
  "statistics",
  "geometry",
  "measure-theory"
 ],
 "ml_areas": [
  "embedding",
  "loss",
  "regularization",
  "training-dynamics"
 ],
 "paper": {
  "arxiv_id": "2609.00603",
  "arxiv_url": "https://arxiv.org/abs/2609.00603",
  "summary_what_math_gives_to_ml": "The paper gives an unusually strong distributional invariance for a deterministic reciprocal-projection construction: any simplex-weighted collection of nonzero directions produces an output whose squared cosine with the input is exactly Beta(1/2,(p-1)/2), regardless of the directions, rank, or overcompleteness. This can be transferred into neural networks as a geometry-aware angular mixing layer or as a calibration target for representation maps, providing controlled angular diversity without injecting random output directions. The main engineering risk is the pole at a_j^T U=0, so practical implementations must use clipping or a smooth reciprocal and explicitly measure how much the exact beta law degrades.",
  "title": "Universal Beta Incidence Angles: Cauchy Rigidity and Infinite Arrangements",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 4,
  "novelty": 7,
  "usefulness": 5
 },
 "solves": [
  "generalization",
  "stability"
 ],
 "title": "Universal Beta Angular Calibration Loss",
 "url": "https://synthcore.org/idea/2981/universal-beta-angular-calibration-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
   }
  }
 }
}