mlsanityData to 7 Oct 2026

Sparse-by-Design Cross-Modality Prediction: L0-Gated Representations for Reliable and Efficient Learning

arXiv 2603.26801 ↗First posted 26 Mar 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Predictive systems increasingly span heterogeneous modalities such as graphs, language, and tabular records, but sparsity and efficiency remain modality-specific (graph edge or neighborhood sparsification, Transformer head or layer pruning, and separate tabular feature-selection pipelines). This fragmentation makes results hard to compare, complicates deployment, and weakens reliability analysis across end-to-end KDD pipelines. A unified sparsification primitive would make accuracy-efficiency trade-offs comparable across modalities and enable controlled reliability analysis under representation compression. We ask whether a single representation-level mechanism can yield comparable accuracy-efficiency trade-offs across modalities while preserving or improving probability calibration. We propose L0-Gated Cross-Modality Learning (L0GM), a modality-agnostic, feature-wise hard-concrete gating framework that enforces L0-style sparsity directly on learned representations. L0GM attaches hard-concrete stochastic gates to each modality's classifier-facing interface: node embeddings (GNNs), pooled sequence embeddings such as CLS (Transformers), and learned tabular embedding vectors (tabular models). This yields end-to-end trainable sparsification with an explicit control knob for the active feature fraction. To stabilize optimization and make trade-offs interpretable, we introduce an L0-annealing schedule that induces clear accuracy-sparsity Pareto frontiers. Across three public benchmarks (ogbn-products, Adult, IMDB), L0GM achieves competitive predictive performance while activating fewer representation dimensions, and it reduces Expected Calibration Error (ECE) in our evaluation. Overall, L0GM establishes a modality-agnostic, reproducible sparsification primitive that supports comparable accuracy, efficiency, and calibration trade-off analysis across heterogeneous modalities.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 29 references that are in the map. First posted on arXiv 26 Mar 2026.

Builds on

21 of 29 references.

References · 21

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2017On Calibration of Modern Neural Networkscited by 4,860
  6. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  8. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  9. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  10. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
  11. 2019Are Sixteen Heads Really Better than One?cited by 803
  12. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
9 more
  1. 2016Wide & Deep Learning for Recommender Systemscited by 745
  2. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
  3. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  4. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  5. 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
  6. 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
  7. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  8. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  9. 2017Deep & Cross Network for Ad Click Predictionscited by 392

Built on by

Not cited yet.