Limited memory bundle DC algorithm for sparse pairwise kernel learning

DOI10.1007/S10898-025-01481-WMaRDI QIDQ6983494zbMATH OpenFDO

Authors N. Karmitsa, Kaisa Joki, Antti Airola, Tapio Pahikkala

Publication date 14 May 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10898-025-01481-W

zbMATH Keywords

\(\ell_0\)-pseudo-normbundle methodsDCAnonsmooth DC optimizationpairwise kernel learningzero-shot learning

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Learning and adaptive systems in artificial intelligence (68T05) Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites work

• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• Best subset selection via a modern optimization lens
• Comparing different nonsmooth minimization methods and software
• Concordance probability and discriminatory power in proportional hazards regression
• Convex Analysis
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC formulations and algorithms for sparse optimization problems
• DC programming and DCA: thirty years of developments
• Feature selection in SVM via polyhedral \(k\)-norm
• Generalized vec trick for fast learning of pairwise kernel models
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• scientific article; zbMATH DE number 1804115 (Why is no real title available?)
• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• Introduction to nonsmooth optimization. Theory, practice and software
• Joint sparse principal component analysis
• Kernel methods in machine learning
• Learning to Rank for Information Retrieval
• Methods of descent for nondifferentiable optimization
• Mixed integer second-order cone programming formulations for variable selection in linear regression
• Neural network for a class of sparse optimization with L₀-regularization
• New limited memory bundle method for large-scale nonsmooth optimization
• Numerical Nonsmooth Optimization
• On early stopping in gradient descent learning
• On functions representable as a difference of convex functions
• Open issues and recent advances in DC programming and DCA
• Optimization and nonsmooth analysis
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
• Projection algorithms for nonconvex minimization with application to sparse principal component analysis
• Representations of quasi-Newton matrices and their use in limited memory methods
• Resolving sets and integer programs for recommender systems
• RLScore: regularized least-squares learners
• Sparse Approximate Solutions to Linear Systems
• Sparse optimization in feature selection: application in neuroimaging
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
• The ABC of DC programming

This page was built for publication: Limited memory bundle DC algorithm for sparse pairwise kernel learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983494)