2 citations · 3 across the 3 of their papers we have counts for
4 papers
Online Convex Optimization with Unbounded Memory
Raunak Kumar, Sarah Dean, Robert Kleinberg
Online convex optimization (OCO) is a widely used framework in online learning. In each round, the learner chooses a decision in a convex set and an adversary chooses a convex loss…
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem
Raunak Kumar, Robert Kleinberg
Bandits with knapsacks (BwK) is an influential model of sequential decision-making under uncertainty that incorporates resource consumption constraints. In each round, the decision…
Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent
Frederik Kunstner, Raunak Kumar, Mark Schmidt
Expectation maximization (EM) is the default algorithm for fitting probabilistic models with missing or latent variables, yet we lack a full understanding of its non-asymptotic con…
Retrieving Top Weighted Triangles in Graphs
Raunak Kumar, Paul Liu, Moses Charikar +1
Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and a number of methods have been developed for scaling subgraph counting to large graphs. Ma…