Even Sharper Bounds for Transductive Learning and Its Applications

arXiv:2609.28459 · cs.LG, cs.IT, math.IT, math.ST, stat.TH · Submitted 2026-09-23 · Read on arXiv

cs.LG, cs.IT, math.IT, math.ST, stat.TH

Submitted: 2026-09-23

Updated: 2026-09-24

Terminology

• Transductive Complexity — 5× in this paper
• VC Dimension — 5× in this paper · explained in 2 episodes
• Hilbert Space — 2× in this paper · explained in 2 episodes
• Sharper Transductive Local Complexity — 2× in this paper
• Generalization — 1× in this paper · explained in 13 episodes
• Generalization Bounds — 1× in this paper · explained in 2 episodes
• Loss Function — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Improved Generalization Bounds for Transductive Learning by Transductive Local Complexity and Its Applications
• Minimax Lower Bounds for Realizable Transductive Classification

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks