A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are...

There is growing concern about "algorithmic bias" - that predictive algorithms used in decision-making might bake in or exacerbate discrimination in society. When will these "biases" arise? What should be done about them? We argue that such questions are naturally answered using the tools of...

This paper studies how market competition influences the algorithmic design choices of firms in the context of targeting. Firms face the general trade-off between bias and variance when choosing the design of a supervised learning algorithm in terms of model complexity or the number of...

In the long run, we are all dead. Nonetheless, when studying the short-run dynamics of economic models, it is crucial to consider boundary conditions that govern long-run, forward-looking behavior, such as transversality conditions. We demonstrate that machine learning (ML) can automatically...