Mathematics & Optimization

Robust Reward Placement under Uncertainty IJCAI 2024 Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination ICML 2024 Robust Sparse Regression with Non-Isotropic Designs NeurIPS 2024 Robust Sparse Voting AISTATS 2024 Robust SVD Made Easy: A fast and reliable algorithm for large-scale data analysis AISTATS 2024 Robust variance-regularized risk minimization with concomitant scaling AISTATS 2024 ROME: Robust Multi-Modal Density Estimator IJCAI 2024 Roping in Uncertainty: Robustness and Regularization in Markov Games ICML 2024 Runtime Analysis of the SMS-EMOA for Many-Objective Optimization AAAI 2024 Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations AAAI 2024 Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs AAAI 2024 S$Ω$I: Score-based O-INFORMATION Estimation ICML 2024 Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage NeurIPS 2024 Safe and Robust Subgame Exploitation in Imperfect Information Games ICML 2024 Safe and Sparse Newton Method for Entropic-Regularized Optimal Transport NeurIPS 2024 Safe dynamic pricing for nonstationary network resource allocation L4DC 2024 Safe Linear Bandits over Unknown Polytopes COLT 2024 Safe online convex optimization with multi-point feedback L4DC 2024 Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel NeurIPS 2024 Sample-and-Bound for Non-convex Optimization AAAI 2024 Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models NeurIPS 2024 Sample Average Approximation for Black-Box Variational Inference UAI 2024 Sample Complexity Bounds for Estimating Probability Divergences under Invariances ICML 2024 Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut NeurIPS 2024 Sample Complexity of Posted Pricing for a Single Item NeurIPS 2024