Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Infinite kernel learning via infinite and semi-infinite programming
Date
2010-01-01
Author
AKYÜZ, SÜREYYA
Weber, Gerhard Wilhelm
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
9
views
0
downloads
Cite This
As data become heterogeneous, multiple kernel learning methods may help to classify them. To overcome the drawback lying in its (multiple) finite choice, we propose a novel method of 'infinite' kernel combinations for learning problems with the help of infinite and semi-infinite optimizations. Looking at all the infinitesimally fine convex combinations of the kernels from an 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, we get a semi-infinite programming problem. We analyse regularity conditions (reduction ansatz) and discuss the type of density functions in the constraints and the bilevel optimization problem derived. Our proposed approach is implemented with the conceptual reduction method and tested on homogeneous and heterogeneous data; this yields a better accuracy than a single-kernel learning for the heterogeneous data. We analyse the structure of problems obtained and discuss structural frontiers, trade-offs and research challenges.
Subject Keywords
Software
,
Control and Optimization
,
Applied Mathematics
URI
https://hdl.handle.net/11511/57714
Journal
OPTIMIZATION METHODS & SOFTWARE
DOI
https://doi.org/10.1080/10556780903483349
Collections
Graduate School of Applied Mathematics, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. AKYÜZ and G. W. Weber, “Infinite kernel learning via infinite and semi-infinite programming,”
OPTIMIZATION METHODS & SOFTWARE
, vol. 25, no. 6, pp. 937–970, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57714.