research
∙
08/03/2023
Disentangling Multi-view Representations Beyond Inductive Bias
Multi-view (or -modality) representation learning aims to understand the...
share
research
∙
07/10/2023
Auction Design for Value Maximizers with Budget and Return-on-spend Constraints
The paper designs revenue-maximizing auction mechanisms for agents who a...
research
∙
06/27/2023
Scheduling with a Limited Testing Budget
Scheduling with testing falls under the umbrella of the research on opti...
research
∙
05/25/2023
Online Dynamic Acknowledgement with Learned Predictions
We revisit the online dynamic acknowledgment problem. In the problem, a ...
research
∙
05/25/2023
Polylogarithmic Approximation for Robust s-t Path
The paper revisits the robust s-t path problem, one of the most fundamen...
research
∙
12/28/2022
A Clustering-guided Contrastive Fusion for Multi-view Representation Learning
The past two decades have seen increasingly rapid advances in the field ...
research
∙
12/15/2022
Min-max Submodular Ranking for Multiple Agents
In the submodular ranking (SR) problem, the input consists of a set of s...
research
∙
11/24/2022
Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule
Given a connected graph on whose edges we can build roads to connect the...
research
∙
05/23/2022
Mechanism Design with Predictions
Improving algorithms via predictions is a very active research topic in ...
research
∙
12/10/2021
Learning-Augmented Algorithms for Online Steiner Tree
This paper considers the recently popular beyond-worst-case algorithm an...
research
∙
06/02/2021
Using Predicted Weights for Ad Delivery
We study the performance of a proportional weights algorithm for online ...
research
∙
11/23/2020
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
This paper proposes a new model for augmenting algorithms with useful pr...
research
∙
02/27/2019
