32 citations · 140 across the 32 of their papers we have counts for
8 papers · 1 filter
Fast and Accurate -means++ via Rejection Sampling
Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard +2
-means++ \cite{arthur2007k} is a widely used clustering algorithm that is easy to implement, has nice theoretical guarantees and strong empirical performance. Despite its wide a…
Consistent k-Clustering for General Metrics
Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard +1
Given a stream of points in a metric space, is it possible to maintain a constant approximate clustering by changing the cluster centers only a small number of times during the ent…
Secretaries with Advice
Paul Dütting, Silvio Lattanzi, Renato Paes Leme +1
The secretary problem is probably the purest model of decision making under uncertainty. In this paper we ask which advice can we give the algorithm to improve its success probabil…
On Mean Estimation for Heteroscedastic Random Variables
Luc Devroye, Silvio Lattanzi, Gabor Lugosi +1
We study the problem of estimating the common mean of independent symmetric random variables with different and unknown standard deviations .…
InstantEmbedding: Efficient Local Node Representations
Ştefan Postăvaru, Anton Tsitsulin, Filipe Miguel Gonçalves de Almeida +3
In this paper, we introduce InstantEmbedding, an efficient method for generating single-node representations using local PageRank computations. We theoretically prove that our appr…
Sliding Window Algorithms for k-Clustering Problems
Michele Borassi, Alessandro Epasto, Silvio Lattanzi +2
The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest elements should be used for analysis. The goal is to desi…
Fully Dynamic Algorithm for Constrained Submodular Optimization
Silvio Lattanzi, Slobodan Mitrović, Ashkan Norouzi-Fard +2
The task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarizat…
Exact Recovery of Mangled Clusters with Same-Cluster Queries
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi +1
We study the cluster recovery problem in the semi-supervised active clustering framework. Given a finite set of input points, and an oracle revealing whether any two points lie in…