Metraipolis › archive › dc_bcbe82978586

Semi-supervised learning with max-margin graph cuts — arXiv:2604.26818

Source
arXiv (en)
Original
https://arxiv.org/abs/2604.26818
License (as archived)
CC0-1.0
Archived
2026-10-06T09:33:12.802Z
SHA-256 of the archived text
0a5a9154271b1371a08085378ea097ff3ed5059864bacadc1207e485de4d3cd0
Stable URL of this page
https://metraipolis.com/documento/dc_bcbe82978586

How to cite

Semi-supervised learning with max-margin graph cuts — arXiv:2604.26818 — arXiv (en), https://arxiv.org/abs/2604.26818 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bcbe82978586 (Metraipolis archive dc_bcbe82978586, sha256 0a5a9154271b1371a08085378ea097ff3ed5059864bacadc1207e485de4d3cd0)
BibTeX
@misc{dcbcbe82978586,
  title = {Semi-supervised learning with max-margin graph cuts — arXiv:2604.26818},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2604.26818},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bcbe82978586; sha256 0a5a9154271b1371a08085378ea097ff3ed5059864bacadc1207e485de4d3cd0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2604.26818. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2604.26818 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T08:24:13.967Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).