Related papers: Pfaffian Systems of A-Hypergeometric Systems II --…
The main result is an elementary proof of holonomicity for A-hypergeometric systems, with no requirements on the behavior of their singularities, originally due to Adolphson [Ado94] after the regular singular case by Gelfand and Gelfand…
We propose a novel Riemannian geometric framework for variational inference in Bayesian models based on the nonparametric Fisher-Rao metric on the manifold of probability density functions. Under the square-root density representation, the…
The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…
Bilevel optimization is a powerful tool for many machine learning problems, such as hyperparameter optimization and meta-learning. Estimating hypergradients (also known as implicit gradients) is crucial for developing gradient-based methods…
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…
We propose a new data-augmentation strategy for fully Bayesian inference in models with binomial likelihoods. The approach appeals to a new class of Polya-Gamma distributions, which are constructed in detail. A variety of examples are…
This work proposes a hyper-reduction method for nonlinear parametric dynamical systems characterized by gradient fields such as Hamiltonian systems and gradient flows. The gradient structure is associated with conservation of invariants or…
The Eisenhart lift provides an elegant geometric description of a dynamical system of second order in terms of null geodesics of the Brinkmann-type metric. In this work, we attempt to generalize the Eisenhart method so as to encompass…
We develop a method for the rigorous estimation of Hausdorff dimensions of limit sets produced by continued fraction iterated function systems. Our method is based on the approximation of a Perron-Frobenius operator using the finite element…
Adaptive stochastic gradient algorithms in the Euclidean space have attracted much attention lately. Such explorations on Riemannian manifolds, on the other hand, are relatively new, limited, and challenging. This is because of the…
The coordinate descent method is an effective iterative method for solving large linear least-squares problems. In this paper, for the highly coherent columns case, we construct an effective coordinate descent method which iteratively…
We extend Petkov\v{s}ek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems $\tau(Y) = M Y$, with $M \in {\rm GL}_n(C(x))$, where $\tau$ is the shift operator. Hypergeometric…
We develop an innovative numerical technique to describe few-body systems. Correlated Gaussian basis functions are used to expand the channel functions in the hyperspherical representation. The method is proven to be robust and efficient…
This paper reviews gradient-based techniques to solve bilevel optimization problems. Bilevel optimization is a general way to frame the learning of systems that are implicitly defined through a quantity that they minimize. This…
The gradient descent approach is the key ingredient in variational quantum algorithms and machine learning tasks, which is an optimization algorithm for finding a local minimum of an objective function. The quantum versions of gradient…
In this work, we study inequalities and enumerative formulas for flags of Pfaff systems on $\mathbb{P}^n_{\mathbb{C}}$. More specifically, we find the number of independent Pfaff systems that leave invariant a one-dimensional holomorphic…
We formulate two classes of first-order algorithms more general than previously studied for minimizing smooth and strongly convex or, respectively, smooth and convex functions. We establish sufficient conditions, via new discrete Lyapunov…
In the paper, we introduce several accelerate iterative algorithms for solving the multiple-set split common fixed-point problem of quasi-nonexpansive operators in real Hilbert space. Based on primal-dual method, we construct several…
We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's…
Quantum determinants and Pfaffians or permanents and Hafnians are introduced on the two parameter quantum general linear group. Fundamental identities among quantum Pf, Hf, and det are proved in the general setting. We show that there are…