activity
20232026
most citedCommunication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates

1 citations · 1 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2026

Learning to Discover Interesting Mathematics

Niket Patel, Ahmad Rammal, Amaury Hayat +2

Recently, Large Language Models (LLMs) have been increasingly able to solve advanced mathematical problems, including many that have been open for decades. This opens the door to e…

cs.AI2026

Distilling LLM Feedback for Lean Theorem Proving

Gaetan Narozniak, Gérard Biau, Rémi Munos +2

Post-training for reasoning models typically combines supervised fine-tuning with reinforcement learning from verifiable rewards, most commonly with GRPO. However, this algorithm s…

cs.AI2026

Formalizing Mathematics at Scale

Ahmad Rammal, Niket Patel, Fabian Gloeckle +5

We present AutoformBot, a multi-agent system for building an Autoformalized Textbook Library At Scale (Atlas) in Lean 4. AutoformBot orchestrates thousands of LLM agents, equipped…

cs.AI2026

Automatic Textbook Formalization

Fabian Gloeckle, Ahmad Rammal, Charles Arnal +4

We present a case study where an automatic AI system formalizes a textbook with more than 500 pages of graduate-level algebraic combinatorics to Lean. The resulting formalization r…

cs.CL2024

Learning Mathematical Rules with Large Language Models

Antoine Gorceix, Bastien Le Chenadec, Ahmad Rammal +2

In this paper, we study the ability of large language models to learn specific mathematical rules such as distributivity or simplifying equations. We present an empirical analysis…

cs.LG2024

Correlated Quantization for Faster Nonconvex Distributed Optimization

Andrei Panferov, Yury Demidovich, Ahmad Rammal +1

Quantization (Alistarh et al., 2017) is an important (stochastic) compression technique that reduces the volume of transmitted bits during each communication round in distributed m…

math.OC2023★ 1 cited

Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates

Ahmad Rammal, Kaja Gruntkowska, Nikita Fedin +2

Byzantine robustness is an essential feature of algorithms for certain distributed optimization problems, typically encountered in collaborative/federated learning. These problems…