2021/05/30 by Jesse Geneson, Geneson, Jesse
Computer Science · #Machine Learning and Algorithms #Optimization and Search Problems #Imbalanced Data Classification Techniques
paper · pdf · doi:10.48550/arxiv.2105.14648
We investigate the generalization of the mistake-bound model to continuous real-valued single variable functions. Let Fq be the class of absolutely continuous functions f: [0, 1] → ℝ with ||f'||q ≤ 1, and define optp(Fq) as the best possible bound on the worst-case sum of the pth powers of the absolute prediction errors over any number of trials. Kimber and Long (Theoretical Computer Science, 1995) proved for q ≥ 2 that optp(Fq) = 1 when p ≥ 2 and optp(Fq) = ∞ when p = 1. For 1 < p < 2 with p = 1+ε, the only known bound was optp(Fq) = O(ε-1) from the same paper. We show for all ε∈ (0, 1) and q ≥ 2 that opt1+ε(Fq) = Θ(ε-(1)/(2)), where the constants in the bound do not depend on q. We also show that opt1+ε(F∞) = Θ(ε-(1)/(2)).