{
 "artifacts": null,
 "category": "memory",
 "description": "Replace random Fourier or random NTK features by a weighted deterministic quadrature rule for the kernel's feature integral. The resulting feature map uses the same linear-model interface as random features but can approximate the leading Gram-matrix eigenvalues substantially better at the same feature count, improving conditioning and reducing the width required for a target kernel approximation.",
 "formulas_latex": [
  "$$K(x,y)=\\int_{\\mathbb{W}}G(w,x)\\,\\overline{G(w,y)}\\,d\\mu^{*}(w),\\qquad x,y\\in\\mathbb{X}.$$",
  "$$\\widehat K_N(x,y)=\\sum_{i=1}^{N}a_iG(w_i,x)\\,\\overline{G(w_i,y)},\\qquad a_i\\geq 0,\\quad \\sum_{i=1}^{N}a_i=1.$$",
  "$$Z_{mi}=\\sqrt{a_i}\\,G(w_i,x_m),\\qquad \\widehat{\\mathbf K}=ZZ^{*},\\qquad \\widehat K_{N}(x_m,x_n)=\\sum_{i=1}^{N}Z_{mi}\\overline{Z_{ni}}.$$",
  "$$|\\lambda_j(\\mathbf K)-\\lambda_j(\\widehat{\\mathbf K})|\\leq\\|\\mathbf K-\\widehat{\\mathbf K}\\|_2.$$"
 ],
 "id": 2977,
 "implementation": "Integrate this at the input embedding or kernel layer of a kernelized model, a random-feature MLP, or a neural tangent-kernel approximation. Given inputs $X\\in\\mathbb R^{M\\times d}$, first select a fixed quadrature rule $(w_i,a_i)_{i=1}^N$ for the feature domain: use Gauss-Hermite nodes for Gaussian Fourier features in low-dimensional Euclidean inputs, or spherical-design/quasi-uniform sphere nodes for features whose parameter domain is a sphere. Normalize weights to be nonnegative and sum to one. Construct the feature matrix with the following pseudocode: `nodes, weights = quadrature_rule(N); weights = weights / weights.sum(); for minibatch Xb: F[:,i] = sqrt(weights[i]) * G(nodes[i], Xb); H = F @ theta`, where $G$ is the original Fourier, sigmoid, ReLU, or other feature function and $\\theta$ is the trainable linear readout. For complex Fourier features, either retain complex tensors or concatenate real and imaginary parts. The formula for $Z$ and $\\widehat K=ZZ^*$ is computed exactly; quadrature nodes and weights are fixed before training. On a held-out subset, compute the exact kernel Gram matrix using the original integral formula or a very large reference feature set, then estimate $\\lambda_j(\\mathbf K)$ and $\\lambda_j(\\widehat{\\mathbf K})$ with Lanczos. Also measure the operator-norm proxy, leading-eigenvalue relative error, effective rank, kernel ridge validation error, and condition number. The first cheap experiment should use MNIST or CIFAR-10 reduced to 20--50 PCA dimensions, compare $N\\in\\{64,128,256,512\\}$ deterministic Gauss or spherical quadrature features against equal-width iid random Fourier features, and train the same linear ridge classifier. Success means lower top-20 eigenvalue error and equal or better test accuracy at the same $N$; a stronger result is achieving the random-feature accuracy with at least 2x fewer features, reducing both feature memory and matrix-multiplication cost.",
 "math_summary": "The paper's central construction is the integral kernel representation $K(x,y)=\\int_{\\mathbb{W}}G(w,x)\\,\\overline{G(w,y)}\\,d\\mu^{*}(w)$, where $\\mathbb{W}$ is the feature-parameter domain, $\\mu^{*}$ is a probability measure, and $G(w,x)$ is a possibly complex-valued feature function. A quadrature rule consists of nodes $w_i\\in\\mathbb{W}$ and nonnegative weights $a_i$ satisfying $\\sum_{i=1}^{N}a_i=1$, producing $\\widehat K_N(x,y)=\\sum_{i=1}^{N}a_iG(w_i,x)\\overline{G(w_i,y)}$. For data points $x_1,\\ldots,x_M$, define $Z_{mi}=\\sqrt{a_i}G(w_i,x_m)$; then the approximate Gram matrix is $\\widehat{\\mathbf K}=ZZ^{*}$, while $\\mathbf K_{mn}=K(x_m,x_n)$. The spectral effect can be monitored with Weyl's inequality $|\\lambda_j(\\mathbf K)-\\lambda_j(\\widehat{\\mathbf K})|\\leq\\|\\mathbf K-\\widehat{\\mathbf K}\\|_2$, where $\\lambda_j$ is the $j$th ordered eigenvalue. The engineering objective is to choose quadrature nodes so that the leading eigenvalue errors are smaller than those obtained from iid Monte Carlo nodes, rather than merely minimizing pointwise kernel error.",
 "math_tags": [
  "numerical-analysis",
  "spectral-theory",
  "linear-algebra",
  "approximation-theory"
 ],
 "ml_areas": [
  "embedding",
  "inference-speedup",
  "training"
 ],
 "paper": {
  "arxiv_id": "2609.00553",
  "arxiv_url": "https://arxiv.org/abs/2609.00553",
  "summary_what_math_gives_to_ml": "The paper identifies a concrete replacement for Monte Carlo random features: approximate the kernel's integral representation with a deterministic quadrature rule chosen to preserve the spectrum of the finite-data Gram matrix. The transferable asset is not merely cheaper kernel evaluation, but better control of the important eigenvalues, which govern conditioning, effective rank, regression accuracy, and optimization behavior. A practical neural-network-adjacent use is to build weighted deterministic Fourier or spherical feature layers, then compare their Gram-spectrum error and downstream accuracy against equal-width random features.",
  "title": "Spectral Bounds for Kernel Quadrature",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 4,
  "novelty": 5,
  "usefulness": 7
 },
 "solves": [
  "memory",
  "accuracy",
  "speedup"
 ],
 "title": "Spectral quadrature features",
 "url": "https://synthcore.org/idea/2977/spectral-quadrature-features",
 "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
   }
  }
 }
}