A Geometric Perspective on Machine Learning

Size: px
Start display at page:

Download "A Geometric Perspective on Machine Learning"

Transcription

1 A Geometric Perspective on Machine Learning Partha Niyogi The University of Chicago Collaborators: M. Belkin, V. Sindhwani, X. He, S. Smale, S. Weinberger A Geometric Perspectiveon Machine Learning p.1

2 Manifold Learning Learning when data Clustering: connected components, min cut Classi cation: on Dimensionality Reduction: unknown: what can you learn about e.g. dimensionality, connected components holes, handles, homology curvature, geodesics from data? A Geometric Perspectiveon Machine Learning p.2

3 An Acoustic Example A Geometric Perspectiveon Machine Learning p.3

4 An Acoustic Example One Dimensional Air Flow (i) (ii) volume velocity pressure A Geometric Perspectiveon Machine Learning p.3

5 Solutions beta! beta! beta! A Geometric Perspectiveon Machine Learning p.4

6 Acoustic Phonetics A 1 A 2 l 1 Vocal Tract modeled as a sequence of tubes. (e.g. Stevens, 1998) l 2 Jansen and Niyogi (in prep.) A Geometric Perspectiveon Machine Learning p.5

7 Pattern Recognition on labeled examples nd Ill Posed A Geometric Perspectiveon Machine Learning p.6

8 Simplicity A Geometric Perspectiveon Machine Learning p.7

9 Simplicity A Geometric Perspectiveon Machine Learning p.7

10 Regularization Principle Splines Ridge Regression SVM e.g. etc. is a p.d. kernel is a corresponding RKHS e.g., certain Sobolev spaces, polynomial families, etc. A Geometric Perspectiveon Machine Learning p.8

11 Simplicity is Relative A Geometric Perspectiveon Machine Learning p.9

12 Simplicity is Relative A Geometric Perspectiveon Machine Learning p.9

13 Intuitions supp has manifold structure geodesic distance v/s ambient distance geometric structure of data should be incorporated versus A Geometric Perspectiveon Machine Learning p.10

14 Geometry and similarity A Geometric Perspectiveon Machine Learning p.11

15 Geometry and similarity A Geometric Perspectiveon Machine Learning p.11

16 Geometry and similarity Geometry is important. A Geometric Perspectiveon Machine Learning p.11

17 Geometry and similarity Geometry is important. Unlabeled data to estimate geometry. A Geometric Perspectiveon Machine Learning p.11

18 Manifold Regularization Laplacian Iterated Laplacian Heat kernel Differential Operator e Representer Theorem: Belkin, Niyogi, Sindhwani (2004) A Geometric Perspectiveon Machine Learning p.12

19 Approximating is unknown but A Geometric Perspectiveon Machine Learning p.13

20 Manifolds and Graphs if A Geometric Perspectiveon Machine Learning p.14

21 Manifold Regularization Representer Theorem: : Least squares : Hinge loss (Support Vector Machines) A Geometric Perspectiveon Machine Learning p.15

22 Ambient and Intrinsic Regularization SVM Laplacian SVM Laplacian SVM !1!1!1! ! A = ! I = 0! ! A = ! I = 0.01! ! A = ! I = 1 A Geometric Perspectiveon Machine Learning p.16

23 Experimental Results: USPS Error Rates RLS vs LapRLS RLS LapRLS Error Rates SVM vs LapSVM SVM LapSVM Error Rates TSVM vs LapSVM TSVM LapSVM Classification Problems Classification Problems Classification Problems 15 Out!of!Sample Extension 15 Out!of!Sample Extension Std Deviation of Error Rates 15 LapRLS (Test) 10 5 LapSVM (Test) 10 5 SVM (o), TSVM (x) Std Dev LapRLS (Unlabeled) LapSVM (Unlabeled) LapSVM Std Dev A Geometric Perspectiveon Machine Learning p.17

24 Experimental Results: Isolet Error Rate (unlabeled set) Error Rates (test set) RLS vs LapRLS RLS LapRLS Labeled Speaker # RLS vs LapRLS RLS LapRLS Labeled Speaker # Error Rates (unlabeled set) Error Rates (test set) SVM vs TSVM vs LapSVM SVM TSVM LapSVM Labeled Speaker # SVM vs TSVM vs LapSVM SVM TSVM LapSVM Labeled Speaker # A Geometric Perspectiveon Machine Learning p.18

25 Experimental comparisons Dataset g50c Coil20 Uspst mac-win WebKB WebKB WebKB Algorithm (link) (page) (page+link) SVM (full labels) RLS (full labels) SVM (l labels) RLS (l labels) Graph-Reg TSVM Graph-density TSVM LDS LapSVM LapRLS LapSVM LapRLS A Geometric Perspectiveon Machine Learning p.19

26 Convergence E = E = E = E = A Geometric Perspectiveon Machine Learning p.20

27 Convergence Theorem with prob. A Geometric Perspectiveon Machine Learning p.21 Belkin and Niyogi (in prep.)

