Search Results for author: Charles Staats

Found 4 papers, 2 papers with code

Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalization

1 code implementation26 Mar 2024 Jin Peng Zhou, Charles Staats, Wenda Li, Christian Szegedy, Kilian Q. Weinberger, Yuhuai Wu

Large language models (LLM), such as Google's Minerva and OpenAI's GPT families, are becoming increasingly capable of solving mathematical quantitative reasoning problems.

Automated Theorem Proving GSM8K +1

Autoformalization with Large Language Models

no code implementations25 May 2022 Yuhuai Wu, Albert Q. Jiang, Wenda Li, Markus N. Rabe, Charles Staats, Mateja Jamnik, Christian Szegedy

Autoformalization is the process of automatically translating from natural language mathematics to formal specifications and proofs.

 Ranked #1 on Automated Theorem Proving on miniF2F-test (using extra training data)

Automated Theorem Proving Program Synthesis

When adversarial examples are excusable

no code implementations25 Apr 2022 Pieter-Jan Kindermans, Charles Staats

Qualitatively, the remaining adversarial errors are similar to test errors on difficult examples.

Self-attention Does Not Need $O(n^2)$ Memory

10 code implementations10 Dec 2021 Markus N. Rabe, Charles Staats

We present a very simple algorithm for attention that requires $O(1)$ memory with respect to sequence length and an extension to self-attention that requires $O(\log n)$ memory.

Cannot find the paper you are looking for? You can Submit a new open access paper.