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.

Hany Hamed

dblp:262/3747 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
Reinforcement learning · 35% Generative modeling · 31% Planning, search and constraint satisfaction · 19%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.012026
Extendable Planning via Multiscale Diffusion · AAAI 2026
Machine learning › Generative modeling › diffusion model
diffusion planning
1.012026
Extendable Planning via Multiscale Diffusion · AAAI 2026
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
long-horizon planning
1.012026
Extendable Planning via Multiscale Diffusion · AAAI 2026
Robotics › Motion planning and robot control
trajectory optimization
1.012026
Extendable Planning via Multiscale Diffusion · AAAI 2026
Machine learning › Reinforcement learning
exploration
0.812024
Dr. Strategy: Model-Based Generalist Agents with Strategic Dreaming · ICML 2024
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
Dr. Strategy: Model-Based Generalist Agents with Strategic Dreaming · ICML 2024
Machine learning › Reinforcement learning › exploration
strategic exploration
0.812024
Dr. Strategy: Model-Based Generalist Agents with Strategic Dreaming · ICML 2024

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

progressive trajectory extension · 1.0multiscale diffusion · 1.0hierarchical planning · 1.0model-based reinforcement learning · 0.8latent landmarks · 0.8highway policy · 0.8
YearPublicationVenuePosition
2026 Extendable Planning via Multiscale Diffusion
abstract
Long-horizon planning is crucial in complex environments, but diffusion-based planners like Diffuser are limited by the trajectory lengths observed during training. This creates a dilemma: long trajectories are needed for effective planning, yet they degrade model performance. In this paper, we introduce this extendable long-horizon planning challenge and propose a two-phase solution. First, Progressive Trajectory Extension incrementally constructs longer trajectories through multi-round compositional stitching. Second, the Hierarchical Multiscale Diffuser enables efficient training and inference over long horizons by reasoning across temporal scales. To avoid the need for multiple separate models, we propose Adaptive Plan Pondering and the Recursive HM-Diffuser, which unify hierarchical planning within a single model. Experiments show our approach yields strong performance gains, advancing scalable and efficient decision-making over long-horizons.
Hany Hamed, Doojin Baek, Taegu Kang, Samyeul Noh, Yoshua Bengio, Sungjin Ahn
AAAI2
2024 Dr. Strategy: Model-Based Generalist Agents with Strategic Dreaming
abstract
Model-based reinforcement learning (MBRL) has been a primary approach to ameliorating the sample efficiency issue as well as to make a generalist agent. However, there has not been much effort toward enhancing the strategy of dreaming itself. Therefore, it is a question *whether and how an agent can ``*dream better*''* in a more structured and strategic way. In this paper, inspired by the observation from cognitive science suggesting that humans use a spatial divide-and-conquer strategy in planning, we propose a new MBRL agent, called **Dr. Strategy**, which is equipped with a novel **Dr**eaming **Strategy**. The proposed agent realizes a version of divide-and-conquer-like strategy in dreaming. This is achieved by learning a set of latent landmarks and then utilizing these to learn a landmark-conditioned highway policy. With the highway policy, the agent can first learn in the dream to move to a landmark, and from there it tackles the exploration and achievement task in a more focused way. In experiments, we show that the proposed model outperforms prior pixel-based MBRL methods in various visually complex and partially observable navigation tasks.
Hany Hamed, Jaesik Yoon, Sungjin Ahn
ICML1