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

Jiaming Li 0004

dblp:33/5934-4 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
4 papers
Vision and language · 34% Language models and text generation · 32% Speech recognition and synthesis · 16%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
code language models
0.912025
Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs · AAAI 2025
Computer vision › Vision and language
cross-modal alignment
0.912025
OpenOmni: Advancing Open-Source Omnimodal Large Language Models with Progressive Multimodal Alignment and Real-time Emotional Speech Synthesis · NeurIPS 2025
Natural language and speech › Speech recognition and synthesis › speech synthesis
emotional speech synthesis
0.912025
OpenOmni: Advancing Open-Source Omnimodal Large Language Models with Progressive Multimodal Alignment and Real-time Emotional Speech Synthesis · NeurIPS 2025
Natural language and speech › Language models and text generation › multimodal language model
omni-modal large language model
0.912025
OpenOmni: Advancing Open-Source Omnimodal Large Language Models with Progressive Multimodal Alignment and Real-time Emotional Speech Synthesis · NeurIPS 2025
Program synthesis and code generation
code completion
0.912025
Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs · AAAI 2025
Program synthesis and code generation › code completion
repository-level code completion
0.912025
Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs · AAAI 2025
Computer vision › Vision and language › vision-language model
multimodal large language model
0.812024
II-Bench: An Image Implication Understanding Benchmark for Multimodal Large Language Models · NeurIPS 2024
Natural language and speech › Information extraction and text analysis
coreference resolution
0.612022
Enhancing Structure Preservation in Coreference Resolution by Constrained Graph Encoding · IEEE ACM Trans. Audio Speech Lang. Process. 2022
Computer vision › Vision and language
vision-language pretraining
0.312025
OpenOmni: Advancing Open-Source Omnimodal Large Language Models with Progressive Multimodal Alignment and Real-time Emotional Speech Synthesis · NeurIPS 2025
Machine learning › Trustworthy machine learning
interpretability
0.212024
II-Bench: An Image Implication Understanding Benchmark for Multimodal Large Language Models · NeurIPS 2024
Machine learning › Graph learning
graph representation learning
0.212022
Enhancing Structure Preservation in Coreference Resolution by Constrained Graph Encoding · IEEE ACM Trans. Audio Speech Lang. Process. 2022

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

