Skip to content
conftrace_

online learning

1,990 papers

OL

Papers

Learning to Incentivize Information Acquisition: Proper Scoring Rules Meet Principal-Agent Model ICML 2023 Learning to Learn Better for Video Object Segmentation AAAI 2023 Learning to Rank under Multinomial Logit Choice JMLR 2023 Leveraging Demonstrations to Improve Online Learning: Quality Matters ICML 2023 Levin Tree Search with Context Models IJCAI 2023 Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games NeurIPS 2023 Long-Term Fairness with Unknown Dynamics NeurIPS 2023 Meta-Learning Adversarial Bandit Algorithms NeurIPS 2023 Meta-Learning Online Adaptation of Language Models EMNLP 2023 Minimizing Dynamic Regret on Geodesic Metric Spaces COLT 2023 Mixed-Effect Thompson Sampling AISTATS 2023 Multi-Agent Intention Recognition and Progression IJCAI 2023 Multiclass Online Learning and Uniform Convergence COLT 2023 Multiplier Bootstrap-based Exploration ICML 2023 Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning NeurIPS 2023 Nearest Neighbour with Bandit Feedback NeurIPS 2023 Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression ICML 2023 Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime ICML 2023 Near-Optimal Differentially Private Reinforcement Learning AISTATS 2023 New Insights for the Stability-Plasticity Dilemma in Online Continual Learning ICLR 2023 Non-Convex Bilevel Optimization with Time-Varying Objective Functions NeurIPS 2023 Non-stationary Online Learning with Memory and Non-stochastic Control JMLR 2023 Non-stationary Reinforcement Learning under General Function Approximation ICML 2023 Nonstochastic Contextual Combinatorial Bandits AISTATS 2023 No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution AISTATS 2023