Research map / Label-efficient and robust learning / Recognition and long-tail
Efficient Training for Positive Unlabeled Learning
Emanuele Sansone, Francesco G. B. De Natale, Zhi‐Hua Zhou
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| run USMO optimization after the proposed initialization instead of initialization alone (ablation) | USMO · UCI small-scale, linear kernel, lambda=0.0001 | F-measure: 55.7 -> 67.6 | Improved |
| run USMO optimization after the proposed initialization instead of initialization alone (ablation) | USMO · UCI small-scale, Gaussian kernel, lambda=0.0001 | F-measure: 45.7 -> 66.3 | Improved |
| run USMO optimization after the proposed initialization instead of initialization alone (ablation) | USMO · UCI small-scale, linear kernel, lambda=0.1 | F-measure: 62.7 -> 74.3 | Improved |
| use USMO instead of the quadprog interior-point solver of the same problem | USMO · UCI small-scale, linear kernel, lambda=0.01 | F-measure: 71.2 -> 71.3 | No clear effect |
| use USMO instead of the quadprog interior-point solver of the same problem | USMO · UCI small-scale, Gaussian kernel, lambda=0.001 | F-measure: 69.2 -> 68.9 | No clear effect |
| use USMO instead of the ramp-loss baseline in the first comparison column | USMO · UCI small-scale, linear kernel, lambda=0.0001 | F-measure: 65.1 -> 67.6 | Improved |
| use USMO instead of the ramp-loss baseline in the first comparison column | USMO · UCI small-scale, Gaussian kernel, lambda=0.0001 | F-measure: 62.3 -> 66.3 | Improved |
| use USMO instead of the ramp-loss baseline in the first comparison column | USMO · UCI small-scale, Gaussian kernel, lambda=0.01 | F-measure: 68.6 -> 68.4 | No clear effect |
Closest papers by meaning
- Learning from positive and unlabeled examples -Finite size sample bounds (NeurIPS 2025 · similarity 0.93)
- Accessible, Realistic, and Fair Evaluation of Positive-Unlabeled Learning Algorithms (ICLR 2026 · similarity 0.92)
- A Closer Look to Positive-Unlabeled Learning from Fine-grained Perspectives: An Empirical Study (NeurIPS 2025 · similarity 0.91)
- Learning from Positive and Unlabeled Data with a Selection Bias (ICLR 2019 · similarity 0.91)
- Active Learning From Positive and Unlabeled Examples (NeurIPS 2026 · similarity 0.89)
- Positive and Unlabeled Learning with Controlled Probability Boundary Fence (ICML 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
