Search Results for author:
Found 3 papers, 2 papers with code
Online Convex Optimization with Unbounded Memory
As a special case, we prove the first non-trivial lower bound for OCO with finite memory \citep{anavaHM2015online}, which could be of independent interest, and also improve existing upper bounds.
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem
Bandits with knapsacks (BwK) is an influential model of sequential decision-making under uncertainty that incorporates resource consumption constraints.
Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent
In this work we first show that for the common setting of exponential family distributions, viewing EM as a mirror descent algorithm leads to convergence rates in Kullback-Leibler (KL) divergence.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
