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

Kaiyi Lin

dblp:259/5140 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
5since 2021 · last 2026
0000-0003-4237-5313ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 1 since 2021Computer networks · 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.

Databases, data mining, and information retrieval
3 papers
Information retrieval · 100%
Artificial intelligence
2 papers
Generative modeling · 49% Representation and self-supervised learning · 37% Transfer learning and domain adaptation · 15%
Computer graphics and multimedia
2 papers
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
cross-modal retrieval
1.022022
Joint Feature Synthesis and Embedding: Adversarial Cross-Modal Retrieval Revisited · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Learning Cross-Aligned Latent Embeddings for Zero-Shot Cross-Modal Retrieval · AAAI 2020
Machine learning › Generative modeling
generative adversarial network
0.612022
Joint Feature Synthesis and Embedding: Adversarial Cross-Modal Retrieval Revisited · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Information retrieval › ranking › content ranking
ad ranking
0.612022
Joint Optimization of Ad Ranking and Creative Selection · SIGIR 2022
Information retrieval
online advertising
0.612022
Joint Optimization of Ad Ranking and Creative Selection · SIGIR 2022
Machine learning › Representation and self-supervised learning › multimodal representation learning
cross-modal representation learning
0.412020
Learning Cross-Aligned Latent Embeddings for Zero-Shot Cross-Modal Retrieval · AAAI 2020
Information retrieval
cross-modal retrieval
0.412020
Correlated Features Synthesis and Alignment for Zero-shot Cross-modal Retrieval · SIGIR 2020
Information retrieval › cross-modal retrieval
zero-shot cross-modal retrieval
0.412020
Correlated Features Synthesis and Alignment for Zero-shot Cross-modal Retrieval · SIGIR 2020
Information retrieval › hashing
binary code learning
0.412019
Deep Supervised Hashing With Anchor Graph · ICCV 2019
Information retrieval › hashing › supervised hashing
deep supervised hashing
0.412019
Deep Supervised Hashing With Anchor Graph · ICCV 2019
Information retrieval
hashing
0.412019
Deep Supervised Hashing With Anchor Graph · ICCV 2019
Machine learning › Transfer learning and domain adaptation
zero-shot learning
0.212022
Joint Feature Synthesis and Embedding: Adversarial Cross-Modal Retrieval Revisited · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Information retrieval › cross-modal retrieval
image-text retrieval
0.112020
Correlated Features Synthesis and Alignment for Zero-shot Cross-modal Retrieval · SIGIR 2020

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

