Exponential family distributions are highly useful in machine learning since their calculation can be performed efficiently through natural parameters. The exponential family has recently been extended to the t-exponential family, which contains Student-t distributions as family members and thus allows us to handle noi…
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.
Trend · papers per month
A method for converting NIW parameters for better estimation.
Study on Alexander polynomials in braids, linking number theory and topology.
New Thompson sampling algorithm reduces regret for exponential family bandits.
Improved inference for models with continuous latent variables.
A new distribution family extends the -stable distribution with a degree of freedom parameter.
Using tax and census data, we demonstrate that the distribution of individual income in the USA is exponential. Our calculated Lorenz curve without fitting parameters and Gini coefficient 1/2 agree well with the data. From the individual income distribution, we derive the distribution function of income for families wi…
Extends likelihood ratio exponential families to analyze various optimization methods.
Unified view on learning unnormalized distributions using NCE.
Recently much attention has been paid to deep generative models, since they have been used to great success for variational inference, generation of complex data types, and more. In most all of these settings, the goal has been to find a particular member of that model family: optimized parameters index a distribution …
NatPN provides fast, accurate uncertainty estimation for exponential family distributions.
We provide a classification of graphical models according to their representation as subfamilies of exponential families. Undirected graphical models with no hidden variables are linear exponential families (LEFs), directed acyclic graphical models and chain graphs with no hidden variables, including Bayesian networks …
A statistical framework for removing unwanted data domains in machine learning.
Study slopes of direct images in complex manifolds, proving a Mehta-Ramanathan type theorem.
Inference for normal and Monte Carlo distributions using minimum relative entropy.
New approach to Generalized Beta family using SDEs.
In this paper, a Bayesian inference technique based on Taylor series approximation of the logarithm of the likelihood function is presented. The proposed approximation is devised for the case, where the prior distribution belongs to the exponential family of distributions. The logarithm of the likelihood function is li…
New method for robust PCA with exponential family distributions.
Generative Adversarial Networks improve robust statistics for various distributions.
Many recent advances in large scale probabilistic inference rely on variational methods. The success of variational approaches depends on (i) formulating a flexible parametric family of distributions, and (ii) optimizing the parameters to find the member of this family that most closely approximates the exact posterior…
Proposes a general method to derive regret bounds for multi-armed bandit algorithms.
Variational inference (VI) provides fast approximations of a Bayesian posterior in part because it formulates posterior approximation as an optimization problem: to find the closest distribution to the exact posterior over some family of distributions. For practical reasons, the family of distributions in VI is usually…
This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.
Extends diffusion models to handle exponential family distributions for inverse problems.
Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings, however, it might not be clear which subclass of graphical models to use, particularly…
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 …
Study shows twist tori equidistribute in moduli space, with other families having singular distributions.
In this paper we introduce a new family of operator-valued distributions on Euclidian space acting by convolution on differential forms. It provides a natural generalization of the important Riesz distributions acting on functions, where the corresponding operators are , and we develop basic analogous prop…
Improves variational inference for sparse models using mixtures of exponential families.
Semi-implicit variational inference (SIVI) is introduced to expand the commonly used analytic variational distribution family, by mixing the variational parameter with a flexible distribution. This mixing distribution can assume any density function, explicit or not, as long as independent random samples can be generat…
New normalizing flows for sphere distributions improve complexity and scale handling.
The mean field methods, which entail approximating intractable probability distributions variationally with distributions from a tractable family, enjoy high efficiency, guaranteed convergence, and provide lower bounds on the true likelihood. But due to requirement for model-specific derivation of the optimization equa…
This note investigates a conjugate class for the Dirichlet distribution class in the exponential family.
New LVMs optimize any exponential family distribution without specific assumptions.
Conjugate pairs of distributions over infinite dimensional spaces are prominent in statistical learning theory, particularly due to the widespread adoption of Bayesian nonparametric methodologies for a host of models and applications. Much of the existing literature in the learning community focuses on processes posses…
We consider the design of prediction market mechanisms known as automated market makers. We show that we can design these mechanisms via the mold of \emph{exponential family distributions}, a popular and well-studied probability distribution template used in statistics. We give a full development of this relationship a…
A new family of multi-distribution divergences is characterized for fairness and other problems.
A subbundle of variable dimension inside the tangent bundle of a smooth manifold is called a smooth distribution if it is the pointwise span of a family of smooth vector fields. We prove that all such distributions are finitely generated, meaning that the family may be taken to be a finite collection. Further, we show …
Optimal learning for parametric prophet inequalities with exponential-type distributions
Geometric Gaussian approximations capture any distribution.
Efficiently learns exponential family distributions with i.i.d. samples.
We study the problem of finding the smallest such that every element of an exponential family can be written as a mixture of elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding th…
New tree-structured Markov fields with Poisson marginals for counting variables.
New tractable density models from squaring neural networks.
Proves that emergent algebras right-distributivity implies left-distributivity.
Efficient EP algorithm improves smoothing distribution inference in financial models.
We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we propose a graphical Fermat's principle to regularize the distribution family. Suc…
Information-Geometric Optimization (IGO) is a unified framework of stochastic algorithms for optimization problems. Given a family of probability distributions, IGO turns the original optimization problem into a new maximization problem on the parameter space of the probability distributions. IGO updates the parameter …