arXiv research

Researchers compare different gradient methods for ridge regression, finding conjugate gradients have similar performance.

The natural gradient method has been used effectively in conjugate Gaussian process models, but the non-conjugate case has been largely unexplored. We examine how natural gradients can be used in non-conjugate stochastic settings, together with hyperparameter learning. We conclude that the natural gradient can signific…

We address the challenge of effective exploration while maintaining good performance in policy gradient methods. As a solution, we propose diverse exploration (DE) via conjugate policies. DE learns and deploys a set of conjugate policies which can be conveniently generated as a byproduct of conjugate gradient descent. …

The study proves triviality and rigidity results for Ricci solitons and estimates their conjugate radius.

NCG methods improve shape optimization efficiency.

Harmonic functions of two variables are exactly those that admit a conjugate, namely a function whose gradient has the same length and is everywhere orthogonal to the gradient of the original function. We show that there are also partial differential equations controlling the functions of three variables that admit a c…

A new method speeds up deep neural network training.

The computational and storage complexity of kernel machines presents the primary barrier to their scaling to large, modern, datasets. A common way to tackle the scalability issue is to use the conjugate gradient algorithm, which relieves the constraints on both storage (the kernel matrix need not be stored) and computa…

Improved Gaussian process regression with tighter log marginal likelihood bounds.

This note provides a novel, simple analysis of the method of conjugate gradients for the minimization of convex quadratic functions. In contrast with standard arguments, our proof is entirely self-contained and does not rely on the existence of Chebyshev polynomials. Another advantage of our development is that it clar…

We would like to congratulate the authors of "A Bayesian Conjugate Gradient Method" on their insightful paper, and welcome this publication which we firmly believe will become a fundamental contribution to the growing field of probabilistic numerical methods and in particular the sub-field of Bayesian numerical methods…

This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems $Bx = b$ with positive definite $B$ for $x$. The goal is to replace the point estimates returned by existing methods with a Gaussian posterior belief over the elements of the inverse of $B$, which can …

