Pith. sign in

REVIEW 1 cited by

Theoretical Foundation of Co-Training and Disagreement-Based Algorithms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.04403 v1 pith:TM4JZCDW submitted 2017-08-15 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords co-trainingdisagreement-basedapproachesclassifierstheoreticaldatafoundationissues
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Disagreement-based approaches generate multiple classifiers and exploit the disagreement among them with unlabeled data to improve learning performance. Co-training is a representative paradigm of them, which trains two classifiers separately on two sufficient and redundant views; while for the applications where there is only one view, several successful variants of co-training with two different classifiers on single-view data instead of two views have been proposed. For these disagreement-based approaches, there are several important issues which still are unsolved, in this article we present theoretical analyses to address these issues, which provides a theoretical foundation of co-training and disagreement-based approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Relating Misfit to Gain in Weak-to-Strong Generalization Beyond the Squared Loss

    cs.LG 2025-01 conditional novelty 6.0 of 10

    For convex and approximately convex model classes, the loss gain in weak-to-strong learning is at least the KL misfit between strong and weak models, plus an error term that vanishes as k grows.

Pith tools