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

Yasumasa Ueda

dblp:85/4097 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 1

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
Probabilistic and Bayesian machine learning · 67% Multi-agent systems · 33%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems
learning agents
0.012003
Estimating Internal Variables and Paramters of a Learning Agent by a Particle Filter · NIPS 2003
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation
0.012003
Estimating Internal Variables and Paramters of a Learning Agent by a Particle Filter · NIPS 2003
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › sequential monte carlo
particle filtering
0.012003
Estimating Internal Variables and Paramters of a Learning Agent by a Particle Filter · NIPS 2003

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

particle filter · 0.0bayesian estimation · 0.0
YearPublicationVenuePosition
2003 Estimating Internal Variables and Paramters of a Learning Agent by a Particle Filter
abstract
When we model a higher order functions, such as learning and memory, we face a difficulty of comparing neural activities with hidden variables that depend on the history of sensory and motor signals and the dynam- ics of the network. Here, we propose novel method for estimating hidden variables of a learning agent, such as connection weights from sequences of observable variables. Bayesian estimation is a method to estimate the posterior probability of hidden variables from observable data sequence using a dynamic model of hidden and observable variables. In this pa- per, we apply particle filter for estimating internal parameters and meta- parameters of a reinforcement learning model. We verified the effective- ness of the method using both artificial data and real animal behavioral data.
Kazuyuki Samejima, Kenji Doya, Yasumasa Ueda, Minoru Kimura
NIPS3