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,657 papers · 148 categories

Trend · papers per month

4998147196 · Jun 202019922001200920172026
48 results for Jeffreys prior

Informative Bayesian priors are often difficult to elicit, and when this is the case, modelers usually turn to noninformative or objective priors. However, objective priors such as the Jeffreys and reference priors are not tractable to derive for many models of interest. We address this issue by proposing techniques fo…

2017-04-04abs ↗pdf ↗

A new Weyl prior is proposed for Bayesian statistics, offering a more canonical choice for parameter α.

problem Choosing a prior distribution for Bayesian inference.
method Proposed a new Weyl prior based on the Weyl structure on a statistical manifold.
result The Weyl prior is a special case of the α-parallel prior with α = -n, where n is the dimension of the statistical manifold.

Optimality of TS with noninformative priors proven for Pareto model.

problem Optimality of Thompson Sampling with noninformative priors for Pareto bandits.
method Proved optimality of TS with certain probability matching priors, showed suboptimality with others, and found effectiveness of truncation procedures.
result TS with certain probability matching priors achieves optimal regret bound for Pareto model.

Thompson Sampling has been demonstrated in many complex bandit models, however the theoretical guarantees available for the parametric multi-armed bandit are still limited to the Bernoulli case. Here we extend them by proving asymptotic optimality of the algorithm using the Jeffreys prior for 1-dimensional exponential …

2013-07-12abs ↗pdf ↗

We construct geometric shrinkage priors for Kählerian signal filters. Based on the characteristics of Kähler manifolds, an efficient and robust algorithm for finding superharmonic priors which outperform the Jeffreys prior is introduced. Several ansätze for the Bayesian predictive priors are also suggested. In particul…

2014-08-28abs ↗pdf ↗

Jeffrey guidance extends diffusion-model control to more complex applications.

problem Controlling diffusion models beyond simple cases like conditional sampling.
method Leveraging Jeffrey's rule of conditioning to update marginal distributions towards a target distribution.
result Significant reductions in FID on CIFAR-10 and FFHQ with Inception embeddings as the target.

Jeffreys Flow improves robustness of Boltzmann generators for rare event sampling.

problem Rare events and metastable trapping in sampling physical systems with rough energy landscapes.
method Introduces Jeffreys Flow, a robust generative framework using Parallel Tempering distillation and symmetric Jeffreys divergence to mitigate mode collapse and improve mode coverage.
result Minimizing Jeffreys divergence suppresses mode collapse and corrects inaccuracies in multi-modal distributions.

This study explores how choosing noninformative priors affects Thompson Sampling in multiparameter bandit models.

problem The optimality of Thompson Sampling (TS) in multiparameter bandit models depends on the choice of priors, especially when models are complex.
method The study extends regret analysis to uniform distributions and proposes a modified TS policy, TS-T, to achieve asymptotic optimality.
result Changing noninformative priors can significantly affect the expected regret in multiparameter bandit models.

We propose a generalized double Pareto prior for Bayesian shrinkage estimation and inferences in linear models. The prior can be obtained via a scale mixture of Laplace or normal distributions, forming a bridge between the Laplace and Normal-Jeffreys' priors. While it has a spike at zero like the Laplace density, it al…

2011-04-05abs ↗pdf ↗

Bayesian method improves extreme quantile estimation with zero coverage error.

problem Estimating extreme quantiles with zero coverage error in small samples.
method Bayesian quantile estimation using Jeffreys prior.
result Bayesian method results in zero coverage error, unlike maximum likelihood.

Due to the success of the bag-of-word modeling paradigm, clustering histograms has become an important ingredient of modern information processing. Clustering histograms can be performed using the celebrated kk-means centroid-based algorithm. From the viewpoint of applications, it is usually required to deal with symm…

2013-03-29abs ↗pdf ↗

Develops a statistical test for IV, improving feature selection reliability.

problem Lack of statistical justification in conventional IV-based feature selection.
method Establishes connection with Jeffreys divergence and proposes a nonparametric hypothesis test.
result The J-Divergence test provides rigorous guarantees and is more reliable than traditional IV thresholds.

Bayesian neural networks update beliefs with soft evidence, improving accuracy and calibration.

problem Updating neural network weights with uncertain or soft evidence.
method Developed two algorithms to approximate Jeffrey's rule for updating neural network weights.
result Jeffrey-based methods outperform traditional approaches in accuracy and calibration, especially in noisy data.

In this paper, we derive a Bayesian model order selection rule by using the exponentially embedded family method, termed Bayesian EEF. Unlike many other Bayesian model selection methods, the Bayesian EEF can use vague proper priors and improper noninformative priors to be objective in the elicitation of parameter prior…

2017-03-30abs ↗pdf ↗

Consider the space RΔR_Δ of rational functions of several variables with poles on a fixed arrangement ΔΔ of hyperplanes. We obtain a decomposition of RΔR_Δ as a module over the ring of differential operators with constant coefficients. We generalize to the space RΔR_Δ the notions of principal part and of residue, and …

1999-03-30abs ↗pdf ↗

Automated feature selection is important for text categorization to reduce the feature size and to speed up the learning process of classifiers. In this paper, we present a novel and efficient feature selection framework based on the Information Theory, which aims to rank the features with their discriminative capacity…

