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

Wei Chen 0020

dblp:c/WeiChen20 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › multi-armed bandit
combinatorial bandits
0.812024
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond · ICML 2024
Machine learning › Reinforcement learning
episodic reinforcement learning
0.812024
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond · ICML 2024
Machine learning › Reinforcement learning
multi-armed bandit
0.812024
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond · ICML 2024

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

smoothness conditions · 0.8regret analysis · 0.8CUCB · 0.8
YearPublicationVenuePosition
2024 Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
abstract
We introduce a novel framework of combinatorial multi-armed bandits (CMAB) with multivariant and probabilistically triggering arms (CMAB-MT), where the outcome of each arm is a $d$-dimensional multivariant random variable and the feedback follows a general arm triggering process. Compared with existing CMAB works, CMAB-MT not only enhances the modeling power but also allows improved results by leveraging distinct statistical properties for multivariant random variables. For CMAB-MT, we propose a general 1-norm multivariant and triggering probability-modulated smoothness condition, and an optimistic CUCB-MT algorithm built upon this condition. Our framework can include many important problems as applications, such as episodic reinforcement learning (RL) and probabilistic maximum coverage for goods distribution, all of which meet the above smoothness condition and achieve matching or improved regret bounds compared to existing works. Through our new framework, we build the first connection between the episodic RL and CMAB literature, by offering a new angle to solve the episodic RL through the lens of CMAB, which may encourage more interactions between these two important directions.
Xutong Liu 0002, Siwei Wang 0002, Jinhang Zuo, Xuchuang Wang, Shuai Li 0010, Mohammad Hajiesmaili, John C. S. Lui, Wei Chen 0020
ICML10
2024 Convergence to Equilibrium of No-Regret Dynamics in Congestion Games
Volkan Cevher, Wei Chen 0020, Leello Tadesse Dadi, Jing Dong 0008, Ioannis Panageas, Stratis Skoulakis, Luca Viano, Baoxiang Wang 0001, Siwei Wang 0002, Jingyu Wu
WINE2