Hot eventLive
懒惰二阶预言机下凸优化复杂度研究
1 reports1 sources16 hr ago updated
Get the story
AI overview
2026年10月5日,arXiv Statistics Machine Learning 发布一篇论文,研究懒惰二阶预言机(lazy second-order oracles)设定下的凸优化复杂度问题。该设定中,算法每轮查询梯度,每 m 轮查询一次 Hessian。论文标题为《懒惰二阶预言机下近最优凸优化复杂度》,目前报道仅给出这一研究设定,未披露具体复杂度界、算法细节或实验结果。
Generated from reports · updated 16 hr ago
Timeline
Follow the coverage from different angles.
Oct 5, 2026
- arXiv · Statistics Machine Learning懒惰二阶预言机下近最优凸优化复杂度
该论文研究懒惰二阶预言机(lazy second-order oracles)设定下的凸优化复杂度,其中算法每轮查询梯度、每 $m$ 轮查询一次 Hessian。
Heat trend
Current heat 6·Comparable peak 10(Oct 5)·Comparable change over 24 hours –
The trend compares only the same participants observed continuously; its range may be smaller than the current heat count. Move or click on the chart to inspect hourly heat; use the left and right arrow keys to switch.