"Efficient online algorithms for fast-rate regret bounds under sparsity."

Pierre Gaillard, Olivier Wintenberger (2018)

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-01-21

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.