Preprint
Large Language Models
Featured

Inline Hardware KV-Cache Compression for Long-Context Transformer Inference: An Architectural Case for a Memory-Path Compression Engine

Jakubův, Jan(Czech Technical University in Prague), Chvalovský, Karel(Czech Technical University in Prague), Goertzel, Zarathustra(Czech Technical University in Prague), Kaliszyk, Cezary(Universität Innsbruck), Olšák, Mirek(Institut des Hautes Études Scientifiques), Piotrowski, Bartosz(Czech Technical University in Prague), Schulz, Stephan(Baden-Wuerttemberg Cooperative State University), Suda, Martin(Czech Technical University in Prague), Urban, Josef(Czech Technical University in Prague)
January 1, 2023DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)77,038 citations

77k

Citations

0

Influential Citations

DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

Venue

2023

Year

Abstract

As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60% of the Mizar theorems in the hammer setting. We also automatically prove 75% of the Mizar theorems when the automated provers are helped by using only the premises used in the human-written Mizar proofs. We describe the methods and large-scale experiments leading to these results. This includes in particular the E and Vampire provers, their ENIGMA and Deepire learning modifications, a number of learning-based premise selection methods, and the incremental loop that interleaves growing a corpus of millions of ATP proofs with training increasingly strong AI/TP systems on them. We also present a selection of Mizar problems that were proved automatically.

Analysis

Why This Paper Matters

This paper marks a milestone in automated theorem proving (ATP) by achieving unprecedented proof rates on the Mizar mathematical library. The Mizar system, celebrating its 50th anniversary, contains a large corpus of formalized mathematics. The ability to automatically prove 60% of theorems in a hammer setting (where the system selects premises automatically) and 75% with human-provided premise hints demonstrates that modern AI/TP systems can now handle a substantial portion of formal mathematics. This is a significant step toward fully automated mathematical reasoning, which has long been a grand challenge in AI.

The work is particularly important because it combines multiple state-of-the-art ATP systems (E and Vampire) with machine learning enhancements (ENIGMA and Deepire) and sophisticated premise selection. The incremental learning loop, where the system alternates between proving theorems and retraining on the growing proof corpus, is a key innovation that allows the system to continuously improve. This approach is reminiscent of self-play in game-playing AI and could become a standard paradigm for ATP.

Technical Contributions

  • Integration of E and Vampire with ML: The paper uses the E prover with ENIGMA (a machine learning-guided clause selection system) and Vampire with Deepire (a deep learning-based clause selection). This combination leverages the strengths of both provers.
  • Learning-based premise selection: Multiple methods are developed to select relevant premises from the Mizar library, reducing the search space for the provers.
  • Incremental training loop: The system iteratively proves theorems, adds them to the training corpus, and retrains the machine learning models, creating a virtuous cycle of improvement.
  • Large-scale experiments: The authors conduct extensive experiments on the Mizar library, demonstrating the scalability of their approach.

Results

The system achieves a proof rate of approximately 60% for Mizar theorems in the hammer setting (automatic premise selection) and 75% when using premises from human-written proofs. These results are a substantial improvement over previous automated systems for Mizar. The paper also provides a selection of automatically proved problems, showcasing the system's capabilities.

Significance

This work has broad implications for the field of AI and formal mathematics. It shows that machine learning can dramatically improve ATP performance on large, real-world mathematical libraries. The incremental learning methodology could be applied to other ATP systems and libraries, potentially leading to fully automated proof assistants. The results also suggest that AI/TP systems are approaching a level where they can assist mathematicians in proving new theorems, not just verifying existing ones. The paper is a fitting tribute to Mizar's 50th anniversary and a strong indicator of the future of automated reasoning.