One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics

DOI10.1162/neco.2007.19.2.546zbMath1122.68102OpenAlexW2087186354WikidataQ51088284 ScholiaQ51088284MaRDI QIDQ5423025

No author found.

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

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

This page was built for publication: One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics