12 citations · 33 across the 7 of their papers we have counts for
3 papers · 1 filter
Beyond Impossibility: Balancing Sufficiency, Separation and Accuracy
Limor Gultchin, Vincent Cohen-Addad, Sophie Giffard-Roisin +2
Among the various aspects of algorithmic fairness studied in recent years, the tension between satisfying both \textit{sufficiency} and \textit{separation} -- e.g. the ratios of po…
Online k-means Clustering
Vincent Cohen-Addad, Benjamin Guedj, Varun Kanade +1
We study the problem of online clustering where a clustering algorithm has to assign a new point that arrives to one of clusters. The specific formulation we use is the -mea…
Online Optimization of Smoothed Piecewise Constant Functions
Vincent Cohen-Addad, Varun Kanade
We study online optimization of smoothed piecewise constant functions over the domain [0, 1). This is motivated by the problem of adaptively picking parameters of learning algorith…