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

Andrew Kirjner

dblp:351/1387 · 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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 90% Medical and health informatics · 10%
Artificial intelligence
1 paper
Vision and language · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › vision-language model › multimodal large language model
multimodal large language model evaluation
0.912025
ConnectomeBench: Can LLMs proofread the connectome? · NeurIPS 2025
Bioinformatics and computational biology › computational neuroscience
connectomics
0.912025
ConnectomeBench: Can LLMs proofread the connectome? · NeurIPS 2025
Bioinformatics and computational biology
protein engineering
0.812024
Improving protein optimization with smoothed fitness landscapes · ICLR 2024
Bioinformatics and computational biology › protein design
protein fitness optimization
0.812024
Improving protein optimization with smoothed fitness landscapes · ICLR 2024
Medical and health informatics › neuroimaging
neuroimaging analysis
0.312025
ConnectomeBench: Can LLMs proofread the connectome? · NeurIPS 2025

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

multimodal model · 1.7large language model · 1.7tikhonov regularization · 0.8graph signal processing · 0.8gibbs sampling · 0.8energy-based model · 0.8MCMC · 0.8
YearPublicationVenuePosition
2025 ConnectomeBench: Can LLMs proofread the connectome?
abstract
Connectomics—the mapping of neural connections in an organism's brain—currently requires extraordinary human effort to proofread the data collected from imaging and machine-learning assisted segmentation. With the growing excitement around using AI agents to automate important scientific tasks, we explore whether current AI systems can perform multiple tasks necessary for data proofreading. We introduce ConnectomeBench, a multimodal benchmark evaluating large language model (LLM) capabilities in three critical proofreading tasks: segment type identification, split error correction, and merge error detection. Using expert annotated data from two large open-source datasets—a cubic millimeter of mouse visual cortex and the complete Drosophila brain—we evaluate proprietary multimodal LLMs including Claude 3.7/4 Sonnet, o4-mini, GPT-4.1, GPT-4o, as well as open source models like InternVL-3 and NVLM. Our results demonstrate that current models achieve surprisingly high performance in segment identification (52-82\% balanced accuracy vs. 20-25\% chance) and binary/multiple choice split error correction (75-85\% accuracy vs. 50\% chance) while generally struggling on merge error identification tasks. Overall, while the best models still lag behind expert performance, they demonstrate promising capabilities that could eventually enable them to augment and potentially replace human proofreading in connectomics.
Jeff Brown, Andrew Kirjner, Annika Vivekananthan, Edward S. Boyden
NeurIPS2
2024 Improving protein optimization with smoothed fitness landscapes
abstract
The ability to engineer novel proteins with higher fitness for a desired property would be revolutionary for biotechnology and medicine. Modeling the combinatorially large space of sequences is infeasible; prior methods often constrain optimization to a small mutational radius, but this drastically limits the design space. Instead of heuristics, we propose smoothing the fitness landscape to facilitate protein optimization. First, we formulate protein fitness as a graph signal then use Tikunov regularization to smooth the fitness landscape. We find optimizing in this smoothed landscape leads to improved performance across multiple methods in the GFP and AAV benchmarks. Second, we achieve state-of-the-art results utilizing discrete energy-based models and MCMC in the smoothed landscape. Our method, called Gibbs sampling with Graph-based Smoothing (GGS), demonstrates a unique ability to achieve 2.5 fold fitness improvement (with in-silico evaluation) over its training set. GGS demonstrates potential to optimize proteins in the limited data regime. Code: https://github.com/kirjner/GGS
Andrew Kirjner, Jason Yim, Raman Samusevich, Shahar Bracha, Tommi S. Jaakkola, Regina Barzilay, Ila Fiete
ICLR1