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.

Richard Ngo

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

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

Artificial intelligence and machine learning · 2 · 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
Language models and text generation · 48% Reinforcement learning · 41% Transfer learning and domain adaptation · 7%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
alignment
0.812024
The Alignment Problem from a Deep Learning Perspective · ICLR 2024
Natural language and speech › Language models and text generation › alignment
deceptive alignment
0.812024
The Alignment Problem from a Deep Learning Perspective · ICLR 2024
Machine learning › Reinforcement learning
reward design
0.412020
Avoiding Side Effects By Considering Future Tasks · NeurIPS 2020
Machine learning › Reinforcement learning › safe reinforcement learning
side effect avoidance
0.412020
Avoiding Side Effects By Considering Future Tasks · NeurIPS 2020
Machine learning › Transfer learning and domain adaptation
pre-trained models
0.212024
The Alignment Problem from a Deep Learning Perspective · ICLR 2024
Knowledge, reasoning and agents › Multi-agent systems
grid environments
0.112020
Avoiding Side Effects By Considering Future Tasks · NeurIPS 2020

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

position paper · 0.8reward shaping · 0.4baseline policy · 0.4
YearPublicationVenuePosition
2024 The Alignment Problem from a Deep Learning Perspective
abstract
AI systems based on deep learning have reached or surpassed human performance in a range of narrow domains. In coming years or decades, artificial general intelligence (AGI) may surpass human capabilities at many critical tasks. In this position paper, we examine the technical difficulty of fine-tuning hypothetical AGI systems based on pretrained deep models to pursue goals that are aligned with human interests. We argue that, if trained like today's most capable models, AGI systems could learn to act deceptively to receive higher reward, learn internally-represented goals which generalize beyond their fine-tuning distributions, and pursue those goals using power-seeking strategies. We review emerging evidence for these properties. AGIs with these properties would be difficult to align and may appear aligned even when they are not.
Richard Ngo, Lawrence Chan, Sören Mindermann
ICLR1
2020 Avoiding Side Effects By Considering Future Tasks
abstract
Designing reward functions is difficult: the designer has to specify what to do (what it means to complete the task) as well as what not to do (side effects that should be avoided while completing the task). To alleviate the burden on the reward designer, we propose an algorithm to automatically generate an auxiliary reward function that penalizes side effects. This auxiliary objective rewards the ability to complete possible future tasks, which decreases if the agent causes side effects during the current task. The future task reward can also give the agent an incentive to interfere with events in the environment that make future tasks less achievable, such as irreversible actions by other agents. To avoid this interference incentive, we introduce a baseline policy that represents a default course of action (such as doing nothing), and use it to filter out future tasks that are not achievable by default. We formally define interference incentives and show that the future task approach with a baseline policy avoids these incentives in the deterministic case. Using gridworld environments that test for side effects and interference, we show that our method avoids interference and is more effective for avoiding side effects than the common approach of penalizing irreversible actions.
Victoria Krakovna, Laurent Orseau, Richard Ngo, Miljan Martic, Shane Legg
NeurIPS3