Pages that link to "Item:Q5169692"

The following pages link to Regret in Online Combinatorial Optimization (Q5169692):

Displaying 22 items.

• An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
• Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
• Maximin effects in inhomogeneous large-scale data (Q2515497) (← links)
• Decentralized online integer programming problems with a coupling cardinality constraint (Q2669516) (← links)
• Regrets of proximal method of multipliers for online non-convex optimization with long term constraints (Q2679238) (← links)
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
• Simple regret optimization in online planning for Markov decision processes (Q2921080) (← links)
• (Q4558509) (← links)
• (Q4969138) (← links)
• Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
• Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
• Game of Thrones: Fully Distributed Learning for Multiplayer Bandits (Q4991671) (← links)
• Online Learning over a Finite Action Set with Limited Switching (Q4991672) (← links)
• Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science (Q5254790) (← links)
• (Q5381125) (← links)
• Small-Loss Bounds for Online Learning with Partial Information (Q5868953) (← links)
• Internal regret in on-line portfolio selection (Q5916205) (← links)
• Internal regret in on-line portfolio selection (Q5921688) (← links)
• Unifying mirror descent and dual averaging (Q6038659) (← links)
• The role of optimization in some recent advances in data-driven decision-making (Q6044973) (← links)
• Adversarial bandits with knapsacks (Q6551256) (← links)
• A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data (Q6555144) (← links)