arXiv Machine Learning

Revisiting Neural Processes via Fourier Transform and Volterra Series

arXiv:2606. 01172v1 Announce Type: new Abstract: Modeling unknown latent functions from finite, irregularly sampled measurements is a recurring challenge across science and engineering.

arXiv Machine Learning
Sep 17

NObSP: Functional Decomposition of Neural Networks via Oblique Subspace Projections

NObSP (Nonlinear Oblique Subspace Projections) is a framework that decomposes neural network predictions into explicit per‑feature contribution functions and an interaction residual, leveraging the linear final layer and oblique projections to avoid double counting when feature subspaces overlap. It connects to functional ANOVA and the Kolmogorov‑Arnold representation theorem, and introduces an efficient partial regression algorithm for out‑of‑sample evaluation. For convolutional networks, NObSP‑CAM generates class activation maps without backward passes after a single calibration, and experiments on tabular and vision datasets show faithfulness comparable to established attribution methods, with high function reproduction scores and improved class purity on TinyImageNet.

By Alexander Caicedo, V\'ictor De La Hoz, Santiago Alf\'erez
arXiv Machine Learning
Jul 23

Native Multi-Dimensional Subquadratic Operators via Input Dependent Long Convolutions

arXiv:2607. 19378v1 Announce Type: new Abstract: Subquadratic alternatives to attention require compromises when applied to multi-dimensional data: standard convolutions lack global receptive fields and input dependency, while recurrent models require rasterizing data such as images, volumes, and partial differential equation (PDE) into an ad-hoc $1\rm D$ scan order that violates their spatial structure.

By David R. Wessels, Farhad Ramezanghorbani, David W. Romero, Alireza Moradzadeh, Olivia Viessmann, Maksim Zhdanov, John St. John, Ken Janik, David M Knigge, Yucheng Tang, Erik J Bekkers, Saee Gopal Paliwal
arXiv Machine Learning
Sep 4

Kernel Reboot: Breaking the Boundaries of Neural Tangent Kernels for Neural Fields

The paper introduces three algorithms—NTK-KIP, MetaQuill, and MetaQuill-KIP—to enhance neural fields (NFs) for reconstructing signals from sparse data. NTK-KIP distills a support set of coordinates to enable non‑linear inpainting with a finite NTK, while MetaQuill meta‑learns a shared initialization that allows quick adaptation to new scenes via a small weight offset. MetaQuill-KIP combines both approaches, achieving high‑quality, semantically plausible reconstructions with lightweight per‑instance adaptation, outperforming diffusion‑style baselines that rely on large pretrained generative models.

By Amir Mallak, Alaa Maalouf, Lior Wolf, Daniela Rus, Dan Rosenbaum
arXiv AI
4d ago

AdaKerNet: Neural Kernel Decoding for Task-Adaptive Prediction with Multimodal Large Models

AdaKerNet is a task‑adaptive neural kernel decoder that operates on frozen multimodal representations from large foundation models, without requiring access to the models’ parameters. It learns Lipschitz‑controlled multimodal features, a reference kernel providing a soft structural prior, and a lightweight nonlinear predictor that deforms this structure. Experiments on four multimodal large language models and diverse input modalities show consistent improvements over baseline decoders, achieving up to 41% error reduction in scarce‑label settings.

By Konstantinos D. Polyzos, Eleni Oikonomou, Tara Javidi
arXiv Machine Learning
Jul 14

Vertical Fusion: Condensing Internal Representations for Robust ViT Classification

arXiv:2607. 10391v1 Announce Type: cross Abstract: Despite exposing rich intermediate representations, Vision Transformers (ViTs) are almost exclusively utilized as black-box feature extractors, where only the last layer is considered for downstream tasks.

By Francesco Di Salvo, Shyam Nandan Rai, Hamed Damirchi, Ignacio Meza De la Jara, Sebastian Doerrich, Marco Lents, Christian Ledig