Skip to content
conftrace_

Papers (including subtopics)

Online k-means Clustering AISTATS 2021 Online Knapsack with Frequency Predictions NeurIPS 2021 Online Learning for Load Balancing of Unknown Monotone Resource Allocation Games ICML 2021 Online Learning from Optimal Actions COLT 2021 Online learning in MDPs with linear function approximation and bandit feedback. NeurIPS 2021 Online Learning in Periodic Zero-Sum Games NeurIPS 2021 Online Learning in Variable Feature Spaces under Incomplete Supervision AAAI 2021 Online Learning Meets Machine Translation Evaluation: Finding the Best Systems with the Least Human Effort ACL 2021 Online Learning of Facility Locations ALT 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 Market Equilibrium with Application to Fair Division NeurIPS 2021 Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm 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 Posted Pricing with Unknown Time-Discounted Valuations AAAI 2021 Online Risk-Averse Submodular Maximization IJCAI 2021 Online Robust Control of Nonlinear Systems with Large Uncertainty AISTATS 2021 Online Search with Maximum Clearance AAAI 2021 Online Selection Problems against Constrained Adversary ICML 2021 Online Selective Classification with Limited Feedback NeurIPS 2021 Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits NeurIPS 2021 Online stochastic gradient descent on non-convex losses from high-dimensional inference JMLR 2021