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

Yo Joong Choe

dblp:234/0589 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-0614-9477ORCID · reported

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

Artificial intelligence and machine learning · 6 · 2 first-author · 3 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

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
4 papers
Representation and self-supervised learning · 35% Trustworthy machine learning · 25% Knowledge representation and reasoning · 12%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation analysis
linear representation hypothesis
1.622025
The Geometry of Categorical and Hierarchical Concepts in Large Language Models · ICLR 2025
The Linear Representation Hypothesis and the Geometry of Large Language Models · ICML 2024
Machine learning › Trustworthy machine learning
interpretability
1.122024
The Linear Representation Hypothesis and the Geometry of Large Language Models · ICML 2024
Discovery of Natural Language Concepts in Individual Units of CNNs · ICLR (Poster) 2019
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
concept representation
0.912025
The Geometry of Categorical and Hierarchical Concepts in Large Language Models · ICLR 2025
Machine learning › Representation and self-supervised learning › representation learning
representation geometry
0.912025
The Geometry of Categorical and Hierarchical Concepts in Large Language Models · ICLR 2025
Natural language and speech › Language models and text generation › large language model
large language model representation
0.812024
The Linear Representation Hypothesis and the Geometry of Large Language Models · ICML 2024
Machine learning › Reinforcement learning › off-policy evaluation
counterfactual evaluation
0.712023
Counterfactually Comparing Abstaining Classifiers · NeurIPS 2023
Machine learning › Trustworthy machine learning › uncertainty estimation
selective classification
0.712023
Counterfactually Comparing Abstaining Classifiers · NeurIPS 2023
Machine learning › Deep learning architectures and training
convolutional neural network
0.412019
Discovery of Natural Language Concepts in Individual Units of CNNs · ICLR (Poster) 2019
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.212023
Counterfactually Comparing Abstaining Classifiers · NeurIPS 2023

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

