← Back to all news
arXiv Machine Learning By Alexander Caicedo, V\'ictor De La Hoz, Santiago Alf\'erez

NObSP: Functional Decomposition of Neural Networks via Oblique Subspace Projections

Read the original on arXiv Machine Learning →

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.

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.

Related stories

arXiv Machine Learning
Aug 27

Controlling for Omitted Variable Bias in Deep Neural Networks

The paper introduces a control‑variable framework for deep neural networks to mitigate omitted variable bias, particularly shortcut learning where covariates like demographics influence predictions. It refits the final layer of a pre‑trained network using cross‑fitting with ridge penalisation, orthogonalises covariate effects, and marginalises predictions over covariate distributions to achieve unbiased, interpretable results. Experiments on simulated images and neuroimaging data show consistent estimation of true effects and performance close to models trained on unconfounded data.

By Manuel Pfeuffer, Roshan Prakash Rane, Kerstin Ritter, Sonja Greven
safety
More like this →
arXiv Computation and Language
Oct 1

Learning Functional Subspaces for Neural Network Compression

arXiv:2609.40127v1 Announce Type: cross Abstract: Modern transformers pair impressive capabilities with substantial memory and compute demands. Low-rank weight factorization reduces both while keepin...

By Massimo Bini, Anders Christensen, Stephan Alaniz, Judah Goldfeder, Ole Winther, Yann LeCun, Ravid Shwartz-Ziv, Zeynep Akata
llmsefficiency
More like this →
arXiv Machine Learning
Oct 16

Complete or Sparse: A Tale of Two Identifiabilities

The paper investigates when supervised learning can recover the true latent variables that generate data, focusing on two causal settings: generative (labels cause latents) and discriminative (latents cause labels). It shows that if the representation space has at least as many dimensions as the latent space, optimal encoders are linear; otherwise, identifiability fails and encoders become nonlinear. Additional constraints—such as non‑negative activations in the generative case or sparsity and spark conditions in the discriminative case—enable recovery of individual latent variables, linking nonlinear ICA, compressed sensing, and neural network interpretability.

By Junze Zhou, David Klindt
llmsdiffusionbenchmarkssafetydata-engineering
More like this →