28 Graph and Manifold Laplacian Fix. Fix Put, where with prob. 1, Belkin (2003), Belkin and Niyogi (in preparation) also Lafon (2004), Coifman et a A Geometric Perspectiveon Machine Learning p.22

29 Well Conditioned Submanifolds " # Tubular Neighborhood Condition No. A Geometric Perspectiveon Machine Learning p.23

30 Euclidean and Geodesic distance For all, condition where. In fact, Second Fundamental Form Bounded by A Geometric Perspectiveon Machine Learning p.24

31 Learning Homology Can you learn qualitative features of? Can you tell a torus from a sphere? Can you tell how many connected components? Can you tell the dimension of? (e.g. Carlsson, de Silva et al) A Geometric Perspectiveon Machine Learning p.25

32 Homology If well chosen, then deformation retracts to. Homology of is constructed using the nerve of and agrees with the homology of. A Geometric Perspectiveon Machine Learning p.26

33 Theorem with cond. no. uniformly sampled i.i.d. Let with prob., homology of equals the homology of (Niyogi, Smale, Weinberger, 2004) A Geometric Perspectiveon Machine Learning p.27

34 Spectral Clustering Isoperimetric inequalities. Cheeger constant. M $M 1!M 1 M 1 e 1 &e 1 =% 1 e 1 cut to cluster [Cheeger] A Geometric Perspectiveon Machine Learning p.28

35 Clustering Digits A Geometric Perspectiveon Machine Learning p.29

36 Clustering Speech A Geometric Perspectiveon Machine Learning p.30

37 Computer Vision: Laplacian Eigenmaps Machine vision: inferring joint angles. Corazza, Andriacchi, Stanford Biomotion Lab, 05, Partiview, Surendran Isometrically invariant representation. A Geometric Perspectiveon Machine Learning p.31

38 Important Issues How to handle noise theoretically and practically? How to choose the graph neighborhood correctly? How often do manifolds arise in natural data? What is the right metric on these manifolds? What are other ways in which one might utilize the geometry of natural distributions? Identify real problems where this approach can make a difference. Complexity estimates and provably correct algorithms rather than heuristics. A Geometric Perspectiveon Machine Learning p.32

A Geometric Perspective on Data Analysis

A Geometric Perspective on Data Analysis A Geometric Perspective on Data Analysis Partha Niyogi The University of Chicago Collaborators: M. Belkin, X. He, A. Jansen, H. Narayanan, V. Sindhwani, S. Smale, S. Weinberger A Geometric Perspectiveon

More information

A Geometric Perspective on Machine Learning

A Geometric Perspective on Machine Learning A Geometric Perspective on Machine Learning Partha Niyogi The University of Chicago Thanks: M. Belkin, A. Caponnetto, X. He, I. Matveeva, H. Narayanan, V. Sindhwani, S. Smale, S. Weinberger A Geometric

More information

Data fusion and multi-cue data matching using diffusion maps

Data fusion and multi-cue data matching using diffusion maps Data fusion and multi-cue data matching using diffusion maps Stéphane Lafon Collaborators: Raphy Coifman, Andreas Glaser, Yosi Keller, Steven Zucker (Yale University) Part of this work was supported by

More information

A Taxonomy of Semi-Supervised Learning Algorithms

A Taxonomy of Semi-Supervised Learning Algorithms A Taxonomy of Semi-Supervised Learning Algorithms Olivier Chapelle Max Planck Institute for Biological Cybernetics December 2005 Outline 1 Introduction 2 Generative models 3 Low density separation 4 Graph

More information

Thorsten Joachims Then: Universität Dortmund, Germany Now: Cornell University, USA

Thorsten Joachims Then: Universität Dortmund, Germany Now: Cornell University, USA Retrospective ICML99 Transductive Inference for Text Classification using Support Vector Machines Thorsten Joachims Then: Universität Dortmund, Germany Now: Cornell University, USA Outline The paper in

More information

Graph based machine learning with applications to media analytics

Graph based machine learning with applications to media analytics Graph based machine learning with applications to media analytics Lei Ding, PhD 9-1-2011 with collaborators at Outline Graph based machine learning Basic structures Algorithms Examples Applications in

More information

Large Scale Manifold Transduction

Large Scale Manifold Transduction Large Scale Manifold Transduction Michael Karlen, Jason Weston, Ayse Erkan & Ronan Collobert NEC Labs America, Princeton, USA Ećole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland New York University,

More information

Topology-Invariant Similarity and Diffusion Geometry

Topology-Invariant Similarity and Diffusion Geometry 1 Topology-Invariant Similarity and Diffusion Geometry Lecture 7 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Intrinsic

More information

Large-Scale Face Manifold Learning

Large-Scale Face Manifold Learning Large-Scale Face Manifold Learning Sanjiv Kumar Google Research New York, NY * Joint work with A. Talwalkar, H. Rowley and M. Mohri 1 Face Manifold Learning 50 x 50 pixel faces R 2500 50 x 50 pixel random

More information

Alternating Minimization. Jun Wang, Tony Jebara, and Shih-fu Chang