prompt construction · 1.7context pruning · 1.7progressive multimodal alignment · 0.9direct preference optimization · 0.9benchmark evaluation · 0.8graph neural network · 0.6graph encoding · 0.6adaptive constraint · 0.6
YearPublicationVenuePosition
2025 Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs
abstract
Some of the latest released Code Large Language Models (Code LLMs) have been trained on repository-level code data, enabling them to perceive repository structures and utilize cross-file code information. This capability allows us to directly concatenate the content of repository code files in prompts to achieve repository-level code completion. However, in real development scenarios, directly concatenating all code repository files in a prompt can easily exceed the context window of Code LLMs, leading to a significant decline in completion performance. Additionally, overly long prompts can increase completion latency, negatively impacting the user experience. In this study, we conducted extensive experiments, including completion error analysis, topology dependency analysis, and cross-file content analysis, to investigate the factors affecting repository-level code completion. Based on the conclusions drawn from these preliminary experiments, we proposed a strategy called **Hierarchical Context Pruning (HCP)** to construct high-quality completion prompts. We applied the **HCP** to six Code LLMs and evaluated them on the CrossCodeEval dataset. The experimental results showed that, compared to previous methods, the prompts constructed using our **HCP** strategy achieved higher completion accuracy on five out of six Code LLMs. Additionally, the **HCP** managed to keep the prompt length around 8k tokens (whereas the full repository code is approximately 50k tokens), significantly improving completion throughput. Our code and data will be publicly available.
Lei Zhang 0201, Yunshui Li, Jiaming Li 0004, Xiaobo Xia, Jiaxi Yang 0004, Run Luo, Minzheng Wang 0001, Longze Chen, Junhao Liu 0001, Qiang Qu 0001, Min Yang 0007
AAAI3
2025 OpenOmni: Advancing Open-Source Omnimodal Large Language Models with Progressive Multimodal Alignment and Real-time Emotional Speech Synthesis
abstract
Recent advancements in omnimodal learning have significantly improved understanding and generation across images, text, and speech, yet these developments remain predominantly confined to proprietary models. The lack of high-quality omnimodal datasets and the challenges of real-time emotional speech synthesis have notably hindered progress in open-source research. To address these limitations, we introduce OpenOmni, a two-stage training framework that integrates omnimodal alignment and speech generation to develop a state-of-the-art omnimodal large language model. In the alignment phase, a pretrained speech model undergoes further training on image-text tasks, enabling (near) zero-shot generalization from vision to speech, outperforming models trained on tri-modal datasets. In the speech generation phase, a lightweight decoder is trained on speech tasks with direct preference optimization, which enables real-time emotional speech synthesis with high fidelity. Extensive experiments demonstrate that OpenOmni surpasses state-of-the-art models across omnimodal, vision-language, and speech-language benchmarks. It achieves a 4-point absolute improvement on OmniBench over the leading open-source model VITA, despite using 5$\times$ fewer training examples and a smaller model size (7B vs. 7$\times$8B). Besides, OpenOmni achieves real-time speech generation with less than 1 second latency at non-autoregressive mode, reducing inference time by 5$\times$ compared to autoregressive methods, and improves emotion classification accuracy by 7.7\%. The codebase is available at https://github.com/RainBowLuoCS/OpenOmni.
Run Luo, Ting-En Lin, Haonan Zhang 0003, Yuchuan Wu, Yongbin Li 0001, Longze Chen, Jiaming Li 0004, Lei Zhang 0201, Xiaobo Xia, Hamid Alinejad-Rokny, Fei Huang 0002, Min Yang 0007
NeurIPS8
2024 II-Bench: An Image Implication Understanding Benchmark for Multimodal Large Language Models
abstract
The rapid advancements in the development of multimodal large language models (MLLMs) have consistently led to new breakthroughs on various benchmarks. In response, numerous challenging and comprehensive benchmarks have been proposed to more accurately assess the capabilities of MLLMs. However, there is a dearth of exploration of the higher-order perceptual capabilities of MLLMs. To fill this gap, we propose the Image Implication understanding Benchmark, II-Bench, which aims to evaluate the model's higher-order perception of images. Through extensive experiments on II-Bench across multiple MLLMs, we have made significant findings. Initially, a substantial gap is observed between the performance of MLLMs and humans on II-Bench. The pinnacle accuracy of MLLMs attains 74.8%, whereas human accuracy averages 90%, peaking at an impressive 98%. Subsequently, MLLMs perform worse on abstract and complex images, suggesting limitations in their ability to understand high-level semantics and capture image details. Finally, it is observed that most models exhibit enhanced accuracy when image sentiment polarity hints are incorporated into the prompts. This observation underscores a notable deficiency in their inherent understanding of image sentiment. We believe that II-Bench will inspire the community to develop the next generation of MLLMs, advancing the journey towards expert artificial general intelligence (AGI). II-Bench is publicly available at https://huggingface.co/datasets/m-a-p/II-Bench.
Feiteng Fang, Xeron Du, Chenhao Zhang 0005, Noah Wang, Yuelin Bai, Qixuan Zhao, Liyang Fan, Chengguang Gan, Hongquan Lin, Jiaming Li 0004, Yuansheng Ni, Haihong Wu, Yaswanth Narsupalli, Zhigang Zheng, Chengming Li 0004, Xiping Hu, Ruifeng Xu 0001, Xiaojun Chen 0006, Min Yang 0007, Ruibo Liu, Wenhao Huang 0001, Ge Zhang 0009, Shiwen Ni
NeurIPS12
2022 Enhancing Structure Preservation in Coreference Resolution by Constrained Graph Encoding
abstract
Coreference resolution is a challenging yet practical problem. Most previous methods are designed to better utilize sequential features of language but can hardly capture the structural associations between mentions. In addition, it is often observed that during long-term training, the embeddings projected from unrelated mentions tend to move closer or even mix together, which increases the difficulty of learning decision boundaries. To tackle these issues: i) We propose a general graph schema derived from diverse knowledge sources (e.g., lemma, type, and semantic roles) to directly link mentions, so that rich information can be exchanged via the relevant connections; ii) We impose two adaptive constraints during graph encoding to regularize the embedding space. One is used to force different sub-modules to generate consistent predictions for the same mention pairs, and the other aims to make the learned embeddings corresponding to unrelated mentions more distinguishable while those of coreferential mentions more similar. Results on two public datasets (ECB+ and ACE05) show that our model consistently outperforms state-of-the-art baselines under different settings with$p$-value less than 0.01 in$t$-test, especially learning effectively from the limited labeled data.
Chuang Fan, Jiaming Li 0004, Ruifeng Xu 0001
IEEE ACM Trans. Audio Speech Lang. Process.2