LogSumExp lower-bound paper: how slow-journal peer review made our proof distinctly better
prof_grimmer · x · 2026-11-18
The author recounts how their "elementary" LogSumExp lower-bound paper, published in the Journal of Complexity, grew through peer review. Reviewers pushed for more insight into why the inequality construction works, prompting the authors to add a vignette articulating a large family of such proofs — theirs optimizes over the family to yield the best one. The piece is also a defense of "slow" journal review over fast conference systems.
Related event: Peer Review Sharpens LogSumExp Lower Bound Paper(2 posts)→
More from Research
- Agentic AI Accelerates String Theory: Quark Mass Hierarchy Problem Sees Progress — weballergy · 2026-11-18
- New Preprint: Quark Mass Hierarchies from Smooth Heterotic String Theory — weballergy · 2026-11-18
- MIT study: AI-edited photos and videos plant over twice as many false memories — Justgototheeffinmoon · 2026-11-18
- Follow-up: a parameterized smoothing family yields strict improvements over LogSumExp in any dimension — prof_grimmer · 2026-11-18
- How Reviewers Pushed a LogSumExp Optimality Paper to Arbitrary Dimensions — prof_grimmer · 2026-11-18
- Is LogSumExp Optimal? A Peer-Reviewed Answer in the Journal of Complexity — prof_grimmer · 2026-11-18