arXiv Machine Learning By Kazuhisa Fujita

Accelerating Hierarchical Sparse Predictive Coding with Hybrid Amortized Inference

Read the original on arXiv Machine Learning →

arXiv:2606. 27802v1 Announce Type: new Abstract: Hierarchical predictive coding provides an interpretable framework for perception as error-driven inference in multi-layer generative models, while sparse coding imposes parsimonious latent representations through explicit sparsity constraints.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computer Vision
Sep 4

Observation-Conditioned Latent Energy Priors for Sparse Implicit Neural Shape Completion

The paper introduces a lightweight, observation-conditioned latent energy prior to improve inference for frozen implicit neural representation (INR) decoders when only sparse off‑grid signed distance function (SDF) samples are available. By standardizing latent codes based on a permutation‑invariant encoding of the sparse observations and combining this energy with a validation‑selected L2 prior, the method consistently outperforms baseline L2 and a six‑component Gaussian mixture model prior on both a controlled cell‑nucleus SDF dataset and a MedShapeNet‑derived SDF completion dataset, especially in the sparsest regimes. Ablation studies confirm that the energy term’s contribution is specific to the observed context rather than generic. whyItMatters":"The approach demonstrates that pretrained INR decoders can become more observation‑aware without retraining, improving shape completion accuracy in data‑sparse scenarios."

By Paul B\"uschl, Ezequiel de la Rosa, Julia Wolleb, Julian McGinnis, C\'esar Nombela-Arrieta, Bjoern Menze