9 citations · 13 across the 4 of their papers we have counts for
8 papers
Non-uniform packings
Lee-Ad Gottlieb, Aryeh Kontorovich
We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the…
Functions with average smoothness: structure, algorithms, and learning
Yair Ashlagi, Lee-Ad Gottlieb, Aryeh Kontorovich
We initiate a program of average smoothness analysis for efficiently learning real-valued functions on metric spaces. Rather than using the Lipschitz constant as the regularizer, w…
Nested Barycentric Coordinate System as an Explicit Feature Map
Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich +2
We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning…
Apportioned Margin Approach for Cost Sensitive Large Margin Classifiers
Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich
We consider the problem of cost sensitive multiclass classification, where we would like to increase the sensitivity of an important class at the expense of a less important one. W…
Classification in asymmetric spaces via sample compression
Lee-Ad Gottlieb, Shira Ozeri
We initiate the rigorous study of classification in quasi-metric spaces. These are point sets endowed with a distance function that is non-negative and also satisfies the triangle…
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces
Lee-Ad Gottlieb, Yair Bartal
We give an algorithm that computes a -approximate Steiner forest in near-linear time . This is a dramatic improvement upon the…