The Concave-Convex Procedure

DOI10.1162/08997660360581958zbMath1022.68112WikidataQ73255154 ScholiaQ73255154MaRDI QIDQ4408935

Alan L. Yuille, Anand Rangarajan

Publication date: 29 June 2003

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/08997660360581958

zbMATH Keywords

discrete-time iterative dynamical systems

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Stochastic Reasoning, Free Energy, and Information Geometry, Combined SVM-based feature selection and classification, Combined SVM-based feature selection and classification, A new stochastic variational PDE model for soft Mumford-Shah segmentation, Discriminatively regularized least-squares classification, Surrogate maximization/minimization algorithms and extensions, Skew Jensen-Bregman Voronoi Diagrams, A closedness condition and its applications to DC programs with convex constraints

Cites Work

• Exponentiated gradient versus gradient descent for linear predictors
• Another interpretation of the EM algorithm for mixture distributions
• The invisible hand algorithm: solving the assignment problem with statistical physics
• An introduction to variational methods for graphical models
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Iterative algorithms for deblurring and deconvolution with constraints
• A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
• Generalized Iterative Scaling for Log-Linear Models