Search Results for author:
Found 6 papers, 2 papers with code
Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions
In this paper, we initiate the study of robustness in rank aggregation under the popular Bradley-Terry-Luce (BTL) model for pairwise comparisons.
Sublinear Algorithms for Hierarchical Clustering
At the heart of our algorithmic results is a view of the objective in terms of cuts in the graph, which allows us to use a relaxed notion of cut sparsifiers to do hierarchical clustering while introducing only a small distortion in the objective function.
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits
In this paper we study the trade-off between memory and regret when $B$ passes over the stream are allowed, for any $B \geq 1$, and establish tight regret upper and lower bounds for any $B$-pass algorithm.
Approximate optimization of convex functions with outlier noise
We study the problem of minimizing a convex function given by a zeroth order oracle that is possibly corrupted by {\em outlier noise}.
Sublinear Algorithms for $(Δ+ 1)$ Vertex Coloring
Any graph with maximum degree $\Delta$ admits a proper vertex coloring with $\Delta + 1$ colors that can be found via a simple sequential greedy algorithm in linear time and space.
Data Structures and Algorithms
Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs
Our techniques also give an algorithm that successively finds a matching in the support of a doubly stochastic matrix in expected time O(n\log^2 n) time, with O(m) pre-processing time; this gives a simple O(m+mn\log^2 n) time algorithm for finding the Birkhoff-von Neumann decomposition of a doubly stochastic matrix.
Data Structures and Algorithms Discrete Mathematics
