Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for gradient conjugate priors

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…

2018-02-07abs ↗pdf ↗

We derive and approximate the conjugate prior of Dirichlet and beta distributions.

problem Intractability of conjugate prior for Dirichlet and beta distributions.
method Derive conjugate prior, define closed-form approximation, and provide algorithm.
result Closed-form approximation enables fully tractable Bayesian treatment.

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

problem Comparing statistical properties of different gradient methods in ridge regression.
method Explicit non-standard error decomposition to bound prediction error of conjugate gradient iterates.
result Conjugate gradient iterates share optimality properties with gradient flow and ridge regression up to a constant factor.

New method improves calibration of BayesCG for better uncertainty quantification.

problem Bayesian conjugate gradient method's poor calibration limits its utility.
method Randomized postiteration strategy to enhance posterior calibration.
result The method improves the distribution of posterior errors and enhances uncertainty quantification.

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

problem Optimizing continuous time replicator equations and continuous Bayesian inference.
method Fisher-Rao natural gradient descent (FR-NGD) and its correspondence with evolutionary dynamics.
result FR-NGD optimally approximates continuous time replicator equations and continuous Bayesian inference.

Unified analysis of conjugate gradients and accelerated methods using duality gap.

problem Minimizing convex quadratic functions efficiently.
method Approximate Duality Gap Technique to unify conjugate gradients and accelerated methods.
result Unified and self-contained proof of conjugate gradients without relying on Chebyshev polynomials.

Making inferences from data streams is a pervasive problem in many modern data analysis applications. But it requires to address the problem of continuous model updating and adapt to changes or drifts in the underlying data generating distribution. In this paper, we approach these problems from a Bayesian perspective c…

2017-07-07abs ↗pdf ↗

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…

2016-12-12abs ↗pdf ↗

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. …

2019-02-10abs ↗pdf ↗

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…

2012-05-30abs ↗pdf ↗

New method uses KL-divergence to create non-informative priors for multivariate Gaussian.

problem Handling hyperparameters for non-informative limits in multivariate Gaussian conjugate priors.
method Using scaled KL-divergence between multivariate Gaussians to construct Wishart and normal-Wishart conjugate priors.
result Forming non-informative priors without violating Wishart shape parameter restrictions.

Develops a fast variational approximation for high-dimensional empirical Bayes posteriors.

problem Optimal posterior computation in high-dimensional settings with prior tails effect.
method Variational approximation of empirical Bayes posterior with data-driven centers and thin-tailed conjugate priors.
result Retains optimal concentration rate properties and superior performance compared to existing methods.

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…

2016-02-22abs ↗pdf ↗

Improved Gaussian process regression with tighter log marginal likelihood bounds.

problem Improving predictive performance in Gaussian process regression models.
method Lower bound on log marginal likelihood using conjugate gradients.
result Improved predictive performance compared to other conjugate gradient based approaches.

In a modern observational study based on healthcare databases, the number of observations and of predictors typically range in the order of 10510^5 ~ 10610^6 and of 10410^4 ~ 10510^5. Despite the large sample size, data rarely provide sufficient information to reliably estimate such a large number of parameters. Sparse reg…

2018-10-29abs ↗pdf ↗

New conjugate priors improve Bayesian inference for multinomial probit models.

problem Lack of tractable conjugate priors for efficient Bayesian inference in multinomial probit models.
method Unified skew-normal (SUN) distributions as conjugate priors, leading to improved posterior inference and classification.
result Improved computational methods for posterior inference and classification, especially in high dimensions.

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

2014-02-10abs ↗pdf ↗

Low-rank matrix estimation from incomplete measurements recently received increased attention due to the emergence of several challenging applications, such as recommender systems; see in particular the famous Netflix challenge. While the behaviour of algorithms based on nuclear norm minimization is now well understood…

2014-06-05abs ↗pdf ↗

We characterize conjugate nonparametric Bayesian models as projective limits of conjugate, finite-dimensional Bayesian models. In particular, we identify a large class of nonparametric models representable as infinite-dimensional analogues of exponential family distributions and their canonical conjugate priors. This c…

2010-12-02abs ↗pdf ↗

New method for identifying autoregressive systems on manifolds.

problem Identifying autoregressive systems on Stiefel and Grassmann manifolds.
method Defining parameters as orthogonal group elements, averaging over observations, conjugate gradient descent on manifolds.
result System parameters can be estimated efficiently using the proposed algorithm.

This report works out the details of a closed-form, fully Bayesian, multiclass, openset, generative pattern classifier using multivariate Gaussian likelihoods, with conjugate priors. The generative model has a common within-class covariance, which is proportional to the between-class covariance in the conjugate prior. …

2013-07-23abs ↗pdf ↗

NMC improves MCMC convergence by analyzing gradients to determine optimal proposal densities.

problem Improving MCMC convergence in structured relational models.
method Newtonian Monte Carlo (NMC) uses first and second order gradients to determine a suitable proposal density.
result NMC outperforms existing methods in various domains, including non-conjugate models.

Deep learning designs effective preconditioners for water engineering problems.

problem Solving large linear systems in water engineering applications.
method Convolutional Neural Network (CNN) for designing preconditioning matrices.
result Learned preconditioners improve convergence rates beyond existing methods.

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…

2012-09-14abs ↗pdf ↗

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

problem Improving convergence of conjugate gradient method for large-scale sparse systems.
method Data-driven approach using graph neural networks to generate incomplete factorization.
result Data-driven preconditioners accelerate convergence of conjugate gradient method.

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

2008-01-23abs ↗pdf ↗

Proposes a non-conjugate model selection method for chain event graphs.

problem Existing model selection algorithms for chain event graphs rely on conjugate priors, which is unrealistic for many real-world applications.
method Proposes a mixture modelling approach to model selection in chain event graphs that does not rely on conjugacy.
result The proposed method is more scalable and robust than existing algorithms.