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

Shreyas Kapur

dblp:216/0137 · DBLP profile ↗
← Back
3ranked-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 2021Human-computer interaction and ubiquitous 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
2 papers
Trustworthy machine learning · 39% Generative modeling · 22% Deep learning architectures and training · 19%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
Diffusion On Syntax Trees For Program Synthesis · ICLR 2025
Program synthesis and code generation
neural program synthesis
0.912025
Diffusion On Syntax Trees For Program Synthesis · ICLR 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing
0.812024
Evidence of Learned Look-Ahead in a Chess-Playing Neural Network · NeurIPS 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Evidence of Learned Look-Ahead in a Chess-Playing Neural Network · NeurIPS 2024
Machine learning › Trustworthy machine learning › interpretability
mechanistic interpretability
0.812024
Evidence of Learned Look-Ahead in a Chess-Playing Neural Network · NeurIPS 2024
Machine learning › Deep learning architectures and training
transformer
0.812024
Evidence of Learned Look-Ahead in a Chess-Playing Neural Network · NeurIPS 2024

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

syntax tree editing · 1.7search · 1.7diffusion model · 1.7linear probe · 0.8attention head analysis · 0.8
YearPublicationVenuePosition
2025 Diffusion On Syntax Trees For Program Synthesis
abstract
Large language models generate code one token at a time. Their autoregressive generation process lacks the feedback of observing the program's output. Training LLMs to suggest edits directly can be challenging due to the scarcity of rich edit data. To address these problems, we propose neural diffusion models that operate on syntax trees of any context-free grammar. Similar to image diffusion models, our method also inverts "noise" applied to syntax trees. Rather than generating code sequentially, we iteratively edit it while preserving syntactic validity, which makes it easy to combine this neural model with search. We apply our approach to inverse graphics tasks, where our model learns to convert images into programs that produce those images. Combined with search, our model is able to write graphics programs, see the execution result, and debug them to meet the required specifications. We additionally show how our system can write graphics programs for hand-drawn sketches. Video results can be found at https://tree-diffusion.github.io.
Shreyas Kapur, Erik Jenner, Stuart Russell 0001
ICLR1
2024 Evidence of Learned Look-Ahead in a Chess-Playing Neural Network
abstract
Do neural networks learn to implement algorithms such as look-ahead or search "in the wild"? Or do they rely purely on collections of simple heuristics? We present evidence of *learned look-ahead* in the policy and value network of Leela Chess Zero, the currently strongest deep neural chess engine. We find that Leela internally represents future optimal moves and that these representations are crucial for its final output in certain board states. Concretely, we exploit the fact that Leela is a transformer that treats every chessboard square like a token in language models, and give three lines of evidence: (1) activations on certain squares of future moves are unusually important causally; (2) we find attention heads that move important information "forward and backward in time," e.g., from squares of future moves to squares of earlier ones; and (3) we train a simple probe that can predict the optimal move 2 turns ahead with 92% accuracy (in board states where Leela finds a single best line). These findings are clear evidence of learned look-ahead in neural networks and might be a step towards a better understanding of their capabilities.
Erik Jenner, Shreyas Kapur, Vasil Georgiev, Cameron Allen, Scott Emmons, Stuart Russell 0001
NeurIPS2
2018 AlterEgo: A Personalized Wearable Silent Speech Interface
abstract
We present a wearable interface that allows a user to silently converse with a computing device without any voice or any discernible movements - thereby enabling the user to communicate with devices, AI assistants, applications or other people in a silent, concealed and seamless manner. A user's intention to speak and internal speech is characterized by neuromuscular signals in internal speech articulators that are captured by the AlterEgo system to reconstruct this speech. We use this to facilitate a natural language user interface, where users can silently communicate in natural language and receive aural output (e.g - bone conduction headphones), thereby enabling a discreet, bi-directional interface with a computing device, and providing a seamless form of intelligence augmentation. The paper describes the architecture, design, implementation and operation of the entire system. We demonstrate robustness of the system through user studies and report 92% median word accuracy levels.
Arnav Kapur, Shreyas Kapur, Pattie Maes
IUI2