NeurIPS 2026 reviews are up: reviews, scores, rebuttals and meta-reviews for 7,877 papers. See the highest rated
acceptodds: the papers of ICLR 2027
121 results for “keyword:"convex optimization"” in ICLR 2027. 20 withdrawn or desk rejected listed apart. clearsort:relevanceratingnewestmost read
[PDF]Partial Participation: Guarantees of Local Step Convergence for Unified Client Selection in the Non-Convex Case▼1.2k1.67
[PDF]Improved KKT Complexity for First-Order Bilevel Optimization under Weak Lower-Level Convexity▼4.3k2.00
[PDF]Non-Convex Online SGD with Dependent Data: Last-Iterate Convergence and Temporal Preconditioning▼1.2k1.67
[PDF]-Support Pruning: Tight Convex Relaxation and Principled Optimization for N:M LLM Pruning▲5103.00
[PDF]A New Approach to Bilevel Optimization: A Value-Centric Perspective via a Distributional Follower▼5.8k2.33
[PDF]Conditional Diffusion without ERM Oracles: From Finite Neural Training to Sampling Guarantees▼5.8k2.33
[PDF]Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning▼1361.33
[PDF]Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov–Wasserstein Problems▲5103.00
[PDF]Revisiting AdaGrad in Stochastic Convex Optimization: Last Iterates, High Probability, and Lower Bounds▼5.8k2.33
[PDF]Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization▼3.7k2.25
[PDF]Smooth Spectral Operators for Indefinite Hessians: Relative Resolution, Stability, and Matrix-Free Approximation▼1611.50
[PDF]Complex Phase Retrieval via Conditional Quantiles: Finite-Sample Recovery without Noise Moments▲153.33
[PDF]Optimal Recursive Composition and Dyadic Phase Laws for Gradient Descent with Predetermined Stepsizes▲5103.00
[PDF]Muon with Finite Newton–Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimization▼2433.33
[PDF]Bregman–Gromov–Wasserstein Clustering: Finite-Length Whole-Sequence Convergence and Local Initialization Consistency▼1.2k1.67
[PDF]The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives▼4.5k2.67
[PDF]Optimal User-Level Private Stochastic Convex Optimization and Mean Estimation with Heavy Tails▲3.8k2.50
[PDF]ABrA-GD: Adaptive Bregman Accelerated Gradient Descent for Relatively Smooth and (Strongly-)Convex Optimization▼4.3k2.00
[PDF]SCMO: Stochastic Control for Optimization over Probability Measures on Infinite-Dimensional Spaces▼4.5k2.67
Withdrawn or desk rejected (20)
[PDF]Lower Bounds For Gradient-Free Convex Optimization And Convex-Concave Saddle-Point ProblemsDesk rejected
[PDF]A Fine-Grained Analysis of the LoRA Fine-Tuning Landscape with Implications for Data SelectionDesk rejected
[PDF]Joining Late in Decentralized Federated Learning: A Theoretical Analysis and Two Local RulesDesk rejected