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

Meisam Hejazinia

dblp:243/3560 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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
1 paper
Reinforcement learning · 100%
Network and information security
1 paper
Privacy and data protection · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › bandit
contextual bandit
0.712023
Federated Linear Contextual Bandits with User-level Differential Privacy · ICML 2023
Machine learning › Reinforcement learning › bandit › contextual bandit
federated linear contextual bandits
0.712023
Federated Linear Contextual Bandits with User-level Differential Privacy · ICML 2023
Privacy and data protection
differential privacy
0.712023
Federated Linear Contextual Bandits with User-level Differential Privacy · ICML 2023
Privacy and data protection › privacy analysis › privacy models
user-level differential privacy
0.712023
Federated Linear Contextual Bandits with User-level Differential Privacy · ICML 2023
Algorithmic game theory and mechanism design › mechanism design › algorithmic mechanism design
online mechanism design
0.712023
Federated Linear Contextual Bandits with User-level Differential Privacy · ICML 2023

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

upper and lower regret bounds · 2.0hedge · 2.0
YearPublicationVenuePosition
2023 Federated Linear Contextual Bandits with User-level Differential Privacy
abstract
This paper studies federated linear contextual bandits under the notion of user-level differential privacy (DP). We first introduce a unified federated bandits framework that can accommodate various definitions of DP in the sequential decision-making setting. We then formally introduce user-level central DP (CDP) and local DP (LDP) in the federated bandits framework, and investigate the fundamental trade-offs between the learning regrets and the corresponding DP guarantees in a federated linear contextual bandits model. For CDP, we propose a federated algorithm termed as $\texttt{ROBIN}$ and show that it is near-optimal in terms of the number of clients $M$ and the privacy budget $\varepsilon$ by deriving nearly-matching upper and lower regret bounds when user-level DP is satisfied. For LDP, we obtain several lower bounds, indicating that learning under user-level $(\varepsilon,\delta)$-LDP must suffer a regret blow-up factor at least $\min\{1/\varepsilon,M\}$ or $\min\{1/\sqrt{\varepsilon},\sqrt{M}\}$ under different conditions.
Ruiquan Huang, Luca Melis, Milan Shen, Meisam Hejazinia, Jing Yang 0002
ICML5
2019 Deep personalized re-targeting
abstract
Predicting booking probability and value at the traveler level plays a central role in computational advertising for massive two-sided vacation rental marketplaces. These marketplaces host millions of travelers with long shopping cycles, spending a lot of time in the discovery phase. The footprint of the travelers in their discovery is a useful data source to help these marketplaces to predict shopping probability and value. However, there is no one-size-fits-all solution for this purpose. In this paper, we propose a hybrid model that infuses deep and shallow neural network embeddings into a gradient boosting tree model. This approach allows the latent preferences of millions of travelers to be automatically learned from sparse session logs. In addition, we present the architecture that we deployed into our production system. We find that there is a pragmatic sweet spot between expensive complex deep neural networks and simple shallow neural networks that can increase the prediction performance of a model by seven percent, based on offline analysis.
Meisam Hejazinia, Pavlos Mitsoulis-Ntompos, Serena Zhang
ASONAM1