activity
20052023
most citedAn Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization

28 citations · 203 across the 35 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.DS2020★ 1 cited

Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations

Vineet Goyal, Garud Iyengar, Rajan Udwani

We consider the problem of online allocation (matching and assortments) of reusable resources where customers arrive sequentially in an adversarial fashion and allocated resources…

stat.ML2020★ 5 cited

Sparsity-Agnostic Lasso Bandit

Min-hwan Oh, Garud Iyengar, Assaf Zeevi

We consider a stochastic contextual bandit problem where the dimension of the feature vectors is potentially large, however, only a sparse subset of features of cardinality $s_…

q-bio.SC2020★ 10 cited

Glycan processing in the Golgi -- optimal information coding and constraints on cisternal number and enzyme specificity

Alkesh Yadav, Quentin Vagne, Pierre Sens +2

Many proteins that undergo sequential enzymatic modification in the Golgi cisternae are displayed at the plasma membrane as cell identity markers. The modified proteins, called gly…

cs.LG2020

Sequential Anomaly Detection using Inverse Reinforcement Learning

Min-hwan Oh, Garud Iyengar

One of the most interesting application scenarios in anomaly detection is when sequential data are targeted. For example, in a safety-critical environment, it is crucial to have an…

cs.DS2020★ 15 cited

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources

Vineet Goyal, Garud Iyengar, Rajan Udwani

We consider the problem of online allocation (matching, budgeted allocations, and assortments) of reusable resources where an adversarial sequence of resource requests is revealed…