
Online Bipartite Matching with Predicted Degrees
We propose a model for online graph problems where algorithms are given ...
read it

Optimal (Euclidean) Metric Compression
We study the problem of representing all distances between n points in ℝ...
read it

Randomized Dimensionality Reduction for Facility Location and SingleLinkage Clustering
Random dimensionality reduction is a versatile tool for speeding up algo...
read it

Learningbased Support Estimation in Sublinear Time
We consider the problem of estimating the number of distinct elements in...
read it

Faster Kernel Matrix Algebra via Density Estimation
We study fast algorithms for computing fundamental properties of a posit...
read it

Online Page Migration with ML Advice
We consider online algorithms for the page migration problem that use pr...
read it

Estimating Entropy of Distributions in Constant Space
We consider the task of estimating the entropy of kary distributions fr...
read it

LearningBased LowRank Approximations
We introduce a "learningbased" algorithm for the lowrank decomposition...
read it

Scalable Nearest Neighbor Search for Optimal Transport
The Optimal Transport (a.k.a. Wasserstein) distance is an increasingly p...
read it

(Learned) Frequency Estimation Algorithms under Zipfian Distribution
The frequencies of the elements in a data stream are an important statis...
read it

Composable Coresets for Determinant Maximization: A Simple NearOptimal Algorithm
"Composable coresets" are an efficient framework for solving optimizati...
read it

SampleOptimal LowRank Approximation of Distance Matrices
A distance matrix A ∈ R^n × m represents all pairwise distances, A_ij=d(...
read it

Set Cover in Sublinear Time
We study the classic set cover problem from the perspective of sublinea...
read it

Scalable Fair Clustering
We study the fair variant of the classic kmedian problem introduced by ...
read it

Learning SublinearTime Indexing for Nearest Neighbor Search
Most of the efficient sublineartime indexing algorithms for the highdi...
read it

Learning Space Partitions for Nearest Neighbor Search
Space partitions of R^d underlie a vast and important class of fast near...
read it

Composable Coresets for Determinant Maximization Problems via Spectral Spanners
We study a spectral generalization of classical combinatorial graph span...
read it

Approximate Nearest Neighbors in Limited Space
We consider the (1+ϵ)approximate nearest neighbor search problem: given...
read it

Approximate Nearest Neighbor Search in High Dimensions
The nearest neighbor problem is defined as follows: Given a set P of n p...
read it

Practical DataDependent Metric Compression with Provable Guarantees
We introduce a new distancepreserving compact representation of multid...
read it

On the FineGrained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks
Empirical risk minimization (ERM) is ubiquitous in machine learning and ...
read it