research
∙
06/14/2023
Multi-class Graph Clustering via Approximated Effective p-Resistance
This paper develops an approximation to the (effective) p-resistance and...
share
research
∙
02/11/2023
Regret Guarantees for Adversarial Online Collaborative Filtering
We investigate the problem of online collaborative filtering under no-re...
research
∙
06/24/2021
Improved Regret Bounds for Tracking Experts with Memory
We address the problem of sequential prediction with expert advice in a ...
research
∙
08/17/2020
Online Multitask Learning with Long-Term Memory
We introduce a novel online multitask setting. In this setting each task...
research
∙
07/06/2020
Online Learning of Facility Locations
In this paper, we provide a rigorous theoretical investigation of an onl...
research
∙
06/17/2019
Online Matrix Completion with Side Information
We give an online algorithm and prove novel mistake and regret bounds fo...
research
∙
06/17/2019
Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems
Mobile edge computing (MEC) is a promising technique for providing low-l...
research
∙
06/17/2018
Predicting Switching Graph Labelings with Cluster Specialists
We address the problem of predicting the labeling of a graph in an onlin...
research
∙
02/22/2018
Quantum linear systems algorithms: a primer
The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the ...
research
∙
07/26/2017
