activity
20142022
most citedOnline Optimization of Smoothed Piecewise Constant Functions

12 citations · 33 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2022

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…

cs.LG2019★ 9 cited

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…

cs.DS2018

Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?

Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu

Motivated by crowdsourced computation, peer-grading, and recommendation systems, Braverman, Mao and Weinberg [STOC'16] studied the \emph{query} and \emph{round} complexity of funda…

cs.DS2017★ 10 cited

Hierarchical Clustering: Objective Functions and Algorithms

Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn +1

Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering…

cs.LG2016★ 12 cited

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…

cs.CG2014★ 2 cited

The Unreasonable Success of Local Search: Geometric Optimization

Vincent Cohen-Addad, Claire Mathieu

What is the effectiveness of local search algorithms for geometric problems in the plane? We prove that local search with neighborhoods of magnitude is an approximation sch…

cs.DS2014

Energy-efficient algorithms for non-preemptive speed-scaling

Vincent Cohen-Addad, Zhentao Li, Claire Mathieu +1

We improve complexity bounds for energy-efficient speed scheduling problems for both the single processor and multi-processor cases. Energy conservation has become a major concern,…