2 citations · 2 across the 13 of their papers we have counts for
4 papers · 1 filter
Fair Polylog-Approximate Low-Cost Hierarchical Clustering
Marina Knittel, Max Springer, John Dickerson +1
Research in fair machine learning, and particularly clustering, has been crucial in recent years given the many ethical controversies that modern intelligent systems have posed. Ah…
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin +1
We present an oracle-efficient relaxation for the adversarial contextual bandits problem, where the contexts are sequentially drawn i.i.d from a known distribution and the cost seq…
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements
MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami
We here address the problem of fairly allocating indivisible goods or chores to agents with weights that define their entitlement to the set of indivisible resources. Stemming…
Optimal Sparse Recovery with Decision Stumps
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Max Springer
Decision trees are widely used for their low computational cost, good predictive performance, and ability to assess the importance of features. Though often used in practice for fe…