- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Local Geometric Analysis and Applications to Learning...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Local Geometric Analysis and Applications to Learning Algorithms. Zheng, Lizhong
Description
Local geometric analysis is a method to define a coordinate system in a small neighborhood in the space of distributions and the functional space over a given alphabet. It is a powerful technique since the notions of distance, projection, and inner product defined this way are useful in the optimization problems involving distributions, such as regressions. It has been used in many places in the literature such as correlation analysis, correspondence analysis. In this talk, we will go through some of the basic setups and properties, and discuss a specific problem we called ``universal feature selectionâ , which has close connections to some of the popular learning algorithms such as matrix completion and deep-learning. We will use this problem to motivate definitions of new information metrics for partial information and the relevance to specific queries.
Item Metadata
Title |
Local Geometric Analysis and Applications to Learning Algorithms.
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2018-10-31T09:02
|
Description |
Local geometric analysis is a method to define a coordinate system in a small neighborhood in the space of distributions and the functional space over a given alphabet. It is a powerful technique since the notions of distance, projection, and inner product defined this way are useful in the optimization problems involving distributions, such as regressions. It has been used in many places in the literature such as correlation analysis, correspondence analysis. In this talk, we will go through some of the basic setups and properties, and discuss a specific problem we called ``universal feature selectionâ , which has close connections to some of the popular learning algorithms such as matrix completion and deep-learning. We will use this problem to motivate definitions of new information metrics for partial information and the relevance to specific queries.
|
Extent |
68.0 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Massachusetts Institute of Technology
|
Series | |
Date Available |
2019-04-30
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0378515
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International