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

67135202269 · Jun 202019922001200920172026
48 results for marginal probabilities

Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.

problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.

Efficient algorithm for Bayesian networks reduces marginal probability distribution computation.

problem Exact computation of marginal probability distribution is NP-hard for categorical variables in Bayesian networks.
method Divide-and-conquer approach exploiting graphical properties of Bayesian networks.
result Novel algorithm outperforms state-of-the-art methods in classification and cancer subtype identification.

Estimates joint probability distribution from 1-way marginals using low-rank tensors and random projections.

problem Nonparametric estimation of joint probability mass function (PMF) from limited data.
method Low-rank tensor decomposition and random projections to link data to PMF estimation.
result Estimates joint density from 1-way marginals using transformed space and novel algorithm.

This work proposes a new method to estimate joint probability from pairwise marginals, reducing sample complexity.

problem Direct nonparametric estimation of high-dimensional joint probability is infeasible due to the curse of dimensionality.
method Developed a coupled nonnegative matrix factorization (CNMF) framework using only pairwise marginals.
result The method provably recovers the joint probability mass function up to bounded error in finite iterations under reasonable conditions.

Proposes logistic-beta process for modeling dependent probabilities with beta marginals.

problem Limited work on flexible and computationally convenient stochastic process extensions for dependent random probabilities.
method Introduces logistic-beta process with logistic transformation and beta marginals, capable of modeling dependence in discrete and continuous domains.
result Logistic-beta processes enable effective posterior inference and design of computationally tractable dependent Bayesian nonparametric models.

Method estimates joint probability density from samples using low-rank decomposition and random projections.

problem Estimating joint probability density from limited samples.
method Low-rank tensor decomposition, dictionaries, and Radon transforms.
result Algorithm outperforms previous methods in estimating synthetic probability densities.

Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal probabilities required in inference and learning. However these variational est…

2012-07-11abs ↗pdf ↗

Quantum probability theory reveals hidden structure in joint probability distributions.

problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.

Proposes a method to construct risk-neutral marginals from arbitrage-free option prices.

problem Lack of risk-neutral marginals that are free of arbitrage and easy to use.
method Explicit construction of risk-neutral marginals from discrete arbitrage-free option prices.
result Explicit construction guarantees risk-neutral marginals free of butterfly and calendar arbitrage.

The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classic…

2015-06-12abs ↗pdf ↗

The paper examines how heavy-tailed risks behave under Gaussian copula models.

problem Understanding tail risk probabilities with heavy-tailed marginal risks and Gaussian dependence.
method Modeling heavy-tailed risks using regular variation and analyzing tail probabilities under Gaussian copula.
result The rate of decay of tail set probabilities varies with the type of tail sets and Gaussian correlation matrix.

In Bayesian statistics, the marginal likelihood, also known as the evidence, is used to evaluate model fit as it quantifies the joint probability of the data under the prior. In contrast, non-Bayesian models are typically compared using cross-validation on held-out data, either through kk-fold partitioning or leave-$p…

2019-05-21abs ↗pdf ↗

We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…

2013-05-03abs ↗pdf ↗

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …

2008-10-24abs ↗pdf ↗

Let X be a data matrix of rank ρ, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new oblivious dimension reduction technique which is precomputed and can be applied to any input matrix X. We pr…

2012-11-26abs ↗pdf ↗

New method tightens bounds on causation probabilities using independent datasets.

problem Challenging point identification of causation probabilities without strong assumptions.
method Imposes counterfactual consistency between SCMs constructed from independent datasets and uses conditional mutual information.
result Significantly tighter bounds on causation probabilities are established.

Study examines liquidation, leverage, and optimal margin requirements in Bitcoin futures markets.

problem Understanding and optimizing margin requirements in Bitcoin futures markets.
method Empirical analysis using generalized extreme value theory and BitMEX data.
result Margin requirements need to be significantly higher to reduce daily margin calls.

A mesh-free method solves continuum-marginal optimal transport problems.

