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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aram H. Markosyan

dblp:321/0886 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 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 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
3 papers
Language models and text generation · 58% Trustworthy machine learning · 25% Optimization for machine learning · 13%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code generation with language models
0.912025
LLMs: A Driving Force in Next Generation Digital Design Automation · DAC 2025
Natural language and speech › Language models and text generation › prompting
adversarial prompt generation
0.812024
Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.812024
Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts · NeurIPS 2024
Natural language and speech › Language models and text generation
large language model safety
0.812024
Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts · NeurIPS 2024
Machine learning › Optimization for machine learning › evolutionary computation
quality-diversity
0.812024
Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts · NeurIPS 2024
Machine learning › Trustworthy machine learning › safety evaluation
red teaming
0.812024
Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts · NeurIPS 2024
Natural language and speech › Language models and text generation › large language model training
large language model training dynamics
0.612022
Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Models · NeurIPS 2022
Natural language and speech › Language models and text generation › large language model › knowledge in language models
memorization
0.612022
Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Models · NeurIPS 2022
Natural language and speech › Language models and text generation › large language model training
scaling laws for language models
0.612022
Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Models · NeurIPS 2022
Machine learning › Generative modeling › computational creativity › creative generation
generative AI for design
0.312025
LLMs: A Driving Force in Next Generation Digital Design Automation · DAC 2025
Natural language and speech › Language models and text generation
large language model
0.312025
LLMs: A Driving Force in Next Generation Digital Design Automation · DAC 2025

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

large language model · 1.7generative AI · 1.7quality-diversity search · 0.8black-box optimization · 0.8empirical training dynamics analysis · 0.6
YearPublicationVenuePosition
2025 LLMs: A Driving Force in Next Generation Digital Design Automation
abstract
Innovations in generative artificial intelligence (GenAI), particularly large language models (LLMs), are poised to revolutionize silicon design automation. This paper explores the transformative potential of LLMs in automating and enhancing various tasks within the silicon design process. It reviews the current applications of LLMs and their potential to automate silicon design tasks, proposing applications, providing a qualitative analysis of the readiness of the technology to support these applications and setting directions for future research.
Matheus T. Moreira, Aram H. Markosyan, Chris Cummins, Warren Hunt, Gabriel Synnaeve, Edith Beigné
DAC2
2024 Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts
abstract
As large language models (LLMs) become increasingly prevalent across many real-world applications, understanding and enhancing their robustness to adversarial attacks is of paramount importance. Existing methods for identifying adversarial prompts tend to focus on specific domains, lack diversity, or require extensive human annotations. To address these limitations, we present Rainbow Teaming, a novel black-box approach for producing a diverse collection of adversarial prompts. Rainbow Teaming casts adversarial prompt generation as a quality-diversity problem and uses open-ended search to generate prompts that are both effective and diverse. Focusing on the safety domain, we use Rainbow Teaming to target various state-of-the-art LLMs, including the Llama 2 and Llama 3 models. Our approach reveals hundreds of effective adversarial prompts, with an attack success rate exceeding 90% across all tested models. Furthermore, we demonstrate that prompts generated by Rainbow Teaming are highly transferable and that fine-tuning models with synthetic data generated by our method significantly enhances their safety without sacrificing general performance or helpfulness. We additionally explore the versatility of Rainbow Teaming by applying it to question answering and cybersecurity, showcasing its potential to drive robust open-ended self-improvement in a wide range of applications.
Mikayel Samvelyan, Sharath Chandra, Andrei Lupu, Eric Hambro, Aram H. Markosyan, Manish Bhatt, Yuning Mao, Minqi Jiang, Jack Parker-Holder, Jakob N. Foerster, Tim Rocktäschel, Roberta Raileanu
NeurIPS5
2022 Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Models
abstract
Despite their wide adoption, the underlying training and memorization dynamics of very large language models is not well understood. We empirically study exact memorization in causal and masked language modeling, across model sizes and throughout the training process. We measure the effects of dataset size, learning rate, and model size on memorization, finding that larger language models memorize training data faster across all settings. Surprisingly, we show that larger models can memorize a larger portion of the data before over-fitting and tend to forget less throughout the training process. We also analyze the memorization dynamics of different parts of speech and find that models memorize nouns and numbers first; we hypothesize and provide empirical evidence that nouns and numbers act as a unique identifier for memorizing individual training examples. Together, these findings present another piece of the broader puzzle of trying to understand what actually improves as models get bigger.
Kushal Tirumala, Aram H. Markosyan, Luke Zettlemoyer, Armen Aghajanyan
NeurIPS2