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

Romy Shioda

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

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

Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 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
Planning, search and constraint satisfaction · 83% Reinforcement learning · 17%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
hierarchical planning
0.112006
Automated Hierarchy Discovery for Planning in Partially Observable Environments · NIPS 2006
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable planning
0.112006
Automated Hierarchy Discovery for Planning in Partially Observable Environments · NIPS 2006
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty
0.112006
Automated Hierarchy Discovery for Planning in Partially Observable Environments · NIPS 2006
Machine learning › Reinforcement learning › hierarchical reinforcement learning
hierarchical policy
0.012006
Automated Hierarchy Discovery for Planning in Partially Observable Environments · NIPS 2006
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.012006
Automated Hierarchy Discovery for Planning in Partially Observable Environments · NIPS 2006

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

non-convex optimization · 0.1mixed-integer nonlinear programming · 0.1bounded hierarchical policy iteration · 0.1
YearPublicationVenuePosition
2006 Automated Hierarchy Discovery for Planning in Partially Observable Environments
abstract
Planning in partially observable domains is a notoriously difficult problem. How- ever, in many real-world scenarios, planning can be simplified by decomposing the task into a hierarchy of smaller planning problems. Several approaches have been proposed to optimize a policy that decomposes according to a hierarchy specified a priori. In this paper, we investigate the problem of automatically discovering the hierarchy. More precisely, we frame the optimization of a hierarchical policy as a non-convex optimization problem that can be solved with general non-linear solvers, a mixed-integer non-linear approximation or a form of bounded hierar- chical policy iteration. By encoding the hierarchical structure as variables of the optimization problem, we can automatically discover a hierarchy. Our method is flexible enough to allow any parts of the hierarchy to be specified based on prior knowledge while letting the optimization discover the unknown parts. It can also discover hierarchical policies, including recursive policies, that are more compact (potentially infinitely fewer parameters) and often easier to understand given the decomposition induced by the hierarchy.
Laurent Charlin, Pascal Poupart, Romy Shioda
NIPS3
2006 A factor analysis model for functional genomics
abstract
BACKGROUND: Expression array data are used to predict biological functions of uncharacterized genes by comparing their expression profiles to those of characterized genes. While biologically plausible, this is both statistically and computationally challenging. Typical approaches are computationally expensive and ignore correlations among expression profiles and functional categories. RESULTS: We propose a factor analysis model (FAM) for functional genomics and give a two-step algorithm, using genome-wide expression data for yeast and a subset of Gene-Ontology Biological Process functional annotations. We show that the predictive performance of our method is comparable to the current best approach while our total computation time was faster by a factor of 4000. We discuss the unique challenges in performance evaluation of algorithms used for genome-wide functions genomics. Finally, we discuss extensions to our method that can incorporate the inherent correlation structure of the functional categories to further improve predictive performance. CONCLUSION: Our factor analysis model is a computationally efficient technique for functional genomics and provides a clear and unified statistical framework with potential for incorporating important gene ontology information to improve predictions.
Rafal Kustra, Romy Shioda
BMC Bioinform.2