Research
We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the urn scheme, each vertex of a…
We study the problem of allocating a set of indivisible items among agents with additive valuations with the goal of maximizing the geometric mean of the agents’ valuations, i.e., the Nash social welfare. This problem…
Neural networks have become the main workhorse of supervised learning, and their efficient training is an important technical challenge which has received a lot of attention. While stochastic gradient descent (SGD) with momentum works well…
