Symmetric and antisymmetric properties of solutions to kernel-based machine learning problems
Giorgio Gnecco

TL;DR
This paper explores how to incorporate symmetry and antisymmetry constraints into kernel-based machine learning models, particularly support vector machines, using specially designed pairwise kernels, supported by theoretical proofs and numerical experiments.
Contribution
It introduces a method to embed symmetry and antisymmetry properties into kernel functions for support vector machines, extending previous work and analyzing the behavior of solutions under optimization algorithms.
Findings
Symmetry and antisymmetry constraints are preserved in the solutions.
Suitable pairwise kernels can encode prior symmetry properties.
Theoretical and numerical validation of the approach.
Abstract
A particularly interesting instance of supervised learning with kernels is when each training example is associated with two objects, as in pairwise classification (Brunner et al., 2012), and in supervised learning of preference relations (Herbrich et al., 1998). In these cases, one may want to embed additional prior knowledge into the optimization problem associated with the training of the learning machine, modeled, respectively, by the symmetry of its optimal solution with respect to an exchange of order between the two objects, and by its antisymmetry. Extending the approach proposed in (Brunner et al., 2012) (where the only symmetric case was considered), we show, focusing on support vector binary classification, how such embedding is possible through the choice of a suitable pairwise kernel, which takes as inputs the individual feature vectors and also the group feature vectors…
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.