cycle consistency · 1.1common embedding space learning · 1.1Wasserstein GAN · 1.1variational autoencoder · 0.9cross-reconstruction · 0.9two-tower architecture · 0.6multimodal representation learning · 0.6knowledge distillation · 0.6adaptive dropout · 0.6wasserstein generative adversarial network · 0.4knowledge transfer · 0.4common space learning · 0.4regularized deep model · 0.4anchor graph · 0.4
YearPublicationVenuePosition
2026 Geo-localization under viewpoint rotation: addressing direction inconsistencies with contrastive learning
Youyuan Xue, Kaiyi Lin, Fan Guo 0001, Jin Tang 0002, Zhihu Wu
GeoInformatica2
2022 Joint Optimization of Ad Ranking and Creative Selection
abstract
In e-commerce, ad creatives play an important role in effectively delivering product information to users. The purpose of online creative selection is to learn users' preferences for ad creatives, and to select the most appealing design for users to maximize Click-Through Rate (CTR). However, the existing common practices in the industry usually place the creative selection after the ad ranking stage, and thus the optimal creative fails to reflect the influence on the ad ranking stage. To address these issues, we propose a novel Cascade Architecture of Creative Selection (CACS), which is built before the ranking stage to joint optimization of intra-ad creative selection and inter-ad ranking. To improve the efficiency, we design a classic two-tower structure and allow creative embeddings of the creative selection stage to share with the ranking stage. To boost the effectiveness, on the one hand, we propose a soft label list-wise ranking distillation method to distill the ranking knowledge from the ranking stage to guide CACS learning; and on the other hand, we also design an adaptive dropout network to encourage the model to probabilistically ignore ID features in favor of content features to learn multi-modal representations of the creative. Most of all, the ranking model obtains the optimal creative information of each ad from our CACS, and uses all available features to improve the performance of the ranking model. We have launched our solution in Taobao advertising platform and have obtained significant improvements both in offline and online evaluations.
Kaiyi Lin, Xiang Zhang 0001, Feng Li 0067, Pengjie Wang 0002, Qingqing Long, Hongbo Deng, Jian Xu 0015, Bo Zheng 0007
SIGIR1
2022 Joint Feature Synthesis and Embedding: Adversarial Cross-Modal Retrieval Revisited
abstract
Recently, generative adversarial network (GAN) has shown its strong ability on modeling data distribution via adversarial learning. Cross-modal GAN, which attempts to utilize the power of GAN to model the cross-modal joint distribution and to learn compatible cross-modal features, is becoming the research hotspot. However, the existing cross-modal GAN approaches typically 1) require labeled multimodal data of massive labor cost to establish cross-modal correlation; 2) utilize the vanilla GAN model that results in unstable training procedure and meaningless synthetic features; and 3) lack of extensibility for retrieving cross-modal data of new classes. In this article, we revisit the adversarial learning in existing cross-modal GAN methods and propose Joint Feature Synthesis and Embedding (JFSE), a novel method that jointly performs multimodal feature synthesis and common embedding space learning to overcome the above three shortcomings. Specifically, JFSE deploys two coupled conditional Wassertein GAN modules for the input data of two modalities, to synthesize meaningful and correlated multimodal features under the guidance of the word embeddings of class labels. Moreover, three advanced distribution alignment schemes with advanced cycle-consistency constraints are proposed to preserve the semantic compatibility and enable the knowledge transfer in the common embedding space for both the true and synthetic cross-modal features. All these add-ons in JFSE not only help to learn more effective common embedding space that effectively captures the cross-modal correlation but also facilitate to transfer knowledge to multimodal data of new classes. Extensive experiments are conducted on four widely used cross-modal datasets, and the comparisons with more than ten state-of-the-art approaches show that our JFSE method achieves remarkably accuracy improvement on both standard retrieval and the newly explored zero-shot and generalized zero-shot retrieval tasks.
Xing Xu 0001, Kaiyi Lin, Yang Yang 0002, Alan Hanjalic, Heng Tao Shen
IEEE Trans. Pattern Anal. Mach. Intell.2
2022 Learning Cross-Modal Common Representations by Private-Shared Subspaces Separation
abstract
Due to the inconsistent distributions and representations of different modalities (e.g., images and texts), it is very challenging to correlate such heterogeneous data. A standard solution is to construct one common subspace, where the common representations of different modalities are generated to bridge the heterogeneity gap. Existing methods based on common representation learning mostly adopt a less effective two-stage paradigm: first, generating separate representations for each modality by exploiting the modality-specific properties as the complementary information, and then capturing the cross-modal correlation in the separate representations for common representation learning. Moreover, these methods usually neglect that there may exist interference in the modality-specific properties, that is, the unrelated objects and background regions in images or the noisy words and incorrect sentences in the text. In this article, we hypothesize that explicitly modeling the interference within each modality can improve the quality of common representation learning. To this end, we propose a novel model private-shared subspaces separation (P3S) to explicitly learn different representations that are partitioned into two kinds of subspaces: 1) the common representations that capture the cross-modal correlation in a shared subspace and 2) the private representations that model the interference within each modality in two private subspaces. By employing the orthogonality constraints between the shared subspace and the private subspaces during the one-stage joint learning procedure, our model is able to learn more effective common representations for different modalities in the shared subspace by fully excluding the interference within each modality. Extensive experiments conducted on cross-modal retrieval verify the advantages of our P3S method compared with 15 state-of-the-art methods on four widely used cross-modal datasets.
Xing Xu 0001, Kaiyi Lin, Lianli Gao, Huimin Lu 0001, Heng Tao Shen, Xuelong Li 0001
IEEE Trans. Cybern.2
2021 Zero-shot Cross-modal Retrieval by Assembling AutoEncoder and Generative Adversarial Network
abstract
Conventional cross-modal retrieval models mainly assume the same scope of the classes for both the training set and the testing set. This assumption limits their extensibility on zero-shot cross-modal retrieval (ZS-CMR), where the testing set consists of unseen classes that are disjoint with seen classes in the training set. The ZS-CMR task is more challenging due to the heterogeneous distributions of different modalities and the semantic inconsistency between seen and unseen classes. A few of recently proposed approaches are inspired by zero-shot learning to estimate the distribution underlying multimodal data by generative models and make the knowledge transfer from seen classes to unseen classes by leveraging class embeddings. However, directly borrowing the idea from zero-shot learning (ZSL) is not fully adaptive to the retrieval task, since the core of the retrieval task is learning the common space. To address the above issues, we propose a novel approach named Assembling AutoEncoder and Generative Adversarial Network (AAEGAN), which combines the strength of AutoEncoder (AE) and Generative Adversarial Network (GAN), to jointly incorporate common latent space learning, knowledge transfer, and feature synthesis for ZS-CMR. Besides, instead of utilizing class embeddings as common space, the AAEGAN approach maps all multimodal data into a learned latent space with the distribution alignment via three coupled AEs. We empirically show the remarkable improvement for ZS-CMR task and establish the state-of-the-art or competitive performance on four image-text retrieval datasets.
Xing Xu 0001, Kaiyi Lin, Huimin Lu 0001, Jie Shao 0001, Heng Tao Shen
ACM Trans. Multim. Comput. Commun. Appl.3
2020 Learning Cross-Aligned Latent Embeddings for Zero-Shot Cross-Modal Retrieval
abstract
Zero-Shot Cross-Modal Retrieval (ZS-CMR) is an emerging research hotspot that aims to retrieve data of new classes across different modality data. It is challenging for not only the heterogeneous distributions across different modalities, but also the inconsistent semantics across seen and unseen classes. A handful of recently proposed methods typically borrow the idea from zero-shot learning, i.e., exploiting word embeddings of class labels (i.e., class-embeddings) as common semantic space, and using generative adversarial network (GAN) to capture the underlying multimodal data structures, as well as strengthen relations between input data and semantic space to generalize across seen and unseen classes. In this paper, we propose a novel method termed Learning Cross-Aligned Latent Embeddings (LCALE) as an alternative to these GAN based methods for ZS-CMR. Unlike using the class-embeddings as the semantic space, our method seeks for a shared low-dimensional latent space of input multimodal features and class-embeddings by modality-specific variational autoencoders. Notably, we align the distributions learned from multimodal input features and from class-embeddings to construct latent embeddings that contain the essential cross-modal correlation associated with unseen classes. Effective cross-reconstruction and cross-alignment criterions are further developed to preserve class-discriminative information in latent space, which benefits the efficiency for retrieval and enable the knowledge transfer to unseen classes. We evaluate our model using four benchmark datasets on image-text retrieval tasks and one large-scale dataset on image-sketch retrieval tasks. The experimental results show that our method establishes the new state-of-the-art performance for both tasks on all datasets.
Kaiyi Lin, Xing Xu 0001, Lianli Gao, Zheng Wang 0044, Heng Tao Shen
AAAI1
2020 Correlated Features Synthesis and Alignment for Zero-shot Cross-modal Retrieval
abstract
The goal of cross-modal retrieval is to search for semantically similar instances in one modality by using a query from another modality. Existing approaches mainly consider the standard scenario that requires the source set for training and the target set for testing share the same scope of classes. However, they may not generalize well on zero-shot cross-modal retrieval (ZS-CMR) task, where the target set contains unseen classes that are disjoint with the seen classes in the source set. This task is more challenging due to 1) the absence of the unseen classes during training, 2) inconsistent semantics across seen and unseen classes, and 3) the heterogeneous multimodal distributions between the source and target set. To address these issues, we propose a novel Correlated Feature Synthesis and Alignment (CFSA) approach to integrate multimodal feature synthesis, common space learning and knowledge transfer for ZS-CMR. Our CFSA first utilizes class-level word embeddings to guide two coupled Wassertein generative adversarial networks (WGANs) to synthesize sufficient multimodal features with semantic correlation for stable training. Then the synthetic and true multimodal features are jointly mapped to a common semantic space via an effective distribution alignment scheme, where the cross-modal correlations of different semantic features are captured and the knowledge can be transferred to the unseen classes under the cycle-consistency constraint. Experiments on four benchmark datasets for image-text retrieval and two large-scale datasets for image-sketch retrieval show the remarkable improvements achieved by our CFAS method comparing with a bundle of state-of-the-art approaches.
Xing Xu 0001, Kaiyi Lin, Huimin Lu 0001, Lianli Gao, Heng Tao Shen
SIGIR2
2019 Deep Supervised Hashing With Anchor Graph
abstract
Recently, a series of deep supervised hashing methods were proposed for binary code learning. However, due to the high computation cost and the limited hardware's memory, these methods will first select a subset from the training set, and then form a mini-batch data to update the network in each iteration. Therefore, the remaining labeled data cannot be fully utilized and the model cannot directly obtain the binary codes of the entire training set for retrieval. To address these problems, this paper proposes an interesting regularized deep model to seamlessly integrate the advantages of deep hashing and efficient binary code learning by using the anchor graph. As such, the deep features and label matrix can be jointly used to optimize the binary codes, and the network can obtain more discriminative feedback from the linear combinations of the learned bits. Moreover, we also reveal the algorithm mechanism and its computation essence. Experiments on three large-scale datasets indicate that the proposed method achieves better retrieval performance with less training time compared to previous deep hashing methods.
Yudong Chen 0002, Zhihui Lai 0001, Yujuan Ding, Kaiyi Lin, Wai Keung Wong
ICCV4