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.

169,181 papers · 148 categories

Trend · papers per month

0.4%0.8%1.2%1.5% · Aug 200119922001200920182026
48 results for non-conjugate

Natural gradients boost performance in non-conjugate Gaussian process models.

problem Improving inference in non-conjugate Gaussian process models.
method Use of natural gradients in non-conjugate stochastic settings with hyperparameter learning.
result Natural gradients significantly improve performance, especially for ill-conditioned posteriors.

We develop a fast inference method for non-conjugate Gaussian process models on spike count data.

problem Non-Gaussian spike count data complicates Gaussian Process Factor Analysis.
method We introduce Polynomial Approximate Log-Likelihood (PAL) estimators for non-conjugate GPFA models.
result PAL estimators achieve fast and accurate extraction of latent structure from spike train data.

New method speeds up inference for non-conjugate Gaussian processes.

problem Inference for non-conjugate Gaussian processes is slow and unreliable.
method Automated augmented conjugate inference method that constructs auxiliary variables to make the model conditionally conjugate.
result Our method is up to two orders of magnitude faster and more robust than existing methods.

Latent Gaussian models (LGMs) are widely used in statistics and machine learning. Bayesian inference in non-conjugate LGMs is difficult due to intractable integrals involving the Gaussian prior and non-conjugate likelihoods. Algorithms based on variational Gaussian (VG) approximations are widely employed since they str…

2013-06-05abs ↗pdf ↗

The paper provides guarantees for a tangent transform algorithm in logistic regression models.

problem Finding theoretical guarantees for statistical optimality and algorithmic convergence in non-conjugate models.
method Exploiting convex duality and minorizing the marginal likelihood, the paper derives non-asymptotic upper bounds and convergence guarantees for a tangent transform algorithm in logistic regression models.
result The tangent transform algorithm is shown to be locally asymptotically stable without assumptions on the data-generating process.

New methods accelerate NCGP inference by trading computation for uncertainty.

problem Prohibitively expensive exact inference in NCGPs for large datasets.
method Iterative methods explicitly modeling approximation error, leveraging parallel computing.
result Significant acceleration of posterior inference compared to baselines.

We prove that under fairly general conditions an iterated exchange move gives infinitely many non-conjugate braids. As a consequence, every knot has infinitely many conjugacy classes of n-braid representations if and only if it has one admitting an exchange move.

2011-03-13abs ↗pdf ↗

Study on Metropolis-within-Gibbs schemes for high-dimensional Bayesian models.

problem Improving the scalability of MCMC methods for complex Bayesian models.
method Relating convergence properties to conditional conductance for non-conjugate hierarchical models.
result Established dimension-free convergence results for Metropolis-within-Gibbs schemes.

Improves hyperparameter learning in GP models with non-conjugate likelihoods.

problem Hyperparameter learning entangled with approximate inference in GP models.
method Hybrid training procedure combining VI for inference and EP-like marginal likelihood approximation for hyperparameter learning.
result Empirically demonstrates the effectiveness of the proposed training procedure across various data sets.

We prove the Morse relations for the set of all geodesics connecting two non-conjugate points on a class of globally hyperbolic Lorentzian manifolds. We overcome the difficulties coming from the fact that the Morse index of every geodesic is infinite, and from the lack of the Palais-Smale condition, by using the Morse …

2006-05-10abs ↗pdf ↗

Variational inference simplifies Bayesian model approximations.

problem Approximating complex Bayesian posterior distributions.
method Solving optimization problems to approximate posterior distributions with simpler variational distributions.
result Variational inference has been successfully applied in various models and large-scale applications.

This paper proposes a method to approximate non-Gaussian likelihoods in Gaussian Processes.

problem Approximating non-Gaussian likelihoods in Gaussian Processes.
method Proposes a piece-wise constant approximation for the inverse-link function.
result Yields a closed form solution for the SVGP lower bound.

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.

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 ↗

This is an addendum to arXiv: 0810.5376. We show, using our methods and an auxiliary result of Bestvina-Bromberg-Fujiwara, that a finitely generated group with infinitely many pairwise non-conjugate homomorphisms to a mapping class group virtually acts non-trivially on an R\R-tree, and, if it is finitely presented, it…

