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
arXiv:2601. 07944v2 Announce Type: replace-cross Abstract: Since the turn of the century, approximate Bayesian inference has steadily evolved as new computational techniques have been incorporated to handle increasingly complex, large-scale predictive problems.
By Roy Shivam Ram Shreshtth, Arnab Hazra, Gourab Mukherjee
arXiv:2607. 08605v1 Announce Type: cross Abstract: Sparse autoencoders (SAEs) have emerged as a promising technique for mechanistic interpretability by learning a set of sparse latent features in large models, each of which encodes a distinct concept.
By Weiduo Liao, Yunqiao Yang, Ying Wei
arXiv:2606. 25232v1 Announce Type: new Abstract: Ordered bottlenecks aim to provide utility at flexible budgets by assigning coarse information to early tokens and task-relevant detail to later ones.
By Erik Ayari, Manuel Traub, Martin V. Butz
arXiv:2607. 15693v1 Announce Type: cross Abstract: We describe a model of perceptual inference in primary visual cortex (V1) equivalent to a minimal diffusion model whose function can be readily understood from its parameters.
By Zeyu Yun, Alexander Belsten, Dasheng Bi, Zahra Kadkhodaie, Yubei Chen, Bruno A. Olshausen
arXiv:2602. 02948v3 Announce Type: replace Abstract: Inverse problems are fundamental to many scientific and engineering disciplines; they arise when one seeks to reconstruct hidden, underlying quantities from noisy measurements.
By Jack Michael Solomon, Rishi Leburu, Matthias Chung
arXiv:2607. 09892v1 Announce Type: cross Abstract: We introduce DenseAR, a new generative paradigm that reformulates autoregressive image generation as coarse-to-fine next-dense-stride prediction using a compact single-scale tokenizer.
By Chicago Y. Park, Jialin Mao, Xiaojian Xu, Taha Kass-Hout, Ulugbek S. Kamilov, Cao Xiao
arXiv:2607. 20652v1 Announce Type: cross Abstract: Language models are thought to exhibit the phenomenon of superposition, representing many more features than dimensions in their residual streams.
By Andrew Mack, Kraig Yuheng Tou, Mark Henry, Zhengxun Wu, Lauren Greenspan
arXiv:2606. 16193v1 Announce Type: cross Abstract: Multimodal Large Language Models (MLLMs) have demonstrated strong performance on vision-language tasks, yet their internal visual representations remain difficult to interpret.
By Yusong Zhao, Hengyi Wang, Tanuja Ganu, Akshay Nambi, Hao Wang
arXiv:2606. 14990v1 Announce Type: cross Abstract: Sparse autoencoders (SAEs) are standard tools for mechanistic interpretability, but current SAE families are constrained by fixed encoder nonlinearities such as ReLU, JumpReLU, and TopK.
By Naiyu Yin, Yue Yu
The paper introduces a training‑adaptive convolutional sparse coding (CSC) framework that learns the sparsity coefficient jointly with network parameters using an unfolded FISTA optimization. By treating the coefficient as a differentiable variable, the method balances information retention and compression through an information bottleneck perspective, promoting compact yet task‑relevant representations. A label‑free post‑training strategy further adjusts compression for corrupted inputs, yielding competitive accuracy on clean data and enhanced robustness to perturbations on CIFAR and ImageNet.
By Meng'en Qin, Yinchen Liu, Mingxuan Cui, Youlu Xing
The paper introduces tunable latent priors for diffusion models, normalizing flows, and variational autoencoders using nested dropout. These priors allow the latent dimensionality to adapt to each inverse problem, reducing reconstruction errors compared to fixed-complexity models across tasks such as compressed sensing, inpainting, denoising, and phase retrieval. In linear denoising, the authors derive the optimal latent complexity in closed form, linking it to noise level and signal spectrum.
By Sean Gunn, Jorio Cocola, Oliver De Candido, Vaggos Chatziafratis, Paul Hand