Mathematics & Optimization

Rethinking the Variational Interpretation of Accelerated Optimization Methods NeurIPS 2021 Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NeurIPS 2021 Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis AAAI 2021 Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing ICML 2021 Revenue maximization via machine learning with noisy data NeurIPS 2021 Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021 Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization AISTATS 2021 Revisiting the Uniform Information Density Hypothesis EMNLP 2021 Revitalizing Optimization for 3D Human Pose and Shape Estimation: A Sparse Constrained Formulation ICCV 2021 Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021 Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation NeurIPS 2021 Riemannian Convex Potential Maps ICML 2021 Riemannian Embedding Banks for Common Spatial Patterns with EEG-based SPD Neural Networks AAAI 2021 Riemannian Stochastic Recursive Momentum Method for non-Convex Optimization IJCAI 2021 RIM: Reliable Influence-based Active Learning on Graphs NeurIPS 2021 Risk Bounds and Calibration for a Smart Predict-then-Optimize Method NeurIPS 2021 Robust Allocations with Diversity Constraints NeurIPS 2021 Robust Auction Design in the Auto-bidding World NeurIPS 2021 Robust Contextual Bandits via Bootstrapping AAAI 2021 Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free ICML 2021 Robust error bounds for quantised and pruned neural networks L4DC 2021 Robust Finite-State Controllers for Uncertain POMDPs AAAI 2021 Robustifying Algorithms of Learning Latent Trees with Vector Variables NeurIPS 2021