Alternating Minimization. Jun Wang, Tony Jebara, and Shih-fu Chang Graph Transduction via Alternating Minimization Jun Wang, Tony Jebara, and Shih-fu Chang 1 Outline of the presentation Brief introduction and related work Problems with Graph Labeling Imbalanced labels

More information

Image Similarities for Learning Video Manifolds. Selen Atasoy MICCAI 2011 Tutorial

Image Similarities for Learning Video Manifolds. Selen Atasoy MICCAI 2011 Tutorial Image Similarities for Learning Video Manifolds Selen Atasoy MICCAI 2011 Tutorial Image Spaces Image Manifolds Tenenbaum2000 Roweis2000 Tenenbaum2000 [Tenenbaum2000: J. B. Tenenbaum, V. Silva, J. C. Langford:

More information

Research in Computational Differential Geomet

Research in Computational Differential Geomet Research in Computational Differential Geometry November 5, 2014 Approximations Often we have a series of approximations which we think are getting close to looking like some shape. Approximations Often

More information

Semi-supervised Learning with Density Based Distances

Semi-supervised Learning with Density Based Distances Semi-supervised Learning with Density Based Distances Avleen S. Bijral Toyota Technological Institute Chicago, IL 6637 Nathan Ratliff Google Inc. Pittsburg, PA 526 Nathan Srebro Toyota Technological Institute

More information

On Manifold Regularization

On Manifold Regularization On Manifold Regularization Mikhail Belkin, artha Niyogi, Vikas Sindhwani misha,niyogi,vikass cs.uchicago.edu Department of Computer Science University of Chicago Abstract We propose a family of learning

More information

Shape analysis through geometric distributions

Shape analysis through geometric distributions Shape analysis through geometric distributions Nicolas Charon (CIS, Johns Hopkins University) joint work with B. Charlier (Université de Montpellier), I. Kaltenmark (CMLA), A. Trouvé, Hsi-Wei Hsieh (JHU)...

More information

Towards Multi-scale Heat Kernel Signatures for Point Cloud Models of Engineering Artifacts

Towards Multi-scale Heat Kernel Signatures for Point Cloud Models of Engineering Artifacts Towards Multi-scale Heat Kernel Signatures for Point Cloud Models of Engineering Artifacts Reed M. Williams and Horea T. Ilieş Department of Mechanical Engineering University of Connecticut Storrs, CT

More information

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov

Correspondence. CS 468 Geometry Processing Algorithms. Maks Ovsjanikov Shape Matching & Correspondence CS 468 Geometry Processing Algorithms Maks Ovsjanikov Wednesday, October 27 th 2010 Overall Goal Given two shapes, find correspondences between them. Overall Goal Given

More information

ADVANCED MACHINE LEARNING. Mini-Project Overview

ADVANCED MACHINE LEARNING. Mini-Project Overview 11 Mini-Project Overview Lecture : Prof. Aude Billard (aude.billard@epfl.ch) Teaching Assistants : Nadia Figueroa, Ilaria Lauzana, Brice Platerrier 22 Deadlines for projects / surveys Sign up for lit.

More information

Approximating the surface volume of convex bodies

Approximating the surface volume of convex bodies Approximating the surface volume of convex bodies Hariharan Narayanan Advisor: Partha Niyogi Department of Computer Science, University of Chicago Approximating the surface volume of convex bodies p. Surface

More information

Iterative Non-linear Dimensionality Reduction by Manifold Sculpting

Iterative Non-linear Dimensionality Reduction by Manifold Sculpting Iterative Non-linear Dimensionality Reduction by Manifold Sculpting Mike Gashler, Dan Ventura, and Tony Martinez Brigham Young University Provo, UT 84604 Abstract Many algorithms have been recently developed

More information

Jointly Learning Data-Dependent Label and Locality-Preserving Projections

Jointly Learning Data-Dependent Label and Locality-Preserving Projections Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Jointly Learning Data-Dependent Label and Locality-Preserving Projections Chang Wang IBM T. J. Watson Research

More information

Geometrization and the Poincaré conjecture

Geometrization and the Poincaré conjecture Geometrization and the Poincaré conjecture Jan Metzger BRIGFOS, 2008 History of the Poincaré conjecture In 1904 Poincaré formulated his conjecture. It is a statement about three dimensional geometric objects,

More information

Stable and Multiscale Topological Signatures

Stable and Multiscale Topological Signatures Stable and Multiscale Topological Signatures Mathieu Carrière, Steve Oudot, Maks Ovsjanikov Inria Saclay Geometrica April 21, 2015 1 / 31 Shape = point cloud in R d (d = 3) 2 / 31 Signature = mathematical

More information

COMPRESSED DETECTION VIA MANIFOLD LEARNING. Hyun Jeong Cho, Kuang-Hung Liu, Jae Young Park. { zzon, khliu, jaeypark

COMPRESSED DETECTION VIA MANIFOLD LEARNING. Hyun Jeong Cho, Kuang-Hung Liu, Jae Young Park.   { zzon, khliu, jaeypark COMPRESSED DETECTION VIA MANIFOLD LEARNING Hyun Jeong Cho, Kuang-Hung Liu, Jae Young Park Email : { zzon, khliu, jaeypark } @umich.edu 1. INTRODUCTION In many imaging applications such as Computed Tomography

More information

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism CS 6170 Computational Topology: Topological Data Analysis University of Utah Spring 2017 School of Computing Lecture 7: Jan 31, 2017 Lecturer: Prof. Bei Wang Scribe: Avani Sharma,

More information

Case-Based Reasoning. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. Parametric / Non-parametric.

Case-Based Reasoning. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. Parametric / Non-parametric. CS 188: Artificial Intelligence Fall 2008 Lecture 25: Kernels and Clustering 12/2/2008 Dan Klein UC Berkeley Case-Based Reasoning Similarity for classification Case-based reasoning Predict an instance

More information

CS 188: Artificial Intelligence Fall 2008

CS 188: Artificial Intelligence Fall 2008 CS 188: Artificial Intelligence Fall 2008 Lecture 25: Kernels and Clustering 12/2/2008 Dan Klein UC Berkeley 1 1 Case-Based Reasoning Similarity for classification Case-based reasoning Predict an instance

More information

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI

More information

Stratified Structure of Laplacian Eigenmaps Embedding

Stratified Structure of Laplacian Eigenmaps Embedding Stratified Structure of Laplacian Eigenmaps Embedding Abstract We construct a locality preserving weight matrix for Laplacian eigenmaps algorithm used in dimension reduction. Our point cloud data is sampled

More information

An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference

An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference Sophia-Antipolis, January 2016 Winter School An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference Frédéric Chazal INRIA Saclay - Ile-de-France frederic.chazal@inria.fr

More information

arxiv: v2 [cs.cg] 8 Feb 2010 Abstract

arxiv: v2 [cs.cg] 8 Feb 2010 Abstract Topological De-Noising: Strengthening the Topological Signal Jennifer Kloke and Gunnar Carlsson arxiv:0910.5947v2 [cs.cg] 8 Feb 2010 Abstract February 8, 2010 Topological methods, including persistent

More information

Overview. Spectral Processing of Point- Sampled Geometry. Introduction. Introduction. Fourier Transform. Fourier Transform

Overview. Spectral Processing of Point- Sampled Geometry. Introduction. Introduction. Fourier Transform. Fourier Transform Overview Spectral Processing of Point- Sampled Geometry Introduction Fourier transform Spectral processing pipeline Spectral filtering Adaptive subsampling Summary Point-Based Computer Graphics Markus

More information

3D Human Motion Analysis and Manifolds

3D Human Motion Analysis and Manifolds D E P A R T M E N T O F C O M P U T E R S C I E N C E U N I V E R S I T Y O F C O P E N H A G E N 3D Human Motion Analysis and Manifolds Kim Steenstrup Pedersen DIKU Image group and E-Science center Motivation

More information

CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis. Lecture 0: Introduction. Instructor: Yusu Wang

CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis. Lecture 0: Introduction. Instructor: Yusu Wang CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis Lecture 0: Introduction Instructor: Yusu Wang Lecture 0: Introduction What is topology Why should we be interested

More information

A Geometric Analysis of Subspace Clustering with Outliers

A Geometric Analysis of Subspace Clustering with Outliers A Geometric Analysis of Subspace Clustering with Outliers Mahdi Soltanolkotabi and Emmanuel Candés Stanford University Fundamental Tool in Data Mining : PCA Fundamental Tool in Data Mining : PCA Subspace

More information

Data Mining Practical Machine Learning Tools and Techniques. Slides for Chapter 6 of Data Mining by I. H. Witten and E. Frank

Data Mining Practical Machine Learning Tools and Techniques. Slides for Chapter 6 of Data Mining by I. H. Witten and E. Frank Data Mining Practical Machine Learning Tools and Techniques Slides for Chapter 6 of Data Mining by I. H. Witten and E. Frank Implementation: Real machine learning schemes Decision trees Classification

More information

Random Simplicial Complexes

Random Simplicial Complexes Random Simplicial Complexes Duke University CAT-School 2015 Oxford 10/9/2015 Part III Extensions & Applications Contents Morse Theory for the Distance Function Persistent Homology and Maximal Cycles Contents

More information

Large-Scale Semi-Supervised Learning

Large-Scale Semi-Supervised Learning Large-Scale Semi-Supervised Learning Jason WESTON a a NEC LABS America, Inc., 4 Independence Way, Princeton, NJ, USA 08540. Abstract. Labeling data is expensive, whilst unlabeled data is often abundant

More information

Feature Extractors. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. The Perceptron Update Rule.

Feature Extractors. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. The Perceptron Update Rule. CS 188: Artificial Intelligence Fall 2007 Lecture 26: Kernels 11/29/2007 Dan Klein UC Berkeley Feature Extractors A feature extractor maps inputs to feature vectors Dear Sir. First, I must solicit your

More information

Semi-supervised Data Representation via Affinity Graph Learning

Semi-supervised Data Representation via Affinity Graph Learning 1 Semi-supervised Data Representation via Affinity Graph Learning Weiya Ren 1 1 College of Information System and Management, National University of Defense Technology, Changsha, Hunan, P.R China, 410073

More information

Preparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers

Preparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers Preparation Meeting Recent Advances in the Analysis of 3D Shapes Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers What You Will Learn in the Seminar Get an overview on state of the art

More information

Manifold Learning for Video-to-Video Face Recognition

Manifold Learning for Video-to-Video Face Recognition Manifold Learning for Video-to-Video Face Recognition Abstract. We look in this work at the problem of video-based face recognition in which both training and test sets are video sequences, and propose

More information

Linear and Non-linear Dimentionality Reduction Applied to Gene Expression Data of Cancer Tissue Samples

Linear and Non-linear Dimentionality Reduction Applied to Gene Expression Data of Cancer Tissue Samples Linear and Non-linear Dimentionality Reduction Applied to Gene Expression Data of Cancer Tissue Samples Franck Olivier Ndjakou Njeunje Applied Mathematics, Statistics, and Scientific Computation University

More information

Geometric Data. Goal: describe the structure of the geometry underlying the data, for interpretation or summary

Geometric Data. Goal: describe the structure of the geometry underlying the data, for interpretation or summary Geometric Data - ma recherche s inscrit dans le contexte de l analyse exploratoire des donnees, dont l obj Input: point cloud equipped with a metric or (dis-)similarity measure data point image/patch,

More information

Manifold Learning Theory and Applications

Manifold Learning Theory and Applications Manifold Learning Theory and Applications Yunqian Ma and Yun Fu CRC Press Taylor Si Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group, an informa business Contents

More information

Globally and Locally Consistent Unsupervised Projection

Globally and Locally Consistent Unsupervised Projection Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Globally and Locally Consistent Unsupervised Projection Hua Wang, Feiping Nie, Heng Huang Department of Electrical Engineering

More information

MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE

MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE REGULARIZATION METHODS FOR HIGH DIMENSIONAL LEARNING Francesca Odone and Lorenzo Rosasco odone@disi.unige.it - lrosasco@mit.edu June 3, 2013 ABOUT THIS

More information

How to project circular manifolds using geodesic distances?

How to project circular manifolds using geodesic distances? How to project circular manifolds using geodesic distances? John Aldo Lee, Michel Verleysen Université catholique de Louvain Place du Levant, 3, B-1348 Louvain-la-Neuve, Belgium {lee,verleysen}@dice.ucl.ac.be

More information

Global versus local methods in nonlinear dimensionality reduction

Global versus local methods in nonlinear dimensionality reduction Global versus local methods in nonlinear dimensionality reduction Vin de Silva Department of Mathematics, Stanford University, Stanford. CA 94305 silva@math.stanford.edu Joshua B. Tenenbaum Department

More information

Detection and approximation of linear structures in metric spaces

Detection and approximation of linear structures in metric spaces Stanford - July 12, 2012 MMDS 2012 Detection and approximation of linear structures in metric spaces Frédéric Chazal Geometrica group INRIA Saclay Joint work with M. Aanjaneya, D. Chen, M. Glisse, L. Guibas,

More information

Feature Transformation by Feedforward Neural Network for Semisupervised Classification

Feature Transformation by Feedforward Neural Network for Semisupervised Classification Feature Transformation by Feedforward Neural Network for Semisupervised Classification Gouchol Pok Division of Computer and Information Technology Education, Pai Chai University, Daejeon, Republic of Korea.

More information

Dimension Reduction of Image Manifolds

Dimension Reduction of Image Manifolds Dimension Reduction of Image Manifolds Arian Maleki Department of Electrical Engineering Stanford University Stanford, CA, 9435, USA E-mail: arianm@stanford.edu I. INTRODUCTION Dimension reduction of datasets

More information

Persistence stability for geometric complexes

Persistence stability for geometric complexes Lake Tahoe - December, 8 2012 NIPS workshop on Algebraic Topology and Machine Learning Persistence stability for geometric complexes Frédéric Chazal Joint work with Vin de Silva and Steve Oudot (+ on-going

More information

The K-modes and Laplacian K-modes algorithms for clustering

The K-modes and Laplacian K-modes algorithms for clustering The K-modes and Laplacian K-modes algorithms for clustering Miguel Á. Carreira-Perpiñán Electrical Engineering and Computer Science University of California, Merced http://faculty.ucmerced.edu/mcarreira-perpinan

More information

Locality Preserving Projections (LPP) Abstract

Locality Preserving Projections (LPP) Abstract Locality Preserving Projections (LPP) Xiaofei He Partha Niyogi Computer Science Department Computer Science Department The University of Chicago The University of Chicago Chicago, IL 60615 Chicago, IL

More information

One-class Problems and Outlier Detection. 陶卿 中国科学院自动化研究所

One-class Problems and Outlier Detection. 陶卿 中国科学院自动化研究所 One-class Problems and Outlier Detection 陶卿 Qing.tao@mail.ia.ac.cn 中国科学院自动化研究所 Application-driven Various kinds of detection problems: unexpected conditions in engineering; abnormalities in medical data,

More information

Graph Transduction via Alternating Minimization

Graph Transduction via Alternating Minimization Jun Wang Department of Electrical Engineering, Columbia University Tony Jebara Department of Computer Science, Columbia University Shih-Fu Chang Department of Electrical Engineering, Columbia University

More information

Global versus local methods in nonlinear dimensionality reduction

Global versus local methods in nonlinear dimensionality reduction Global versus local methods in nonlinear dimensionality reduction Vin de Silva Department of Mathematics, Stanford University, Stanford. CA 94305 silva@math.stanford.edu Joshua B. Tenenbaum Department

More information

Technical Report. Title: Manifold learning and Random Projections for multi-view object recognition

Technical Report. Title: Manifold learning and Random Projections for multi-view object recognition Technical Report Title: Manifold learning and Random Projections for multi-view object recognition Authors: Grigorios Tsagkatakis 1 and Andreas Savakis 2 1 Center for Imaging Science, Rochester Institute

More information

MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE

MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE REGULARIZATION METHODS FOR HIGH DIMENSIONAL LEARNING Francesca Odone and Lorenzo Rosasco odone@disi.unige.it - lrosasco@mit.edu June 6, 2011 ABOUT THIS

More information

Semi-Supervised Hierarchical Models for 3D Human Pose Reconstruction

Semi-Supervised Hierarchical Models for 3D Human Pose Reconstruction Semi-Supervised Hierarchical Models for 3D Human Pose Reconstruction Atul Kanaujia, CBIM, Rutgers Cristian Sminchisescu, TTI-C Dimitris Metaxas,CBIM, Rutgers 3D Human Pose Inference Difficulties Towards

More information

A Dendrogram. Bioinformatics (Lec 17)

A Dendrogram. Bioinformatics (Lec 17) A Dendrogram 3/15/05 1 Hierarchical Clustering [Johnson, SC, 1967] Given n points in R d, compute the distance between every pair of points While (not done) Pick closest pair of points s i and s j and

More information

Comparative Study on SVM Multi-class Incremental Learning Algorithms

Comparative Study on SVM Multi-class Incremental Learning Algorithms Comparative Study on SVM Multi-class Incremental Learning Algorithms Divya M R*, Meghana Kishore Murthy*, Shwetha S # [*] 3 rd year student, Information Science and Engineering, R.V.College of Engineering,

More information

Kernel Methods for Topological Data Analysis

Kernel Methods for Topological Data Analysis Kernel Methods for Topological Data Analysis Toward Topological Statistics Kenji Fukumizu The Institute of Statistical Mathematics (Tokyo Japan) Joint work with Genki Kusano and Yasuaki Hiraoka (Tohoku

More information

Scattered Data Problems on (Sub)Manifolds

Scattered Data Problems on (Sub)Manifolds Scattered Data Problems on (Sub)Manifolds Lars-B. Maier Technische Universität Darmstadt 04.03.2016 Lars-B. Maier (Darmstadt) Scattered Data Problems on (Sub)Manifolds 04.03.2016 1 / 60 Sparse Scattered

More information

Learning Better Data Representation using Inference-Driven Metric Learning

Learning Better Data Representation using Inference-Driven Metric Learning Learning Better Data Representation using Inference-Driven Metric Learning Paramveer S. Dhillon CIS Deptt., Univ. of Penn. Philadelphia, PA, U.S.A dhillon@cis.upenn.edu Partha Pratim Talukdar Search Labs,

More information

Overview Citation. ML Introduction. Overview Schedule. ML Intro Dataset. Introduction to Semi-Supervised Learning Review 10/4/2010

Overview Citation. ML Introduction. Overview Schedule. ML Intro Dataset. Introduction to Semi-Supervised Learning Review 10/4/2010 INFORMATICS SEMINAR SEPT. 27 & OCT. 4, 2010 Introduction to Semi-Supervised Learning Review 2 Overview Citation X. Zhu and A.B. Goldberg, Introduction to Semi- Supervised Learning, Morgan & Claypool Publishers,

More information

A Multicover Nerve for Geometric Inference. Don Sheehy INRIA Saclay, France

A Multicover Nerve for Geometric Inference. Don Sheehy INRIA Saclay, France A Multicover Nerve for Geometric Inference Don Sheehy INRIA Saclay, France Computational geometers use topology to certify geometric constructions. Computational geometers use topology to certify geometric

More information

Topology and the Analysis of High-Dimensional Data

Topology and the Analysis of High-Dimensional Data Topology and the Analysis of High-Dimensional Data Workshop on Algorithms for Modern Massive Data Sets June 23, 2006 Stanford Gunnar Carlsson Department of Mathematics Stanford University Stanford, California

More information

CSE 573: Artificial Intelligence Autumn 2010

CSE 573: Artificial Intelligence Autumn 2010 CSE 573: Artificial Intelligence Autumn 2010 Lecture 16: Machine Learning Topics 12/7/2010 Luke Zettlemoyer Most slides over the course adapted from Dan Klein. 1 Announcements Syllabus revised Machine

More information

Graph Transduction via Alternating Minimization

Graph Transduction via Alternating Minimization Jun Wang Department of Electrical Engineering, Columbia University Tony Jebara Department of Computer Science, Columbia University Shih-Fu Chang Department of Electrical Engineering, Columbia University

More information

Online Pose Classification and Walking Speed Estimation using Handheld Devices

Online Pose Classification and Walking Speed Estimation using Handheld Devices Online Pose Classification and Walking Speed Estimation using Handheld Devices Jun-geun Park MIT CSAIL Joint work with: Ami Patel (MIT EECS), Jonathan Ledlie (Nokia Research), Dorothy Curtis (MIT CSAIL),

More information

Computational Statistics and Mathematics for Cyber Security

Computational Statistics and Mathematics for Cyber Security and Mathematics for Cyber Security David J. Marchette Sept, 0 Acknowledgment: This work funded in part by the NSWC In-House Laboratory Independent Research (ILIR) program. NSWCDD-PN--00 Topics NSWCDD-PN--00

More information

Self Lane Assignment Using Smart Mobile Camera For Intelligent GPS Navigation and Traffic Interpretation

Self Lane Assignment Using Smart Mobile Camera For Intelligent GPS Navigation and Traffic Interpretation For Intelligent GPS Navigation and Traffic Interpretation Tianshi Gao Stanford University tianshig@stanford.edu 1. Introduction Imagine that you are driving on the highway at 70 mph and trying to figure

More information

Generalized Principal Component Analysis CVPR 2007

Generalized Principal Component Analysis CVPR 2007 Generalized Principal Component Analysis Tutorial @ CVPR 2007 Yi Ma ECE Department University of Illinois Urbana Champaign René Vidal Center for Imaging Science Institute for Computational Medicine Johns

More information

Robust Pose Estimation using the SwissRanger SR-3000 Camera

Robust Pose Estimation using the SwissRanger SR-3000 Camera Robust Pose Estimation using the SwissRanger SR- Camera Sigurjón Árni Guðmundsson, Rasmus Larsen and Bjarne K. Ersbøll Technical University of Denmark, Informatics and Mathematical Modelling. Building,

More information

ECS 234: Data Analysis: Clustering ECS 234

ECS 234: Data Analysis: Clustering ECS 234 : Data Analysis: Clustering What is Clustering? Given n objects, assign them to groups (clusters) based on their similarity Unsupervised Machine Learning Class Discovery Difficult, and maybe ill-posed

More information

Multidimensional scaling

Multidimensional scaling Multidimensional scaling Lecture 5 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 Cinderella 2.0 2 If it doesn t fit,

More information

Clustering algorithms and introduction to persistent homology

Clustering algorithms and introduction to persistent homology Foundations of Geometric Methods in Data Analysis 2017-18 Clustering algorithms and introduction to persistent homology Frédéric Chazal INRIA Saclay - Ile-de-France frederic.chazal@inria.fr Introduction

More information

Computational Geometry Learning

Computational Geometry Learning Computational Geometry Learning Jean-Daniel Boissonnat Frédéric Chazal Geometrica, INRIA http://www-sop.inria.fr/geometrica Lectures at MPRI MPRI Computational Geometry Learning Lectures at MPRI 1 / 14

More information

A (somewhat) Unified Approach to Semisupervised and Unsupervised Learning

A (somewhat) Unified Approach to Semisupervised and Unsupervised Learning A (somewhat) Unified Approach to Semisupervised and Unsupervised Learning Ben Recht Center for the Mathematics of Information Caltech April 11, 2007 Joint work with Ali Rahimi (Intel Research) Overview

More information

21 Analysis of Benchmarks

21 Analysis of Benchmarks 21 Analysis of Benchmarks In order to assess strengths and weaknesses of different semi-supervised learning (SSL) algorithms, we invited the chapter authors to apply their algorithms to eight benchmark

More information

LEARNING ON STATISTICAL MANIFOLDS FOR CLUSTERING AND VISUALIZATION

LEARNING ON STATISTICAL MANIFOLDS FOR CLUSTERING AND VISUALIZATION LEARNING ON STATISTICAL MANIFOLDS FOR CLUSTERING AND VISUALIZATION Kevin M. Carter 1, Raviv Raich, and Alfred O. Hero III 1 1 Department of EECS, University of Michigan, Ann Arbor, MI 4819 School of EECS,

More information

Adaptation of multiscale function extension to inexact matching. Application to the mapping of individuals to a learnt manifold.

Adaptation of multiscale function extension to inexact matching. Application to the mapping of individuals to a learnt manifold. Adaptation of multiscale function extension to inexact matching. Application to the mapping of individuals to a learnt manifold. Nicolas Duchateau?1, Mathieu De Craene 2, Marta Sitges 1, and Vicent Caselles

More information

Topological estimation using witness complexes. Vin de Silva, Stanford University

Topological estimation using witness complexes. Vin de Silva, Stanford University Topological estimation using witness complexes, Acknowledgements Gunnar Carlsson (Mathematics, Stanford) principal collaborator Afra Zomorodian (CS/Robotics, Stanford) persistent homology software Josh

More information

INFORMATION PRESERVING EMBEDDINGS FOR DISCRIMINATION

INFORMATION PRESERVING EMBEDDINGS FOR DISCRIMINATION INFORMATION PRESERVING EMBEDDINGS FOR DISCRIMINATION Kevin M. Carter 1, Christine Kyung-min Kim 1, Raviv Raich 2, Alfred O. Hero III 1 1 Department of EECS, University of Michigan, Ann Arbor, MI 4819 2

More information

topological data analysis and stochastic topology yuliy baryshnikov waikiki, march 2013

topological data analysis and stochastic topology yuliy baryshnikov waikiki, march 2013 topological data analysis and stochastic topology yuliy baryshnikov waikiki, march 2013 Promise of topological data analysis: extract the structure from the data. In: point clouds Out: hidden structure

More information

Manifold Learning: Applications in Neuroimaging

Manifold Learning: Applications in Neuroimaging Your own logo here Manifold Learning: Applications in Neuroimaging Robin Wolz 23/09/2011 Overview Manifold learning for Atlas Propagation Multi-atlas segmentation Challenges LEAP Manifold learning for

More information

Kernels and Clustering

Kernels and Clustering Kernels and Clustering Robert Platt Northeastern University All slides in this file are adapted from CS188 UC Berkeley Case-Based Learning Non-Separable Data Case-Based Reasoning Classification from similarity

More information

Locality Preserving Projections (LPP) Abstract

Locality Preserving Projections (LPP) Abstract Locality Preserving Projections (LPP) Xiaofei He Partha Niyogi Computer Science Department Computer Science Department The University of Chicago The University of Chicago Chicago, IL 60615 Chicago, IL

More information

Head Frontal-View Identification Using Extended LLE

Head Frontal-View Identification Using Extended LLE Head Frontal-View Identification Using Extended LLE Chao Wang Center for Spoken Language Understanding, Oregon Health and Science University Abstract Automatic head frontal-view identification is challenging

More information

Efficient Iterative Semi-supervised Classification on Manifold

Efficient Iterative Semi-supervised Classification on Manifold . Efficient Iterative Semi-supervised Classification on Manifold... M. Farajtabar, H. R. Rabiee, A. Shaban, A. Soltani-Farani Sharif University of Technology, Tehran, Iran. Presented by Pooria Joulani

More information

Cluster Analysis (b) Lijun Zhang

Cluster Analysis (b) Lijun Zhang Cluster Analysis (b) Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Grid-Based and Density-Based Algorithms Graph-Based Algorithms Non-negative Matrix Factorization Cluster Validation Summary

More information

Learning Appearance Manifolds from Video

Learning Appearance Manifolds from Video Learning Appearance Manifolds from Video Ali Rahimi MIT CS and AI Lab, Cambridge, MA 9 ali@mit.edu Ben Recht MIT Media Lab, Cambridge, MA 9 brecht@media.mit.edu Trevor Darrell MIT CS and AI Lab, Cambridge,

More information

Riemannian Manifold Learning

Riemannian Manifold Learning IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, TPAMI-0505-0706, ACCEPTED 2007-6-11 1 Riemannian Manifold Learning Tong LIN and Hongbin ZHA Abstract--Recently, manifold learning has been

More information

MATH 567: Mathematical Techniques in Data

MATH 567: Mathematical Techniques in Data Supervised and unsupervised learning Supervised learning problems: MATH 567: Mathematical Techniques in Data (X, Y ) P (X, Y ). Data Science Clustering I is labelled (input/output) with joint density We

More information

CSE 6242 A / CS 4803 DVA. Feb 12, Dimension Reduction. Guest Lecturer: Jaegul Choo

CSE 6242 A / CS 4803 DVA. Feb 12, Dimension Reduction. Guest Lecturer: Jaegul Choo CSE 6242 A / CS 4803 DVA Feb 12, 2013 Dimension Reduction Guest Lecturer: Jaegul Choo CSE 6242 A / CS 4803 DVA Feb 12, 2013 Dimension Reduction Guest Lecturer: Jaegul Choo Data is Too Big To Do Something..

More information

Themes in the Texas CCRS - Mathematics

Themes in the Texas CCRS - Mathematics 1. Compare real numbers. a. Classify numbers as natural, whole, integers, rational, irrational, real, imaginary, &/or complex. b. Use and apply the relative magnitude of real numbers by using inequality

More information

Bias Selection Using Task-Targeted Random Subspaces for Robust Application of Graph-Based Semi-Supervised Learning

Bias Selection Using Task-Targeted Random Subspaces for Robust Application of Graph-Based Semi-Supervised Learning Bias Selection Using Task-Targeted Random Subspaces for Robust Application of Graph-Based Semi-Supervised Learning Christopher T. Symons, Ranga Raju Vatsavai Computational Sciences and Engineering Oak

More information

Shape Modeling and Geometry Processing

Shape Modeling and Geometry Processing 252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry

More information