research
∙
08/08/2023
Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs
Recently, there has been extensive study of cooperative multi-agent mult...
share
research
∙
06/13/2023
Multi-Fidelity Multi-Armed Bandits Revisited
We study the multi-fidelity multi-armed bandit (MF-MAB), an extension of...
research
∙
05/14/2023
A Survey of Federated Evaluation in Federated Learning
In traditional machine learning, it is trivial to conduct model evaluati...
research
∙
03/30/2023
Contextual Combinatorial Bandits with Probabilistically Triggered Arms
We study contextual combinatorial bandits with probabilistically trigger...
research
∙
03/01/2023
Efficient Explorative Key-term Selection Strategies for Conversational Contextual Bandits
Conversational contextual bandits elicit user preferences by occasionall...
research
∙
02/15/2023
On-Demand Communication for Asynchronous Multi-Agent Bandits
This paper studies a cooperative multi-agent multi-armed stochastic band...
research
∙
01/28/2023
Interactive Log Parsing via Light-weight User Feedbacks
Template mining is one of the foundational tasks to support log analysis...
research
∙
01/05/2023
Applying Quantum Error-correcting Codes for Fault-tolerant Blind Quantum Cloud Computation
Blind Quantum Computation (BQC) is a delegation computing protocol that ...
research
∙
11/21/2022
TinyQMIX: Distributed Access Control for mMTC via Multi-agent Reinforcement Learning
Distributed access control is a crucial component for massive machine ty...
research
∙
11/12/2022
Pareto-Optimal Learning-Augmented Algorithms for Online k-Search Problems
This paper leverages machine learned predictions to design online algori...
research
∙
09/24/2022
The Online Knapsack Problem with Departures
The online knapsack problem is a classic online resource allocation prob...
research
∙
08/31/2022
Federated Online Clustering of Bandits
Contextual multi-armed bandit (MAB) is an important sequential decision-...
research
∙
08/31/2022
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
In this paper, we study the combinatorial semi-bandits (CMAB) and focus ...
research
∙
06/17/2022
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms
We generalize the multiple-play multi-armed bandits (MP-MAB) problem wit...
research
∙
04/28/2022
Multi-Player Multi-Armed Bandits with Finite Shareable Resources Arms: Learning Algorithms Applications
Multi-player multi-armed bandits (MMAB) study how decentralized players ...
research
∙
02/20/2022
Multi-dimensional Network Security Game: How do attacker and defender battle on parallel targets?
In this paper, we consider a new network security game wherein an attack...
research
∙
12/22/2021
Decentralized Task Offloading in Edge Computing: A Multi-User Multi-Armed Bandit Approach
Mobile edge computing facilitates users to offload computation tasks to ...
research
∙
12/20/2021
Decentralized Stochastic Proximal Gradient Descent with Variance Reduction over Time-varying Networks
In decentralized learning, a network of nodes cooperate to minimize an o...
research
∙
06/09/2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning
Multi-layered network exploration (MuLaNE) problem is an important probl...
research
∙
05/03/2021
Joint D2D Collaboration and Task Offloading for Edge Computing: A Mean Field Graph Approach
Mobile edge computing (MEC) facilitates computation offloading to edge s...
research
∙
11/05/2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
We study the online restless bandit problem, where the state of each arm...
research
∙
08/01/2020
Online VNF Chaining and Predictive Scheduling: Optimality and Trade-offs
For NFV systems, the key design space includes the function chaining for...
research
∙
06/24/2020
Online Competitive Influence Maximization
Online influence maximization has attracted much attention as a way to m...
research
∙
01/16/2020
Combining Offline Causal Inference and Online Bandit Learning for Data Driven Decisions
A fundamental question for companies is: How to make good decisions with...
research
∙
06/04/2019
Toward Building Conversational Recommender Systems: A Contextual Bandit Approach
Contextual bandit algorithms have gained increasing popularity in recomm...
research
∙
05/22/2019
A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets
Estimating set similarity and detecting highly similar sets are fundamen...
research
∙
03/14/2019
FAVE: A fast and efficient network Flow AVailability Estimation method with bounded relative error
This paper focuses on helping network providers to carry out network cap...
research
∙
11/14/2018
Submodular Optimization Over Streams with Inhomogeneous Decays
Cardinality constrained submodular function maximization, which aims to ...
research
∙
11/13/2018
Community Exploration: From Offline Optimization to Online Learning
We introduce the community exploration problem that has many real-world ...
research
∙
10/07/2018
Graphlet Count Estimation via Convolutional Neural Networks
Graphlets are defined as k-node connected induced subgraph patterns. For...
research
∙
08/06/2018
Quantifying Deployability & Evolvability of Future Internet Architectures via Economic Models
Emerging new applications demand the current Internet to provide new fun...
research
∙
05/04/2018
Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback
The web link selection problem is to select a small subset of web links ...
research
∙
10/31/2017
Joint Cache Resource Allocation and Request Routing for In-network Caching Services
In-network caching is recognized as an effective solution to offload con...
research
∙
01/25/2016
Quegel: A General-Purpose Query-Centric Framework for Querying Big Graphs
Pioneered by Google's Pregel, many distributed systems have been develop...
research
∙
09/18/2011