Skip to content
conftrace_

Papers (including subtopics)

Online Boosting with Bandit Feedback ALT 2021 Online Convex Optimization with Continuous Switching Constraint NeurIPS 2021 Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation AAAI 2021 Online Facility Location with Multiple Advice NeurIPS 2021 Online false discovery rate control for anomaly detection in time series NeurIPS 2021 Online Forgetting Process for Linear Regression Models AISTATS 2021 Online Graph Dictionary Learning ICML 2021 Online Knapsack with Frequency Predictions NeurIPS 2021 Online Learning from Optimal Actions COLT 2021 Online Learning in Periodic Zero-Sum Games NeurIPS 2021 Online Learning in Unknown Markov Games ICML 2021 Online Learning Meets Machine Translation Evaluation: Finding the Best Systems with the Least Human Effort ACL 2021 Online Learning of a Probabilistic and Adaptive Scene Representation CVPR 2021 Online Learning with Optimism and Delay ICML 2021 Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games COLT 2021 Online Markov Decision Processes with Aggregate Bandit Feedback COLT 2021 Online Model Selection for Reinforcement Learning with Function Approximation AISTATS 2021 Online Multi-Armed Bandits with Adaptive Inference NeurIPS 2021 Online Non-Monotone DR-Submodular Maximization AAAI 2021 Online Optimal Control with Affine Constraints AAAI 2021 Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021 Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with $\sqrt$T Regret ICML 2021 Online Robust Reinforcement Learning with Model Uncertainty NeurIPS 2021 Online Sparse Reinforcement Learning AISTATS 2021 Online stochastic gradient descent on non-convex losses from high-dimensional inference JMLR 2021