Regression under Human Assistance


  • Abir De MPI-SWS
  • Paramita Koley IIT kharagpur
  • Niloy Ganguly IIT Kharagpur
  • Manuel Gomez-Rodriguez MPI-SWS



Decisions are increasingly taken by both humans and machine learning models. However, machine learning models are currently trained for full automation—they are not aware that some of the decisions may still be taken by humans. In this paper, we take a first step towards the development of machine learning models that are optimized to operate under different automation levels. More specifically, we first introduce the problem of ridge regression under human assistance and show that it is NP-hard. Then, we derive an alternative representation of the corresponding objective function as a difference of nondecreasing submodular functions. Building on this representation, we further show that the objective is nondecreasing and satisfies α-submodularity, a recently introduced notion of approximate submodularity. These properties allow a simple and efficient greedy algorithm to enjoy approximation guarantees at solving the problem. Experiments on synthetic and real-world data from two important applications—medical diagnosis and content moderation—demonstrate that the greedy algorithm beats several competitive baselines.




How to Cite

De, A., Koley, P., Ganguly, N., & Gomez-Rodriguez, M. (2020). Regression under Human Assistance. Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), 2611-2620.



AAAI Technical Track: Humans and AI