- Rating
- 4
- Confidence
- 1
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper studies the convergence of Factorized AdaBoost.MH through a minimax quantity that measures the weight retained after reducing a multiclass problem to a binary one. It provides an exact characterization of this quantity and uses it to show that the factorized method has a boosting-round upper bound of the same order as AdaBoost.MH, up to a constant factor.
Critical strengths
The paper gives a sharp characterization of the combinatorial quantity governing the factorized edge. The analysis is technically interesting and improves on prior bounds by removing their apparent dependence on the number of examples or classes.
Critical weaknesses
-
The problem setting and terminology need to be clarified. The paper should distinguish classes from labels consistently. For example, the first sentence of the second paragraph of the Introduction appears to conflate the two concepts. Multiclass classification and multi-label classification are different settings. Although AdaBoost.MH can be applied to both, the paper defines as a signed one-hot label matrix, so each example has exactly one positive entry. The results therefore concern multiclass classification and do not directly establish a result for general multi-label classification.
-
There is a notation error in Lemma 4.3. In the definition of the nearly balanced vector set (lines 655–658), the sum should run from to , not , since each vote vector has coordinates (classes).
Questions for authors
see Critical Weaknesses.