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

Pierre Dangauthier

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

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

Artificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 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
2 papers
Probabilistic and Bayesian machine learning · 59% Motion planning and robot control · 29% Graph learning · 12%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
robot learning
0.112005
Auto-supervised learning in the Bayesian Programming Framework · ICRA 2005
Machine learning › Graph learning › graph neural network › message passing
approximate message passing
0.012007
TrueSkill Through Time: Revisiting the History of Chess · NIPS 2007
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
expectation propagation
0.012007
TrueSkill Through Time: Revisiting the History of Chess · NIPS 2007
Machine learning › Probabilistic and Bayesian machine learning › probabilistic programming
bayesian programming
0.012005
Auto-supervised learning in the Bayesian Programming Framework · ICRA 2005

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

factor graph · 0.1expectation propagation · 0.1feature selection · 0.1bayesian programming · 0.1
YearPublicationVenuePosition
2007 TrueSkill Through Time: Revisiting the History of Chess
abstract
We extend the Bayesian skill rating system TrueSkill to infer entire time series of skills of players by smoothing through time instead of (cid:12)ltering. The skill of each participating player, say, every year is represented by a latent skill variable which is a(cid:11)ected by the relevant game outcomes that year, and coupled with the skill variables of the previous and subsequent year. Inference in the resulting factor graph is carried out by approximate message passing (EP) along the time series of skills. As before the system tracks the uncertainty about player skills, explicitly models draws, can deal with any number of competing entities and can infer individual skills from team results. We extend the system to estimate player-speci(cid:12)c draw mar- gins. Based on these models we present an analysis of the skill curves of important players in the history of chess over the past 150 years. Results include plots of players’ lifetime skill development as well as the ability to compare the skills of di(cid:11)erent players across time. Our results indicate that a) the overall playing strength has increased over the past 150 years, and b) that modelling a player’s ability to force a draw provides signi(cid:12)cantly better predictive power.
Pierre Dangauthier, Ralf Herbrich, Tom Minka, Thore Graepel
NIPS1
2005 Auto-supervised learning in the Bayesian Programming Framework
abstract
Domestic and real world robotics requires continuous learning of new skills and behaviors to interact with humans. Auto-supervised learning, a compromise between supervised and completely unsupervised learning, consist in relying on previous knowledge to acquire new skills. We propose here to realize auto-supervised learning by exploiting statistical regularities in the sensorimotor space of a robot. In our context, it corresponds to achieve feature selection in a Bayesian programming framework. We compare several feature selection algorithms and validate them on a real robotic experiment.
Pierre Dangauthier, Pierre Bessière, Anne Spalanzani
ICRA1