Papers by Mehran Kazemi
TwiRGCN: Temporally Weighted Graph Convolution for Question Answering over Temporal Knowledge Graphs (2023.eacl-main)
Copied to clipboard
| Challenge: | Recent years have witnessed interest in Temporal Question Answering over Knowledge Graphs (TKGQA) but these methods are highly engineered and do not automatically discover relevant parts of the KG during multi-hop reasoning. |
| Approach: | They propose a scheme to modulate the messages passed through a KG edge during convolution based on the relevance of its associated period to the question. |
| Outcome: | The proposed system outperforms state-of-the-art models on a recent challenging dataset for multi-hop complex temporal QA called TimeQuestions. |
BIG-Bench Extra Hard (2025.acl-long)
Copied to clipboard
Mehran Kazemi, Bahare Fatemi, Hritik Bansal, John Palowitch, Chrysovalantis Anastasiou, Sanket Vaibhav Mehta, Lalit K Jain, Virginia Aglietti, Disha Jindal, Peter Chen, Nishanth Dikkala, Gladys Tyen, Xin Liu, Uri Shalit, Silvia Chiappa, Kate Olszewska, Yi Tay, Vinh Q. Tran, Quoc V Le, Orhan Firat
| Challenge: | Current benchmarks for large language model reasoning focus on math and coding abilities, leaving a gap in evaluating broader reasoning proficiencies. |
| Approach: | They propose a benchmark to evaluate general reasoning in large language models . they use BIG-Bench and its harder version BIG-Benefit Hard to assess general reasoning . |
| Outcome: | The new benchmark pushes the boundaries of LLM reasoning evaluation. |
LAMBADA: Backward Chaining for Automated Reasoning in Natural Language (2023.acl-long)
Copied to clipboard
| Challenge: | Recent advances in automated reasoning with natural text suffer from a combinatorial explosion of the search space and high failure rates for problems requiring longer chains of reasoning. |
| Approach: | They propose a Backward Chaining algorithm that decomposes reasoning into four sub-modules and implements it by few-shot prompted LLM inference. |
| Outcome: | The proposed algorithm achieves sizable accuracy boosts over state-of-the-art forward reasoning methods on two challenging logical reasoning datasets. |
Using Domain Knowledge to Guide Dialog Structure Induction via Neural Probabilistic Soft Logic (2023.acl-long)
Copied to clipboard
Connor Pryor, Quan Yuan, Jeremiah Liu, Mehran Kazemi, Deepak Ramachandran, Tania Bedrax-Weiss, Lise Getoor
| Challenge: | Existing DSI approaches infer latent dialog structure without access to domain knowledge. |
| Approach: | They propose a neural-symbolic approach that injects symbolic knowledge into latent space of a generative neural model. |
| Outcome: | The proposed approach boosts performance over the canonical baselines over three dialog structure induction datasets. |
GeoCoder: Solving Geometry Problems by Generating Modular Code through Vision-Language Models (2025.findings-naacl)
Copied to clipboard
| Challenge: | Various vision-language models (VLMs) have made significant progress in multimodal tasks, but they still struggle with geometry problems. |
| Approach: | They propose a vision-language model that leverages modular code-finetuning to generate and execute code using a predefined geometry function library. |
| Outcome: | The proposed model improves geometric reasoning abilities by 16% on a GeomVerse dataset compared to other methods. |
FaMTEB: Massive Text Embedding Benchmark in Persian Language (2025.findings-emnlp)
Copied to clipboard
Erfan Zinvandi, Morteza Alikhani, Mehran Sarmadi, Zahra Pourbahman, Sepehr Arvin, Reza Kazemi, Arash Amini
| Challenge: | a comprehensive benchmark for Persian text embeddings is built upon the Massive Text Embedding Benchmark (MTEB) 63 datasets are included in the benchmark, including a novel task of summary retrieval. |
| Approach: | They propose a benchmark for Persian (Farsi) text embeddings built upon the Massive Text Embedding Benchmark. |
| Outcome: | The proposed framework includes 63 datasets spanning seven different tasks . the evaluation datasets were rigorously evaluated by humans and automated systems . |