2016-02-09abs ↗pdf ↗

This study investigates self-supervised learning with Wasserstein distance on tree structures.

problem Improving self-supervised learning methods using Wasserstein distance.
method Utilized Tree-Wasserstein distance (TWD) and Jeffrey divergence regularization for training.
result A simple combination of softmax function and Tree-Wasserstein distance outperforms cosine similarity-based methods.

The paper explores how to handle uncertain evidence in probabilistic models.

problem Handling uncertain evidence in probabilistic models and stochastic simulators.
method The paper considers distributional evidence, Jeffrey's rule, and virtual evidence as methods for interpreting uncertain evidence.
result The paper provides guidelines on how to account for uncertain evidence and highlights the importance of careful consideration.

MsIGN tackles high-dimensional Bayesian inference using multiscale structure.

problem High-dimensional Bayesian inference challenges due to the curse of dimensionality.
method MsIGN generates samples from coarse to fine scale, minimizing Jeffreys divergence.
result MsIGN outperforms previous approaches in posterior approximation and mode capture.

We propose a method for recovering the structure of a sparse undirected graphical model when very few samples are available. The method decides about the presence or absence of bonds between pairs of variable by considering one pair at a time and using a closed form formula, analytically derived by calculating the post…

2016-03-03abs ↗pdf ↗

Jeffrey and Kirwan suggested expressions for intersection pairings on the reduced space of a Hamiltonian G-space in terms of multiple residues. In this paper we prove a residue formula for symplectic volumes of reduced spaces of a quasi-Hamiltonian SU(2)-space. The definition of quasi-Hamiltonian G-spaces was recently …

1999-06-14abs ↗pdf ↗

We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …

2016-11-23abs ↗pdf ↗

Using the notion of equivariant Kirwan map, as defined by Goldin, we prove that -- in the case of Hamiltonian torus actions with isolated fixed points -- Tolman and Weitsman's description of the kernel of the Kirwan map can be deduced directly from the residue theorem of Jeffrey and Kirwan. A characterization of the ke…

2002-11-06abs ↗pdf ↗

The Global Vectors for word representation (GloVe), introduced by Jeffrey Pennington et al. is reported to be an efficient and effective method for learning vector representations of words. State-of-the-art performance is also provided by skip-gram with negative-sampling (SGNS) implemented in the word2vec tool. In this…

2014-11-20abs ↗pdf ↗

This work is a continuation of our previous paper arXiv:1812.06473 where we have constructed N=2{\cal N}=2 supersymmetric Yang-Mills theory on 4D manifolds with a Killing vector field with isolated fixed points. In this work we expand on the mathematical aspects of the theory, with a particular focus on its nature as a …

2019-04-29abs ↗pdf ↗

We compare two models of corporate default by calculating the Jeffreys-Kullback-Leibler divergence between their predicted default probabilities when asset correlations are either high or low. Our main results show that the divergence between the two models increases in highly correlated, volatile, and large markets, b…

2016-04-24abs ↗pdf ↗

Lisa Jeffrey and Frances Kirwan developed an integration theory for symplectic reductions. That is, given a symplectic manifold with symplectic group action, they developed a way of pulling the integration of forms on the reduction back to an integration of group-equivariant forms on the original space. We seek an anal…

2004-02-18abs ↗pdf ↗

We prove an analogue of the Atiyah-Bott-Berline-Vergne localization formula in the setting of equivariant basic cohomology of KK-contact manifolds. As a consequence, we deduce analogues of Witten's nonabelian localization and the Jeffrey-Kirwan residue formula, which relate equivariant basic integrals on a contact man…

2017-03-01abs ↗pdf ↗

We define a moment map associated to a smooth torus action on a smooth manifold, without a two-form. We define cobordisms of such structures, allowing non compact manifolds as long as the moment maps are proper. We prove that a compact manifold with a torus action and a moment map is cobordant to the disjoint union of …

1997-01-19abs ↗pdf ↗

We prove that the Grothendieck-Springer simultaneous resolution viewed as a correspondence between the adjoint quotient of a Lie algebra and its maximal torus is Lagrangian in the sense of shifted symplectic structures. As Hamiltonian spaces can be interpreted as Lagrangians in the adjoint quotient, this allows one to …

2014-11-11abs ↗pdf ↗

We develop a Chern-Weil theory for compact Lie group action whose generic stabilizers are finite in the framework of equivariant cohomology. This provides a method of changing an equivariant closed form within its cohomological class to a form more suitable to yield localization results. This work is motivated by our w…

1998-04-29abs ↗pdf ↗

The space Ω(G)Ω(G) of all based loops in a compact semisimple simply connected Lie group GG has an action of the maximal torus TGT\subset G (by pointwise conjugation) and of the circle S1S^1 (by rotation of loops). Let $μ: Ω(G)\to (\t\times i\mathbb{R})^*$ be a moment map of the resulting T×S1T\times S^1 action. We show t…

2007-02-26abs ↗pdf ↗

Artificial neural network training with stochastic gradient descent can be destabilized by "bad batches" with high losses. This is often problematic for training with small batch sizes, high order loss functions or unstably high learning rates. To stabilize learning, we have developed adaptive learning rate clipping (A…

2019-06-21abs ↗pdf ↗