Resolving the Geometric Locus Dilemma for Support Vector Learning Machines
Denise M. Reeves

TL;DR
This paper explores the geometric and algebraic properties of support vector machines, revealing that their decision boundaries are principal eigenaxes and establishing duality relationships that encode Bayesian likelihood ratios.
Contribution
It introduces a novel geometric and algebraic framework for understanding linear decision boundaries as principal eigenaxes, linking them to statistical equilibrium and duality principles.
Findings
Decision boundaries are principal eigenaxes of data distributions.
Learning involves finding a statistical equilibrium of eigenenergies.
Eigenaxes encode Bayesian likelihood ratios for classification.
Abstract
Capacity control, the bias/variance dilemma, and learning unknown functions from data, are all concerned with identifying effective and consistent fits of unknown geometric loci to random data points. A geometric locus is a curve or surface formed by points, all of which possess some uniform property. A geometric locus of an algebraic equation is the set of points whose coordinates are solutions of the equation. Any given curve or surface must pass through each point on a specified locus. This paper argues that it is impossible to fit random data points to algebraic equations of partially configured geometric loci that reference arbitrary Cartesian coordinate systems. It also argues that the fundamental curve of a linear decision boundary is actually a principal eigenaxis. It is shown that learning principal eigenaxes of linear decision boundaries involves finding a point of statistical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Control Systems and Identification · Neural Networks and Applications
