arXiv:2609.28684v1 Announce Type: new Abstract: Encoding input coordinates with sinusoidal functions into multi-layer perceptrons (MLPs) has proven effective for implicit neural representations (INRs) of surfaces defined as zero-level sets. However, existing methods often struggle to balance training efficiency, rendering speed, and noise robustness: single-MLP approaches are expensive at inference, grid-based representations are fast but can limit surface smoothness and overfit input noise, and previous multiscale approaches frequently capture noise and produce artifacts due to hard spectral truncation. To address these limitations, we propose M-plicits, a multiscale framework that models surfaces as a residual sum of MLPs trained via a sequence of nested neighborhoods. Unlike existing residual approaches that rely on standard domain-wide sampling and require costly mesh extraction for visualization, our method strictly localizes supervision to narrow bands around the previous zero-level sets. This nested design naturally provides robustness against noisy input data: the coarse network acts as a low-pass filter that establishes a clean geometric prior, while subsequent residuals progressively refine the geometry without fitting to high-frequency artifacts. We further introduce a multiscale sphere-tracing algorithm and a GEMM-based analytical normal computation that bypasses auto-differentiation entirely, yielding high-fidelity real-time rendering. On Stanford and Thingi32, M-plicits achieves the best mean Chamfer distance in the coarse configuration and the best median Chamfer distance and IoU in the fine configuration, with substantially better noise robustness than iNGP, BACON, and IDF, while using an order of magnitude fewer parameters than grid-based baselines. Code, models, and data will be released at https://github.com/dsilvavinicius/m-plicits.
M-plicits: Neural Implicit Surfaces via Nested Multiscale Residuals
M-plicits, a multiscale neural implicit surface framework from researchers publishing on arXiv (2609.28684v1), models surfaces as a residual sum of MLPs trained over nested neighborhoods, achieving the best mean Chamfer distance in its coarse configuration and the best median Chamfer distance and IoU in its fine configuration on the Stanford and Thingi32 datasets. The method uses an order of magnitude fewer parameters than grid-based baselines and shows substantially better noise robustness than iNGP, BACON, and IDF, with a multiscale sphere-tracing algorithm and GEMM-based analytical normal computation that bypasses auto-differentiation for real-time rendering. Code, models, and data are to be released at github.com/dsilvavinicius/m-plicits.
Run your AI side-project on zahid.host
EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.