Country
DyingExperts: EfficientAlgorithms withOptimalRegretBounds
Various results suggest that achieving optimal regret in the fully adversarial sleeping experts problem is computationally hard.
Tractable Density Estimationon Learned Manifolds with Conformal Embedding Flows
Brendan Leigh Ross Layer 6 AI brendan@layer6.ai
AdversarialReprogrammingRevisited
Adversarial reprogramming, introduced by Elsayed, Goodfellow, and SohlDickstein, seeks to repurpose a neural network to perform a different task, by manipulating its input without modifying its weights.
Global Convergence of Gradient Descent for Deep Linear Residual Networks
It is motivated by avoiding stable manifolds of saddle points.
Efficient Communication in Multi-Agent Reinforcement Learning via Variance Based Control
Sai Qian Zhang, Qi Zhang, Jieyu Lin
In the research literature, there have been three lines of research that try to mitigate the instability and inefficiency caused by decentralized execution.
The Elastic Lottery Ticket Hypothesis
Work was done when the author interned at Microsoft.