Related papers: Optimizing generalized kernels of polygons

Bayesian Optimization (BO) has the potential to solve various combinatorial tasks, ranging from materials science to neural architecture search. However, BO requires specialized kernels to effectively model combinatorial domains. Recent…

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over…

For a planar domain $\Omega$, we consider the Dirichlet spaces with respect to a base point $\zeta\in\Omega$ and the corresponding kernel functions. It is not known how these kernel functions behave as we vary the base point. In this note,…

We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…

Despite their success, kernel methods suffer from a massive computational cost in practice. In this paper, in lieu of commonly used kernel expansion with respect to $N$ inputs, we develop a novel optimal design maximizing the entropy among…

The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…

Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…

In this work, we broadly connect kernel-based filtering (e.g. approaches such as the bilateral filters and nonlocal means, but also many more) with general variational formulations of Bayesian regularized least squares, and the related…

The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most $k$ of its vertices. In a breakthrough result Reed, Smith, and Vetta (Operations Research Letters, 2004) gave a $\BigOh(4^kkmn)$…

Neural operators are neural network-based surrogate models for approximating solution operators of parametric partial differential equations, enabling efficient many-query computations in science and engineering. Many applications,…

We show that the Bergman, Szego, and Poisson kernels associated to a finitely connected domain in the plane are all composed of finitely many easily computed functions of one variable. The new formulas give rise to new methods for computing…

Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that…

Kernel theorems, in general, provide a convenient representation of bounded linear operators. For the operator acting on a concrete function space, this means that its action on any element of the space can be expressed as a generalised…

A general, {\em rectangular} kernel matrix may be defined as $K_{ij} = \kappa(x_i,y_j)$ where $\kappa(x,y)$ is a kernel function and where $X=\{x_i\}_{i=1}^m$ and $Y=\{y_i\}_{i=1}^n$ are two sets of points. In this paper, we seek a low-rank…

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

We study the worst case error of kernel density estimates via subset approximation. A kernel density estimate of a distribution is the convolution of that distribution with a fixed kernel (e.g. Gaussian kernel). Given a subset (i.e. a point…

In real Hilbert spaces, this paper generalizes the orthogonal groups $\mathrm{O}(n)$ in two ways. One way is by finite multiplications of a family of operators from reflections which results in a group denoted as $\Theta(\kappa)$, the other…

We introduce a new generalization of $\theta$-congruent numbers by defining the notion of rational $\theta$-parallelogram envelope for a positive integer $n$, where $\theta \in (0, \pi)$ is an angle with rational cosine. Then, we study more…

Since the results here have been superseded by another paper cowritten by the author, this article is available for reference purposes only. Fix a Dedekind domain $\mathcal{O}$ and a non-zero prime $\mathfrak{p}$ in it along with a…

Tracking of moving objects is crucial to security systems and networks. Given a graph $G$, terminal vertices $s$ and $t$, and an integer $k$, the \textsc{Tracking Paths} problem asks whether there exists at most $k$ vertices, which if…