A Distribution Dependent and Independent Complexity Analysis of Manifold Regularization
원문 초록
Manifold regularization is a commonly used technique in semi-supervised learning. It enforces the classification rule to be smooth with respect to the data-manifold. Here, we derive sample complexity bounds based on pseudo-dimension for models that add a convex data dependent regularization term to a supervised learning process, as is in particular done in Manifold regularization. We then compare the bound for those semi-supervised methods to purely supervised methods, and discuss a setting in which the semi-supervised method can only have a constant improvement, ignoring logarithmic terms. By viewing Manifold regularization as a kernel method we then derive Rademacher bounds which allow for a distribution dependent analysis. Finally we illustrate that these bounds may be useful for choosing an appropriate manifold regularization parameter in situations with very sparsely labeled data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Using Instruction-Tuned Large Language Models to Identify Indicators of Vulnerability in Police Incident Narratives
Harmonic-NAS: Hardware-Aware Multimodal Neural Architecture Search on Resource-constrained Devices
STRAPPER: Preference-based Reinforcement Learning via Self-training Augmentation and Peer Regularization
Unlocking the Use of Raw Multispectral Earth Observation Imagery for Onboard Artificial Intelligence
VNE: An Effective Method for Improving Deep Representation by Manipulating Eigenvalue Distribution
Continuous Indeterminate Probability Neural Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.