research
∙
07/30/2023
Integrated Private Data Trading Systems for Data Marketplaces
In the digital age, data is a valuable commodity, and data marketplaces ...
share
research
∙
03/07/2023
A Survey of Data Pricing for Data Marketplaces
A data marketplace is an online venue that brings data owners, data brok...
research
∙
02/17/2023
Multi-unit Auction over a Social Network
Diffusion auction is an emerging business model where a seller aims to i...
research
∙
02/14/2023
Differentially Private Diffusion Auction: The Single-unit Case
Diffusion auction refers to an emerging paradigm of online marketplace w...
research
∙
01/30/2023
Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
We study a game between autobidding algorithms that compete in an online...
research
∙
10/23/2022
No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution
Supply chain management (SCM) has been recognized as an important discip...
research
∙
10/04/2022
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
We study high-probability regret bounds for adversarial K-armed bandits ...
research
∙
07/26/2022
SPAIC: A Spike-based Artificial Intelligence Computing Framework
Neuromorphic computing is an emerging research field that aims to develo...
research
∙
02/12/2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits
We consider the problem of combining and learning over a set of adversar...
research
∙
02/12/2022
Adaptive Bandit Convex Optimization with Heterogeneous Curvature
We consider the problem of adversarial bandit convex optimization, that ...
research
∙
01/30/2022
No-Regret Learning in Time-Varying Zero-Sum Games
Learning from repeated play in a fixed two-player zero-sum game is a cla...
research
∙
02/11/2021
Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously
In this work, we develop linear bandit algorithms that automatically ada...
research
∙
02/08/2021
Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games
We study infinite-horizon discounted two-player zero-sum Markov games, a...
research
∙
08/14/2020
The Relevance of Classic Fuzz Testing: Have We Solved This One?
As fuzz testing has passed its 30th anniversary, and in the face of the ...
research
∙
07/27/2020
RANDOM MASK: Towards Robust Convolutional Neural Networks
Robustness of neural networks has recently been highlighted by the adver...
research
∙
06/16/2020
Linear Last-iterate Convergence for Matrix Games and Stochastic Games
Optimistic Gradient Descent Ascent (OGDA) algorithm for saddle-point opt...
research
∙
06/14/2020
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs
We develop a new approach to obtaining high probability regret bounds fo...
research
∙
05/19/2020
Selling Data at an Auction under Privacy Constraints
Private data query combines mechanism design with privacy protection to ...
research
∙
02/02/2020
A Closer Look at Small-loss Bounds for Bandits with Graph Feedback
We study small-loss bounds for the adversarial multi-armed bandits probl...
research
∙
11/19/2019
Defective Convolutional Layers Learn Robust CNNs
Robustness of convolutional neural networks has recently been highlighte...
research
∙
11/05/2017