← Search

Janos Kramar

5 accepted papers

2024

Improving Sparse Decomposition of Language Model Activations with Gated Sparse Autoencoders

NeurIPS 2024poster

Recent work has found that sparse autoencoders (SAEs) are an effective technique for unsupervised discovery of interpretable features in language models' (LMs) activations, by finding sparse, linear reconstructions of those activations. We introduce the Gated Sparse Autoencoder (Gated SAE), which ac…

Cited by 6SourcePDFScholar
2024

On scalable oversight with weak LLMs judging strong LLMs

NeurIPS 2024poster

Scalable oversight protocols aim to enable humans to accurately supervise superhuman AI. In this paper we study debate, where two AI's compete to convince a judge; consultancy, where a single AI tries to convince a judge that asks questions; and compare to a baseline of direct question-answering,…

Cited by 31SourcePDFScholar
2023

Tracr: Compiled Transformers as a Laboratory for Interpretability

NeurIPS 2023spotlight

We show how to "compile" human-readable programs into standard decoder-only transformer models. Our compiler, Tracr, generates models with known structure. This structure can be used to design experiments. For example, we use it to study "superposition" in transformers that execute multi-step algori…

2021

A Neural Network Auction For Group Decision Making Over a Continuous Space

IJCAI 2021poster

We propose a system for conducting an auction over locations in a continuous space. It enables participants to express their preferences over possible choices of location in the space, selecting the location that maximizes the total utility of all agents. We prevent agents from tricking the system i…

Cited by 3SourcePDFScholar
2017

Zoneout: Regularizing RNNs by Randomly Preserving Hidden Activations

ICLR 2017poster

We propose zoneout, a novel method for regularizing RNNs. At each timestep, zoneout stochastically forces some hidden units to maintain their previous values. Like dropout, zoneout uses random noise to train a pseudo-ensemble, improving generalization. But by preserving instead of dropping hidden un…

Cited by 397SourcecodeScholar