EDBT 2026 Demo / reviewers in the wild / expert
Ruike Song
dblp:414/8570
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—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 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
1 paper |
Language models and text generation · 81% Reinforcement learning · 19% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation › alignment
reward hacking |
1.0 | 1 | 2026 | Causal Reward Adjustment: Mitigating Reward Hacking in External Reasoning via Backdoor Correction · AAAI 2026 |
Natural language and speech › Language models and text generation
large language model reasoning |
0.3 | 1 | 2026 | Causal Reward Adjustment: Mitigating Reward Hacking in External Reasoning via Backdoor Correction · AAAI 2026 |
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model |
0.3 | 1 | 2026 | Causal Reward Adjustment: Mitigating Reward Hacking in External Reasoning via Backdoor Correction · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
sparse autoencoder · 1.0causal inference · 1.0backdoor adjustment · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Causal Reward Adjustment: Mitigating Reward Hacking in External Reasoning via Backdoor CorrectionabstractExternal reasoning systems combine language models with process reward models (PRMs) to select high-quality reasoning paths for complex tasks such as mathematical problem solving. However, these systems are prone to reward hacking, where high-scoring but logically incorrect paths are assigned high scores by the PRMs, leading to incorrect answers. From a causal inference perspective, we attribute this phenomenon primarily to the presence of confounding semantic features. To address it, we propose Causal Reward Adjustment (CRA), a method that mitigates reward hacking by estimating the true reward of a reasoning path. CRA trains sparse autoencoders on the PRM’s internal activations to recover interpretable features, then corrects confounding by using backdoor adjustment. Experiments on math solving datasets demonstrate that CRA mitigates reward hacking and improves final accuracy, without modifying the policy model or retraining PRM. Ruike Song, Zeen Song, Huijie Guo, Wenwen Qiang |
AAAI | 1 |