Adaptive Spectral Routing
Adaptive Spectral Routing
Auto-generated stub. Edit this file to add more details.
A data partitioning technique for ensemble learning that uses the empirical Fiedler eigenvector to account for Markovian dependency structures.
Why It Matters
Provides a theoretically grounded method to mitigate the impact of Markov dependence in ensemble learning by leveraging spectral graph properties.
Evidence
Finally, we propose \emph{adaptive spectral routing}, which partitions the training data via the empirical Fiedler eigenvector of a dependency graph
Related Papers
Metadata & Links
- created_at
- 2026-04-18T05:35:00Z