Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonas Belouadi

dblp:314/6088 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
7since 2021 · last 2025
0009-0002-2990-9536ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 5 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Language models and text generation · 53% Generative modeling · 23% Vision and language · 16%
Computer graphics and multimedia
2 papers
Visual content generation and editing · 88% Geometric modeling and processing · 12%
Software engineering, system software, and programming languages
2 papers
Program synthesis and code generation · 60% Empirical software engineering · 40%

Topics — the 10 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › vision-language model
multimodal large language model
0.912025
ScImage: How good are multimodal large language models at scientific text-to-image generation? · ICLR 2025
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.912025
ScImage: How good are multimodal large language models at scientific text-to-image generation? · ICLR 2025
Machine learning › Generative modeling
diffusion model
0.812024
DeTikZify: Synthesizing Graphics Programs for Scientific Figures and Sketches with TikZ · NeurIPS 2024
Natural language and speech › Language models and text generation
multimodal language model
0.812024
DeTikZify: Synthesizing Graphics Programs for Scientific Figures and Sketches with TikZ · NeurIPS 2024
Natural language and speech › Language models and text generation › text generation
poetry generation
0.712023
ByGPT5: End-to-End Style-conditioned Poetry Generation with Token-free Language Models · ACL (1) 2023
Natural language and speech › Language models and text generation › controllable text generation
style-controlled generation
0.712023
ByGPT5: End-to-End Style-conditioned Poetry Generation with Token-free Language Models · ACL (1) 2023
Empirical software engineering
reproducibility
0.612022
Reproducibility Issues for BERT-based Evaluation Metrics · EMNLP 2022
Computer vision › Vision and language
multimodal understanding
0.312025
ScImage: How good are multimodal large language models at scientific text-to-image generation? · ICLR 2025
Natural language and speech › Language models and text generation
code generation
0.212024
DeTikZify: Synthesizing Graphics Programs for Scientific Figures and Sketches with TikZ · NeurIPS 2024
Geometric modeling and processing › shape representation › 2d shape representation
vector graphics representation
0.212024
AutomaTikZ: Text-Guided Synthesis of Scientific Vector Graphics with TikZ · ICLR 2024

Methods — techniques the papers use, named apart from their topics

