相关论文: A Formula for Type III Sums of Squares
SAS introduced Type III methods to address difficulties in dummy-variable models for effects of multiple factors and covariates. Type III methods are widely used in practice; they are the default method in many statistical computing…
Type III methods, introduced by SAS in 1976, formulate estimable functions that substitute, somehow, for classical ANOVA effects in multiple linear regression models. They have been controversial since, provoking wide use and satisfied…
In 1934, F. Yates described a sum of squares for testing factor main effects in saturated unbalanced models for effects of two factors. He claimed no particular properties of this sum of squares other than that it provided an "efficient…
It is shown that the sum of squares by Yates's method of weighted squares of means is equivalent to numerator sums of squares formulated by other methods. These relations are established first for hypotheses about fixed effects in a general…
We obtain new Poisson type summation formulas with nodes $\pm \sqrt{n}$ and with weights involving the function $r_k(n)$ that gives the number of representations of a positive integer $n$ as the sum of $k$ squares. Our results extend…
Triangular map is a recent construct in probability theory that allows one to transform any source probability density function to any target density function. Based on triangular maps, we propose a general framework for high-dimensional…
Distorted sums of models were introduced and discussed in [Sh:463]. This notion generalizes the notion of disjoint (or direct) sums of models by letting the summands overlap. In the first section we investigate types in distorted sums and…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic…
Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…
The Sum-of-Squares (SOS) approximation method is a technique used in optimization problems to derive lower bounds on the optimal value of an objective function. By representing the objective function as a sum of squares in a feature space,…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
From sum-of-squares formulas of sizes $[r, s, n]$ and $[r', s', n']$ we construct a formula of size $[r + r', 2ss', 2nn']$.
We study sum of squares (SOS) relaxations to optimize polynomial functions over a set $V\cap R^n$, where $V$ is a complex algebraic variety. We propose a new methodology that, rather than relying on some algebraic description, represents…
We give an overview of classical summation formulations, such as Poisson's and Voronoi's, and then turn to modern versions involving modular form coefficients. A new formula involving the coefficients of cusp forms on GL(3) is described,…
Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e.…
Optimizing over the cone of nonnegative polynomials, and its dual counterpart, optimizing over the space of moments that admit a representing measure, are fundamental problems that appear in many different applications from engineering and…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…