Bregman divergence (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bregman divergence" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
69th place
59th place
5th place
5th place
11th place
8th place
916th place
706th place
18th place
17th place
4th place
4th place
low place
low place
low place
7,050th place

arxiv.org

doi.org

harvard.edu

ui.adsabs.harvard.edu

nih.gov

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

nips.cc

papers.nips.cc

  • Ehsan Amid, Manfred K. Warmuth, Rohan Anil, Tomer Koren (2019). "Robust Bi-Tempered Logistic Loss Based on Bregman Divergences". Conference on Neural Information Processing Systems. pp. 14987-14996. pdf

semanticscholar.org

api.semanticscholar.org

univ-ag.fr

www1.univ-ag.fr

  • "Matrix Information Geometry", R. Nock, B. Magdalou, E. Briys and F. Nielsen, pdf, from this book

utexas.edu

cs.utexas.edu

  • "Learning with Bregman Divergences" (PDF). utexas.edu. Retrieved 19 August 2023.
  • Dhillon, Inderjit; Tropp, Joel (2008). "Matrix Nearness Problems with Bregman Divergence" (PDF). SIAM Journal on Matrix Analysis and Applications. 29 (4). Supposed D_\varphi is a Bregman divergence, supposed that {C_k} is a finite collection of closed, convex sets whose intersection is nonempty. Given an input matrix Y our goal is to produce a matrix \mathbf{X} in the intersection that diverges the least from \textbf{Y}, i.e. to solve \min_{\mathbf{X} } D_\varphi(\mathbf{X};\mathbf{Y}) subject to \mathbf{X} \in \big\cap_k C_k. Under mild conditions, the solution is unique and it has a variational characterization analogous with the characterization of an orthogonal projection onto a convex set" (see s2.4, page 1125 for more)

worldcat.org

search.worldcat.org