paper-with-me

홈 › Papers

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

2023-03-21 · Joe Hirose

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.

📄 PDF Abstract BibTeX arXiv:2303.11619

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Power Term Polynomial Algebra for Boolean Logic

2026-03-14 · Emanuele Sansone, Armando Solar-Lezama arxiv

We introduce power term polynomial algebra, a representation language for Boolean formulae designed to bridge conjunctive normal form (CNF) and algebraic normal form (ANF). The language is motivated by the tiling mismatc…

Evolving Ranking Functions for Canonical Blow-Ups in Positive Characteristic

2026-02-06 · Gergely Bérczi arxiv

Resolution of singularities in positive characteristic remains a long-standing open problem in algebraic geometry. In characteristic zero, the problem was solved by Hironaka in 1964, work for which he was awarded the Fie…

A generalization of the randomized singular value decomposition

2021-05-27 · ICLR 2022 4 · Nicolas Boullé, Alex Townsend

The randomized singular value decomposition (SVD) is a popular and effective algorithm for computing a near-best rank $k$ approximation of a matrix $A$ using matrix-vector products with standard Gaussian vectors. Here, w…

The Cost of Parallelizing Boosting

2024-02-23 · Xin Lyu, Hongxun Wu, Junzhao Yang

We study the cost of parallelizing weak-to-strong boosting algorithms for learning, following the recent work of Karbasi and Larsen. Our main results are two-fold: - First, we prove a tight lower bound, showing that even…

Pose estimation and bin picking for deformable products

2019-11-12 · Benjamin Joffe, Tevon Walker. Remi Gourdon, Konrad Ahlin

Robotic systems in manufacturing applications commonly assume known object geometry and appearance. This simplifies the task for the 3D perception algorithms and allows the manipulation to be more deterministic. However,…

ObjectPose Estimation