Mathematics & Optimization

Procedure Learning via Regularized Gromov-Wasserstein Optimal Transport WACV 2026 Prompt-OT: An Optimal Transport Regularization Paradigm for Knowledge Preservation in Vision-Language Model Adaptation WACV 2026 Provable Guarantees For Robust Feature Selection in Sparse Linear Models in High-Dimensions UAI 2026 Provably Correct k-Means Clustering of Persistence Diagrams UAI 2026 Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric Customization AAAI 2026 Public Goods Games in Directed Networks with Constraints on Sharing AAAI 2026 Putting Fair Division on the Map AAAI 2026 QuadSync: Quadrifocal Tensor Synchronization via Tucker Decomposition CVPR 2026 Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential ALT 2026 Quantized Stochastic Primal–Dual Methods for Distributed Optimization under Relaxed Global Geometry UAI 2026 Quantum Algorithms for Spectral Sums AAAI 2026 Quantum Lipschitz Bandits AAAI 2026 Quantum Non-Linear Bandit Optimization AAAI 2026 Quiet Planting for k-SAT, Multiple Solutions of Arbitrary Geometry COLT 2026 Random is Faster than Systematic in Multi-Objective Local Search AAAI 2026 Randomization for Faster Exact Optimization of Discounted Markov Decision Processes COLT 2026 Random Reshuffling Dominates Stochastic Gradient Descent COLT 2026 Rate-optimal community detection near the KS threshold via node-robust algorithms COLT 2026 Realistic Internal Dynamics Are Essential for Human-Like Control: An Optimal Feedback Control Perspective L4DC 2026 Reconfiguring Proportional Committees AAAI 2026 Reconstructing Riemannian Metrics From Random Geometric Graphs COLT 2026 Recovery of Planted Subgraphs COLT 2026 Recovery thresholds for hidden weighted sparse graphs (extended abstract) COLT 2026 Recursive Fréchet Mean Estimation UAI 2026 Refined Risk Bounds for Unbounded Losses via Transductive Priors JMLR 2026