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

Zhiye Yang

dblp:293/9663 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0006-3964-4892ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 33% Coding theory · 33% Information theory · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › signal processing for communications
integrated sensing and communication
1.012026
New Constructions of Locally Perfect Nonlinear Functions and Their Application to Sequence Sets With Low Ambiguity Zone · IEEE Trans. Inf. Theory 2026
Coding theory › sequences
sequence design
1.012026
New Constructions of Locally Perfect Nonlinear Functions and Their Application to Sequence Sets With Low Ambiguity Zone · IEEE Trans. Inf. Theory 2026
Information retrieval
online advertising
0.512021
We Know What You Want: An Advertising Strategy Recommender System for Online Advertising · KDD 2021
Algorithmic game theory and mechanism design › multi-armed bandit
contextual bandits
0.512021
We Know What You Want: An Advertising Strategy Recommender System for Online Advertising · KDD 2021
Algorithmic game theory and mechanism design
multi-armed bandit
0.512021
We Know What You Want: An Advertising Strategy Recommender System for Online Advertising · KDD 2021

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

ye-zhou-fan-liu-lei-tang bounds · 1.0locally perfect nonlinear function · 1.0contextual bandit · 1.0
YearPublicationVenuePosition
2026 New Constructions of Locally Perfect Nonlinear Functions and Their Application to Sequence Sets With Low Ambiguity Zone
abstract
Low Ambiguity Zone (LAZ) sequences are essential in modern integrated sensing and communication (ISAC) systems. Recently, locally perfect nonlinear functions (LPNFs) have been employed to design LAZ sequences with flexible parameters. In this work, we propose three new classes of LPNFs and use them to construct LAZ sequences that offer additional flexible parameters. Notably, all the proposed LAZ sequences are asymptotically optimal with respect to the Ye-Zhou-Fan-Liu-Lei-Tang bounds derived in [IEEE J. Sel. Areas Commun. 40(6), pp. 1809-1822, 2022].
Zhiye Yang, Huaning Liu, Keqin Feng
IEEE Trans. Inf. Theory1
2025 Trace representation of a family of generalized cyclotomic binary sequences with period pn
Zibi Xiao, Yaya Ye, Zhiye Yang, Xiangyong Zeng
Des. Codes Cryptogr.3
2021 We Know What You Want: An Advertising Strategy Recommender System for Online Advertising
abstract
Advertising expenditures have become the major source of revenue for e-commerce platforms. Providing good advertising experiences for advertisers by reducing their costs of trial and error in discovering the optimal advertising strategies is crucial for the long-term prosperity of online advertising. To achieve this goal, the advertising platform needs to identify the advertiser's optimization objectives, and then recommend the corresponding strategies to fulfill the objectives. In this work, we first deploy a prototype of strategy recommender system on Taobao display advertising platform, which indeed increases the advertisers' performance and the platform's revenue, indicating the effectiveness of strategy recommendation for online advertising. We further augment this prototype system by explicitly learning the advertisers' preferences over various advertising performance indicators and then optimization objectives through their adoptions of different recommending advertising strategies. We use contextual bandit algorithms to efficiently learn the advertisers' preferences and maximize the recommendation adoption, simultaneously. Simulation experiments based on Taobao online bidding data show that the designed algorithms can effectively optimize the strategy adoption rate of advertisers.
Liyi Guo, Junqi Jin, Zhenzhe Zheng 0001, Zhiye Yang, Zhizhuang Xing, Lvyin Niu, Fan Wu 0006, Chuan Yu 0002, Yuning Jiang 0001, Xiaoqiang Zhu
KDD5