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
98 results for “keyword:"nonconvex"” in ICLR 2027. 12 withdrawn or desk rejected listed apart. clearsort:relevanceratingnewestmost read
[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]Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness▲3952.67
[PDF]Complex Phase Retrieval via Conditional Quantiles: Finite-Sample Recovery without Noise Moments▲143.33
[PDF]A Mini-batch Proximal Adam Algorithm for Nonsmooth Nonconvex Stochastic Composite Optimization via MCMC Sampling▼5.8k2.33
[PDF]Muon with Finite Newton–Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimization▼2443.33
[PDF]Bregman–Gromov–Wasserstein Clustering: Finite-Length Whole-Sequence Convergence and Local Initialization Consistency▼1.2k1.67
[PDF]SCMO: Stochastic Control for Optimization over Probability Measures on Infinite-Dimensional Spaces▼4.5k2.67
[PDF]Learning Reliable Skills from Sparse Online Feedback for Cold-Start LLM-Based Molecular Optimization▲3.0k2.33
[PDF]Momentum Makes (Adaptive) Subgradient Methods Optimal for Stochastic Nonsmooth Nonconvex Optimization▼5.8k2.33
[PDF]Rank-1 Factored Gradient Descent without Restricted Isometry: Application to Quantum Pure State Tomography on Multi-Qubits▼4.3k2.00
[PDF]Obtaining First-Order Game-Stationary Points for Smooth Nonconvex–Nonconcave Minimax Problems via First-Order Methods▲3952.67
[PDF]Communication-Efficient Agnostic Federated Learning via Faster Convergence and Compression▲5103.00
[PDF]On computing Goldstein approximate second-order stationary points of structured nonsmooth nonconvex programs▲432.75
[PDF]On the hardness of deterministic second-order optimization of functions with Lipschitz gradients▼1.2k1.67
[PDF]Dense Weak Hiding: Closing Complexity Gaps in Nonconvex and PL Finite-Sum Optimization under Individual Smoothness▼2443.33
Withdrawn or desk rejected (12)
[PDF]Low-Rank Recovery of High-Order Neighbor Structure for Scalable Multi-View ClusteringWithdrawn2.00
[PDF]A Fine-Grained Analysis of the LoRA Fine-Tuning Landscape with Implications for Data SelectionDesk rejected