conftrace_

online learning algorithm

20 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret bound (1926) game theory (854) repeated game (30) multi-agent system (1819) mirror descent (148) multi-armed bandit (1098) contextual bandit (381) zero-sum game (190) regret minimization (315)

Papers

A Toolbox for Modelling Engagement with Educational Videos AAAI 2024
Convergence of No-Swap-Regret Dynamics in Self-Play NIPS 2024
Autoregressive Bandits AISTATS 2024
Strategic Usage in a Multi-Learner Setting AISTATS 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 NIPS 2024
Generalized Implicit Follow-The-Regularized-Leader ICML 2023
Doubly Fair Dynamic Pricing AISTATS 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
Optimistic Bandit Convex Optimization NIPS 2016
Learning in Games: Robustness of Fast Convergence NIPS 2016
Response-Based Approachability with Applications to Generalized No-Regret Problems JMLR 2015
An Online Learning Algorithm for Bilinear Models ICML 2015
Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques ICML 2014
Dimension-Free Exponentiated Gradient NIPS 2013
Regularized Distance Metric Learning:Theory and Algorithm NIPS 2009