We extend the Fourier cosine method to discrete probability distributions, achieving faster convergence rates.
problem Extending Fourier cosine method to discrete probability distributions.
method Spectral filters and convergence rates analysis.
result Spectral filters achieve one order faster convergence rates than previously recognized.
New formulae identify discrete probability laws without needing normalization constants.
problem Characterizing non-normalized discrete probability distributions.
method Derive explicit formulae for mass functions using Stein's method.
result Developed tools for solving statistical problems without normalization constants.
Exact Bayesian inference for discrete models using probability generating functions.
problem Discrete statistical models with infinite support and continuous priors.
method Probabilistic programming language with automatic differentiation and probability generating functions.
result Genfer tool provides exact solutions for a wide range of inference problems.
Sharp bounds for high-probability estimation of discrete distributions.
problem Estimating discrete distributions with high probability under χ2-divergence. method Sharp upper and lower bounds for the classical Laplace estimator, and characterization of minimax high-probability risk for any estimator.
result Sharp bounds for high-probability estimation of discrete distributions can be achieved through a simple smoothing strategy.
Study asset pricing under model uncertainty with discrete time and states.
problem Asset pricing under model uncertainty with discrete time and states.
method Novel definition of arbitrage, investigation of no-arbitrage conditions, expansion to multi-period securities model.
result Necessary and sufficient conditions for no-arbitrage asset pricing under model uncertainty.
In this expository paper we illustrate the generality of game theoretic probability protocols of Shafer and Vovk (2001) in finite-horizon discrete games. By restricting ourselves to finite-horizon discrete games, we can explicitly describe how discrete distributions with finite support and the discrete pricing formulas…
Refined analysis of Mitra's algorithm for discrete mixtures.
problem Classifying general discrete mixture distribution models.
method Spectral clustering tailored to bipartite stochastic block models.
result Improved separation conditions for probability distributions.
We give a complete characterization of both comonotone and not comonotone coherent risk measures in the discrete finite probability space, where each outcome is equally likely. To the best of our knowledge, this is the first work that characterizes \textit{and} distinguishes comonotone and not comonotone coherent risk …
SDE automatically recovers interpretable discrete distributions.
problem Limited interpretable discrete probability laws.
method Unsupervised framework using symbolic density estimation.
result Accurately recovers interpretable discrete distributions.
Improved bounds for discrete probability distribution estimation under the ℓ∞ norm.
problem Estimating discrete probability distributions under the ℓ∞ norm with improved bounds.
method Minimax bounds in expectation and high-probability tail bounds.
result Resolved open questions posed in Kontorovich and Painsky (JMLR, 2025), including a fully empirical tightest risk bound and identifying the worst-case extremal distribution.
Study shows financial value of weak information converges in discrete vs continuous markets.
problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.
The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability space…
A method for diffusion on probability simplex for generative models.
problem Tension between continuous and discrete data in diffusion models.
method Proposes using softmax function applied to Ornstein-Uhlenbeck Process on probability simplex.
result Method extends to bounded image generation.
Proves hardness of semi-discrete optimal transport and proposes regularization methods.
problem Computing Wasserstein distance between discrete and non-discrete probability measures.
method Proves hardness, introduces distributionally robust dual optimal transport, regularizes primal objective, uses stochastic gradient descent.
result Regularization schemes and improved convergence guarantees for semi-discrete optimal transport problems.
The paper bounds and identifies joint probabilities in causal inference with monotonicity assumptions.
problem Bounding and identifying joint probabilities of potential outcomes and observed variables under monotonicity assumptions.
method Proposes new families of monotonicity assumptions, formulates bounding problem as linear programming, introduces new monotonicity assumption for identification.
result Validated methods through numerical experiments and applied to real-world datasets.
The probability minimizing problem of large losses of portfolio in discrete and continuous time models is studied. This gives a generalization of quantile hedging presented in [3].
The paper develops approximations for Pearson's chi-square statistic and applies them to confidence intervals.
problem Finding confidence intervals for strictly convex functions of discrete distribution weights.
method Non-asymptotic local normal approximation for multinomial probabilities, deriving bounds and coupling inequalities.
result Developed methods to find confidence intervals for negative entropy of discrete distributions.
New discrepancy function compares discrete probability measures considering space geometry.
problem Comparing discrete probability measures in a geometrically meaningful way.
method Proposes the Fourier Discrepancy Function, proving convexity, differentiability, and providing gradient formula.
result Proves the Fourier Discrepancy is convex, twice differentiable, and provides an explicit gradient formula.
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the dat…
We describe a Groebner basis of relations among conditional probabilities in a discrete probability space, with any set of conditioned-upon events. They may be specialized to the partially-observed random variable case, the purely conditional case, and other special cases. We also investigate the connection to generali…
In this paper a quantitative analysis of the ruin probability in finite time of discrete risk process with proportional reinsurance and investment of finance surplus is focused on. It is assumed that the total loss on a unit interval has a light-tailed distribution -- exponential distribution and a heavy-tailed distrib…
Investigates statistical properties of perturb-softmax and perturb-argmax distributions.
problem Underexplored statistical properties of Gumbel-Softmax and Gumbel-Argmax distributions.
method Investigates convexity and differentiability to determine completeness and minimality of these distributions.
result Identifies parameters that admit complete and minimal representation of probability distributions.
Unified framework for continuous-state discrete flow matching models.
problem Discrete generative modeling with continuous probabilities.
method Introducing α-Flow, a family of CS-DFM models based on information geometry. result Optimal flow matching loss for α-flow minimizes generalized kinetic energy. Paper develops a consistent estimator for discrete mixture models.
problem Estimating mixing probability density in discrete mixture models.
method Develops an L1 consistent estimator under specific conditions. result Consistent estimation of mixing probability density for every density f. Probability distributions produced by the cross-entropy loss for ordinal classification problems can possess undesired properties. We propose a straightforward technique to constrain discrete ordinal probability distributions to be unimodal via the use of the Poisson and binomial probability distributions. We evaluate …
Study error bounds in evaluating distributional computational graphs.
problem Error analysis in evaluating graphs with inputs as probability distributions.
method Establish non-asymptotic error bounds using Wasserstein-1 distance.
result Non-asymptotic error bounds for discretization errors in distributional computational graphs.
Optimal testing of discrete distributions with high probability, achieving sample complexity bounds.
problem Testing discrete distributions with high probability accuracy.
method Characterizing sample complexity as a function of parameters like δ, providing sample-optimal testers.
result Optimal algorithms for closeness and independence testing, achieving within constant factors of information-theoretic lower bounds.
Maximizes probability of completing investment schedules with optimal portfolio weights.
problem Optimizing probability of completing investment schedules with optimal portfolio weights.
method Computing maximum probability and optimal portfolio weight functions for various rebalancing schedules.
result Noticeable improvements in probability to complete schedules with optimal portfolio weights.
Algorithm reduces support of discrete measures by integrating against functions.
problem Efficiently reducing the support of discrete measures when N≫n. method Geometric characterization and greedy geometric sampling.
result A new measure with n+1 atoms has the same mean as original measure. New method optimizes non-linear functionals over probability measures.
problem Optimizing non-linear functionals defined over probability measures.
method N-particle underdamped Langevin algorithm with spacetime discretization.
result Converges globally in total variation distance.
We study the ruin problem over a risk process described by a discrete-time Markov model. In contrast to previous studies that focused on the asymptotic behaviour of ruin probabilities for large values of the initial capital, we provide a new technique to compute the quantity of interest for any initial value, and with …
Cosine schedule is optimal for discrete diffusion models.
problem Choosing the best discretization schedule for diffusion models.
method Optimized using Fisher-Rao geometry.
result Cosine schedule is Fisher-Rao optimal.
In this paper, we propose the discrete time Compound Beta-Binomial Risk Model with by-claims, delayed by-claims and randomized dividends. We then analyze the Gerber-Shiu function for the cases where the dividend threshold d=0 and d>0 under the assumption that the constant discount rate ν∈(0,1). More specifical…
Hybrid framework combines PGMs and TNs for complex probabilistic modeling.
problem Combining quantum-like correlations into PGM models.
method Introducing decoherence to convert probabilistic TN models into PGMs.
result Hybrid models can represent and combine strengths of both PGMs and TNs.
This paper studies geometrical structure of the manifold of escort probability distributions and shows its new applicability to information science. In order to realize escort probabilities we use a conformal transformation that flattens so-called alpha-geometry of the space of discrete probability distributions, which…
In this study, we propose a new definition of multivariate conditional value-at-risk (MCVaR) as a set of vectors for discrete probability spaces. We explore the properties of the vector-valued MCVaR (VMCVaR) and show the advantages of VMCVaR over the existing definitions given for continuous random variables when adapt…
Forward-Euler fails for simulating Wasserstein gradient flows with KL divergence.
problem Simulating Wasserstein gradient flows with forward-Euler discretization fails for KL divergence.
method Forward-Euler discretization for Wasserstein gradient flows with KL divergence.
result Forward-Euler discretization can be incorrect for Wasserstein gradient flows with KL divergence.
This paper proposes an active learning-based Gaussian process (AL-GP) metamodelling method to estimate the cumulative as well as complementary cumulative distribution function (CDF/CCDF) for forward uncertainty quantification (UQ) problems. Within the field of UQ, previous studies focused on developing AL-GP approaches…
We describe discrete restricted Boltzmann machines: probabilistic graphical models with bipartite interactions between visible and hidden discrete variables. Examples are binary restricted Boltzmann machines and discrete naive Bayes models. We detail the inference functions and distributed representations arising in th…
Unified framework for convergence of discrete diffusion models without state space size dependence.
problem Fundamental limitations in existing convergence theory for discrete diffusion models, especially under singular priors and large vocabularies.
method Unified adjoint-equation-based framework that establishes dimension-free convergence guarantees in any integral probability metric (IPM).
result First dimension-free convergence bounds applicable to both masked and uniform priors, free of state space size S. This work bounds the generalization error of private algorithms for discrete data.
problem Bounding the generalization error of private algorithms for discrete data.
method Information-theoretic approach using relative entropy and the method of types.
result Explicit upper bounds on the generalization error of stable private algorithms for discrete data.
We present a new approach for studying the problem of optimal hedging of a European option in a finite and complete discrete-time market model. We consider partial hedging strategies that maximize the success probability or minimize the expected shortfall under a cost constraint and show that these problems can be trea…
Sequence-to-sequence text-to-speech (TTS) is dominated by soft-attention-based methods. Recently, hard-attention-based methods have been proposed to prevent fatal alignment errors, but their sampling method of discrete alignment is poorly investigated. This research investigates various combinations of sampling methods…
Discrete Flow Maps bypass sequential prediction limits for parallel text generation.
problem Sequential autoregressive prediction limits large language model speed.
method Flow Maps compress generative trajectories into single-step mappings.
result Discrete Flow Maps surpass previous state-of-the-art results in discrete flow modeling.
New Fourier metrics equivalent to Wasserstein distances in image processing.
problem Equivalence of Fourier-based and Wasserstein metrics in imaging problems.
method Extensions of Fourier-based metrics to handle different centers of mass and discrete measures, showing equivalence to Wasserstein distances.
result New Fourier metrics are equivalent to Wasserstein distances with explicit constants, improving runtime in image processing.
Unified discrete diffusion for categorical data simplifies training and sampling.
problem Training and sampling in discrete diffusion models for categorical data.
method Mathematical simplifications and elegant unification of discrete-time and continuous-time discrete diffusion.
result Unified Simplified Discrete Denoising Diffusion (USD3) outperforms SOTA baselines.
Generalizes optimal portfolio theory to include capital gains taxes.
problem Investment optimization in markets with capital gains taxes.
method Mathematical analysis of a specific market model with realistic tax rules.
result Closedness of attainable terminal wealth set under no unbounded non-substitutable investment condition.
Paper proposes DAG-DB for learning discrete DAGs via backpropagation.
problem Learning Directed Acyclic Graphs (DAGs) from data.
method DAG-DB uses Discrete Backpropagation with I-MLE and Straight-Through Estimation.
result DAG-DB learns DAGs effectively using probabilistic sampling and backpropagation.