Polynomial Precision Dependence Solutions to Alignment Research Center Matrix Completion Problems

Rico Angell
1/8/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

We present solutions to the matrix completion problems proposed by the Alignment Research Center that have a polynomial dependence on the precision $\varepsilon$. The motivation for these problems is to enable efficient computation of heuristic estimators to formally evaluate and reason about different quantities of deep neural networks in the interest of AI alignment. Our solutions involve reframing the matrix completion problems as a semidefinite program (SDP) and using recent advances in spectral bundle methods for fast, efficient, and scalable SDP solving.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{angell2024polynomial,
  title  = {Polynomial Precision Dependence Solutions to Alignment Research Center Matrix Completion Problems},
  author = {Rico Angell},
  year   = {2024},
  eprint = {2401.03999},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.03999v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.03999.svg)](https://codeofpaper.com/paper/2401.03999)

Discussion