Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jayden Teoh
dblp:374/2302 · also Jayden Teoh Jing Teoh
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0009-2712-3493ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 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
3 papers |
Reinforcement learning · 34% Learning paradigms · 28% Language models and text generation · 21% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation › large language model evaluation
capability evaluation |
0.9 | 1 | 2025 | The Elicitation Game: Evaluating Capability Elicitation Techniques · ICML 2025 |
Machine learning › Transfer learning and domain adaptation
domain generalization |
0.9 | 1 | 2025 | On Generalization Across Environments In Multi-Objective Reinforcement Learning · ICLR 2025 |
Machine learning › Reinforcement learning
multi-objective reinforcement learning |
0.9 | 1 | 2025 | On Generalization Across Environments In Multi-Objective Reinforcement Learning · ICLR 2025 |
Machine learning › Learning paradigms › curriculum learning
automatic curriculum generation |
0.8 | 1 | 2024 | Improving Environment Novelty Quantification for Effective Unsupervised Environment Design · NeurIPS 2024 |
Machine learning › Learning paradigms
curriculum learning |
0.8 | 1 | 2024 | Improving Environment Novelty Quantification for Effective Unsupervised Environment Design · NeurIPS 2024 |
Machine learning › Reinforcement learning › reinforcement learning environment › environment design
unsupervised environment design |
0.8 | 1 | 2024 | Improving Environment Novelty Quantification for Effective Unsupervised Environment Design · NeurIPS 2024 |
Natural language and speech › Language models and text generation
code generation |
0.3 | 1 | 2025 | The Elicitation Game: Evaluating Capability Elicitation Techniques · ICML 2025 |
Machine learning › Reinforcement learning
generalization in reinforcement learning |
0.2 | 1 | 2024 | Improving Environment Novelty Quantification for Effective Unsupervised Environment Design · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
prompting · 0.9pareto set learning · 0.9fine-tuning · 0.9circuit-breaking · 0.9activation steering · 0.9regret-based curriculum design · 0.8gaussian mixture model · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On Generalization Across Environments In Multi-Objective Reinforcement LearningabstractReal-world sequential decision-making tasks often require balancing trade-offs between multiple conflicting objectives, making Multi-Objective Reinforcement Learning (MORL) an increasingly prominent field of research. Despite recent advances, existing MORL literature has narrowly focused on performance within static environments, neglecting the importance of generalizing across diverse settings. Conversely, existing research on generalization in RL has always assumed scalar rewards, overlooking the inherent multi-objectivity of real-world problems. Generalization in the multi-objective context is fundamentally more challenging, as it requires learning a Pareto set of policies addressing varying preferences across multiple objectives. In this paper, we formalize the concept of generalization in MORL and how it can be evaluated. We then contribute a novel benchmark featuring diverse multi-objective domains with parameterized environment configurations to facilitate future studies in this area. Our baseline evaluations of state-of-the-art MORL algorithms on this benchmark reveals limited generalization capabilities, suggesting significant room for improvement. Our empirical findings also expose limitations in the expressivity of scalar rewards, emphasizing the need for multi-objective specifications to achieve effective generalization. We further analyzed the algorithmic complexities within current MORL approaches that could impede the transfer in performance from the single- to multiple-environment settings. This work fills a critical gap and lays the groundwork for future research that brings together two key areas in reinforcement learning: solving multi-objective decision-making problems and generalizing across diverse environments. We make our code available at [https://github.com/JaydenTeoh/MORL-Generalization](https://github.com/JaydenTeoh/MORL-Generalization). Jayden Teoh, Pradeep Varakantham, Peter Vamplew 0001 |
ICLR | 1 |
| 2025 | The Elicitation Game: Evaluating Capability Elicitation TechniquesabstractCapability evaluations are required to understand and regulate AI systems that may
be deployed or further developed. Therefore, it is important that evaluations provide
an accurate estimation of an AI system’s capabilities. However, in numerous cases,
previously latent capabilities have been elicited from models, sometimes long
after initial release. Accordingly, substantial efforts have been made to develop
methods for eliciting latent capabilities from models. In this paper, we evaluate the
effectiveness of capability elicitation techniques by intentionally training model
organisms – language models with hidden capabilities that are revealed by a
password. We introduce a novel method for training model organisms, based
on circuit-breaking, which is more robust to elicitation techniques than standard
password-locked models. We focus on elicitation techniques based on prompting
and activation steering, and compare these to fine-tuning methods. Prompting
techniques can elicit the actual capability of both password-locked and circuit-
broken model organisms in an MCQA setting, while steering fails to do so. For
a code-generation task, only fine-tuning can elicit the hidden capabilities of our
novel model organism. Additionally, our results suggest that combining techniques
improves elicitation. Still, if possible, fine-tuning should be the method of choice
to improve the trustworthiness of capability evaluations. Felix Hofstätter, Teun van der Weij, Jayden Teoh, Rada Djoneva, Henning Bartsch, Francis Rhys Ward |
ICML | 3 |
| 2024 | Improving Environment Novelty Quantification for Effective Unsupervised Environment DesignabstractUnsupervised Environment Design (UED) formalizes the problem of autocurricula through interactive training between a teacher agent and a student agent. The teacher generates new training environments with high learning potential, curating an adaptive curriculum that strengthens the student's ability to handle unseen scenarios. Existing UED methods mainly rely on *regret*, a metric that measures the difference between the agent's optimal and actual performance, to guide curriculum design. Regret-driven methods generate curricula that progressively increase environment complexity for the student but overlook environment *novelty* — a critical element for enhancing an agent's generalizability. Measuring environment novelty is especially challenging due to the underspecified nature of environment parameters in UED, and existing approaches face significant limitations. To address this, this paper introduces the *Coverage-based Evaluation of Novelty In Environment* (CENIE) framework. CENIE proposes a scalable, domain-agnostic, and curriculum-aware approach to quantifying environment novelty by leveraging the student's state-action space coverage from previous curriculum experiences. We then propose an implementation of CENIE that models this coverage and measures environment novelty using Gaussian Mixture Models. By integrating both regret and novelty as complementary objectives for curriculum design, CENIE facilitates effective exploration across the state-action space while progressively increasing curriculum complexity. Empirical evaluations demonstrate that augmenting existing regret-based UED algorithms with CENIE achieves state-of-the-art performance across multiple benchmarks, underscoring the effectiveness of novelty-driven autocurricula for robust generalization. Jayden Teoh, Pradeep Varakantham |
NeurIPS | 1 |