Learning Distance for Sequences by Learning a Ground Metric Bing Su - - PowerPoint PPT Presentation

learning distance for sequences by learning a ground
SMART_READER_LITE
LIVE PREVIEW

Learning Distance for Sequences by Learning a Ground Metric Bing Su - - PowerPoint PPT Presentation

ICML | 2019 Learning Distance for Sequences by Learning a Ground Metric Bing Su Ying Wu Motivation Distance between sequences depends on temporal alignment to eliminate the local temporal discrepancies. indicates whether


slide-1
SLIDE 1

Learning Distance for Sequences by Learning a Ground Metric

Bing Su Ying Wu

ICML | 2019

slide-2
SLIDE 2

Motivation

  • Distance between sequences depends on temporal

alignment to eliminate the local temporal discrepancies.

Temporal alignment

indicates whether or the probability of the pair and is aligned.

slide-3
SLIDE 3

Motivation

  • The inference of alignment depends on the ground metric

between elements in sequences.

Ground metric

Let Ω be a space, be the metric on this space.

slide-4
SLIDE 4

A Unified Perspective

  • Distance between two sequences: a general formulation

The ground metric matrix

  • f pairwise distances

between elements The temporal alignment matrix

slide-5
SLIDE 5

A Unified Perspective

  • T* is generally inferred by
  • is the feasible set of T, which is a subset of

with some constraints; is a regularization term.

  • Different distance measures for sequences differ in the

constraints imposed to the feasible set, the regularization term, and the optimization method.

slide-6
SLIDE 6

A Unified Perspective

  • Connection to dynamic time warping (DTW)

DTW infers T via dynamic programming.

  • Connection to order-preserving Wasserstein distance

(OPW) OPW infers T by the Sinkhorn’s matrix scaling algorithm.

slide-7
SLIDE 7

Problem

  • The distance between sequences is formulated as a

function of the ground metric: meta-distance

  • Learn meta-distance by learning the ground metric
  • Given a set of N training sequences and the corresponding

labels,

  • Learn a meta-distance by learning a

Mahalanobis distance as the ground metric:

  • ,
  • Goal: with the learned W, the resulting meta-distance

better separates sequences from different classes.

slide-8
SLIDE 8

Objective

  • Regressive virtual sequence metric learning (RVSML)
  • Associate a virtual sequence

with each training sequence

  • Minimize the meta-distances between the training

sequences and their associated virtual sequences

  • If does not depend on W, it is equivalent to
slide-9
SLIDE 9

Optimization

  • Fix , optimize W: standard regression, closed form

solution

  • Fix W, optimize : standard inference, e.g. DTW, OPW
  • Guaranteed convergence
slide-10
SLIDE 10

Evaluation

  • Generating V:
  • RVSML instantiated by (a) DTW and (b) OPW using the

NN classifier with the (a) DTW and (b) OPW distance

  • Comparison with other metric learning methods on the ChaLearn

and SAD datasets

slide-11
SLIDE 11

Results

  • Comparison with state-of-the-art methods on the MSR Activity3D

and MSR Action3D datasets

  • Please visit our poster for more details.
  • Thank you very much!