Mathematics & Optimization

Rate-Optimal Subspace Estimation on Random Graphs NeurIPS 2021 Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projections NeurIPS 2021 Real-Time Pricing Optimization for Ride-Hailing Quality of Service IJCAI 2021 Reaping the Benefits of Bundling under High Production Costs AISTATS 2021 Rearchitecting Linux Storage Stack for µs Latency and High Throughput OSDI 2021 Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms RSS 2021 Reasoning-Based Learning of Interpretable ML Models IJCAI 2021 Recognizing Reduplicated Forms: Finite-State Buffered Machines ACL 2021 Reconstructing weighted voting schemes from partial information about their power indices COLT 2021 Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NeurIPS 2021 Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility AAAI 2021 Recursive Bayesian Networks: Generalising and Unifying Probabilistic Context-Free Grammars and Dynamic Bayesian Networks NeurIPS 2021 Reduced-Rank Regression with Operator Norm Error COLT 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Refined Learning Bounds for Kernel and Approximate k-Means NeurIPS 2021 Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem Interspeech 2021 Regime Switching Bandits NeurIPS 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Regret Bounds for Adaptive Nonlinear Control L4DC 2021 Regret Bounds for Gaussian-Process Optimization in Large Domains NeurIPS 2021 Regret Minimization in Heavy-Tailed Bandits COLT 2021 Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021 Regret-optimal measurement-feedback control L4DC 2021 Regularized ERM on random subspaces AISTATS 2021 Regularized Online Allocation Problems: Fairness and Beyond ICML 2021