Distance-informed Neural Processes

Aishwarya Venkataramanan, Joachim Denzler
8/26/2025
cs.LGcs.AI

No official code found. Best implementation: cvjena/DNP (1 star, last commit 2025-11-24).

Abstract

We propose the Distance-informed Neural Process (DNP), a novel variant of Neural Processes that improves uncertainty estimation by combining global and distance-aware local latent structures. Standard Neural Processes (NPs) often rely on a global latent variable and struggle with uncertainty calibration and capturing local data dependencies. DNP addresses these limitations by introducing a global latent variable to model task-level variations and a local latent variable to capture input similarity within a distance-preserving latent space. This is achieved through bi-Lipschitz regularization, which bounds distortions in input relationships and encourages the preservation of relative distances in the latent space. This modeling approach allows DNP to produce better-calibrated uncertainty estimates and more effectively distinguish in- from out-of-distribution data. Empirical results demonstrate that DNP achieves strong predictive performance and improved uncertainty calibration across regression and classification tasks.

View on arXivView PDF

Code Implementations(1)

cvjena/DNPCommunity65%

Code for NeurIPS 2025 paper "Distance-informed Neural Processes"

10PythonAug 26, 202511 months ago

Similar Papers

Cite this paper

@article{venkataramanan2025distanceinformed,
  title  = {Distance-informed Neural Processes},
  author = {Aishwarya Venkataramanan and Joachim Denzler},
  year   = {2025},
  eprint = {2508.18903},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.18903v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.18903.svg)](https://codeofpaper.com/paper/2508.18903)

Discussion