{
 "artifacts": null,
 "category": "architecture",
 "description": "Replace dense long-range token interactions with sparse message passing on a balanced hierarchical tree. Boundary token features are extended to internal tree nodes by weighted harmonic relaxation, and the resulting weighted normal derivative is used as a learned multiscale interaction or regularization signal.",
 "formulas_latex": [
  "$$w_{v_{k-1}v_k}=p^{k(s-n)}$$",
  "$$\\sum_{z\\sim v}w_{vz}\\bigl(u(v)-u(z)\\bigr)=0\\qquad(v\\ \\text{internal})$$",
  "$$\\mathcal{E}_{T}(u)=\\frac12\\sum_{(v,z)\\in E(T)}w_{vz}\\lvert u(v)-u(z)\\rvert^2=C_s\\langle f,D^s f\\rangle$$",
  "$$L_{\\mathrm{DtN}}=L_{BB}-L_{BI}L_{II}^{-1}L_{IB},\\qquad L_T=\\begin{bmatrix}L_{BB}\u0026L_{BI}\\\\L_{IB}\u0026L_{II}\\end{bmatrix}$$"
 ],
 "id": 3143,
 "implementation": "Integrate this as a sparse multiscale interaction layer after token or patch embeddings and before a Transformer block. Given N boundary feature vectors X in R^{Nxd}, construct a balanced b-ary tree by recursively grouping nearby tokens, with depth K chosen so b^K is approximately N. Here b replaces p, while n is a user-chosen effective ultrametric dimension and s controls scale selectivity. For every edge from level k-1 to k, set conductance w_k=b^{k(s-n)}. Initialize each internal-node feature as the weighted average of its children. Hold boundary features fixed and perform T Jacobi updates on internal nodes: u_v \u003c- (sum_{z~v} w_vz u_z)/(sum_{z~v}w_vz). This is the discrete weighted-harmonic equation. Compute the boundary flux q_x=sum_{z~x}w_xz(u_x-u_z), then add a learned projection of q to X through a residual connection. For small trees, compute the exact Dirichlet-to-Neumann matrix L_BB-L_BI L_II^{-1}L_IB; for large trees, use the finite relaxation approximation and backpropagate through its T steps. Add lambda times E_T(u)=1/2 sum_edges w_e||u_v-u_z||^2 to the task loss if an explicit regularizer is desired. The paper supplies the conductance law, harmonic update, flux interpretation, and energy identity; estimate the tree from token locality or clustering and tune s, lambda, and T empirically. First test on CIFAR-10 with 256 image patches or a small language-model task with 256 tokens, comparing against dense attention at matched feature width. Measure validation accuracy or perplexity, wall-clock time, peak memory, and scaling with N. Success is equal or better accuracy at lower cost, with energy decreasing across relaxation steps and stable performance across tree depths.",
 "math_summary": "The paper assigns the edge joining levels k-1 and k of the Bruhat–Tits tree a conductance w_{v_{k-1}v_k}=p^{k(s-n)}, where p is the branching prime, n is the ultrametric dimension, s\u003e0 is the fractional order, and k is the horocyclic scale. A weighted-harmonic extension u of boundary data f satisfies the local Kirchhoff equation sum_{z~v} w_{vz}(u(v)-u(z))=0 at every internal vertex v, where z ranges over neighbors and w_{vz} is the edge conductance. The boundary operator is the weighted normal derivative, formally (D^s f)(x)=-c_s lim_{k-\u003einfty}[u(v_k(x))-f(x)]/a_k, where v_k(x) is the level-k ancestor of boundary point x, a_k is the scale-dependent normalization, and c_s is a calibration constant. The paper's key structural claim is the Dirichlet-to-Neumann identity and energy equality: the tree energy E_T(u)=1/2 sum_{(v,z)}w_{vz}|u(v)-u(z)|^2 equals C_s \u003cf,D^s f\u003e, with C_s depending only on normalization. For a finite neural tree, the exact boundary operator is the Schur complement of the internal graph Laplacian: L_DtN=L_BB-L_BI L_II^{-1}L_IB, where B and I denote boundary and internal nodes.",
 "math_tags": [
  "graph-theory",
  "spectral-theory",
  "functional-analysis"
 ],
 "ml_areas": [
  "graph-nn",
  "transformer",
  "regularization",
  "inference-speedup"
 ],
 "paper": {
  "arxiv_id": "2609.03647",
  "arxiv_url": "https://arxiv.org/abs/2609.03647",
  "summary_what_math_gives_to_ml": "The paper provides a non-Archimedean analogue of the Caffarelli–Silvestre construction: a nonlocal boundary operator is represented as a local weighted-harmonic computation on a tree. The transferable asset is the explicit scale-dependent edge conductance, which turns long-range hierarchical interactions into sparse multilevel message passing, together with an energy identity that can be used as a principled regularizer. A practical neural adaptation is a differentiable tree-extension layer over a hierarchy of tokens, patches, or graph clusters, with the induced Dirichlet-to-Neumann signal fed back as a learned multiscale interaction operator.",
  "title": "Extension Problems for the Vladimirov--Taibleson Operator and the Hierarchical Laplacian",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 6,
  "usefulness": 6
 },
 "solves": [
  "accuracy",
  "scalability",
  "regularization"
 ],
 "title": "Weighted Tree Dirichlet-to-Neumann Layer",
 "url": "https://synthcore.org/idea/3143/weighted-tree-dirichlet-to-neumann-layer",
 "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
   }
  }
 }
}