The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Adaptive Online Learning Algorithms for Blind Separation: Maximum Entropy and Minimum Mutual Information
Open accessAbstract
There are two major approaches for blind separation: maximum entropy (ME) and minimum mutual information (MMI). Both can be implemented by the stochastic gradient descent method for obtaining the demixing matrix. The MI is the contrast function for blind separation; the entropy is not. To justify the ME, the relation between ME and MMI is first elucidated by calculating the first derivative of the entropy and proving that the mean subtraction is necessary in applying the ME and at the solution points determined by the MI, the ME will not update the demixing matrix in the directions of increasing the cross-talking. Second, the natural gradient instead of the ordinary gradient is introduced to obtain efficient algorithms, because the parameter space is a Riemannian space consisting of matrices. The mutual information is calculated by applying the Gram-Charlier expansion to approximate probability density functions of the outputs. Finally, we propose an efficient learning algorithm that incorporates with an adaptive method of estimating the unknown cumulants. It is shown by computer simulation that the convergence of the stochastic descent algorithms is improved by using the natural gradient and the adaptively estimated cumulants.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Independent component analysis, A new concept?
Comon, P. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90029-9 · Cited by 8,205
Kendall's Advanced Theory of Statistics.
AA, Stuart, A., & Ord, K. (1995) · Journal of the American Statistical Association · doi:10.2307/2291187 · Cited by 2,619
A New Learning Algorithm for Blind Signal Separation
Амари, Ш.-И., Cichocki, A. S., & Yang, H. H. (1995) · Cited by 1,904
Self-citationBlind signal separation: statistical principles
Cardoso, J.-F. (1998) · Proceedings of the IEEE · doi:10.1109/5.720250 · Cited by 1,885
Equivariant adaptive source separation
Cardoso, J.-F., & Laheld, B. H. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.553476 · Cited by 1,349
Backpropagation and stochastic gradient descent method
Амари, Ш.-И. (1993) · Neurocomputing · doi:10.1016/0925-2312(93)90006-o · Cited by 1,026
A Theory of Adaptive Pattern Classifiers
Amari, S. (1967) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1967.264666 · Cited by 534
Self-citationAdaptive blind signal processing-neural network approaches
Amari, S., & Cichocki, A. (1998) · Proceedings of the IEEE · doi:10.1109/5.720251 · Cited by 466
Self-citationAdaptation and decorrelation in the cortex
Barlow, H. B., & Földiák, P. (1989) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 340
A First Application of Independent Component Analysis to Extracting Structure from Stock Returns
Back, A. D., & Weigend, A. S. (1997) · International Journal of Neural Systems · doi:10.1142/s0129065797000458 · Cited by 309
Nonlinear neurons in the low-noise limit: a factorial code maximizes information transfer
Nadal, J., & Parga, N. (1994) · Network Computation in Neural Systems · doi:10.1088/0954-898x/5/4/008 · Cited by 282
Durbin, R. M., Miall, C., & Mitchison, G. (1989) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 267
Independent-component analysis of skin color image
Tsumura, N., Haneishi, H., & Miyake, Y. (1999) · Journal of the Optical Society of America A · doi:10.1364/josaa.16.002169 · Cited by 212
Information–theoretic approach to blind separation of sources in non-linear mixture
Yang, H. H., Амари, Ш.-И., & Cichocki, A. S. (1998) · Signal Processing · doi:10.1016/s0165-1684(97)00196-5 · Cited by 153
Self-citationNeural Learning in Structured Parameter Spaces - Natural Riemannian Gradient
Амари, Ш.-И. (1997) · Cited by 147
Nonlinear higher-order statistical decorrelation by volume-conserving neural architectures
Deco, G., & Brauer, W. (1995) · Neural Networks · doi:10.1016/0893-6080(94)00108-x · Cited by 122
The nonlinear PCA criterion in blind source separation: Relations with other approaches
Karhunen, J., Pajunen, P., & Erkki Oja, A. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00046-0 · Cited by 99
Neural networks for blind separation with unknown number of sources
Cichocki, A. S., Karhunen, J., Kasprzak, W., & Vigário, R. (1999) · Neurocomputing · doi:10.1016/s0925-2312(98)00091-5 · Cited by 94
Blind source separation using algorithmic information theory
Pajunen, P. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00048-4 · Cited by 58
Statistical inference: learning in artificial neural networks
Yang, H. H., Murata, N., & Amari, S. (1998) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(97)01114-5 · Cited by 16
Self-citation
Cited by
Natural Gradient Works Efficiently in Learning
Amari, S.-I. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,681
Self-citationBlind signal separation: statistical principles
Cardoso, J.-F. (1998) · Proceedings of the IEEE · doi:10.1109/5.720250 · Cited by 1,885
Kernel methods in machine learning
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · The Annals of Statistics · doi:10.1214/009053607000000677 · Cited by 1,651
Causality detection based on information-theoretic approaches in time series analysis
HLAVACKOVASCHINDLER, K., PALUS, M., VEJMELKA, M., & BHATTACHARYA, J. (2007) · Physics Reports · doi:10.1016/j.physrep.2006.12.004 · Cited by 800
Kim, H., & Mnih, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.05983 · Cited by 617
Metadata
- Authors
- Yang, H. H., & Amari, S.-I.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1997-10-01
- Volume
- 9
- Issue
- 7
- Pages
- 1457-1482
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2083780577
- Cited by
- 314
- References
- 21
- FWCI
- 28.25
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.