Semi-supervised learning with max-margin graph cuts
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915967771082752 |
|---|---|
| author | Kveton, Branislav Valko, Michal Rahimi, Ali Huang, Ling |
| author_facet | Kveton, Branislav Valko, Michal Rahimi, Ali Huang, Ling |
| contents | This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic function solution. We motivate the approach, compare it to existing work, and prove a bound on its generalization error. The quality of our solutions is evaluated on a synthetic problem and three UCI ML repository datasets. In most cases, we outperform manifold regularization of support vector machines, which is a state-of-the-art approach to semi-supervised max-margin learning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_26818 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Semi-supervised learning with max-margin graph cuts Kveton, Branislav Valko, Michal Rahimi, Ali Huang, Ling Machine Learning This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic function solution. We motivate the approach, compare it to existing work, and prove a bound on its generalization error. The quality of our solutions is evaluated on a synthetic problem and three UCI ML repository datasets. In most cases, we outperform manifold regularization of support vector machines, which is a state-of-the-art approach to semi-supervised max-margin learning. |
| title | Semi-supervised learning with max-margin graph cuts |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2604.26818 |