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
59 results for “keyword:"lower bounds"” in ICLR 2027. 7 withdrawn or desk rejected listed apart. clearsort:relevanceratingnewestmost read
[PDF]Exploration-Free Learning Needs an Exact Plug-In: Information Floors and Sharp Regret Constants for Event-Triggered Estimation▼1361.33
[PDF]Query Complexity of Forward-Only Hebbian Learning: Theory and a Native Fit for Diffusion Models▼4.3k2.00
[PDF]Quantum Algorithms for Risk-Sensitive Bandits: Matching Upper and Lower Bounds for Quantum CVaR Estimation▼4.5k2.67
[PDF]Maximin-Sufficient Learning under Strategic Feedback in Zero-Sum Games with an Informed Opponent▼4.3k2.00
[PDF]Sampling the Shell: From Exponential to Constant Sample Complexity in Negative-Sampling Anomaly Detection▼5.8k2.33
[PDF]Revisiting AdaGrad in Stochastic Convex Optimization: Last Iterates, High Probability, and Lower Bounds▼5.8k2.33
[PDF]Read Depth and Broadcast Depth: What Sharing Keys and Values Across Layers Costs a Transformer▲3.0k2.33
[PDF]Exact Softmax Attention Has the Rectangular Matrix-Multiplication Exponent in Extended Arithmetic Circuits▼1.2k3.00
Withdrawn or desk rejected (7)
[PDF]Lower Bounds For Gradient-Free Convex Optimization And Convex-Concave Saddle-Point ProblemsDesk rejected
[PDF]Sharp Root-Exponential Rates for Smooth Convex Optimization in a Serial Finite-Bit ModelDesk rejected2.33