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.

Lynn Cherif

dblp:355/5809 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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 · 48% Language models and text generation · 28% Deep learning architectures and training · 24%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model safety
safety fine-tuning
0.912025
Learning Diverse Attacks on Large Language Models for Robust Red-Teaming and Safety Tuning · ICLR 2025
Security and privacy of machine learning
red teaming
0.912025
Learning Diverse Attacks on Large Language Models for Robust Red-Teaming and Safety Tuning · ICLR 2025
Machine learning › Reinforcement learning › non-stationary reinforcement learning
continual reinforcement learning
0.812024
Parseval Regularization for Continual Reinforcement Learning · NeurIPS 2024
Machine learning › Reinforcement learning
plasticity preservation
0.812024
Parseval Regularization for Continual Reinforcement Learning · NeurIPS 2024
Machine learning › Deep learning architectures and training
regularization
0.812024
Parseval Regularization for Continual Reinforcement Learning · NeurIPS 2024

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

reinforcement learning · 1.7GFlowNets · 0.9GFlowNet · 0.9parseval regularization · 0.8
YearPublicationVenuePosition
2025 Learning Diverse Attacks on Large Language Models for Robust Red-Teaming and Safety Tuning
abstract
Red-teaming, or identifying prompts that elicit harmful responses, is a critical step in ensuring the safe and responsible deployment of large language models (LLMs). Developing effective protection against many modes of attack prompts requires discovering diverse attacks. Automated red-teaming typically uses reinforcement learning to fine-tune an attacker language model to generate prompts that elicit undesirable responses from a target LLM, as measured, for example, by an auxiliary toxicity classifier. We show that even with explicit regularization to favor novelty and diversity, existing approaches suffer from mode collapse or fail to generate effective attacks. As a flexible and probabilistically principled alternative, we propose to use GFlowNet fine-tuning, followed by a secondary smoothing phase, to train the attacker model to generate *diverse* and *effective* attack prompts. We find that the attacks generated by our method are effective against a wide range of target LLMs, both with and without safety tuning, and transfer well between target LLMs. Finally, we demonstrate that models safety-tuned using a dataset of red-teaming prompts generated by our method are robust to attacks from other RL-based red-teaming approaches.
Seanie Lee, Minsu Kim 0004, Lynn Cherif, David Dobre, Juho Lee 0001, Sung Ju Hwang, Kenji Kawaguchi, Gauthier Gidel, Yoshua Bengio, Nikolay Malkin, Moksh Jain
ICLR3
2024 Parseval Regularization for Continual Reinforcement Learning
abstract
Plasticity loss, trainability loss, and primacy bias have been identified as issues arising when training deep neural networks on sequences of tasks---referring to the increased difficulty in training on new tasks. We propose to use Parseval regularization, which maintains orthogonality of weight matrices, to preserve useful optimization properties and improve training in a continual reinforcement learning setting. We show that it provides significant benefits to RL agents on a suite of gridworld, CARL and MetaWorld tasks. We conduct comprehensive ablations to identify the source of its benefits and investigate the effect of certain metrics associated to network trainability including weight matrix rank, weight norms and policy entropy.
Wesley Chung, Lynn Cherif, Doina Precup, David Meger
NeurIPS2