
FriendlyCore: Practical Differentially Private Aggregation
Differentially private algorithms for common metric aggregation tasks, s...
read it

Differentially Private Approximate Quantiles
In this work we study the problem of differentially private (DP) quantil...
read it

Dynamic Connectivity in Disk Graphs
Let S be a set of n sites, each associated with a point in ℝ^2 and a rad...
read it

Differentially Private MultiArmed Bandits in the Shuffle Model
We give an (ε,δ)differentially private algorithm for the multiarmed ba...
read it

Online Weighted Bipartite Matching with a Sample
We study the classical online bipartite matching problem: One side of th...
read it

Online Markov Decision Processes with Aggregate Bandit Feedback
We study a novel variant of online finitehorizon Markov Decision Proces...
read it

Separating Adaptive Streaming from Oblivious Streaming
We present a streaming problem for which every adversariallyrobust stre...
read it

Locality Sensitive Hashing for Efficient Similar Polygon Retrieval
Locality Sensitive Hashing (LSH) is an effective method of indexing a se...
read it

The Sparse Vector Technique, Revisited
We revisit one of the most basic and widely applicable techniques in the...
read it

Dualitybased approximation algorithms for depth queries and maximum depth
We design an efficient data structure for computing a suitably defined a...
read it

Output sensitive algorithms for approximate incidences and their applications
An ϵapproximate incidence between a point and some geometric object (li...
read it

On Radial Isotropic Position: Theory and Algorithms
We review the theory of, and develop algorithms for transforming a finit...
read it

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity
We present a differentially private learner for halfspaces over a finite...
read it

Locality Sensitive Hashing for SetQueries, Motivated by Group Recommendations
Locality Sensitive Hashing (LSH) is an effective method to index a set o...
read it

Adversarially Robust Streaming Algorithms via Differential Privacy
A streaming algorithm is said to be adversarially robust if its accuracy...
read it

How to Find a Point in the Convex Hull Privately
We study the question of how to compute a point in the convex hull of an...
read it

Nearoptimal Regret Bounds for Stochastic Shortest Path
Stochastic shortest path (SSP) is a wellknown problem in planning and c...
read it

Privately Learning Thresholds: Closing the Exponential Gap
We study the sample complexity of learning threshold functions under the...
read it

Apprenticeship Learning via FrankWolfe
We consider the applications of the FrankWolfe (FW) algorithm for Appre...
read it

Influence Maximization with Few Simulations
Influence maximization (IM) is the problem of finding a set of s nodes i...
read it

Competitive Analysis with a Sample and the Secretary Problem
We extend the standard online worstcase model to accommodate past exper...
read it

Triangles and Girth in Disk Graphs and Transmission Graphs
Let S ⊂R^2 be a set of n sites, where each s ∈ S has an associated radiu...
read it

Thompson Sampling for Adversarial Bit Prediction
We study the Thompson sampling algorithm in an adversarial setting, spec...
read it

Average reward reinforcement learning with unknown mixing times
We derive and analyze learning algorithms for policy evaluation, apprent...
read it

General techniques for approximate incidences and their application to the camera posing problem
We consider the classical camera pose estimation problem that arises in ...
read it

Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies
We consider a settings of hierarchical reinforcement learning, in which ...
read it

Differentially Private Learning of Geometric Concepts
We present differentially private efficient algorithms for learning unio...
read it

Learning and Generalization for Matching Problems
We study a classic algorithmic problem through the lens of statistical l...
read it

Approximate MinimumWeight Matching with Outliers under Translation
Our goal is to compare two planar point sets by finding subsets of a giv...
read it

Improved bounds for multipass pairing heaps and pathbalanced binary search trees
We revisit multipass pairing heaps and pathbalanced binary search trees...
read it

Differentially Private kMeans with Constant Multiplicative Error
We design new differentially private algorithms for the Euclidean kmean...
read it

Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies
In this work, we provide theoretical guarantees for reward decomposition...
read it

Representations of Sparse Distributed Networks: A LocalitySensitive Approach
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a l...
read it

Selection from heaps, rowsorted matrices and X+Y using soft heaps
We use soft heaps to obtain simpler optimal algorithms for selecting the...
read it

Stabbing pairwise intersecting disks by five points
We present an O(n) expected time algorithm and an O(n n) deterministic ...
read it

Decomposing arrangements of hyperplanes: VCdimension, combinatorial dimension, and point location
We reexamine parameters for the two main space decomposition technique...
read it

Prophet Secretary: Surpassing the 11/e Barrier
In the Prophet Secretary problem, samples from a known set of probabilit...
read it
Haim Kaplan
is this you? claim profile