We study online meta-learning with bandit feedback, with the goal of
imp...
We consider stochastic convex optimization problems where the objective ...
We consider distributed learning scenarios where M machines interact wit...
Many compression techniques have been proposed to reduce the communicati...
We study meta-learning for adversarial multi-armed bandits. We consider ...
We consider stochastic optimization problems where data is drawn from a
...
We investigate robust linear regression where data may be contaminated b...
We develop an algorithmic framework for solving convex optimization prob...
In this work we investigate stochastic non-convex optimization problems ...
We consider stochastic convex optimization problems, where several machi...
Many applications in machine learning can be framed as minimization prob...
We propose a novel adaptive, accelerated algorithm for the stochastic
co...
We consider the problem of training machine learning models in a risk-av...
Adaptive importance sampling for stochastic optimization is a promising
...
We consider a setting where multiple players sequentially choose among a...
We consider variational inequalities coming from monotone operators, a
s...
Generative Adversarial Networks (GANs) have shown great results in accur...
We present a novel method for convex unconstrained optimization that, wi...
We introduce a novel method to learn a policy from unsupervised
demonstr...
We consider the use of no-regret algorithms to compute equilibria for
pa...
Modern stochastic optimization methods often rely on uniform sampling wh...
DR-submodular continuous functions are important objectives with wide
re...
We consider the problem of training generative models with a Generative
...
We present an approach towards convex optimization that relies on a nove...
The weighted k-nearest neighbors algorithm is one of the most fundamenta...
A commonly used heuristic in non-convex optimization is Normalized Gradi...