wordnet · 0.9counterfactual · 0.8causal inner product · 0.8observational causal inference · 0.7doubly robust estimation · 0.7unit analysis · 0.4concept discovery · 0.4
YearPublicationVenuePosition
2025 The Geometry of Categorical and Hierarchical Concepts in Large Language Models
abstract
The linear representation hypothesis is the informal idea that semantic concepts are encoded as linear directions in the representation spaces of large language models (LLMs). Previous work has shown how to make this notion precise for representing binary concepts that have natural contrasts (e.g., {male, female}) as _directions_ in representation space. However, many natural concepts do not have natural contrasts (e.g., whether the output is about an animal). In this work, we show how to extend the formalization of the linear representation hypothesis to represent features (e.g., is_animal) as _vectors_. This allows us to immediately formalize the representation of categorical concepts as polytopes in the representation space. Further, we use the formalization to prove a relationship between the hierarchical structure of concepts and the geometry of their representations. We validate these theoretical results on the Gemma and LLaMA-3 large language models, estimating representations for 900+ hierarchically related concepts using data from WordNet.
Kiho Park 0001, Yo Joong Choe, Yibo Jiang, Victor Veitch
ICLR2
2024 The Linear Representation Hypothesis and the Geometry of Large Language Models
abstract
Informally, the "linear representation hypothesis" is the idea that high-level concepts are represented linearly as directions in some representation space. In this paper, we address two closely related questions: What does "linear representation" actually mean? And, how do we make sense of geometric notions (e.g., cosine similarity and projection) in the representation space? To answer these, we use the language of counterfactuals to give two formalizations of linear representation, one in the output (word) representation space, and one in the input (context) space. We then prove that these connect to linear probing and model steering, respectively. To make sense of geometric notions, we use the formalization to identify a particular (non-Euclidean) inner product that respects language structure in a sense we make precise. Using this causal inner product, we show how to unify all notions of linear representation. In particular, this allows the construction of probes and steering vectors using counterfactual pairs. Experiments with LLaMA-2 demonstrate the existence of linear representations of concepts, the connection to interpretation and control, and the fundamental role of the choice of inner product.
Kiho Park 0001, Yo Joong Choe, Victor Veitch
ICML2
2023 Counterfactually Comparing Abstaining Classifiers
abstract
Abstaining classifiers have the option to abstain from making predictions on inputs that they are unsure about. These classifiers are becoming increasingly popular in high-stakes decision-making problems, as they can withhold uncertain predictions to improve their reliability and safety. When evaluating black-box abstaining classifier(s), however, we lack a principled approach that accounts for what the classifier would have predicted on its abstentions. These missing predictions matter when they can eventually be utilized, either directly or as a backup option in a failure mode. In this paper, we introduce a novel approach and perspective to the problem of evaluating and comparing abstaining classifiers by treating abstentions as missing data. Our evaluation approach is centered around defining the counterfactual score of an abstaining classifier, defined as the expected performance of the classifier had it not been allowed to abstain. We specify the conditions under which the counterfactual score is identifiable: if the abstentions are stochastic, and if the evaluation data is independent of the training data (ensuring that the predictions are missing at random), then the score is identifiable. Note that, if abstentions are deterministic, then the score is unidentifiable because the classifier can perform arbitrarily poorly on its abstentions. Leveraging tools from observational causal inference, we then develop nonparametric and doubly robust methods to efficiently estimate this quantity under identification. Our approach is examined in both simulated and real data experiments.
Yo Joong Choe, Aditya Gangrade, Aaditya Ramdas
NeurIPS1
2020 word2word: A Collection of Bilingual Lexicons for 3, 564 Language Pairs
abstract
We present word2word, a publicly available dataset and an open-source Python package for cross-lingual word translations extracted from sentence-level parallel corpora. Our dataset provides top-k word translations in 3,564 (directed) language pairs across 62 languages in OpenSubtitles2018 (Lison et al., 2018). To obtain this dataset, we use a count-based bilingual lexicon extraction model based on the observation that not only source and target words but also source words themselves can be highly correlated. We illustrate that the resulting bilingual lexicons have high coverage and attain competitive translation quality for several language pairs. We wrap our dataset and model in an easy-to-use Python library, which supports downloading and retrieving top-k word translations in any of the supported language pairs as well as computing top-k word translations for custom parallel corpora.
Yo Joong Choe, Kyubyong Park
LREC1
2020 Jejueo Datasets for Machine Translation and Speech Synthesis
abstract
Jejueo was classified as critically endangered by UNESCO in 2010. Although diverse efforts to revitalize it have been made, there have been few computational approaches. Motivated by this, we construct two new Jejueo datasets: Jejueo Interview Transcripts (JIT) and Jejueo Single Speaker Speech (JSS). The JIT dataset is a parallel corpus containing 170k+ Jejueo-Korean sentences, and the JSS dataset consists of 10k high-quality audio files recorded by a native Jejueo speaker and a transcript file. Subsequently, we build neural systems of machine translation and speech synthesis using them. All resources are publicly available via our GitHub repository. We hope that these datasets will attract interest of both language and machine learning communities.
Kyubyong Park, Yo Joong Choe, Jiyeon Ham
LREC2
2019 Discovery of Natural Language Concepts in Individual Units of CNNs
Seil Na, Yo Joong Choe, Gunhee Kim
ICLR (Poster)2
2018 Local White Matter Architecture Defines Functional Brain Dynamics
abstract
Large bundles of myelinated axons, called white matter, anatomically connect disparate brain regions together and compose the structural core of the human connectome. We recently proposed a method of measuring the local integrity along the length of each white matter fascicle, termed the local connectome [1]. If communication efficiency is fundamentally constrained by the integrity along the entire length of a white matter bundle [2], then variability in the functional dynamics of brain networks should be associated with variability in the local connectome. We test this prediction using two statistical approaches that are capable of handling the high dimensionality of data. First, by performing statistical inference on distance-based correlations, we show that similarity in the local connectome between individuals is significantly correlated with similarity in their patterns of functional connectivity. Second, by employing variable selection using sparse canonical correlation analysis and cross-validation, we show that segments of the local connectome are predictive of certain patterns of functional brain dynamics. These results are consistent with the hypothesis that structural variability along axon bundles constrains communication between disparate brain regions.
Sivaraman Balakrishnan, Yo Joong Choe, Aarti Singh, Jean M. Vettel, Timothy D. Verstynen
SMC2