English
Related papers

Related papers: Waring decompositions and identifiability via Bert…

200 papers

We consider the problem of factorizing a structured 3-way tensor into its constituent Canonical Polyadic (CP) factors. This decomposition, which can be viewed as a generalization of singular value decomposition (SVD) for tensors, reveals…

Machine Learning · Computer Science 2020-07-01 Sirisha Rambhatla , Xingguo Li , Jarvis Haupt

Causal discovery with latent variables is a crucial but challenging task. Despite the emergence of numerous methods aimed at addressing this challenge, they are not fully identified to the structure that two observed variables are…

Machine Learning · Computer Science 2023-12-20 Wei Chen , Zhiyi Huang , Ruichu Cai , Zhifeng Hao , Kun Zhang

We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompositions: we prove that given a tensor whose decomposition satisfies a robust form of Kruskal's rank condition, it is possible to approximately…

Data Structures and Algorithms · Computer Science 2013-05-01 Aditya Bhaskara , Moses Charikar , Aravindan Vijayaraghavan

Uncertainty quantification based on generalized polynomial chaos has been used in many applications. It has also achieved great success in variation-aware design automation. However, almost all existing techniques assume that the parameters…

Numerical Analysis · Mathematics 2019-06-21 Chunfeng Cui , Zheng Zhang

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

In this paper we introduce the open Waring rank of a form of degree d in n variables and prove the that this rank in bounded from above by \binom{n+d-2}{d-1} - \binom{n+d-6}{d-3} whenever n, d >= 3. This proves the same upper bound for the…

Commutative Algebra · Mathematics 2013-05-31 Joachim Jelisiejew

We introduce a new Bayesian multi-class support vector machine by formulating a pseudo-likelihood for a multi-class hinge loss in the form of a location-scale mixture of Gaussians. We derive a variational-inference-based training objective…

Machine Learning · Computer Science 2018-06-08 Martin Wistuba , Ambrish Rawat

We show how well known tools of algebraic geometry for the study of finite sets can be fruitfully applied to the study of Waring decompositions of symmetric tensors (forms). We mainly focus on the uniqueness of a given decomposition (the…

Algebraic Geometry · Mathematics 2018-07-03 Luca Chiantini

We prove that the generic element of the fifth secant variety $\sigma_5(Gr(\mathbb{P}^2,\mathbb{P}^9)) \subset \mathbb{P}(\bigwedge^3 \mathbb{C}^{10})$ of the Grassmannian of planes of $\mathbb{P}^9$ has exactly two decompositions as a sum…

Algebraic Geometry · Mathematics 2018-02-19 Davide Vanzo , Alessandra Bernardi

Metaquerying is a datamining technology by which hidden dependencies among several database relations can be discovered. This tool has already been successfully applied to several real-world applications. Recent papers provide only…

Databases · Computer Science 2007-05-23 F. Angiulli , R. Ben-Eliyahu-Zohary , G. Ianni , L. Palopoli

We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…

Optimization and Control · Mathematics 2012-03-02 Feng Guo , Erich L. Kaltofen , Lihong Zhi

Machine learning models provide statistically impressive results which might be individually unreliable. To provide reliability, we propose an Epistemic Classifier (EC) that can provide justification of its belief using support from the…

Machine Learning · Computer Science 2020-10-20 Chitresh Bhushan , Zhaoyuan Yang , Nurali Virani , Naresh Iyer

Cayley's hyperdeterminant is a homogeneous polynomial of degree 4 in the 8 entries of a 2 x 2 x 2 array. It is the simplest (nonconstant) polynomial which is invariant under changes of basis in three directions. We use elementary facts…

Representation Theory · Mathematics 2025-12-09 Murray R. Bremner , Mikelis G. Bickis , Mohsen Soltanifar

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…

Computational Geometry · Computer Science 2023-11-06 Pankaj K. Agarwal , Esther Ezra , Micha Sharir

In this paper, we study the real and the complex Waring rank of reducible cubic forms. In particular, we compute the complex rank of all reducible cubic forms. In the real case, for all reducible cubics, we either compute or bound the real…

Commutative Algebra · Mathematics 2015-12-16 Enrico Carlini , Cheng Guo , Emanuele Ventura

We consider the problem of inferring an unknown ranking of $n$ items from a random tournament on $n$ vertices whose edge directions are correlated with the ranking. We establish, in terms of the strength of these correlations, the…

Statistics Theory · Mathematics 2024-07-24 Dmitriy Kunisky , Daniel A. Spielman , Xifan Yu

Let G be a compact Lie group or a complex reductive affine algebraic group. We explore induced mappings between G-character varieties of surface groups by mappings between corresponding surfaces. It is shown that these mappings are…

Algebraic Geometry · Mathematics 2023-04-27 Indranil Biswas , Jacques Hurtubise , Lisa C. Jeffrey , Sean Lawton

Let $f$ be a homogeneous polynomial of even degree $d$. We study the decompositions $f=\sum_{i=1}^r f_i^2$ where $\mathrm{deg} f_i=d/2$. The minimal number of summands $r$ is called the $2$-rank of $f$, so that the polynomials having…

Algebraic Geometry · Mathematics 2024-09-05 Giorgio Ottaviani , Ettore Teixeira Turatti

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

Commutative Algebra · Mathematics 2019-02-04 Michel Hickel , Mickaël Matusinski

Linear causal disentanglement is a recent method in causal representation learning to describe a collection of observed variables via latent variables with causal dependencies between them. It can be viewed as a generalization of both…

Machine Learning · Statistics 2024-07-08 Paula Leyes Carreno , Chiara Meroni , Anna Seigal