Deep Learning Evidence for Global Optimality of Gerver’s Sofa

The moving sofa problem, introduced by Leo Moser in 1966, seeks to determine the maximal area of a 2D shape that can navigate an L-shaped corridor of unit width. Joseph Gerver’s 1992 solution, providing a lower bound of approximately 2.2195, is the best known, though its global optimality remains unproven. This paper leverages neural networks’ approximation power and recent advances in invexity optimization to explore global optimality. We propose two approaches supporting Gerver’s conjecture that his sofa is the unique global maximum. The first approach uses continuous function learning, discarding assumptions about the monotonicity, symmetry, and differentiability of sofa movements. The sofa area is computed as a differentiable function using our “waterfall” algorithm, with the loss function incorporating both differential terms and initial conditions based on physics-informed machine learning. Extensive training with diverse network initialization consistently converges to Gerver’s solution. The second approach applies discrete optimization to the Kallus–Romik upper bound, improving it from 2.37 to 2.3337 for five rotation angles. As the number of angles increases, our model asymptotically converges to Gerver’s area from above, indicating that no larger sofa exists.