--- title: "Azim Ospanov — author profile and papers — Elamur Research" description: "Azim Ospanov, Chinese University of Hong Kong: 3 papers on Elamur Research (2024–2025), h-index 2 — affiliations, topics, co-authors and…" canonical: "https://research.elamur.ai/free/en/authors/azim-ospanov/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/azim-ospanov/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Azim Ospanov # Azim Ospanov Azim Ospanov has 3 papers in our library, in 2024–2025, most of them on [Language models & pretraining](https://md.research.elamur.ai/free/en/topics/language-models/), [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Roozbeh Yousefzadeh](https://md.research.elamur.ai/free/en/authors/roozbeh-yousefzadeh/), [Farzan Farnia](https://md.research.elamur.ai/free/en/authors/farzan-farnia/). 3 papers in our library · 2024–2025 [OpenAlex](https://openalex.org/A5114188122) · [**h-index 2**](https://openalex.org/authors/A5114188122) · [15,760 works](https://openalex.org/works?filter=author.id:A5114188122) · [7 citations](https://openalex.org/works?filter=author.id:A5114188122&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 3 works in our library](https://md.research.elamur.ai/free/en/authors/azim-ospanov/#papers) · [🔗 Cited 26 times in our library](https://md.research.elamur.ai/free/en/authors/azim-ospanov/cited-by/) · [⭐ Paper Stars ranking: #10556](https://md.research.elamur.ai/free/en/paper-stars/page/106/#star-10556) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Azim+Ospanov) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Azim+Ospanov) · [dblp](https://dblp.org/search?q=Azim+Ospanov) · [ACL Anthology](https://aclanthology.org/search/?q=Azim+Ospanov) ## Affiliations [🎓**Chinese University of Hong Kong** Hong Kong · China 2024–2026 · 15,756 papers*current*](https://md.research.elamur.ai/free/en/universities/chinese-university-of-hong-kong/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 3 The field of science this work belongs to (OpenAlex fields).[Computer Science · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computational Theory and Mathematics · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/computational-theory-and-mathematics/) 🧭 Topics 2 Research subjects and languages the work is about.[Language models & pretraining · 1 work](https://md.research.elamur.ai/free/en/topics/language-models/) · [Reasoning · 1 work](https://md.research.elamur.ai/free/en/topics/reasoning/) ## Works by year ### 2020s [**2025** 2 papers](https://md.research.elamur.ai/free/en/authors/azim-ospanov/year/2025/) · [**2024** 1 paper](https://md.research.elamur.ai/free/en/authors/azim-ospanov/year/2024/) ## Papers The most cited first (OpenAlex and our library). 1. **[APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoning](https://md.research.elamur.ai/free/en/papers/ospanov-2025-apollo-automated-llm-lean-collaboration/)** *(2025 · 17 citations)* Automated theorem proving with LLMs usually relies on brute-force sampling: a model writes complete Lean proofs, sometimes thousands of times, and the verifier only reports pass or fail. 2. **[A Lean Dataset for International Math Olympiad: Small Steps towards Writing Math Proofs for Hard Problems](https://md.research.elamur.ai/free/en/papers/yousefzadeh-2024-lean-dataset-international-math-olympiad/)** *(2024 · 7 citations)* Formal theorem proving in Lean lacks high-quality reference material. Even miniF2F, the community's standard benchmark, has public formal proofs for only 6 of the 20 IMO problems in its test set. Without reference proofs, it is hard to tell where automated provers go wrong. The authors wrote original Lean 4 proofs… 3. **[miniF2F-Lean Revisited: Reviewing Limitations and Charting a Path Forward](https://md.research.elamur.ai/free/en/papers/ospanov-2025-minif2f-lean-revisited-reviewing-limitations/)** *(2025 · 4 citations)* This NeurIPS 2025 paper examines miniF2F, a widely used benchmark of 488 competition-style math problems with paired natural-language and Lean statements. ## Co-authors here 2 co-authors with a page, the most papers together first. - [Roozbeh Yousefzadeh](https://md.research.elamur.ai/free/en/authors/roozbeh-yousefzadeh/) ×3 - [Farzan Farnia](https://md.research.elamur.ai/free/en/authors/farzan-farnia/) ×2 ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Conference on Neural Information Processing Systems (NeurIPS)](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/) ×2: [NeurIPS 2025](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2025/) ×2 ## Cited by Papers of our library cite their works 26 times (of the 149,439 papers whose bibliographies we read); [6 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/azim-ospanov/cited-by/). Updated 3 November 2026