Hardness of High-Dimensional Linear Classification

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and approximate forms. However, only O (nᵈ) and respectively Õ (1/εᵈ) upper bounds are known and complemented by polynomial lower bounds that do not support the exponential in dimension dependence. We close this gap up to polylogarithmic terms by reduction from widely-believed hardness conjectures for Affine Degeneracy testing and k-Sum problems. Our reductions yield matching lower bounds of Ω̃ (nᵈ) and respectively Ω̃ (1/εᵈ) based on Affine Degeneracy testing, and Ω̃ (n^d/2) and respectively Ω̃ (1/ε^d/2) conditioned on k-Sum. The first bound also holds unconditionally if the computational model is restricted to make sidedness queries, which corresponds to a widely spread setting implemented and optimized in many contemporary algorithms and computing paradigms.