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

Wenhai Cui

dblp:352/8643 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-8056-6044ORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 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
2 papers
Reinforcement learning · 28% Optimization for machine learning · 24% Learning theory · 24%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › bandit
bandit learning
0.812024
Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility · AAAI 2024
Privacy and data protection
differential privacy
0.812024
Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility · AAAI 2024
Privacy and data protection › privacy-preserving computation
privacy-preserving decision making
0.812024
Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility · AAAI 2024
Machine learning › Learning theory
online learning
0.712023
Opposite Online Learning via Sequentially Integrated Stochastic Gradient Descent Estimators · AAAI 2023
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.712023
Opposite Online Learning via Sequentially Integrated Stochastic Gradient Descent Estimators · AAAI 2023
Machine learning › Optimization for machine learning
stochastic gradient descent
0.712023
Opposite Online Learning via Sequentially Integrated Stochastic Gradient Descent Estimators · AAAI 2023

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

privacy budget analysis · 1.5mean-volatility utility · 1.5convergence analysis · 1.5two-armed bandit · 0.7stochastic gradient descent · 0.7sequential testing · 0.7
YearPublicationVenuePosition
2024 Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility
abstract
For ensuring the safety of users by protecting the privacy, the traditional privacy-preserving bandit algorithm aiming to maximize the mean reward has been widely studied in scenarios such as online ride-hailing, advertising recommendations, and personalized healthcare. However, classical bandit learning is irresponsible in such practical applications as they fail to account for risks in online decision-making and ignore external system information. This paper firstly proposes privacy protected mean-volatility utility as the objective of bandit learning and proves its responsibility, because it aims at achieving the maximum probability of utility by considering the risk. Theoretically, our proposed responsible bandit learning is expected to achieve the fastest convergence rate among current bandit algorithms and generates more statistical power than classical normality-based test. Finally, simulation studies provide supporting evidence for the theoretical results and demonstrate stronger performance when using stricter privacy budgets.
Wenhai Cui, Bei Jiang, Linglong Kong
AAAI2
2023 Opposite Online Learning via Sequentially Integrated Stochastic Gradient Descent Estimators
abstract
Stochastic gradient descent algorithm (SGD) has been popular in various fields of artificial intelligence as well as a prototype of online learning algorithms. This article proposes a novel and general framework of one-sided testing for streaming data based on SGD, which determines whether the unknown parameter is greater than a certain positive constant. We construct the online-updated test statistic sequentially by integrating the selected batch-specific estimator or its opposite, which is referred to opposite online learning. The batch-specific online estimators are chosen strategically according to the proposed sequential tactics designed by two-armed bandit process. Theoretical results prove the advantage of the strategy ensuring the distribution of test statistic to be optimal under the null hypothesis and also supply the theoretical evidence of power enhancement compared with classical test statistic. In application, the proposed method is appealing for statistical inference of one-sided testing because it is scalable for any model. Finally, the superior finite-sample performance is evaluated by simulation studies.
Wenhai Cui, Xiaoting Ji, Linglong Kong
AAAI1