Spectral Dimensionality Reduction via Maximum Entropy

Neil D. Lawrence

edit

Back to publications

Spectral Dimensionality Reduction via Maximum Entropy

Neil D. Lawrence

Proceedings of the Fourteenth International Workshop on Artificial Intelligence and Statistics, PMLR 15:51-59, 2011.

Abstract

We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian random fields (GRFs). Our unifying perspective is based on the maximum entropy principle which is in turn inspired by maximum variance unfolding. The resulting probabilistic models are based on GRFs. The resulting model is a nonlinear generalization of principal component analysis. We show that parameter fitting in the locally linear embedding is approximate maximum likelihood in these models. We directly maximize the likelihood and show results that are competitive with the leading spectral approaches on a robot navigation visualization and a human motion capture data set.

Links

Cite this Paper

BibTeX


@InProceedings{Lawrence:spectral11,
  title = 	 {Spectral Dimensionality Reduction via Maximum Entropy},
  author = 	 {Lawrence, Neil D.},
  booktitle = 	 {Proceedings of the Fourteenth International Workshop on Artificial Intelligence and Statistics},
  pages = 	 {51--59},
  year = 	 {2011},
  editor = 	 {Gordon, Geoffrey and Dunson, David},
  volume = 	 {15},
  address = 	 {Fort Lauderdale, FL, USA},
  publisher =    {PMLR},
  pdf = 	 {http://proceedings.mlr.press/v15/lawrence11a/lawrence11a.pdf},
  url = 	 {/publications/lawrence-spectral11.html},
  abstract = 	 {We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian random fields (GRFs). Our unifying perspective is based on the maximum entropy principle which is in turn inspired by maximum variance unfolding. The resulting probabilistic models are based on GRFs. The resulting model is a nonlinear generalization of principal component analysis. We show that parameter fitting in the locally linear embedding is approximate maximum likelihood in these models. We directly maximize the likelihood and show results that are competitive with the leading spectral approaches on a robot navigation visualization and a human motion capture data set.},
  note =         {Notable Paper}
}

Endnote

%0 Conference Paper
%T Spectral Dimensionality Reduction via Maximum Entropy
%A Neil D. Lawrence
%B Proceedings of the Fourteenth International Workshop on Artificial Intelligence and Statistics
%D 2011
%E Geoffrey Gordon
%E David Dunson	
%F Lawrence:spectral11
%I PMLR
%P 51--59
%U /publications/lawrence-spectral11.html
%V 15
%X We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian random fields (GRFs). Our unifying perspective is based on the maximum entropy principle which is in turn inspired by maximum variance unfolding. The resulting probabilistic models are based on GRFs. The resulting model is a nonlinear generalization of principal component analysis. We show that parameter fitting in the locally linear embedding is approximate maximum likelihood in these models. We directly maximize the likelihood and show results that are competitive with the leading spectral approaches on a robot navigation visualization and a human motion capture data set.
%Z Notable Paper

RIS


TY  - CPAPER
TI  - Spectral Dimensionality Reduction via Maximum Entropy
AU  - Neil D. Lawrence
BT  - Proceedings of the Fourteenth International Workshop on Artificial Intelligence and Statistics
DA  - 2011/06/14
ED  - Geoffrey Gordon
ED  - David Dunson	
ID  - Lawrence:spectral11
PB  - PMLR
VL  - 15
SP  - 51
EP  - 59
L1  - http://proceedings.mlr.press/v15/lawrence11a/lawrence11a.pdf
UR  - /publications/lawrence-spectral11.html
AB  - We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian random fields (GRFs). Our unifying perspective is based on the maximum entropy principle which is in turn inspired by maximum variance unfolding. The resulting probabilistic models are based on GRFs. The resulting model is a nonlinear generalization of principal component analysis. We show that parameter fitting in the locally linear embedding is approximate maximum likelihood in these models. We directly maximize the likelihood and show results that are competitive with the leading spectral approaches on a robot navigation visualization and a human motion capture data set.
N1  - Notable Paper
ER  -

APA


Lawrence, N.D.. (2011). Spectral Dimensionality Reduction via Maximum Entropy. Proceedings of the Fourteenth International Workshop on Artificial Intelligence and Statistics 15:51-59 Available from /publications/lawrence-spectral11.html. Notable Paper