Source

Tancik et al. (2020), LIT-550 — read as NOTE-296. NeRF (LIT-435), from an overlapping group and published first, is the ablation showing that the network without an encoding oversmooths. Explained by THEORY-077.

The practice

When a network takes a low-dimensional, densely sampled coordinate (pixel position, a 3D point, a time) and has to represent fine detail over it:

  • Encode the coordinate as γ(v) = [cos(2πBv), sin(2πBv)], with the rows of B sampled from N(0, σ²). The paper uses 256 frequencies. In 1D, 16 sampled frequencies matched a dense basis
  • Tune σ on held-out data, per task. It is the only thing that matters: Gaussian, uniform, log-uniform and Laplacian samplings give the same error curve against the frequencies’ standard deviation. Too small and high frequencies never converge. Too large and the fit aliases
  • Prefer sampled frequencies to NeRF-style log-spaced, axis-aligned ones. Axis-aligned frequencies favour content along the axes. Gaussian won every task in Table 1, though on simplified NeRF only by 0.2 dB
tasknonebasicpositional enc.Gaussian
2D natural images (PSNR)19.3221.7124.9525.57
3D shape (IoU)0.8640.8920.9600.973
3D MRI (PSNR)26.1428.5832.2334.51
simplified NeRF (PSNR)22.4123.1625.2825.48

Conditions

  • Low input dimension. The argument and the evidence are for 1–3D inputs, where the data is dense and a shift-invariant kernel is the right prior. It says nothing about token embeddings or high-dimensional features
  • It is not a reason to keep a large coordinate MLP. SOTA-205 recommends replacing one with an explicit structure and a small decoder, which is another way of buying high-frequency capacity. This practice is about the encoding when an MLP does read coordinates
  • Not evidence for RoPE practices. YaRN’s analogy between RoPE and Fourier features does not make this paper a source for SOTA-151 or SOTA-179

Known implementations

  • NeRF (log-spaced positional encoding, the form this generalizes)