Related papers: Algorithm for computing local Bernstein-Sato ideal…
When the target parameter for inference is a real-valued, continuous function of probabilities in the $k$-sample multinomial problem, variance estimation may be challenging. In small samples or when the function is nondifferentiable at the…
For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…
Motivated by the goal of improving the efficiency of small sample design, we propose a novel Bayesian stochastic approximation method to estimate the root of a regression function. The method features adaptive local modelling and…
In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local…
We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…
We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can…
We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct:…
Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…
In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…
We construct local solutions to the Benjamin-Ono equation for quasi-periodic initial data. The solution is unique among limits of smooth solutions and depends continuously on the data. Our result applies to a richer class of quasi-periodic…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
Probabilistic graphical models play a crucial role in machine learning and have wide applications in various fields. One pivotal subset is undirected graphical models, also known as Markov random fields. In this work, we investigate the…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…
We consider the computation of the permanent of a binary n by n matrix. It is well- known that the exact computation is a #P complete problem. A variety of Markov chain Monte Carlo (MCMC) computational algorithms have been introduced in the…
We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…
We compute the Bernstein-Sato polynomial of $f$, a function which given a pair $(M,v)$ in $X = M_n(\mathbf{C}) \times \mathbf{C}^n$ tests whether $v$ is a cyclic vector for $M$. The proof includes a description of shift operators…
Bayesian optimization has recently emerged as a popular method for the sample-efficient optimization of expensive black-box functions. However, the application to high-dimensional problems with several thousand observations remains…
A new differential-recurrence relation for the B-spline functions of the same degree is proved. From this relation, a recursive method of computing the coefficients of B-spline functions of degree $m$ in the Bernstein-B\'{e}zier form is…
We consider the fundamental problem of estimating the mean of a vector $y=X\beta+z$, where $X$ is an $n\times p$ design matrix in which one can have far more variables than observations, and $z$ is a stochastic error term--the so-called…
We show that, with coefficients in a field or a complete local ring k, the Braden-MacPherson algorithm computes the stalks of parity sheaves with coefficients in k. As a consequence we deduce that the Braden-MacPherson algorithm may be used…