zero-shot learning · 1.7multimodal CLIP embedding · 1.5large language model fine-tuning · 1.5raster image generation · 0.9multimodal large language model · 0.9code-based image generation · 0.9multimodal language model · 0.8monte carlo tree search · 0.8token-free modeling · 0.7pre-training · 0.7fine-tuning · 0.7BERT · 0.6
YearPublicationVenuePosition
2025 Tikzero: Zero-Shot Text-Guided Graphics Program Synthesis
Jonas Belouadi, Eddy Ilg, Margret Keuper, Hideki Tanaka, Masao Utiyama, Raj Dabre, Steffen Eger, Simone Paolo Ponzetto
ICCV1
2025 ScImage: How good are multimodal large language models at scientific text-to-image generation?
abstract
Multimodal large language models (LLMs) have demonstrated impressive capabilities in generating high-quality images from textual instructions. However, their performance in generating scientific images—a critical application for accelerating scientific progress—remains underexplored. In this work, we address this gap by introducing ScImage, a benchmark designed to evaluate the multimodal capabilities of LLMs in generating scientific images from textual descriptions. ScImage assesses three key dimensions of understanding: spatial, numeric, and attribute comprehension, as well as their combinations, focusing on the relationships between scientific objects (e.g., squares, circles). We evaluate seven models, GPT-4o, Llama, AutomaTikZ, Dall-E, StableDiffusion, GPT-o1 and Qwen2.5-Coder-Instruct using two modes of output generation: code-based outputs (Python, TikZ) and direct raster image generation. Additionally, we examine four different input languages: English, German, Farsi, and Chinese. Our evaluation, conducted with 11 scientists across three criteria (correctness, relevance, and scientific accuracy), reveals that while GPT4-o produces outputs of decent quality for simpler prompts involving individual dimensions such as spatial, numeric, or attribute understanding in isolation, all models face challenges in this task, especially for more complex prompts. ScImage is available: huggingface.co/datasets/casszhao/ScImage
Leixin Zhang 0001, Steffen Eger, Yinjie Cheng, Weihe Zhai, Jonas Belouadi, Fahimeh Moafian, Zhixue Zhao
ICLR5
2024 AutomaTikZ: Text-Guided Synthesis of Scientific Vector Graphics with TikZ
abstract
Generating bitmap graphics from text has gained considerable attention, yet for scientific figures, vector graphics are often preferred. Given that vector graphics are typically encoded using low-level graphics primitives, generating them directly is difficult. To address this, we propose the use of TikZ, a well-known abstract graphics language that can be compiled to vector graphics, as an intermediate representation of scientific figures. TikZ offers human-oriented, high-level commands, thereby facilitating conditional language modeling with any large language model. To this end, we introduce DaTikZ the first large-scale TikZ dataset, consisting of 120k TikZ drawings aligned with captions. We fine-tune LLaMA on DaTikZ, as well as our new model CLiMA, which augments LLaMA with multimodal CLIP embeddings. In both human and automatic evaluation, CLiMA and LLaMA outperform commercial GPT-4 and Claude 2 in terms of similarity to human-created figures, with CLiMA additionally improving text-image alignment. Our detailed analysis shows that all models generalize well and are not susceptible to memorization. GPT-4 and Claude 2, however, tend to generate more simplistic figures compared to both humans and our models. We make our framework, AutomaTikZ, along with model weights and datasets, publicly available.
Jonas Belouadi, Anne Lauscher, Steffen Eger
ICLR1
2024 DeTikZify: Synthesizing Graphics Programs for Scientific Figures and Sketches with TikZ
abstract
Creating high-quality scientific figures can be time-consuming and challenging, even though sketching ideas on paper is relatively easy. Furthermore, recreating existing figures that are not stored in formats preserving semantic information is equally complex. To tackle this problem, we introduce DeTikZify, a novel multimodal language model that automatically synthesizes scientific figures as semantics-preserving TikZ graphics programs based on sketches and existing figures. To achieve this, we create three new datasets: DaTikZv2, the largest TikZ dataset to date, containing over 360k human-created TikZ graphics; SketchFig, a dataset that pairs hand-drawn sketches with their corresponding scientific figures; and MetaFig, a collection of diverse scientific figures and associated metadata. We train DeTikZify on MetaFig and DaTikZv2, along with synthetically generated sketches learned from SketchFig. We also introduce an MCTS-based inference algorithm that enables DeTikZify to iteratively refine its outputs without the need for additional training. Through both automatic and human evaluation, we demonstrate that DeTikZify outperforms commercial Claude 3 and GPT-4V in synthesizing TikZ programs, with the MCTS algorithm effectively boosting its performance. We make our code, models, and datasets publicly available.
Jonas Belouadi, Simone Paolo Ponzetto, Steffen Eger
NeurIPS1
2023 ByGPT5: End-to-End Style-conditioned Poetry Generation with Token-free Language Models
abstract
State-of-the-art poetry generation systems are often complex.They either consist of taskspecific model pipelines, incorporate prior knowledge in the form of manually created constraints, or both.In contrast, end-to-end models would not suffer from the overhead of having to model prior knowledge and could learn the nuances of poetry from data alone, reducing the degree of human supervision required.In this work, we investigate end-to-end poetry generation conditioned on styles such as rhyme, meter, and alliteration.We identify and address lack of training data and mismatching tokenization algorithms as possible limitations of past attempts.In particular, we successfully pre-train ByGPT5, a new token-free decoder-only language model, and fine-tune it on a large custom corpus of English and German quatrains annotated with our styles.We show that ByGPT5 outperforms other models such as mT5, ByT5, GPT-2 and ChatGPT, while also being more parameter efficient and performing favorably compared to humans.In addition, we analyze its runtime performance and demonstrate that it is not prone to memorization.We make our code, models, and datasets publicly available.1
Jonas Belouadi, Steffen Eger
ACL (1)1
2023 UScore: An Effective Approach to Fully Unsupervised Evaluation Metrics for Machine Translation
abstract
The vast majority of evaluation metrics for machine translation are supervised, i.e., (i) are trained on human scores, (ii) assume the existence of reference translations, or (iii) leverage parallel data.This hinders their applicability to cases where such supervision signals are not available.In this work, we develop fully unsupervised evaluation metrics.To do so, we leverage similarities and synergies between evaluation metric induction, parallel corpus mining, and MT systems.In particular, we use an unsupervised evaluation metric to mine pseudo-parallel data, which we use to remap deficient underlying vector spaces (iteratively) and to induce an unsupervised MT system, which then provides pseudo-references as an additional component in the metric.Finally, we also induce unsupervised multilingual sentence embeddings from pseudo-parallel data.We show that our fully unsupervised metrics are effective, i.e., they beat supervised competitors on four out of five evaluation datasets.We make our code publicly available.1
Jonas Belouadi, Steffen Eger
EACL1
2022 Reproducibility Issues for BERT-based Evaluation Metrics
abstract
Reproducibility is of utmost concern in machine learning and natural language processing (NLP).In the field of natural language generation (especially machine translation), the seminal paper of Post (2018) has pointed out problems of reproducibility of the dominant metric, BLEU, at the time of publication.Nowadays, BERT-based evaluation metrics considerably outperform BLEU.In this paper, we ask whether results and claims from four recent BERT-based metrics can be reproduced.We find that reproduction of claims and results often fails because of (i) heavy undocumented preprocessing involved in the metrics, (ii) missing code and (iii) reporting weaker results for the baseline metrics.(iv) In one case, the problem stems from correlating not to human scores but to a wrong column in the csv file, inflating scores by 5 points.Motivated by the impact of preprocessing, we then conduct a second study where we examine its effects more closely (for one of the metrics).We find that preprocessing can have large effects, especially for highly inflectional languages.In this case, the effect of preprocessing may be larger than the effect of the aggregation mechanism (e.g., greedy alignment vs. Word Mover Distance).
Yanran Chen, Jonas Belouadi, Steffen Eger
EMNLP2