problem Recovering minimum-energy velocity fields from time-continuous probability marginals.
method Embeds weak continuity equation in a reproducing kernel Hilbert space, optimizing with mini-batch stochastic methods.
result Accurately recovers drift and maintains marginal consistency in synthetic experiments.

Evidential Softmax preserves multimodality in sparse probability distributions for generative models.

problem Sparse probability distributions in deep generative models make exact marginalization computationally intractable.
method Introduce ev-softmax, a sparse normalization function that preserves multimodality and can be trained with probabilistic loss functions.
result ev-softmax outperforms existing techniques in distributional accuracy and dimensionality reduction.

The marginal maximum a posteriori probability (MAP) estimation problem, which calculates the mode of the marginal posterior distribution of a subset of variables with the remaining variables marginalized, is an important inference problem in many models, such as those with hidden variables or uncertain parameters. Unfo…

2013-02-26abs ↗pdf ↗

Combines MCTM and NF for flexible multivariate density regression with interpretable marginals.

problem Difficult interpretation of flexible NF models and limitations of MCTM in flexibility.
method Hybrid approach combining MCTM for interpretable marginals and NF for complex joint distributions.
result Demonstrates versatility and improved performance compared to MCTM and other NF models.

Given a set of possible models (e.g., Bayesian network structures) and a data sample, in the unsupervised model selection problem the task is to choose the most accurate model with respect to the domain joint probability distribution. In contrast to this, in supervised model selection it is a priori known that the chos…

2013-01-23abs ↗pdf ↗

A new method for semi-supervised learning with missing data using GMM and margin confidence.

problem Handling missing data in semi-supervised learning with classification uncertainty.
method Explicitly models missingness mechanism, uses margin confidence and Aranda Ordaz function, develops ECM algorithm.
result Effective reduction of bias and robustness in semi-supervised learning with substantial missing labels.

Given a set of possible models (e.g., Bayesian network structures) and a data sample, in the unsupervised model selection problem the task is to choose the most accurate model with respect to the domain joint probability distribution. In contrast to this, in supervised model selection it is a priori known that the chos…

2013-01-16abs ↗pdf ↗

Proposes MFSWB for marginal fairness in SWB, improving efficiency and performance.

problem Achieving marginal fairness in SWB averaging.
method Defining MFSWB as a constrained SWB problem, proposing two surrogate problems and a new slicing distribution.
result Surrogate MFSWB problems effectively minimize distances to marginals and encourage marginal fairness.

New estimator reduces variance in off-policy evaluation for contextual bandits.

problem High variance in current OPE methods for contextual bandits.
method Marginal Density Ratio (MR) estimator focusing on marginal distribution shift.
result MR estimator reduces variance compared to IPW and DR methods.

Estimates high-dimensional posterior densities by marginal distributions and neural networks.

problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.

A framework estimates categorical distributions under constraints, ensuring generality and uniqueness.

problem Estimating categorical distributions summarizing sample data under marginal constraints.
method Theoretical framework + Iterative Proportional Fitting (IPF) to estimate the distribution.
result A unique categorical distribution of Maximum Entropy under marginal constraints exists and is estimated.

Bayesian inference in the presence of an intractable likelihood function is computationally challenging. When following a Markov chain Monte Carlo (MCMC) approach to approximate the posterior distribution in this context, one typically either uses MCMC schemes which target the joint posterior of the parameters and some…

2016-07-08abs ↗pdf ↗

SUMO provides unbiased log marginal likelihood estimation for latent variable models.

problem Biased estimates of log marginal likelihood in latent variable models.
method Randomized truncation of infinite series for unbiased estimation.
result Models trained with SUMO give better test-set likelihoods than standard methods.

The paper derives a formula for factorizing categorical data to improve Bayes classifiers.

problem Improving the accuracy of Bayes classifiers by effectively factoring multidimensional data.
method Derives an explicit formula for calculating the marginal likelihood of a factorized categorical dataset.
result The derived formula can be used to select the best factorization for constructing a Bayes classifier.