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

Keyang Xu

dblp:154/3241 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 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
3 papers
Generative modeling · 68% Language models and text generation · 13% Trustworthy machine learning · 10%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 92% Data integration and cleaning · 8%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.722025
Improving Rectified Flow with Boundary Conditions · ICCV 2025
AMO Sampler: Enhancing Text Rendering with Overshooting · CVPR 2025
Machine learning › Generative modeling › diffusion model
rectified flow
0.912025
Improving Rectified Flow with Boundary Conditions · ICCV 2025
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.912025
AMO Sampler: Enhancing Text Rendering with Overshooting · CVPR 2025
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.512021
Unsupervised Out-of-Domain Detection via Pre-trained Transformers · ACL/IJCNLP (1) 2021
Natural language and speech › Question answering and dialogue systems › intent detection
out-of-domain detection
0.512021
Unsupervised Out-of-Domain Detection via Pre-trained Transformers · ACL/IJCNLP (1) 2021
Natural language and speech › Language models and text generation › pre-trained language model
pretrained transformer
0.512021
Unsupervised Out-of-Domain Detection via Pre-trained Transformers · ACL/IJCNLP (1) 2021
Information retrieval
distributed information retrieval
0.312018
Dynamic Shard Cutoff Prediction for Selective Search · SIGIR 2018
Information retrieval › distributed information retrieval
selective search
0.312018
Dynamic Shard Cutoff Prediction for Selective Search · SIGIR 2018
Information retrieval › search engines
web crawling
0.312017
De-duping URLs with Sequence-to-Sequence Neural Networks · SIGIR 2017
Rendering
text rendering
0.312025
AMO Sampler: Enhancing Text Rendering with Overshooting · CVPR 2025
Natural language and speech › Language models and text generation
pre-trained language model
0.112021
Unsupervised Out-of-Domain Detection via Pre-trained Transformers · ACL/IJCNLP (1) 2021
Data integration and cleaning › entity resolution
duplicate detection
0.112017
De-duping URLs with Sequence-to-Sequence Neural Networks · SIGIR 2017

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

overshooting sampler · 1.7langevin dynamics · 1.7attention-modulated sampling · 1.7boundary conditions · 0.9SDE sampling · 0.9ODE sampling · 0.9pre-trained transformer · 0.5taily · 0.3rank-s · 0.3sequence-to-sequence neural network · 0.3
YearPublicationVenuePosition
2025 AMO Sampler: Enhancing Text Rendering with Overshooting
abstract
Achieving precise alignment between textual instructions and generated images in text-to-image generation is a significant challenge, particularly in rendering written text within images. Sate-of-the-art models like Stable Diffusion 3 (SD3), Flux, and AuraFlow still struggle with accurate text depiction, resulting in misspelled or inconsistent text. We introduce a training-free method with minimal computational overhead that significantly enhances text rendering quality. Specifically, we introduce an overshooting sampler for pre-trained rectified flow (RF) models, by alternating between over-simulating the learned ordinary differential equation (ODE) and reintroducing noise. Compared to the Euler sampler, the overshooting sampler effectively introduces an extra Langevin dynamics term that can help correct the compounding error from successive Euler steps and therefore improve the text rendering. However, when the overshooting strength is high, we observe over-smoothing artifacts on the generated images. To address this issue, we propose an Attention Modulated Overshooting sampler (AMO), which adaptively control the strength of overshooting for each image patch according to their attention score with the text content. AMO demonstrates a 32.3% and 35.9% improvement in text rendering accuracy on SD3 and Flux without compromising overall image quality or increasing inference cost.
Xixi Hu 0001, Keyang Xu, Bo Liu 0042, Qiang Liu 0001, Hongliang Fei
CVPR2
2025 Improving Rectified Flow with Boundary Conditions
abstract
Rectified Flow offers a simple and effective approach to high-quality generative modeling by learning a velocity field. However, we identify a limitation in directly modeling the velocity with an unconstrained neural network: the learned velocity often fails to satisfy certain boundary conditions, leading to inaccurate velocity field estimations that deviate from the desired ODE. This issue is particularly critical during stochastic sampling at inference, as the score function's errors are amplified near the boundary. To mitigate this, we propose a Boundary-enforced Rectified Flow Model (Boundary RF Model), in which we enforce boundary conditions with a minimal code modification. Boundary RF Model improves performance over vanilla RF model, demonstrating 8.01% improvement in FID score on ImageNet using ODE sampling and 8.98% improvement using SDE sampling.
Xixi Hu 0001, Runlong Liao, Keyang Xu, Bo Liu 0042, Yeqing Li, Eugene Ie, Hongliang Fei, Qiang Liu 0001
ICCV3
2025 Direct Preference Optimization of Video Large Multimodal Models from Language Model Reward
abstract
Ruohong Zhang, Liangke Gui, Zhiqing Sun, Yihao Feng, Keyang Xu, Yuanhan Zhang, Di Fu, Chunyuan Li, Alexander G Hauptmann, Yonatan Bisk, Yiming Yang. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025.
Ruohong Zhang, Liangke Gui, Zhiqing Sun, Yihao Feng, Keyang Xu, Yuanhan Zhang, Di Fu, Chunyuan Li, Alex Hauptmann 0001, Yonatan Bisk, Yiming Yang 0002
NAACL (Long Papers)5
2021 Unsupervised Out-of-Domain Detection via Pre-trained Transformers
abstract
Keyang Xu, Tongzheng Ren, Shikun Zhang, Yihao Feng, Caiming Xiong. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021.
Keyang Xu, Tongzheng Ren, Shikun Zhang, Yihao Feng, Caiming Xiong
ACL/IJCNLP (1)1
2018 Dynamic Shard Cutoff Prediction for Selective Search
abstract
Selective search architectures use resource selection algorithms such as Rank-S or Taily to rank index shards and determine how many to search for a given query. Most prior research evaluated solutions by their ability to improve efficiency without significantly reducing early-precision metrics such as [email protected] and [email protected] This paper recasts selective search as an early stage of a multi-stage retrieval architecture, which makes recall-oriented metrics more appropriate. A new algorithm is presented that predicts the number of shards that must be searched for a given query in order to meet recall-oriented goals. Decoupling shard ranking from deciding how many shards to search clarifies efficiency vs. effectiveness trade-offs, and enables them to be optimized independently. Experiments on two corpora demonstrate the value of this approach.
Hafeezul Rahman Mohammad, Keyang Xu, Jamie Callan, J. Shane Culpepper
SIGIR2
2017 De-duping URLs with Sequence-to-Sequence Neural Networks
abstract
Many URLs on the Internet point to identical contents, which increase the burden of web crawlers. Techniques that detect such URLs (known as URL de-duping) can greatly save resources such as bandwidth and storage for crawlers. Traditional de-duping methods are usually limited to heavily engineered rule matching strategies.In this work, we propose a novel URL de-duping framework based on sequence-to-sequence (Seq2Seq) neural networks. A single concise translation model can take the place of thousands of explicit rules. Experiments indicate that a vanilla Seq2Seq architecture yields robust and accurate results in detecting duplicate URLs. Furthermore, we demonstrate the efficiency of this framework in the real large-scale web environment.
Keyang Xu, Zhengzhong Liu 0001, Jamie Callan
SIGIR1