2010-05-27abs ↗pdf ↗

The Hodge series of a finite matrix group is the generating function for invariant exterior forms of specified order and degree. Lauret, Miatello, and Rossetti gave examples of pairs of non-conjugate cyclic groups having the same Hodge series; the corresponding space forms are isospectral for the Laplacian on p-forms f…

2014-04-09abs ↗pdf ↗

New subgroups of mapping class groups constructed for infinite-type surfaces.

problem Constructing new subgroups of mapping class groups for infinite-type surfaces.
method Utilization of special homeomorphisms called shift maps and multipush maps.
result Countably (and uncountably in certain cases) many non-conjugate embeddings of subgroups into mapping class groups.

It has been known since the time of Nielsen that the mapping class group Modg,1\text{Mod}_{g,1} of a surface of genus gg and one puncture acts faithfully by homeomorphisms on the circle. In this note, we show that this standard representation of the mapping class group is not rigid, precisely, if G<Modg,1G<\text{Mod}_{g,1} is a…

2016-03-07abs ↗pdf ↗

New representations of 3-manifold groups into complex hyperbolic space found.

problem Finding representations of 3-manifold groups into complex hyperbolic spaces.
method Using Lefschetz fibrations and orbifold fundamental groups of branched coverings of the projective plane.
result Infinitely many non-conjugate representations discovered.

The paper analyzes symmetries of Vaidya-Bonner geodesics.

problem Investigating invariance properties of Vaidya-Bonner geodesics.
method Classification of Lie point symmetries and Noether symmetries, determination of optimal system of subalgebras.
result Determination of optimal system of subalgebras for Vaidya-Bonner geodesics.

Efficiently infers cluster assignments in probabilistic models.

problem Efficiently inferring cluster assignments in probabilistic models.
method Amortized approximate Bayesian inference mapping cluster representations into conditional probabilities.
result Parallelizable, yields iid samples with similar computational cost to Gibbs sampling.

In this note, we give an explicit counterexample to the simple loop conjecture for representations of surface groups into PSL(2,R). Specifically, we show that for any surface with negative Euler characteristic and genus at least 1, there are uncountably many non-conjugate, non-injective homomorphisms of its fundamental…

2012-10-11abs ↗pdf ↗

Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…

2013-06-02abs ↗pdf ↗

Mean-field variational inference is a method for approximate Bayesian posterior inference. It approximates a full posterior distribution with a factorized set of distributions by maximizing a lower bound on the marginal likelihood. This requires the ability to integrate a sum of terms in the log joint likelihood using …

2012-06-27abs ↗pdf ↗

Paper accelerates Bayesian few-shot classification using mirror descent.

problem Non-conjugate inference in Bayesian few-shot classification.
method Integrates mirror descent-based variational inference into Gaussian process-based few-shot classification.
result Accelerated convergence and improved uncertainty quantification.

Combines VI and EP for better Gaussian process hyperparameter learning.

problem Improving hyperparameter learning in Gaussian processes for better performance.
method Hybrid training procedure combining Variational Inference (VI) for posterior inference and Expectation Propagation (EP) for hyperparameter learning.
result The hybrid training procedure provides a better learning objective and generalizes better than using only VI or EP.

Unified framework for efficient Gaussian process inference.

problem Efficient inference in non-conjugate Gaussian process models.
method Combines expectation propagation with linearization for improved efficiency.
result Unified view of various inference schemes, including classical smoothers and EP.

Paper extends multi-task Gaussian Cox processes for heterogeneous tasks.

problem Modeling multiple heterogeneous correlated tasks jointly.
method Data augmentation and mean-field approximation for non-conjugate Bayesian inference.
result Demonstrates improved performance and inference on synthetic and real data.

Optimization with noisy gradients has become ubiquitous in statistics and machine learning. Reparameterization gradients, or gradient estimates computed via the "reparameterization trick," represent a class of noisy gradients often used in Monte Carlo variational inference (MCVI). However, when these gradient estimator…

2017-05-22abs ↗pdf ↗