Demo Data from EDBT 2026 / reviewers in the wild / expert
He Zhang 0030
dblp:24/2058-30
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0009-0800-8035ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
User interface design and tools · 100% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
exploration |
0.9 | 1 | 2025 | Efficient Skill Discovery via Regret-Aware Optimization · ICML 2025 |
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
unsupervised skill discovery |
0.9 | 1 | 2025 | Efficient Skill Discovery via Regret-Aware Optimization · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
object-aware feedback generation · 1.3multimodal reinforcement learning · 1.3coarse-to-fine policy network · 1.3temporal representation learning · 0.9regret scoring · 0.9mutual information optimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Skill Discovery via Regret-Aware OptimizationabstractUnsupervised skill discovery aims to learn diverse and distinguishable behaviors in open-ended reinforcement learning. For the existing methods, they focus on improving the diversity via pure exploration, mutual information optimization and learning temporal representation. Despite they perform well on exploration, they remain limited in terms of efficiency, especially for the high-dimensional situations. In this work, we frame the skill discovery as a min-max game of skill generation and policy learning, proposing a regret-aware method on top of temporal representation learning that expands the discovered skill space along the direction of upgradable policy strength. The key insight behind the proposed method is that the skill discovery is adversarial to the policy learning, i.e., skills with weak strength should be further explored while less exploration for the skills with converged strength. As an implementation, we score the degree of strength convergence with regret, and guide the skill discovery with a learnable skill generator. To avoid degeneration, the skill generation comes from an upgradable population of skill generators. We conduct experiments on environments with varying complexities and dimension sizes. Empirical results show that our method outperforms baselines on both efficiency and diversity. Moreover, our method achieves 15% zero-shot improvement on high-dimensional environments, compared to existing methods. He Zhang 0030, Shaopeng Zhai, Ying Sun 0006, Hui Xiong 0001 |
ICML | 1 |
| 2023 | Interactive Interior Design Recommendation via Coarse-to-fine Multimodal Reinforcement LearningabstractPersonalized interior decoration design often incurs high labor costs. Recent efforts in developing intelligent interior design systems have focused on generating textual requirement-based decoration designs while neglecting the problem of how to mine homeowner's hidden preferences and choose the proper initial design. To fill this gap, we propose an Interactive Interior Design Recommendation System (IIDRS) based on reinforcement learning (RL). IIDRS aims to find an ideal plan by interacting with the user, who provides feedback on the gap between the recommended plan and their ideal one. To improve decision-making efficiency and effectiveness in large decoration spaces, we propose a Decoration Recommendation Coarse-to-Fine Policy Network (DecorRCFN). Additionally, to enhance generalization in online scenarios, we propose an object-aware feedback generation method that augments model training with diversified and dynamic textual feedback. Extensive experiments on a real-world dataset demonstrate our method outperforms traditional methods by a large margin in terms of recommendation accuracy. Further user studies demonstrate that our method reaches higher real-world user satisfaction than baseline methods. He Zhang 0030, Ying Sun 0006, Weiyu Guo, Haonan Lu, Xiaodong Lin 0004, Hui Xiong 0001 |
ACM Multimedia | 1 |