Nonlinear conjugate gradient (NLCG) based optimizers have shown superior loss convergence properties compared to gradient descent based optimizers for traditional optimization problems. However, in Deep Neural Network (DNN) training, the dominant optimization algorithm of choice is still Stochastic Gradient Descent (SG…

A method uses CG to create efficient channels for ideal observers.

Conjugate gradient methods improve efficiency for high-dimensional GLMMs.

The paper deals with learning probability distributions of observed data by artificial neural networks. We suggest a so-called gradient conjugate prior (GCP) update appropriate for neural networks, which is a modification of the classical Bayesian update for conjugate priors. We establish a connection between the gradi…

New method for identifying autoregressive systems on manifolds.

Regularized least-squares (kernel-ridge / Gaussian process) regression is a fundamental algorithm of statistics and machine learning. Because generic algorithms for the exact solution have cubic complexity in the number of datapoints, large datasets require to resort to approximations. In this work, the computation of …

We propose a conjugate gradient type optimization technique for the computation of the Karcher mean on the set of complex linear subspaces of fixed dimension, modeled by the so-called Grassmannian. The identification of the Grassmannian with Hermitian projection matrices allows an accessible introduction of the geometr…

NeuralIF uses neural networks to improve preconditioning for faster CG convergence.

Let $(M,g(t))$, $0\le t\le T$, $\partial M\neφ$, be a compact $n$-dimensional manifold, $n\ge 2$, with metric $g(t)$ evolving by the Ricci flow such that the second fundamental form of $\partial M$ with respect to the unit outward normal of $\partial M$ is uniformly bounded below on $\partial M\times [0,T]$. We will pr…

We establish a point-wise gradient estimate for $all$ positive solutions of the conjugate heat equation. This contrasts to Perelman's point-wise gradient estimate which works mainly for the fundamental solution rather than all solutions. Like Perelman's estimate, the most general form of our gradient estimate does not …

Improves understanding of stochastic NGVI convergence rates.

New recommendations improve Gaussian process accuracy and stability.

We present a general method for deriving collapsed variational inference algo- rithms for probabilistic models in the conjugate exponential family. Our method unifies many existing approaches to collapsed variational inference. Our collapsed variational inference leads to a new lower bound on the marginal likelihood. W…

The paper introduces a new framework to understand and optimize deep neural networks.

Conjugate gradient (CG) methods are a class of important methods for solving linear equations and nonlinear optimization problems. In this paper, we propose a new stochastic CG algorithm with variance reduction and we prove its linear convergence with the Fletcher and Reeves method for strongly convex and smooth functi…

We prove Gaussian type bounds for the fundamental solution of the conjugate heat equation evolving under the Ricci flow. As a consequence, for dimension 4 and higher, we show that the backward limit of type I $κ$-solutions of the Ricci flow must be a non-flat gradient shrinking Ricci soliton. This extends Perelman's pr…

We propose and study kernel conjugate gradient methods (KCGM) with random projections for least-squares regression over a separable Hilbert space. Considering two types of random projections generated by randomized sketches and Nyström subsampling, we prove optimal statistical results with respect to variants of norms …

In this work, we consider the use of model-driven deep learning techniques for massive multiple-input multiple-output (MIMO) detection. Compared with conventional MIMO systems, massive MIMO promises improved spectral efficiency, coverage and range. Unfortunately, these benefits are coming at the cost of significantly i…

In this paper we introduce a parameter dependent class of Krylov-based methods, namely CD, for the solution of symmetric linear systems. We give evidence that in our proposal we generate sequences of conjugate directions, extending some properties of the standard Conjugate Gradient (CG) method, in order to preserve the…

Nowadays stochastic approximation methods are one of the major research direction to deal with the large-scale machine learning problems. From stochastic first order methods, now the focus is shifting to stochastic second order methods due to their faster convergence and availability of computing resources. In this pap…

New method improves calibration of BayesCG for better uncertainty quantification.

BONG optimizes Bayesian inference online with natural gradient descent.

The stochastic variational inference (SVI) paradigm, which combines variational inference, natural gradients, and stochastic updates, was recently proposed for large-scale data analysis in conjugate Bayesian models and demonstrated to be effective in several problems. This paper studies a family of Bayesian latent vari…

Proves FR-NGD optimally approximates evolutionary dynamics and continuous Bayesian inference.

This work proves convergence of adaptive resampling for random Fourier features.

Novel probabilistic solver speeds up solving related linear systems.

The paper analyzes contraction rates for GP regression approximations.

New method tackles high-dimensional SBL without covariance matrices.

Solving systems of linear equations is a problem occuring frequently in water engineering applications. Usually the size of the problem is too large to be solved via direct factorization. One can resort to iterative approaches, in particular the conjugate gradients method if the matrix is symmetric positive definite. P…

A new iterative K-FAC algorithm reduces training time and memory usage.

The paper improves sparse Gaussian processes by optimizing predictive loss.

Two methods solve kernel ridge regression problems efficiently.

Recent advances in policy gradient methods and deep learning have demonstrated their applicability for complex reinforcement learning problems. However, the variance of the performance gradient estimates obtained from the simulation is often excessive, leading to poor sample efficiency. In this paper, we apply the stoc…

New method uses robust estimators for Newton's method in empirical risk minimization.

In this work, we present direction-of-arrival (DoA) estimation algorithms based on the Krylov subspace that effectively exploit prior knowledge of the signals that impinge on a sensor array. The proposed multi-step knowledge-aided iterative conjugate gradient (CG) (MS-KAI-CG) algorithms perform subtraction of the unwan…

We present both, theory and an algorithm for solving time-harmonic wave problems in a general setting. The time-harmonic solutions will be achieved by computing time-periodic solutions of the original wave equations. Thus, an exact controllability technique is proposed to solve the time-dependent wave equations. We dis…