mlsanityData to 14 Oct 2026

Representable but Unlearned: Encoding Rank and the Interaction-Prediction Floor

arXiv 2609.36208 ↗First posted 28 Sep 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Input encodings can restrict which measured contrasts a predictor can jointly reproduce, even when no single contrast is forced to vanish. We compute the attainable contrast space from an encoder's equivalence classes and a fixed contrast design, without labels, loss, or a fitted model; projecting the recorded contrasts onto that space gives an empirical error floor for any unrestricted decoder on those classes. On a 140-rectangle siRNA interaction panel, a graph neural network's training-only feature mask merges 165 endpoint states into 90 classes and cuts the rank of the 140 interaction contrasts to 72. The resulting floor is 0.009980, which is 14.6% of the fitted model's interaction squared error; the fitted model reaches 0.068335, slightly worse than a control predicting no interaction at all. A minimum of three restored chemistry columns recovers full rank. Refitting without the mask removes the floor entirely, yet interaction MSE improves by only 0.000017 under the reported protocol, and the restored columns remain absent from every training input. On a released RNA-splicing predictor, whose encoding is injective on the measured states, the same computation returns the full design rank of 1,986 and a floor of exactly zero. These results separate what an encoding permits from what a fitted model achieves; they do not identify what limits the remaining error. The rank check needs no fits and bounds what any amount of training under a fixed encoding can recover. The project repository is available at https://github.com/shadi97kh/REPRESENTABLE-BUT-UNLEARNED.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 62 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

17 of 62 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2017Inductive Representation Learning on Large Graphscited by 6,320
  5. 2016Layer Normalizationcited by 5,669
  6. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  7. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
  8. 2017Decoupled Weight Decay Regularizationcited by 1,831
  9. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
  10. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  11. 2014Convolutional Neural Networks for Sentence Classificationcited by 1,127
  12. 2020True to the Model or True to the Data?cited by 126
5 more
  1. 2022Neural Causal Models for Counterfactual Identification and Estimationcited by 57
  2. 2024Reconsidering Faithfulness in Regular, Self-Explainable and Domain Invariant GNNscited by 16
  3. 2024Consistency of Neural Causal Partial Identificationcited by 5
  4. 2026GNN Explanations that do not Explain and How to find Themcited by 5
  5. 2026When Are Neural Interaction Discoveries Real? Identifiability, Recoverability, and a Pre-Fit Diagnosticcited by 1

Built on by

Not cited yet.