Unverified50% confidenceOpinionExact time
This paper's work can be seen as a generalization of SVGD: in SVGD the relationship between the displacement field and the density ratio is implicitly fixed, whereas this paper explicitly parameterizes both into the same convex optimization objective, allowing the density ratio and the displacement field to be jointly estimated.
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedRepresentative methods for variance reduction include SVRG and SARAH.72% similarUnverified强行取极值样本会引入离群点，迫使SVM构建更复杂的决策边界，高阶poly核在这种数据上收敛更慢69% similarUnverifiedThe paper proves that the classical Local Extra SGD algorithm, through more refined analysis, can achieve tighter convergence guarantees than previously known for general smooth and monotone variational inequalities.66% similarUnverifiedWhen ε ≈ 1, the gradient second-moment term in the denominator is diluted, adaptive scaling has almost no effect, and the optimizer behaves close to pure SGD.63% similarUnverifiedLow-rank decomposition is typically implemented using Singular Value Decomposition (SVD), reducing the parameter count from m×n to r×(m+n).63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1013243API
curl https://kongchang.com/api/v1/knowledge/claims/1013243MCP
get_claim(id=1013243)