mlsanityData to 7 Oct 2026

Blow-up Algorithm for Sum-of-Products Polynomials and Real Log Canonical Thresholds

arXiv 2303.11619 ↗First posted 21 Mar 2023math.ST cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

When considering a real log canonical threshold (RLCT) that gives a Bayesian generalization error, in general, papers replace a mean error function with a relatively simple polynomial whose RLCT corresponds to that of the mean error function, and obtain its RLCT by resolving its singularities through an algebraic operation called blow-up. Though it is known that the singularities of any polynomial can be resolved by a finite number of blow-up iterations, it is not clarified whether or not it is possible to resolve singularities of a specific polynomial by applying a specific blow-up algorithm. Therefore this paper considers the blow-up algorithm for the polynomials called sum-of-products (sop) polynomials and its RLCT.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 21 Mar 2023.

Builds on

3 of 20 references.

References · 3

  1. 2020The Exact Asymptotic Form of Bayesian Generalization Error in Latent Dirichlet Allocationcited by 14
  2. 2016Upper Bound of Bayesian Generalization Error in Non-negative Matrix Factorizationcited by 10
  3. 2022Asymptotic Behavior of Bayesian Generalization Error in Multinomial Mixturescited by 9

Built on by

Not cited yet.