{
 "artifacts": null,
 "category": "training",
 "description": "Interpret the Cramér energy of an embedding as the logarithm of the number of random in-distribution samples required to reach it through a convex hull. Use this quantity to stratify training data into geometric difficulty levels and schedule exposure from low-energy central points toward high-energy boundary points, or preferentially replay high-energy points after the model has learned the core distribution.",
 "formulas_latex": [
  "$$\\exp\\!\\left(\\Lambda_K^{*}(x)\\right)\\ \\text{is, up to polynomial factors in }d,\\ \\text{the number of independent samples needed for }x\\text{ to be captured by their random convex hull}$$",
  "$$\\Lambda_{K}^{*}(x)\\leq-\\log q_{K}(x)\\leq\\Lambda_{K}^{*}(x)+\\frac{1}{2}\\log d+C$$",
  "$$E_i=\\max_{\\theta\\in\\mathbb{R}^{d}}\\left[\\langle\\theta,z_i\\rangle-\\log\\left(\\frac{1}{B}\\sum_{j=1}^{B}e^{\\langle\\theta,z_j\\rangle}\\right)-\\frac{\\tau^2}{2}\\|\\theta\\|_2^2\\right]$$",
  "$$p_t(i)=(1-\\rho_t)\\frac{1}{N}+\\rho_t\\frac{\\exp(\\alpha_t\\widetilde E_i)}{\\sum_{j=1}^{N}\\exp(\\alpha_t\\widetilde E_j)},\\qquad \\widetilde E_i=\\frac{E_i-\\operatorname{median}(E)}{\\operatorname{MAD}(E)+\\varepsilon}$$"
 ],
 "id": 2859,
 "implementation": "Integrate this into the data loader for supervised classification or contrastive representation learning. Maintain a memory bank of embeddings and per-example energies updated every one or two epochs; compute each energy with 3–5 regularized dual-ascent steps and refresh only a random subset to control overhead. Rank training examples by robustly standardized energy \\(\\widetilde E_i\\), divide them into four empirical quantile bins, and define a schedule \\(\\rho_t\\) and \\(\\alpha_t\\): begin with nearly uniform sampling and low \\(\\alpha_t\\), then gradually increase both emphasis on high-energy examples. Use importance weights \\(w_i=1/(Np_t(i))\\), clipped to `[0.2,5]`, so the curriculum changes sampling without changing the target empirical risk. Pseudocode: `E=update_dual_energy(memory_bank); Etilde=(E-median(E))/(MAD(E)+eps); rho=rho_max*min(1,epoch/warmup); p=(1-rho)/N+rho*softmax(alpha*Etilde); idx=sample(p); loss=clip(1/(N*p[idx]),.2,5)*CE(model(x[idx]),y[idx])`. The paper supplies the geometric interpretation; the schedule, refresh rate, clipping, and \\(\\alpha_t\\) are empirical. Test first on CIFAR-100 with a ResNet-18 against uniform sampling, class-balanced sampling, and loss-based hard-example mining. Measure validation accuracy and loss versus examples seen, rare-subcluster accuracy, calibration on boundary examples, and wall-clock overhead. A successful curriculum should improve accuracy or loss at fixed examples and compute, not merely increase gradient variance.",
 "math_summary": "The paper identifies \\(\\exp(\\Lambda_K^*(x))\\), up to polynomial factors in dimension, with the number of independent samples needed for \\(x\\) to be captured by their random convex hull. Here \\(K\\subset\\mathbb{R}^d\\) is the embedding support, \\(x\\in\\operatorname{int}(K)\\), and \\(\\Lambda_K^*(x)\\) is the Cramér transform of the uniform measure on \\(K\\). The depth comparison \\(\\Lambda_K^*(x)\\le -\\log q_K(x)\\le \\Lambda_K^*(x)+\\tfrac12\\log d+C\\) means that increasing energy corresponds, within an additive \\(O(\\log d)\\) uncertainty, to decreasing half-space centrality. For a finite memory bank \\(z_1,\\ldots,z_B\\), use the regularized empirical energy \\(E_i=\\max_\\theta[\\langle\\theta,z_i\\rangle-\\widehat\\Lambda(\\theta)-\\tfrac{\\tau^2}{2}\\|\\theta\\|^2]\\). Define curriculum bins by empirical quantiles of \\(E_i\\), avoiding absolute thresholds because the theorem’s additive constant and finite-sample bias are unknown.",
 "math_tags": [
  "probability",
  "convex-analysis",
  "geometry",
  "large-deviations"
 ],
 "ml_areas": [
  "curriculum",
  "embedding",
  "training",
  "data-augmentation"
 ],
 "paper": {
  "arxiv_id": "2608.29972",
  "arxiv_url": "https://arxiv.org/abs/2608.29972",
  "summary_what_math_gives_to_ml": "The paper supplies a computable bridge between a large-deviation energy, the Cramér transform \\(\\Lambda^*\\), and geometric centrality measured by Tukey half-space depth. The key transferable asset is that \\(\\exp(\\Lambda^*(x))\\) estimates the number of independent samples needed for a point to appear in a random convex hull, while the depth comparison provides an interpretable geometric calibration up to a dimension-dependent factor. A practical neural use is to equip embedding models with a Cramér-energy confidence score and train or sample examples according to this score, rather than relying only on Euclidean distance or softmax confidence. The method is most suitable for bounded, approximately log-concave embedding distributions and should first be tested as an OOD detector and hard-example curriculum.",
  "title": "Cramér transform, half-space depth and threshold phenomena for convex bodies",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 7,
  "usefulness": 5
 },
 "solves": [
  "sample-efficiency",
  "accuracy",
  "generalization"
 ],
 "title": "Convex-hull difficulty curriculum",
 "url": "https://synthcore.org/idea/2859/convex-hull-difficulty-curriculum",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)"
 }
}