activity
20182021
most citedStructure Adaptive Algorithms for Stochastic Bandits

11 citations · 14 across the 3 of their papers we have counts for

collaborators

8 papers

cs.LG20213 cited

One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning

Avrim Blum, Nika Haghtalab, Richard Lanas Phillips +1

In recent years, federated learning has been embraced as an approach for bringing about collaboration across large populations of learning agents. However, little is known about ho…

cs.LG2021

Robust learning under clean-label attack

Avrim Blum, Steve Hanneke, Jian Qian +1

We study the problem of robust learning under clean-label data-poisoning attacks, where the attacker injects (an arbitrary set of) correctly-labeled examples to the training set to…

cs.LG2020

Online Learning with Primary and Secondary Losses

Avrim Blum, Han Shao

We study the problem of online learning with primary and secondary losses. For example, a recruiter making decisions of which job applicants to hire might weigh false positives and…

cs.LG2020

Stochastic Bandits with Vector Losses: Minimizing -Norm of Relative Losses

Xuedong Shang, Han Shao, Jian Qian

Multi-armed bandits are widely applied in scenarios like recommender systems, for which the goal is to maximize the click rate. However, more factors should be considered, e.g., us…

stat.ML202011 cited

Structure Adaptive Algorithms for Stochastic Bandits

Rémy Degenne, Han Shao, Wouter M. Koolen

We study reward maximisation in a wide class of structured stochastic multi-armed bandit problems, where the mean rewards of arms satisfy some given structural constraints, e.g. li…

physics.comp-ph2020

Accurately Solving Physical Systems with Graph Learning

Han Shao, Tassilo Kugelstadt, Torsten Hädrich +4

Iterative solvers are widely used to accurately simulate physical systems. These solvers require initial guesses to generate a sequence of improving approximate solutions. In this…