Article

Free access

A comparison of new and old algorithms for a mixture estimation problem

Authors:

David P. Helmbold,

Robert E. Schapire,

Manfred K. WarmuthAuthors Info & Claims

COLT '95: Proceedings of the eighth annual conference on Computational learning theory

Pages 69 - 78

https://doi.org/10.1145/225298.225306

Published: 05 July 1995 Publication History

First page of PDF

References

[1]

N. Abe, J. Takeuchi, and M. K. Warmuth. Polynomial learnability of probablistic concepts with respect to the Kullback-Leibler divergence. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 277-289. Morgan Kaufmann, 1991.

Digital Library

[2]

S. Amari. Differential Geometrical Methods in Statisitcs. Springer-Verlag, 1985.

[3]

S. Amari. The EM algorithm and information geometry in neural-network learning. Neural Computation, 7(1):13-18, 1995.

Digital Library

[4]

T. Cover. Universal portfolios. Mathematical Finance. 1(1):1-29, 1991.

[5]

A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum-likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B39:1-38, 1977.

[6]

R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, 1973.

Digital Library

[7]

G. H~ Golub and C. F. Van Loan. Matrix Computations. Johns-Hopkins University Press, 1989.

[8]

J. Kivinen and M. K. Warmuth. Additive versus exponentiated gradient updates. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995.

Digital Library

[9]

J. Kivinen and M. K. Warmuth. The perceptron algorithm vs. winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. In Proceedings of the Eighth Annual Workshop on Computational Learning Theory, July 1995~

Digital Library

[10]

N. Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.

Digital Library

[11]

D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, 1984.

[12]

R. M. Neal and G. E. Hinton. A new view of the EM algorithm that justifies incremental and other variants. Unpublished manuscript, 1993.

[13]

S. J. Nowlan. Soft Competative Adaption: Neural Network Learning Algorithms Based on Fitting Statistical Mixtures. PhD thesis, Carnegie Mellon University, 1991.

Digital Library

[14]

B. C. Peters and H. F. Walker. The numerical evaluation of the maximum-likelihood estimates of a subset of mixture proportions. SIAM Journal o/ Applied Mathematics, 35:447-452, 1978.

[15]

R. A. Redner and H. F. Walker. Mixture densities, maximum likelihood, and the EM algorithm. S~am Review, 26:195-239, 1984.

Cited By

Zhou HYao XCai SZhang N(2022)Transaction cost regularization for online portfolio selection2022 IEEE 2nd International Conference on Data Science and Computer Application (ICDSCA)10.1109/ICDSCA56264.2022.9987825(288-295)Online publication date: 28-Oct-2022
https://doi.org/10.1109/ICDSCA56264.2022.9987825
Zhang SZuo XLiu J(2020)The Improvement of the Algorithm EG for the Relative Entropy Loss2020 Chinese Control And Decision Conference (CCDC)10.1109/CCDC49329.2020.9163940(3957-3963)Online publication date: Aug-2020
https://doi.org/10.1109/CCDC49329.2020.9163940
Mezuman EWeiss Y(2016)A tight convex upper bound on the likelihood of a finite mixture2016 23rd International Conference on Pattern Recognition (ICPR)10.1109/ICPR.2016.7899878(1683-1688)Online publication date: Dec-2016
https://doi.org/10.1109/ICPR.2016.7899878
Show More Cited By

Index Terms

A comparison of new and old algorithms for a mixture estimation problem

Recommendations

Mixture density estimation with group membership functions

The mixture density model has been extensively studied in the field of statistical pattern recognition. And the EM algorithm has been well known as a convenient and efficient tool to iteratively compute the maximum likelihood estimates of mixture model ...
A Comparison of New and Old Algorithms for a Mixture EstimationProblem
Special issue on the eighth annual conference on computational learning theory, (COLT '95)

We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for supervised learning and give simple derivations for many of the standard ...
Projection pursuit mixture density estimation

In this paper we seek a Gaussian mixture model (GMM) of an n-variate probability density function. Usually the parameters of GMMs are determined in the original n-dimensional space by optimizing a maximum likelihood (ML) criterion. A practical ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

COLT '95: Proceedings of the eighth annual conference on Computational learning theory

July 1995

464 pages

ISBN:0897917235

DOI:10.1145/225298

Chairman:
Wolfgang Maass
Technische Univ. Graz, Graz, Austria

Copyright © 1995 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAI: ACM Special Interest Group on Artificial Intelligence
University of California: University of California
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

8COLT95

Sponsor:

SIGAI
University of California
SIGACT

8COLT95: 8th Annual Conference on Computational Learning Theory

July 5 - 8, 1995

California, Santa Cruz, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
393
Total Downloads

Downloads (Last 12 months)76
Downloads (Last 6 weeks)10

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhou HYao XCai SZhang N(2022)Transaction cost regularization for online portfolio selection2022 IEEE 2nd International Conference on Data Science and Computer Application (ICDSCA)10.1109/ICDSCA56264.2022.9987825(288-295)Online publication date: 28-Oct-2022
https://doi.org/10.1109/ICDSCA56264.2022.9987825
Zhang SZuo XLiu J(2020)The Improvement of the Algorithm EG for the Relative Entropy Loss2020 Chinese Control And Decision Conference (CCDC)10.1109/CCDC49329.2020.9163940(3957-3963)Online publication date: Aug-2020
https://doi.org/10.1109/CCDC49329.2020.9163940
Mezuman EWeiss Y(2016)A tight convex upper bound on the likelihood of a finite mixture2016 23rd International Conference on Pattern Recognition (ICPR)10.1109/ICPR.2016.7899878(1683-1688)Online publication date: Dec-2016
https://doi.org/10.1109/ICPR.2016.7899878
Kashima HAbe N(2007)A Parameterized Probabilistic Model of Network Evolution for Supervised Link Predictionネットワーク構造の確率的な時変モデルに基づく教師ありリンク予測Transactions of the Japanese Society for Artificial Intelligence10.1527/tjsai.22.20922:2(209-217)Online publication date: 2007
https://doi.org/10.1527/tjsai.22.209
Blum AKalai A(1999)Universal Portfolios With and Without Transaction CostsMachine Language10.1023/A:100753072874835:3(193-205)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1023/A%3A1007530728748
Yu JFerguson F(1998)Maximum likelihood estimation for failure analysis [IC yield]IEEE Transactions on Semiconductor Manufacturing10.1109/66.72856511:4(681-691)Online publication date: Jan-1998
https://doi.org/10.1109/66.728565
Li HYamanishi KCohen PWahlster W(1997)Document classification using a finite mixture modelProceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics10.3115/976909.979623(39-47)Online publication date: 7-Jul-1997
https://dl.acm.org/doi/10.3115/976909.979623
Blum AKalai AFreund YSchapire R(1997)Universal portfolios with and without transaction costsProceedings of the tenth annual conference on Computational learning theory10.1145/267460.267518(309-313)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1145/267460.267518
Yamanishi KBlum AKearns M(1996)A randomized approximation of the MDL for stochastic models with hidden variablesProceedings of the ninth annual conference on Computational learning theory10.1145/238061.238074(99-109)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/238061.238074
Ferguson EJianlin Yu (1996)Maximum likelihood estimation for yield analysis [IC manufacture]Proceedings. 1996 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems10.1109/DFTVS.1996.572019(149-157)Online publication date: 1996
https://doi.org/10.1109/DFTVS.1996.572019
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents