Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthew Rosencrantz

dblp:40/971 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › latent representation learning
low-dimensional representation learning
0.012004
Learning low dimensional predictive representations · ICML 2004
Machine learning › Representation and self-supervised learning › representation learning › latent representation learning › state representation learning
predictive state representation
0.012004
Learning low dimensional predictive representations · ICML 2004

Methods — techniques the papers use, named apart from their topics

principal component analysis · 0.0baum-welch · 0.0
YearPublicationVenuePosition
2004 Learning low dimensional predictive representations
abstract
Predictive state representations (PSRs) have recently been proposed as an alternative to partially observable Markov decision processes (POMDPs) for representing the state of a dynamical system (Littman et al., 2001). We present a learning algorithm that learns a PSR from observational data. Our algorithm produces a variant of PSRs called transformed predictive state representations (TPSRs). We provide an efficient principal-components-based algorithm for learning a TPSR, and show that TPSRs can perform well in comparison to Hidden Markov Models learned with Baum-Welch in a real world robot tracking task for low dimensional representations and long prediction horizons.
Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian Thrun
ICML1
2003 Decentralized Sensor Fusion with Distributed Particle Filters
Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian Thrun
UAI1