Supervised Distributional Reduction via Optimal Transport and Dependence Maximization
The introduction of a novel algorithm, Supervised Distributional Reduction (SDR), aims to create target-aware representations by integrating optimal transport with explicit dependence maximization. SDR enhances the Fused Gromov-Wasserstein (FGW) objective, aligning the input distribution's relational structure with a collection of representative points. Additionally, it incorporates a direct dependence term that promotes the learned embeddings to effectively capture task-relevant signals. This approach tackles the issue of maintaining a balance between compression and predictive accuracy in supervised data reduction contexts. The research is available on arXiv, identified by the number 2605.27619.
Key facts
- SDR stands for Supervised Distributional Reduction
- The algorithm combines optimal transport with dependence maximization
- It builds on the Fused Gromov-Wasserstein (FGW) objective
- The method aligns relational structure of input distribution with representative points
- It includes a direct dependence term for task-relevant signal
- The paper is on arXiv with ID 2605.27619
- The approach addresses compression vs predictive fidelity balance
- Supervised variants of distributional reduction are under-explored
Entities
Institutions
- arXiv