Goto

Collaborating Authors

 inr


Operator Learning with Neural Fields: Tackling PDEs on General Geometries

Neural Information Processing Systems

Machine learning approaches for solving partial differential equations require learning mappings between function spaces. While convolutional or graph neural networks are constrained to discretized functions, neural operators present a promising milestone toward mapping functions directly. Despite impressive results they still face challenges with respect to the domain geometry and typically rely on some form of discretization. In order to alleviate such limitations, we present CORAL, a new method that leverages coordinate-based networks for solving PDEs on general geometries. CORAL is designed to remove constraints on the input mesh, making it applicable to any spatial sampling and geometry. Its ability extends to diverse problem domains, including PDE solving, spatio-temporal forecasting, and geometry-aware inference. CORAL demonstrates robust performance across multiple resolutions and performs well in both convex and non-convex domains, surpassing or performing on par with state-of-the-art models.








SurfaceReconstruction

Neural Information Processing Systems

Despitetheirsuccess,INRsoftenintroducehard to control inductive bias (i.e., the solution surface can exhibit unexplainable behaviours),havecostlyinference,andareslowtotrain.


Signal Processingfor Implicit Neural Representations

Neural Information Processing Systems

We 39] UnivCon hasserv (real-vf and g, we examine filter. Wechoose Thai Statue, Armadillo, and Dragonfrom Stanford 3DScanning Repository [84,85,86,87] todemonstrateourresults. Figure 1 8 Input Image Mean Filter Median Filter LaMaINSP-Net Target Image


Generalised Implicit Neural Representations

Neural Information Processing Systems

We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal exists on some unknown topological space from which we sample a discrete graph.In the absence of a coordinate system to identify the sampled nodes, we propose approximating their location with a spectral embedding of the graph. This allows us to train INRs without knowing the underlying continuous domain, which is the case for most graph signals in nature, while also making the INRs independent of any choice of coordinate system. We show experiments with our method on various real-world signals on non-Euclidean domains.