Unverified50% confidenceFactExact time
In zeroth-order optimization, converting function values into gradient estimates via finite differences or Gaussian smoothing and then applying first-order methods usually incurs a cost linear in the dimension d.
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
Unverified线性评估函数在参数空间中是凸的，意味着梯度下降类方法能够找到全局最优解77% similarUnverifiedWhen F is the gradient of some convex function, the variational inequality degenerates into standard convex optimization.72% similarUnverified无梯度方法样本效率低，在高维参数空间中缺乏梯度指引意味着需要海量函数评估才能收敛71% similarUnverifiedSince the joint lower bound shows that the dependence on (d, δ, ε) cannot be optimized in a decomposed manner, the trade-offs in algorithm design should be placed on improving constants and practical sample reuse efficiency, rather than attempting to break through the product structure of the three in worst-case guarantees.70% similarUnverifiedImplicit regularization describes the intrinsic preference of optimization algorithms themselves over the solution space, where optimization algorithms such as gradient descent tend to select simple solutions even without explicit regularization terms70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1037296API
curl https://kongchang.com/api/v1/knowledge/claims/1037296MCP
get_claim(id=1037296)