Search Results - "Garrabrant, Scott"

A Formal Approach to the Problem of Logical Non-Omniscience by Garrabrant, Scott, Benson-Tilsen, Tsvi, Critch, Andrew, Soares, Nate, Taylor, Jessica

“…We present the logical induction criterion for computable algorithms that assign probabilities to every logical statement in a given formal language, and…”
Get full text

Temporal Inference with Finite Factored Sets by Garrabrant, Scott

“…We propose a new approach to temporal inference, inspired by the Pearlian causal inference paradigm - though quite different from Pearl's approach formally…”
Get full text

Embedded Agency by Demski, Abram, Garrabrant, Scott

“…Traditional models of rational action treat the agent as though it is cleanly separated from its environment, and can act on that environment from the outside…”
Get full text

P-recursive integer sequences and automata theory by Garrabrant, Scott Michael

“…An integer sequence {an} is called polynomially recursive, or P-recursive, if it satisfies a nontrivial linear recurrence relation of the form q 0(n)an + q…”
Get full text

Categorizing Variants of Goodhart's Law by Manheim, David, Garrabrant, Scott

“…There are several distinct failure modes for overoptimization of systems on the basis of metrics. This occurs when a metric which can be used to improve a…”
Get full text

Cartesian Frames by Garrabrant, Scott, Herrmann, Daniel A, Lopez-Wild, Josiah

“…We introduce a novel framework, the theory of Cartesian frames (CF), that gives powerful tools for manipulating sets of acts. The CF framework takes as its…”
Get full text

Pattern avoidance is not P-recursive by Garrabrant, Scott, Pak, Igor

“…Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The…”
Get full text

Words in Linear Groups, Random Walks, Automata and P-Recursiveness by Garrabrant, Scott, Pak, Igor

“…Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the…”
Get full text

Counting With Irrational Tiles by Garrabrant, Scott, Pak, Igor

“…We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides…”
Get full text

Asymptotic Convergence in Online Learning with Unbounded Delays by Garrabrant, Scott, Soares, Nate, Taylor, Jessica

“…We study the problem of predicting the results of computations that are too expensive to run, via the observation of the results of smaller computations. We…”
Get full text

Risks from Learned Optimization in Advanced Machine Learning Systems by Hubinger, Evan, van Merwijk, Chris, Mikulik, Vladimir, Skalse, Joar, Garrabrant, Scott

“…We analyze the type of learned optimization that occurs when a learned model (such as a neural network) is itself an optimizer - a situation we refer to as…”
Get full text

Inductive Coherence by Garrabrant, Scott, Fallenstein, Benya, Demski, Abram, Soares, Nate

“…While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of…”
Get full text

A Formal Approach to the Problem of Logical Non-Omniscience by Garrabrant, Scott, Benson-Tilsen, Tsvi, Critch, Andrew, Soares, Nate, Taylor, Jessica

“…EPTCS 251, 2017, pp. 221-235 We present the logical induction criterion for computable algorithms that assign probabilities to every logical statement in a…”
Get full text

Logical Induction by Garrabrant, Scott, Benson-Tilsen, Tsvi, Critch, Andrew, Soares, Nate, Taylor, Jessica

“…We present a computable algorithm that assigns probabilities to every logical statement in a given formal language, and refines those probabilities over time…”
Get full text

Asymptotic Logical Uncertainty and The Benford Test by Garrabrant, Scott, Bhaskar, Siddharth, Demski, Abram, Garrabrant, Joanna, Koleszarik, George, Lloyd, Evan

“…We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear…”
Get full text

Cofinite Induced Subgraphs of Impartial Combinatorial Games: An Analysis of CIS-Nim by Garrabrant, Scott M, Friedman, Eric J, Landsberg, Adam Scott

“…Given an impartial combinatorial game G, we create a class of related games (CIS-G) by specifying a finite set of positions in G and forbidding players from…”
Get full text

Using TPA to count linear extensions by Banks, Jacqueline, Garrabrant, Scott, Huber, Mark L, Perizzolo, Anne

“…A linear extension of a poset $P$ is a permutation of the elements of the set that respects the partial order. Let $L(P)$ denote the number of linear…”
Get full text

Upper bounds in the Ohtsuki-Riley-Sakuma partial order on 2-bridge knots by Garrabrant, Scott M, Hoste, Jim, Shanahan, Patrick D

“…In this paper we use continued fractions to study a partial order on the set of 2-bridge knots derived from the work of Ohtsuki, Riley, and Sakuma. We…”
Get full text