Mathematics & Optimization

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 Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems ICML 2021 Online Unrelated Machine Load Balancing with Predictions Revisited ICML 2021 On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization ICML 2021 On lp-hyperparameter Learning via Bilevel Nonsmooth Optimization JMLR 2021 On Minimizing the Number of Running Buffers for Tabletop Rearrangement RSS 2021 On Multi-Armed Bandit Designs for Dose-Finding Trials JMLR 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 On Optimal Robustness to Adversarial Corruption in Online Decision Problems NeurIPS 2021 On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry NeurIPS 2021 On Riemannian Stochastic Approximation Schemes with Fixed Step-Size AISTATS 2021 On Robust Mean Estimation under Coordinate-level Corruption ICML 2021 On Robust Optimal Transport: Computational Complexity and Barycenter Computation NeurIPS 2021 On Solving Probabilistic Linear Diophantine Equations JMLR 2021 On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games AAAI 2021 On the Approximation Power of Two-Layer Networks of Random ReLUs COLT 2021 On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NeurIPS 2021 On the Complexity of Finding Justifications for Collective Decisions AAAI 2021