Online linear optimization with sparsity constraints

MaRDI QIDQ7034368zbMATH OpenFDO

Authors Jun-Kun Wang, Chi-Jen Lu, Shou-De Lin

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/wang19b.html

zbMATH Keywords

banditonline learningsparsity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Probabilistic games; gambling (91A60)

Cites work

• Algorithm design
• Combinatorial bandits
• Efficient algorithms for online decision problems
• Efficient learning with partially observed attributes
• Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Regret in online combinatorial optimization

This page was built for publication: Online linear optimization with sparsity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034368)