One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics
From MaRDI portal
Publication:5423025
DOI10.1162/neco.2007.19.2.546zbMath1122.68102WikidataQ51088284 ScholiaQ51088284MaRDI QIDQ5423025
Publication date: 30 October 2007
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco.2007.19.2.546
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Investigation on the skewness for independent component analysis, Machine learning problems from optimization perspective
Cites Work
- Learned parametric mixture based ICA algorithm
- Independent component analysis, a new concept?
- Adaptive blind separation of independent sources: A deflation approach
- The Geometry of Algorithms with Orthogonality Constraints
- A Constrained EM Algorithm for Independent Component Analysis
- One-Bit-Matching Conjecture for Independent Component Analysis
- HIGH-ORDER CONTRASTS FOR SELF-ADAPTIVE SOURCE SEPARATION