We study pure exploration with infinitely many bandit arms generated i.i...
We study the sample complexity of learning ReLU neural networks from the...
We advance the study of incentivized bandit exploration, in which arm ch...
We investigate one of the most basic problems in streaming algorithms:
a...
We study efficient optimization of the Hamiltonians of multi-species
sph...
We consider the classic question of state tomography: given copies of an...
We consider the Sherrington-Kirkpatrick model of spin glasses at
high-te...
We study the stochastic multi-player multi-armed bandit problem. In this...
Given a graph G of degree k over n vertices, we consider the problem of
...
We study the problem of algorithmically optimizing the Hamiltonian H_N o...
Domain generalization aims at performing well on unseen test environment...
Classically, data interpolation with a parametrized model class is possi...
What functions, when applied to the pairwise Manhattan distances between...
We consider the cooperative multi-player version of the stochastic
multi...
We consider the spherical perceptron with Gaussian disorder. This is the...
We consider a generalization of the fundamental online metrical service
...
Graph compression or sparsification is a basic information-theoretic and...
We introduce the problem of k-chasing of convex functions, a simultaneou...
We consider incentivized exploration: a version of multi-armed bandits w...
We show the existence of O(f(c)k) sized vertex sparsifiers that preserve...
In the chasing convex bodies problem, an online player receives a reques...
We consider the non-stochastic version of the (cooperative) multi-player...
We address online combinatorial optimization when the player has a prior...
The convex body chasing problem, introduced by Friedman and Linial, is a...
Let F be a family of sets in some metric space. In the
F-chasing problem...
This article concerns the expressive power of depth in deep feed-forward...