arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.06463cs.CGcs.LGmath.OC
收藏

(超)球曲面的优化

Optimization on the Surface of the (Hyper)-Sphere

University of California, Santa Cruz(加州大学圣克鲁兹分校);Purdue University(普渡大学)

Parameswaran Raman, Jiasen Yang

摘要:

汤姆逊问题是研究$k$维球体表面带电粒子的$n$数分布的经典物理问题。当$k=2$,即2球(圆),粒子出现在等距点。这样的配置可以解析地计算。然而,对于更高的维度,如$k \ge 3$,即3-球面(标准球面)的情况,没有太多的分析理解。在这些设置下找到问题的全局最小值是特别困难的,因为随着$k$和$n$的值的增大,优化问题变得越来越计算密集。在这项工作中,我们探索了各种各样的数值优化方法来解决汤姆森问题。在我们的实证研究中,我们发现基于随机梯度的方法(SGD)是解决这个问题的一个令人信服的选择,因为它可以很好地随点的数量而扩展。

英文摘要:

Thomson problem is a classical problem in physics to study how $n$ number of charged particles distribute themselves on the surface of a sphere of $k$ dimensions. When $k=2$, i.e. a 2-sphere (a circle), the particles appear at equally spaced points. Such a configuration can be computed analytically. However, for higher dimensions such as $k \ge 3$, i.e. the case of 3-sphere (standard sphere), there is not much that is understood analytically. Finding global minimum of the problem under these settings is particularly tough since the optimization problem becomes increasingly computationally intensive with larger values of $k$ and $n$. In this work, we explore a wide variety of numerical optimization methods to solve the Thomson problem. In our empirical study, we find stochastic gradient based methods (SGD) to be a compelling choice for this problem as it scales well with the number of points.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