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

Jiaxin Ge

dblp:344/8809 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
7since 2021 · last 2025
0000-0001-9152-6267ORCID · corroborated

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

Artificial intelligence and machine learning · 7 · 4 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
7 papers
Vision and language · 47% Language models and text generation · 25% Trustworthy machine learning · 9%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 54% Programming languages and type systems · 46%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
visual reasoning
2.332025
Puzzled by Puzzles: When Vision-Language Models Can't Take a Hint · EMNLP 2025
Recursive Visual Programming · ECCV (43) 2024
From Wrong To Right: A Recursive Approach Towards Vision-Language Explanation · EMNLP 2023
Machine learning › Trustworthy machine learning
robustness
1.122025
Generate, but Verify: Reducing Hallucination in Vision-Language Models with Retrospective Resampling · NeurIPS 2025
Entailment as Robust Self-Learner · ACL (1) 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.912025
Enough Coin Flips Can Make LLMs Act Bayesian · ACL (1) 2025
Natural language and speech › Language models and text generation
hallucination mitigation
0.912025
Generate, but Verify: Reducing Hallucination in Vision-Language Models with Retrospective Resampling · NeurIPS 2025
Natural language and speech › Language models and text generation
in-context learning
0.912025
Enough Coin Flips Can Make LLMs Act Bayesian · ACL (1) 2025
Computer vision › Vision and language
multimodal hallucination
0.912025
Generate, but Verify: Reducing Hallucination in Vision-Language Models with Retrospective Resampling · NeurIPS 2025
Computer vision › Vision and language
vision-language model
0.912025
Generate, but Verify: Reducing Hallucination in Vision-Language Models with Retrospective Resampling · NeurIPS 2025
Visual content generation and editing › video authoring
slideshow creation
0.912025
AutoPresent: Designing Structured Visuals from Scratch · CVPR 2025
Compilers and program optimization
code generation
0.912025
AutoPresent: Designing Structured Visuals from Scratch · CVPR 2025
Programming languages and type systems › programming paradigms
visual programming
0.812024
Recursive Visual Programming · ECCV (43) 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic-based reasoning
entailment
0.712023
Entailment as Robust Self-Learner · ACL (1) 2023
Natural language and speech › Language models and text generation › natural language understanding › sentence pair modeling
natural language inference
0.712023
Entailment as Robust Self-Learner · ACL (1) 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
self-training
0.712023
Entailment as Robust Self-Learner · ACL (1) 2023
Computer vision › Vision and language › vision-language generation
visual explanation generation
0.712023
From Wrong To Right: A Recursive Approach Towards Vision-Language Explanation · EMNLP 2023
Natural language and speech › Language models and text generation
instruction following
0.312025
AutoPresent: Designing Structured Visuals from Scratch · CVPR 2025

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

