3.4k citations · 4.9k across the 135 of their papers we have counts for
3 papers · 1 filter
Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting
Daniele Calandriello, Alessandro Lazaric, Michal Valko
We derive a new proof to show that the incremental resparsification algorithm proposed by Kelner and Levin (2013) produces a spectral sparsifier in high probability. We rigorously…
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback
Zheng Wen, Branislav Kveton, Michal Valko +1
We study the online influence maximization problem in social networks under the independent cascade model. Specifically, we aim to learn the set of "best influencers" in a social n…
Incremental Spectral Sparsification for Large-Scale Graph-Based Semi-Supervised Learning
Daniele Calandriello, Alessandro Lazaric, Michal Valko +1
While the harmonic function solution performs well in many semi-supervised learning (SSL) tasks, it is known to scale poorly with the number of samples. Recent successful and scala…