Lin Chen

activity

20172021

most citedOnline Continuous Submodular Maximization: From Full-Information to Bandit Feedback

20 citations · 51 across the 9 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.CC2021

Tight running times for minimum $ℓ_{q}$ -norm load balancing: beyond exponential dependencies on $1/ ε$

Lin Chen, Liangde Tao, José Verschae

We consider a classical scheduling problem on $m$ identical machines. For an arbitrary constant $q > 1$ , the aim is to assign jobs to machines such that $\sum_{i = 1}^{m} C_{i}^{q}$ is minim…

cs.LG2021★ 2 cited

Feature Cross Search via Submodular Optimization

Lin Chen, Hossein Esfandiari, Gang Fu +2

In this paper, we study feature cross search as a fundamental primitive in feature engineering. The importance of feature cross search especially for the linear model has been know…

cs.LG2021★ 4 cited

Infinite-Horizon Offline Reinforcement Learning with Linear Function Approximation: Curse of Dimensionality and Algorithm

Lin Chen, Bruno Scherrer, Peter L. Bartlett

In this paper, we investigate the sample complexity of policy evaluation in infinite-horizon offline reinforcement learning (also known as the off-policy evaluation problem) with l…

Tight running times for minimum ℓq​-norm load balancing: beyond exponential dependencies on 1/ε

Feature Cross Search via Submodular Optimization

Infinite-Horizon Offline Reinforcement Learning with Linear Function Approximation: Curse of Dimensionality and Algorithm

Tight running times for minimum $ℓ_{q}$ -norm load balancing: beyond exponential dependencies on $1/ ε$