MODELLING OF KERNEL MACHINES BY INFINITE AND SEMI-INFINITE PROGRAMMING


Ozogur-Akyuz S., Weber G. -.

2nd Global Conference on Power Control and Optimization, Balvi, Letonya, 1 - 03 Haziran 2009, cilt.1159, ss.306-313 identifier

  • Cilt numarası: 1159
  • Basıldığı Şehir: Balvi
  • Basıldığı Ülke: Letonya
  • Sayfa Sayıları: ss.306-313

Özet

In Machine Learning (ML) algorithms, one of the crucial issues is the representation of the data. As the data become heterogeneous and large-scale, single kernel methods become insufficient to classify nonlinear data. The finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, we propose a novel method of "infinite" kernel combinations for learning problems with the help of infinite and semi-infinite programming regarding all elements in kernel space. Looking at all infinitesimally fine convex combinations of the kernels from the infinite kernel set, the margin is maximized subject to an infinite number of constraints with a compact index set and an additional (Riemann-Stieltjes) integral constraint due to the combinations. After a parametrization in the space of probability measures, it becomes semi-infinite. We analyze the regularity conditions which satisfy the Reduction Ansatz and discuss the type of distribution functions within the structure of the constraints and our bi-level optimization problem.