Continuous Optimization

Robust Algorithms for Recovering Planted r-Colorable Graphs COLT 2025 Robust Consensus Anchor Learning for Efficient Multi-view Subspace Clustering ICML 2025 Robustness of Quantum Algorithms for Nonconvex Optimization ICLR 2025 Robust random graph matching in Gaussian models via vector approximate message passing COLT 2025 Robust Sparsification via Sensitivity ICML 2025 Sample Complexity of Branch-length Estimation by Maximum Likelihood ICML 2025 Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses COLT 2025 Scalable Approximation Algorithms for p-Wasserstein Distance and Its Variants ICML 2025 Scalable Equilibrium Sampling with Sequential Boltzmann Generators ICML 2025 Scalable First-order Method for Certifying Optimal k-Sparse GLMs ICML 2025 Scalable Gaussian Processes with Latent Kronecker Structure ICML 2025 Scalable Knowledge Refactoring Using Constrained Optimisation AAAI 2025 Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy IJCAI 2025 Secant Line Search for Frank-Wolfe Algorithms ICML 2025 Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients JMLR 2025 SERENA: A Unified Stochastic Recursive Variance Reduced Gradient Framework for Riemannian Non-Convex Optimization ICML 2025 Settling the Maximin Share Fairness for Scheduling among Groups of Machines ICML 2025 Sharp bounds on aggregate expert error ALT 2025 Sharper Bounds for Chebyshev Moment Matching, with Applications COLT 2025 SIFAR: A Simple Faster Accelerated Variance-Reduced Gradient Method IJCAI 2025 Simple Randomized Rounding for Max-Min Eigenvalue Augmentation ICML 2025 Simplex Constrained Sparse Optimization via Tail Screening JMLR 2025 Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds JMLR 2025 Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs ICML 2025 SPAC: Sparse Partitioning and Adaptive Core Tensor Pruning Model for Knowledge Graph Completion AAAI 2025