{
 "artifacts": null,
 "category": "architecture",
 "description": "Replace dense attention weights with a compactly supported anisotropic bump derived from the obstacle solution, using one learnable ellipsoid per attention head or feature group. Tokens outside the learned ellipsoid receive exactly zero weight, while tokens inside receive smoothly decaying weights according to a fractional exponent. The learned positive-definite matrix represents orientation, scale, and correlations between feature dimensions.",
 "formulas_latex": [
  "$$\\min\\{u,\\,(-\\Delta)^{s}u-(c-\\langle Ax,x\\rangle)\\}=0$$",
  "$$u(x)=K\\max\\{1-\\langle Bx,x\\rangle,0\\}^{1+s},\\qquad B=B^{T}\u003e0$$",
  "$$(-\\Delta)^{s}v(x)=c_{n,s}\\,\\mathrm{P.V.}\\int_{\\mathbb{R}^{n}}\\frac{v(x)-v(z)}{|x-z|^{n+2s}}\\,dz$$",
  "$$w_{ij}=K_h\\bigl(1-d_{ij}^{T}B_h d_{ij}\\bigr)_{+}^{1+s_h},\\quad B_h=L_hL_h^{T}+\\varepsilon I,\\quad \\alpha_{ij}=\\frac{w_{ij}}{\\sum_{\\ell\\in\\mathcal N(i)}w_{i\\ell}+\\delta}$$"
 ],
 "id": 2989,
 "implementation": "(1) Integration point: replace or augment the score-and-softmax operation in a multi-head self-attention layer. For head h, let q_i, k_j, and v_j be the query, key, and value vectors in R^{d_h}. Compute d_ij=q_i-k_j. Give each head a learned lower-triangular matrix L_h and define B_h=L_h L_h^T+epsilon I with epsilon=1e-4. Use a_h to define s_h=0.05+0.90 sigmoid(a_h). (2) Pseudocode: for each query i and candidate key j, compute r_ij=d_ij^T B_h d_ij; compute w_ij=K_h*max(1-r_ij,0)^(1+s_h); optionally multiply w_ij by exp(q_i^T k_j/sqrt(d_h)) if content matching is retained; normalize alpha_ij=w_ij/(sum_j w_ij+delta); output o_i=sum_j alpha_ij v_j. During an initial correctness experiment, enumerate all pairs. After learning stable ellipsoids, construct candidate pairs with an approximate range-search data structure and retain only r_ij\u003c1. (3) Computed directly from the paper’s mathematics: compact support, the SPD quadratic metric, and the exponent 1+s_h. Estimated or tuned empirically: the eigenvalues of B_h, the active-neighbor count, K_h, and the initialization radius. Initialize B_h near an isotropic matrix so every query has neighbors, and add a mild penalty if the mean active count is below a minimum. (4) First experiment: train a 4-layer, 8-head transformer on CIFAR-10 image patches and on a synthetic task where each token depends on a randomly rotated local ellipse. Compare dense softmax attention, fixed square-window attention, and the ellipsoidal kernel. Report validation accuracy, loss at equal FLOPs, active neighbors per query, and wall-clock attention time. A successful result is at least two times fewer active pairs with no more than one percentage point accuracy loss, or better accuracy than fixed windows at the same active-neighbor budget. Ablate the learned matrix, the fractional exponent, and the content-score multiplier.",
 "math_summary": "Theorem 1.1 states that the decaying viscosity solution of the fractional obstacle problem min{u, (-Delta)^s u - (c - \u003cAx,x\u003e)} = 0 is u(x) = K max{1 - \u003cBx,x\u003e, 0}^{1+s}, where 0\u003cs\u003c1, c\u003e0, A is symmetric positive definite, B is symmetric positive definite, and K\u003e0. Here \u003cBx,x\u003e means x^T B x. Its positivity set is the ellipsoid {x : x^T B x \u003c 1}. The paper defines the fractional Laplacian by (-Delta)^s v(x) = c_(n,s) P.V. integral over R^n of (v(x)-v(z))/|x-z|^(n+2s) dz. For attention, use displacement d_ij = q_i - k_j, quadratic radius r_ij = d_ij^T B_h d_ij, and kernel weight w_ij = K_h (1-r_ij)_+^(1+s_h). Enforce positive definiteness with B_h = L_h L_h^T + epsilon I, where L_h is learned, epsilon\u003e0, and s_h is fixed in (0,1) or parameterized as s_h = 0.05 + 0.90 sigmoid(a_h). Normalize with alpha_ij = w_ij divided by the sum of weights for query i plus delta.",
 "math_tags": [
  "pde",
  "geometry",
  "fractional-analysis"
 ],
 "ml_areas": [
  "attention",
  "graph-nn",
  "inference-speedup"
 ],
 "paper": {
  "arxiv_id": "2609.00703",
  "arxiv_url": "https://arxiv.org/abs/2609.00703",
  "summary_what_math_gives_to_ml": "The paper gives an exact anisotropic compact-support profile for a fractional obstacle problem: a positive-definite quadratic form clipped at zero and raised to the power 1+s. The transferable asset is the ellipsoidal support together with a smooth, learnable radial decay profile, not the PDE solver itself. This can become a sparse attention or graph-neural-network kernel with learned orientation and scale, allowing the model to select a bounded anisotropic neighborhood instead of attending to every token. The main falsifiable benefit is lower attention cost at comparable accuracy, especially for data with directional or non-axis-aligned locality.",
  "title": "Ellipsoidal Positivity Sets for Fractional Obstacle Problems with Quadratic Forcing",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 6,
  "novelty": 5,
  "usefulness": 6
 },
 "solves": [
  "speedup",
  "scalability",
  "accuracy"
 ],
 "title": "Fractional Ellipsoidal Sparse Attention",
 "url": "https://synthcore.org/idea/2989/fractional-ellipsoidal-sparse-attention",
 "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
   }
  }
 }
}