online learning algorithm

A Toolbox for Modelling Engagement with Educational Videos AAAI 2024 Autoregressive Bandits AISTATS 2024 Convergence of No-Swap-Regret Dynamics in Self-Play NeurIPS 2024 Convergence of Online Learning Algorithm for a Mixture of Multiple Linear Regressions ICML 2024 Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion AISTATS 2024 Maximizing utility in multi-agent environments by anticipating the behavior of other learners NeurIPS 2024 Strategic Usage in a Multi-Learner Setting AISTATS 2024 Doubly Fair Dynamic Pricing AISTATS 2023 Generalized Implicit Follow-The-Regularized-Leader ICML 2023 Solving Linear Programs with Fast Online Learning Algorithms ICML 2023 Incremental Sense Weight Training for In-Depth Interpretation of Contextualized Word Embeddings (Student Abstract) AAAI 2020 Monotone Learning with Rectified Wire Networks JMLR 2019 Multi-objective Contextual Bandit Problem with Similarity Information AISTATS 2018 Macro Grammars and Holistic Triggering for Efficient Semantic Parsing EMNLP 2017 Learning in Games: Robustness of Fast Convergence NeurIPS 2016 Optimistic Bandit Convex Optimization NeurIPS 2016 An Online Learning Algorithm for Bilinear Models ICML 2015 Response-Based Approachability with Applications to Generalized No-Regret Problems JMLR 2015 Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques ICML 2014 Dimension-Free Exponentiated Gradient NeurIPS 2013 Regularized Distance Metric Learning:Theory and Algorithm NeurIPS 2009