{
 "artifacts": null,
 "category": "architecture",
 "description": "Use a sparse multivariate Legendre expansion as the geometry-to-network-weights map, rather than an unconstrained MLP that consumes all shape parameters. The hypernetwork predicts only coefficients for a selected set of polynomial multi-indices, allowing high-dimensional or countably parameterized shape uncertainty to be handled with a number of learned terms determined by coefficient decay rather than ambient dimension.",
 "formulas_latex": [
  "$$W(\\mathbf y)=\\sum_{\\nu\\in\\mathbb N_0^{(\\mathbb N)}}c_\\nu P_\\nu(\\mathbf y),\\qquad P_\\nu(\\mathbf y)=\\prod_{j\\ge1}P_{\\nu_j}(y_j),$$",
  "$$\\mathbf b\\in\\ell^p(\\mathbb N),\\quad 0\u003cp\u003c1\\quad\\Longrightarrow\\quad (\\|c_\\nu\\|)_{\\nu}\\in\\ell^p,$$",
  "$$\\|c-c_N\\|_{\\ell^q}\\le C_{p,q}N^{-(1/p-1/q)}\\|c\\|_{\\ell^p},\\qquad q\u003ep,$$",
  "$$\\widehat W_N(\\mathbf y)=\\sum_{\\nu\\in\\Lambda_N}\\widehat c_\\nu P_\\nu(\\mathbf y),\\qquad \\Lambda_N=\\text{the }N\\text{ indices with largest estimated }\\|\\widehat c_\\nu\\|.$$"
 ],
 "id": 2974,
 "implementation": "(1) Integrate this into a geometry-conditioned MLP or hypernetwork. The input is the first \\(K\\) shape coordinates \\(y_j\\); the output is either the prediction itself or a low-rank adapter \\(\\Delta W(y)\\) for a base neural operator. Do not learn a dense MLP over all monomials. Maintain a set \\(\\Lambda\\) of multi-indices and learn one coefficient tensor \\(C_\\nu\\) per index. (2) Pseudocode: initialize \\(\\Lambda=\\{0\\}\\); sample a shape batch \\(y_b\\); evaluate normalized Legendre features \\(P_\\nu(y_b)\\); compute \\(\\Delta W_b=\\sum_{\\nu\\in\\Lambda}C_\\nu P_\\nu(y_b)\\); run the base network with \\(W_0+\\Delta W_b\\); backpropagate prediction loss plus \\(\\lambda\\sum_{\\nu\\in\\Lambda}\\|C_\\nu\\|_2^p\\). Every \\(T\\) steps, estimate validation sensitivity for candidate indices obtained by incrementing one active component, add the best candidates, and prune the smallest coefficients to keep \\(|\\Lambda|=N\\). This is the adapted \\(\\widehat W_N\\) formula. (3) The paper supplies the expected \\(\\ell^p\\) decay, not the value of \\(p\\); estimate an effective \\(p\\) by fitting the log-log ordered coefficient curve and compare it with validation error. Normalize Legendre polynomials and clip shape samples to valid deformations. (4) First experiment: use a 2D neural operator or MLP predicting solutions of a PDE on randomly perturbed domains with 32 shape modes. Compare a dense coordinate MLP, Fourier features, and sparse Legendre adapters at equal trainable parameter counts. Success is lower error at fixed parameter count, a validation curve close to \\(N^{-(1/p-1/2)}\\), and no degradation when increasing available shape modes from 32 to 128.",
 "math_summary": "The paper states that \\(\\mathbf b=(b_j)\\in\\ell^p\\), \\(0\u003cp\u003c1\\), yields complex-parametric holomorphy of the pulled-back operator, current, and far field, and consequently \\(\\ell^p\\)-summability of their Legendre coefficients. Let \\(P_\\nu(\\mathbf y)=\\prod_jP_{\\nu_j}(y_j)\\) be tensor Legendre polynomials indexed by finitely supported multi-indices \\(\\nu\\in\\mathbb N_0^{(\\mathbb N)}\\), and write a target operator or network parameter as \\(W(\\mathbf y)=\\sum_\\nu c_\\nu P_\\nu(\\mathbf y)\\). The transferable consequence is \\((c_\\nu)\\in\\ell^p\\). If coefficients are ordered by magnitude, the best \\(N\\)-term truncation obeys the Stechkin bound \\(\\|c-c_N\\|_{\\ell^q}\\le C_{p,q}N^{-(1/p-1/q)}\\|c\\|_{\\ell^p}\\) for any \\(q\u003ep\\). This supplies a principled sparse architecture and an empirical coefficient-selection rule.",
 "math_tags": [
  "approximation-theory",
  "functional-analysis",
  "complex-analysis"
 ],
 "ml_areas": [
  "mlp",
  "graph-nn",
  "world-model",
  "fine-tuning"
 ],
 "paper": {
  "arxiv_id": "2609.00466",
  "arxiv_url": "https://arxiv.org/abs/2609.00466",
  "summary_what_math_gives_to_ml": "The paper provides a constructive recipe for representing operators on changing surfaces in one fixed function space: a surface contravariant Piola map transports geometry-dependent Maxwell trace spaces to a reference space, while Jacobian factors cancel in the pulled-back variational form. Its second transferable asset is dimension-independent sparse approximation: if shape perturbation amplitudes belong to \\(\\ell^p\\), \\(0\u003cp\u003c1\\), holomorphic parameter dependence implies rapidly decaying multivariate Legendre coefficients. Together these suggest geometry-conditioned neural operators or hypernetworks that reuse one mesh and one parameter indexing across shapes, while replacing dense dependence on infinitely many shape variables by a learned sparse polynomial dependence. The most credible first test is a fixed-reference neural operator for PDE or scattering data across randomly deformed domains, compared against remeshing and dense parameter encodings.",
  "title": "Shape Holomorphy and Sparse Approximation of the Maxwell Electric Field Integral Operator",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 6,
  "usefulness": 6
 },
 "solves": [
  "sample-efficiency",
  "scalability",
  "accuracy"
 ],
 "title": "Sparse Legendre Shape Hypernetwork",
 "url": "https://synthcore.org/idea/2974/sparse-legendre-shape-hypernetwork",
 "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
   }
  }
 }
}