large language model · 2.6iterative self-refinement · 2.6vision-language model · 1.5self-verification · 0.9retrospective resampling · 0.9hallucination-aware training · 0.9biased coin flip experiments · 0.9self-training · 0.7pseudo-labeling · 0.7prompting · 0.7
YearPublicationVenuePosition
2025 Enough Coin Flips Can Make LLMs Act Bayesian
abstract
Large language models (LLMs) exhibit the ability to generalize given few-shot examples in their input prompt, an emergent capability known as in-context learning (ICL). We investigate whether LLMs use ICL to perform structured reasoning in ways that are consistent with a Bayesian framework or rely on pattern matching. Using a controlled setting of biased coin flips, we find that: (1) LLMs often possess biased priors, causing initial divergence in zero-shot settings, (2) in-context evidence outweighs explicit bias instructions, (3) LLMs broadly follow Bayesian posterior updates, with deviations primarily due to miscalibrated priors rather than flawed updates, and (4) attention magnitude has negligible effect on Bayesian inference. With sufficient demonstrations of biased coin flips via ICL, LLMs update their priors in a Bayesian manner. Code and visualizations are available on the project page.
Ritwik Gupta, Rodolfo Corona, Jiaxin Ge, Daniel Klein 0001, Trevor Darrell, David M. Chan
ACL (1)3
2025 AutoPresent: Designing Structured Visuals from Scratch
abstract
Designing structured visuals such as presentation slides is essential for communicative needs, necessitating both content creation and visual planning skills. In this work, we tackle the challenge of automated slide generation, where models produce slide presentations from natural language (NL) instructions. We first introduce the SlidesBench benchmark, the first benchmark for slide generation with 7k training and 585 testing examples derived from 310 slide decks across 10 domains. SlidesBench supports evaluations that are (i) reference-based to measure similarity to a target slide, and (ii) reference-free to measure the design quality of generated slides alone. We benchmark end-to-end image generation and program generation methods with a variety of models, and find that programmatic methods produce higher-quality slides in user-interactable formats. Built on the success of program generation, we create AutoPresent, an 8B LlaMa-based model trained on 7k pairs of instructions paired with code for slide generation, and achieve results comparable to the closed-source model GPT-4O. We further explore iterative design refinement where the model is tasked to self-refine its own output, and we found that this process improves the slide’s quality. We hope that our work will provide a basis for future work on generating structured visuals. Our code, data, demo, and video demonstrations are publicly available at https: //github.com/para-lost/AutoPresent
Jiaxin Ge, Zhiruo Wang 0001, Yi-Hao Peng, Sanjay Subramanian, Qinyue Tan, Maarten Sap, Alane Suhr, Daniel Fried, Graham Neubig, Trevor Darrell
CVPR1
2025 Puzzled by Puzzles: When Vision-Language Models Can't Take a Hint
abstract
Rebus puzzles, visual riddles that encode language through imagery, spatial arrangement, and symbolic substitution, pose a unique challenge to current vision-language models (VLMs).Unlike traditional image captioning or question answering tasks, rebus solving requires multi-modal abstraction, symbolic reasoning, and a grasp of cultural, phonetic and linguistic puns.In this paper, we investigate the capacity of contemporary VLMs to interpret and solve rebus puzzles by constructing a hand-generated and annotated benchmark of diverse English-language rebus puzzles, ranging from simple pictographic substitutions to spatially-dependent cues ("head" over "heels").We analyze how different VLMs perform, and our findings reveal that while VLMs exhibit some surprising capabilities in decoding simple visual clues, they struggle significantly with tasks requiring abstract reasoning, lateral thinking, and understanding visual metaphors.
Heekyung Lee, Jiaxin Ge, Tsung-Han Wu, Trevor Darrell, David M. Chan
EMNLP2
2025 Generate, but Verify: Reducing Hallucination in Vision-Language Models with Retrospective Resampling
abstract
Vision-Language Models (VLMs) excel at visual understanding but often suffer from visual hallucinations, where they generate descriptions of nonexistent objects, actions, or concepts, posing significant risks in safety-critical applications. Existing hallucination mitigation methods typically follow one of two paradigms: generation adjustment, which modifies decoding behavior to align text with visual inputs, and post-hoc verification, where external models assess and correct outputs. While effective, generation adjustment methods often rely on heuristics and lack correction mechanisms, while post-hoc verification is complicated, typically requiring multiple models and tending to reject outputs rather than refine them. In this work, we introduce REVERSE, a unified framework that integrates hallucination-aware training with on-the-fly self-verification. By leveraging a new hallucination-verification dataset containing over 1.3M semi-synthetic samples, along with a novel inference-time retrospective resampling technique, our approach enables VLMs to both detect hallucinations during generation and dynamically revise those hallucinations. Our evaluations show that REVERSE achieves state-of-the-art hallucination reduction, outperforming the best existing methods by up to 12% on CHAIR-MSCOCO and 34% on HaloQuest.
Tsung-Han Wu, Heekyung Lee, Jiaxin Ge, Joseph Gonzalez 0001, Trevor Darrell, David M. Chan
NeurIPS3
2024 Recursive Visual Programming
Jiaxin Ge, Sanjay Subramanian, Baifeng Shi, Roei Herzig, Trevor Darrell
ECCV (43)1
2023 Entailment as Robust Self-Learner
abstract
Entailment has been recognized as an important metric for evaluating natural language understanding (NLU) models, and recent studies have found that entailment pretraining benefits weakly supervised fine-tuning.In this work, we design a prompting strategy that formulates a number of different NLU tasks as contextual entailment.This approach improves the zero-shot adaptation of pretrained entailment models.Secondly, we notice that self-training entailment-based models with unlabeled data can significantly improve the adaptation performance on downstream tasks.To achieve more stable improvement, we propose the Simple Pseudo-Label Editing (SimPLE) algorithm for better pseudo-labeling quality in self-training.We also found that both pretrained entailmentbased models and the self-trained models are robust against adversarial evaluation data.Experiments on binary and multi-class classification tasks show that SimPLE leads to more robust self-training results, indicating that the self-trained entailment models are more efficient and trustworthy than large language models on language understanding tasks.
Jiaxin Ge, Hongyin Luo, James R. Glass
ACL (1)1
2023 From Wrong To Right: A Recursive Approach Towards Vision-Language Explanation
abstract
Addressing the challenge of adapting pretrained vision-language models for generating insightful explanations for visual reasoning tasks with limited annotations, we present ReVisE: a Recursive Visual Explanation algorithm.Our method iteratively computes visual features (conditioned on the text input), an answer, and an explanation, to improve the explanation quality step by step until the answer converges.We find that this multi-step approach guides the model to correct its own answers and outperforms single-step explanation generation.Furthermore, explanations generated by ReVisE also serve as valuable annotations for few-shot self-training.Our approach outperforms previous methods while utilizing merely 5% of the human-annotated explanations across 10 metrics, demonstrating up to a 4.2 and 1.3 increase in BLEU-1 score on the VCR and VQA-X datasets, underscoring the efficacy and dataefficiency of our method.
Jiaxin Ge, Sanjay Subramanian, Trevor Darrell, Boyi Li 0001
EMNLP1