Surrogate maximization/minimization algorithms and extensions

DOI10.1007/S10994-007-5022-XMaRDI QIDQ1009342zbMATH OpenOpenAlexFDO

Authors Zhihua Zhang, James T. Kwok, Dit-Yan Yeung

Publication date 31 March 2009

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-007-5022-x

zbMATH Keywords

logistic regressionlog-linear modelconvexitysurrogate functionAdaBoost

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Generalized linear models (logistic models) (62J12)

Recommendations

• The α-EM algorithm: surrogate likelihood maximization using α-logarithmic information measures
• The MM alternative to EM
• EM vs MM: a case study
• Convex surrogate minimization in classification
• Alternating minimization as sequential unconstrained minimization: a survey

Cites work

• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 739537 (Why is no real title available?)
• scientific article; zbMATH DE number 756188 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• A decision-theoretic generalization of on-line learning and an application to boosting
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Convex Analysis
• Generalized Iterative Scaling for Log-Linear Models
• Improved boosting algorithms using confidence-rated predictions
• Logistic regression, AdaBoost and Bregman distances
• Maximum likelihood estimation via the ECM algorithm: A general framework
• Modern multidimensional scaling: theory and applications
• Monotonicity of quadratic-approximation algorithms
• On the convergence properties of the EM algorithm
• The Concave-Convex Procedure
• The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
• The TM algorithm for maximising a conditional likelihood function.

Cited in

(9)

• A survey on surrogate approaches to non-negative matrix factorization
• SABRINA: a stochastic subspace majorization-minimization algorithm
• Sparse high-dimensional fractional-norm support vector machine via DC programming
• A majorization-minimization-based method for nonconvex inverse rig problems in facial animation: algorithm derivation
• Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^*
• On Algorithms for Difference of Monotone Operators
• The α-EM algorithm: surrogate likelihood maximization using α-logarithmic information measures
• Convergence analysis of block majorize-minimize subspace approach
• Understanding non-negative matrix factorization in the framework of Bregman divergence

Describes a project that uses

Uses Software

• AdaBoost.MH

This page was built for publication: Surrogate maximization/minimization algorithms and extensions

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