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.

Sondre Wold

dblp:330/4280 · DBLP profile ↗
← Back
2ranked-venue papers
1as 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 · 1 first-author · 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
1 paper
Trustworthy machine learning · 75% Language models and text generation · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
circuit analysis
0.912025
Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models · ACL (1) 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models · ACL (1) 2025
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability
0.912025
Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models · ACL (1) 2025
Natural language and speech › Language models and text generation › language modeling › language model architecture
transformer language model
0.912025
Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models · ACL (1) 2025

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

probabilistic context-free grammar · 0.9circuit composition · 0.9
YearPublicationVenuePosition
2025 Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models
abstract
A fundamental question in interpretability research is to what extent neural networks, particularly language models, implement reusable functions through subnetworks that can be composed to perform more complex tasks.Recent advances in mechanistic interpretability have made progress in identifying circuits, which represent the minimal computational subgraphs responsible for a model's behavior on specific tasks.However, most studies focus on identifying circuits for individual tasks without investigating how functionally similar circuits relate to each other.To address this gap, we study the modularity of neural networks by analyzing circuits for highly compositional subtasks within a transformer-based language model.Specifically, given a probabilistic context-free grammar, we identify and compare circuits responsible for ten modular string-edit operations.Our results indicate that functionally similar circuits exhibit both notable node overlap and crosstask faithfulness.Moreover, we demonstrate that the circuits identified can be reused and combined through set operations to represent more complex functional model capabilities.
Philipp Mondorf, Sondre Wold, Barbara Plank
ACL (1)2
2024 Estimating Lexical Complexity from Document-Level Distributions
abstract
Existing methods for complexity estimation are typically developed for entire documents. This limitation in scope makes them inapplicable for shorter pieces of text, such as health assessment tools. These typically consist of lists of independent sentences, all of which are too short for existing methods to apply. The choice of wording in these assessment tools is crucial, as both the cognitive capacity and the linguistic competency of the intended patient groups could vary substantially. As a first step towards creating better tools for supporting health practitioners, we develop a two-step approach for estimating lexical complexity that does not rely on any pre-annotated data. We implement our approach for the Norwegian language and verify its effectiveness using statistical testing and a qualitative evaluation of samples from real assessment tools. We also investigate the relationship between our complexity measure and certain features typically associated with complexity in the literature, such as word length, frequency, and the number of syllables.
Sondre Wold, Petter Mæhlum, Oddbjørn Hove
LREC/COLING1