University of Cambridge > Talks.cam > Machine Learning @ CUED > Geometric Algorithms for Linear Independent Component Analysis

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Geometric Algorithms for Linear Independent Component Analysis

Download to your calendar using vCal

If you have a question about this talk, please contact Karsten Borgwardt .

Independent Component Analysis (ICA) is a challenging problem in the areas of statistical signal processing and unsupervised machine learning. This talk studies the problem of linear ICA .

Recently, there has been an increasing interest in using geometric optimisation methods to solve linear ICA problems. Two prominent classes of geometric linear ICA methods, Newton-type methods and Jacobi-type methods, will be discussed. This talk will mainly focus on the development and convergence analysis of the proposed geometric linear ICA methods, both theoretically and numerically.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Winstanley Lecture Hall, Trinity College Meeting Rooms 1&2, MRC Epidemiology Unit, Level 3, Institute of Metabolic Science, Cambridge Biomedical Campus, Cambridge CB2 0QQ Tom ap Rhys Seminar Room, Department of Plant Sciences

Other talks

Title to be confirmed Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Morning Break Title to be confirmed Am I a Member? Auditing Private Machine Learning Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity