Related papers: Skew 2-Dyck paths via the kernel method
We present a system called Smyth for program sketching in a typed functional language whereby the concrete evaluation of ordinary assertions gives rise to input-output examples, which are then used to guide the search to complete the holes.…
Simultaneously solving multiple related learning tasks is beneficial under a variety of circumstances, but the prior knowledge necessary to correctly model task relationships is rarely available in practice. In this paper, we develop a…
We study the path planning problem for continuum-arm robots, in which we are given a starting and an end point, and we need to compute a path for the tip of the continuum arm between the two points. We consider both cases where obstacles…
The general perception is that kernel methods are not scalable, and neural nets are the methods of choice for nonlinear learning problems. Or have we simply not tried hard enough for kernel methods? Here we propose an approach that scales…
In this work, a kernel-based surrogate for integrating Hamiltonian dynamics that is symplectic by construction and tailored to large prediction horizons is proposed. The method learns a scalar potential whose gradient enters a…
We initiate the study of an algebra of symmetries for the 3D Dirac-Dunkl operator associated with the Weyl group of the exceptional root system $G_2$. For this symmetry algebra, we give both an abstract definition and an explicit…
Primal-dual methods for solving convex optimization problems with functional constraints often exhibit a distinct two-stage behavior. Initially, they converge towards a solution at a sublinear rate. Then, after a certain point, the method…
The Dirac-Dunkl operator on the 2-sphere associated to the $\mathbb{Z}_2^3$ reflection group is considered. Its symmetries are found and are shown to generate the Bannai-Ito algebra. Representations of the Bannai-Ito algebra are constructed…
In this paper, we establish real Paley-Wiener theorems for the Dunkl transform on Rd. More precisely, we characterize the functions in the Schwartz space S(IRd) and in L2k(Rd) whose Dunkl transform has bounded, unbounded, convex and…
During the last years, asymptotic (or sequential) constraint qualifications, which postulate upper semicontinuity of certain set-valued mappings and provide a natural companion of asymptotic stationarity conditions, have been shown to be…
The exact path length problem is to determine if there is a path of a given fixed cost between two vertices. This paper focuses on the exact path problem for costs $-1,0$ or $+1$ between all pairs of vertices in an edge-weighted digraph.…
The NP-complete $k$-Path problem asks whether a given undirected graph has a (simple) path of length at least $k$. We prove that $k$-Path has polynomial-size Turing kernels when restricted to planar graphs, graphs of bounded degree,…
We introduce in this paper a novel strategy for efficiently approximating the Sinkhorn distance between two discrete measures. After identifying neglectable components of the dual solution of the regularized Sinkhorn problem, we propose to…
Two novel extended semi-discrete KP-type systems, namely partial differential-difference systems with one continuous and two discrete variables, are investigated. Introducing an arbitrary function into the Cauchy matrix function or the…
In this paper, we propose a kernel method for exact tail asymptotics of a random walk to neighborhoods in the quarter plane. This is a two-dimensional method, which does not require a determination of the unknown generating function(s).…
We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…
Given a directed acyclic graph with positive edge-weights, two vertices s and t, and a threshold-weight L, we present a fully-polynomial time approximation-scheme for the problem of counting the s-t paths of length at most L. We extend the…
We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new…
We introduce and analyze Structured Stochastic Zeroth order Descent (S-SZD), a finite difference approach that approximates a stochastic gradient on a set of $l\leq d$ orthogonal directions, where $d$ is the dimension of the ambient space.…
This paper introduces a second-order differential inclusion for unconstrained convex optimization. In continuous level, solution existence in proper sense is obtained and exponential decay of a novel Lyapunov function along with the…