相关论文: Iterations of the generalized Gram-Schmidt procedu…
In this paper, we analyze the iteration-complexity of Generalized Forward--Backward (GFB) splitting algorithm, as proposed in \cite{gfb2011}, for minimizing a large class of composite objectives $f + \sum_{i=1}^n h_i$ on a Hilbert space,…
Although machine learning is increasingly applied in control approaches, only few methods guarantee certifiable safety, which is necessary for real world applications. These approaches typically rely on well-understood learning algorithms,…
We obtain generalized Christoffel-Darboux (GCD) formula for skew-orthogonal polynomials (SOP). Using this, we present an alternative derivation of the level density and two-point function for Gaussian orthogonal ensembles (GOE) and Gaussian…
A generalized Gaussian process model (GGPM) is a unifying framework that encompasses many existing Gaussian process (GP) models, such as GP regression, classification, and counting. In the GGPM framework, the observation likelihood of the…
Statistical shape models (SSMs) represent a class of shapes as a normal distribution of point variations, whose parameters are estimated from example shapes. Principal component analysis (PCA) is applied to obtain a low-dimensional…
The Gaussian process state-space model (GPSSM) has garnered considerable attention over the past decade. However, the standard GP with a preliminary kernel, such as the squared exponential kernel or Mat\'{e}rn kernel, that is commonly used…
We present GraSSP, a novel approach to perform automated parallelization relying on recent advances in formal verification and synthesis. GraSSP augments an existing sequential program with an additional functionality to decompose data…
This work focuses on developing and motivating a stochastic version of a wellknown inverse problem methodology. Specifically, we consider the iteratively regularized Gauss-Newton method, originally proposed by Bakushinskii for…
Standard Gibbs sampling applied to a multivariate normal distribution with a specified precision matrix is equivalent in fundamental ways to the Gauss-Seidel iterative solution of linear equations in the precision matrix. Specifically, the…
The Gram-Schmidt process of L.N. Vaserstein for making an elementary matrix symplectic yields a nice set of generators for the odd sized elementary group.
The GMRES algorithm of Saad and Schultz (1986) is an iterative method for approximately solving linear systems $A{\bf x}={\bf b}$, with initial guess ${\bf x}_0$ and residual ${\bf r}_0 = {\bf b} - A{\bf x}_0$. The algorithm employs the…
The generalized inverse Gaussian-Poisson (GIGP) distribution proposed by Sichel in the 1970s has proved to be a flexible fitting tool for diverse frequency data, collectively described using the item production model. In this paper, we…
In this paper, we unify popular non-rigid registration methods for point sets and surfaces under our general framework, GiNGR. GiNGR builds upon Gaussian Process Morphable Models (GPMM) and hence separates modeling the deformation prior…
The reparameterization gradient has become a widely used method to obtain Monte Carlo gradients to optimize the variational objective. However, this technique does not easily apply to commonly used distributions such as beta or gamma…
A real quadratic matrix is generalized doubly stochastic (g.d.s.) if all of its row sums and column sums equal one. We propose numerically stable methods for generating such matrices having possibly orthogonality property or/and satisfying…
We present a way to construct Parseval frames of piecewise constant functions for $L^2[0,1]$. The construction is similar to the generalized Walsh bases. It is based on iteration of operators that satisfy a Cuntz-type relation, but without…
Operator-valued frame ($G$-frame), as a generalization of frame is introduced by Kaftal, Larson, and Zhang in \textit{Trans. Amer. Math. Soc.}, 361(12):6349-6385, 2009 and by Sun in \textit{J. Math. Anal. Appl.}, 322(1):437-452, 2006. It…
In this paper, we introduce and study two time-changed variants of the generalized fractional Skellam process. These are obtained by time-changing the generalized fractional Skellam process with an independent L\'evy subordinator with…
This paper presents an in-depth analysis of the generalized isotonic recursive partitioning (GIRP) algorithm for fitting isotonic models under separable convex losses, proposed by Luss and Rosset [J. Comput. Graph. Statist., 23 (2014), pp.…
In this paper, we introduce the generalized Gompertz-power series class of distributions which is obtained by compounding generalized Gompertz and power series distributions. This compounding procedure follows same way that was previously…