Mathematics & Optimization

Random Tensor Theory for Tensor Decomposition AAAI 2022 Rapid Convergence of Informed Importance Tempering AISTATS 2022 Rapidly Mixing Multiple-try Metropolis Algorithms for Model Selection Problems NeurIPS 2022 Rate-Distortion Theoretic Bounds on Generalization Error for Distributed Learning NeurIPS 2022 Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms COLT 2022 Rate of Convergence of Polynomial Networks to Gaussian Processes COLT 2022 Rate-Optimal Online Convex Optimization in Adaptive Linear Control NeurIPS 2022 Real-Time Driver-Request Assignment in Ridesourcing AAAI 2022 Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion NeurIPS 2022 RECAPP: Crafting a More Efficient Catalyst for Convex Optimization ICML 2022 Reconfiguring Shortest Paths in Graphs AAAI 2022 Reconstruction on Trees and Low-Degree Polynomials NeurIPS 2022 Recoverability Landscape of Tree Structured Markov Random Fields under Symmetric Noise AISTATS 2022 Recruitment Strategies That Take a Chance NeurIPS 2022 Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT NeurIPS 2022 Re-evaluating Word Mover’s Distance ICML 2022 Refined Convergence Rates for Maximum Likelihood Estimation under Finite Mixture Models ICML 2022 Refined Lower Bounds for Nearest Neighbor Condensation ALT 2022 Registration of Human Point Set Using Automatic Key Point Detection and Region-Aware Features WACV 2022 Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization AISTATS 2022 Regret Bounds for Risk-Sensitive Reinforcement Learning NeurIPS 2022 Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation ICML 2022 Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data JMLR 2022 Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games NeurIPS 2022 Reinforced Genetic Algorithm for Structure-based Drug Design NeurIPS 2022