2 citations · 2 across the 13 of their papers we have counts for
Showing 2023 · cs.LGShow all
2 papers · 2 filters
cs.LG2023
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…
cs.LG2023
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…