KDD 2025 -Practical contextual bandits for large-scale structured discrete constrained opt. problems
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceCovers contextual bandits applied to large-scale structured discrete optimization with constraints. Practical algorithm at 2 minutes teaches bandit strategy applied to constrained problems relevant to operations.
A 2-minute video from Association for Computing Machinery (ACM): “KDD 2025 -Practical contextual bandits for large-scale structured discrete constrained opt. problems”.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.