research
∙
05/31/2023
Active causal structure learning with advice
We introduce the problem of active causal structure learning with advice...
share
research
∙
05/03/2023
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else
We study the Online Traveling Salesperson Problem (OLTSP) with predictio...
research
∙
06/01/2022
Learning-Augmented Algorithms for Online TSP on the Line
We study the online Traveling Salesman Problem (TSP) on the line augment...
research
∙
09/11/2021
Accelerated Distributed Laplacian Solvers via Shortcuts
In this work we refine the analysis of the distributed Laplacian solver ...
research
∙
08/03/2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model
The model was recently introduced by Augustine et al. <cit.> in order t...
research
∙
07/17/2021
Learning Augmented Online Facility Location
Following the research agenda initiated by Munoz Vassilvitskii [1] a...
research
∙
10/22/2020
Computationally and Statistically Efficient Truncated Regression
We provide a computationally and statistically efficient estimator for t...
research
∙
10/18/2020
Robust Learning under Strong Noise via SQs
This work provides several new insights on the robustness of Kearns' sta...
research
∙
09/14/2020
Optimal Testing of Discrete Distributions with High Probability
We study the problem of testing discrete distributions with a focus on t...
research
∙
06/01/2020
Secretary and Online Matching Problems with Machine Learned Advice
The classical analysis of online algorithms, due to its worst-case natur...
research
∙
07/06/2019
Towards Testing Monotonicity of Distributions Over General Posets
In this work, we consider the sample complexity required for testing the...
research
∙
06/24/2019
Distribution-Independent PAC Learning of Halfspaces with Massart Noise
We study the problem of distribution-independent PAC learning of halfsp...
research
∙
06/11/2019
Communication and Memory Efficient Testing of Discrete Distributions
We study distribution testing with communication and memory constraints ...
research
∙
09/21/2018
Local Computation Algorithms for the Lovász Local Lemma
We consider the task of designing Local Computation Algorithms (LCA) for...
research
∙
09/11/2018
Efficient Statistics, in High Dimensions, from Truncated Samples
We provide an efficient algorithm for the classical problem, going back ...
research
∙
02/22/2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
We present O( n)-round algorithms in the Massively Parallel Computation ...
research
∙
09/12/2017
