Demo Data from EDBT 2026 / reviewers in the wild / expert
Pusen Dong
dblp:314/6442
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 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
1 paper |
Reinforcement learning · 30% Knowledge representation and reasoning · 30% Language models and text generation · 30% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
constraint specification |
0.8 | 1 | 2024 | From Text to Trajectory: Exploring Complex Constraint Representation and Decomposition in Safe Reinforcement Learning · NeurIPS 2024 |
Machine learning › Reinforcement learning
safe reinforcement learning |
0.8 | 1 | 2024 | From Text to Trajectory: Exploring Complex Constraint Representation and Decomposition in Safe Reinforcement Learning · NeurIPS 2024 |
Machine learning › Optimization for machine learning
cost function design |
0.2 | 1 | 2024 | From Text to Trajectory: Exploring Complex Constraint Representation and Decomposition in Safe Reinforcement Learning · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
trajectory-level constraint translation · 0.8text as training signal · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | From Text to Trajectory: Exploring Complex Constraint Representation and Decomposition in Safe Reinforcement LearningabstractSafe reinforcement learning (RL) requires the agent to finish a given task while obeying specific constraints. Giving constraints in natural language form has great potential for practical scenarios due to its flexible transfer capability and accessibility. Previous safe RL methods with natural language constraints typically need to design cost functions manually for each constraint, which requires domain expertise and lacks flexibility. In this paper, we harness the dual role of text in this task, using it not only to provide constraint but also as a training signal. We introduce the Trajectory-level Textual Constraints Translator (TTCT) to replace the manually designed cost function. Our empirical results demonstrate that TTCT effectively comprehends textual constraint and trajectory, and the policies trained by TTCT can achieve a lower violation rate than the standard cost function. Extra studies are conducted to demonstrate that the TTCT has zero-shot transfer capability to adapt to constraint-shift environments. Pusen Dong, Tianchen Zhu, Haoyi Zhou, Jianxin Li 0002 |
NeurIPS | 1 |
| 2021 | Accelerating DCNNs via Cooperative Weight/Activation Compression
Yuhao Zhang 0006, Xikun Jiang, Yudong Pan, Pusen Dong, Zhaoyan Shen, Zhiping Jia |
ICA3PP (3) | 5 |