Closed-form variational objectives for Bayesian neural networks with ReLU layers.
problem Efficient computation of Bayesian neural networks with closed-form variational objectives.
method Single-layer networks with piecewise polynomial activations (ReLU). Structured Normal variational distributions for Normal likelihoods. Approximate lower bounds for other likelihoods.
result Closed-form computation of variational lower bounds, predictive mean, and variance for Bayesian neural networks.
Improved bound for Gaussian mechanism in differential privacy.
problem Finding tighter bounds for Gaussian mechanism in differential privacy.
method Presented a new closed form bound for (ε,δ)-differential privacy using zero mean Gaussian noise. result The new bound is always lower and valid for all ε>0. Derives exact formula for Minkowski sum of ellipsoids in N-space.
problem Finding volume bounds for Minkowski sum of ellipsoids.
method Closed-form parametric equation derivation and volume bounds calculation.
result Upper and lower volume bounds for Minkowski sum of ellipsoids.
The aim of this paper is to study the fast computation of the lower and upper bounds on the value function for utility maximization under the Heston stochastic volatility model with general utility functions. It is well known there is a closed form solution of the HJB equation for power utility due to its homothetic pr…
In the context of dealing with financial risk management problems it is desirable to have accurate bounds for option prices in situations when pricing formulae do not exist in the closed form. A unified approach for obtaining upper and lower bounds for Asian-type options, including options on VWAP, is proposed in this …
Method bounds tail probabilities of continuous RVs.
problem Bounding tail probabilities of continuous random variables.
method Setting continuous, positive, and strictly decreasing/increasing functions to derive upper and lower bounds.
result Provides tighter bounds than existing methods, including a novel asymptotic capacity bound for AWGN channel.
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 …
Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in most cases, this quantity has no closed-form expression, making some form of approximation necessary.…
A new algorithm optimizes Gaussian process posterior mean functions efficiently.
problem Optimizing Gaussian process posterior mean functions over hyperrectangles is challenging due to nonlinearity and nonconvexity.
method PALM-Mean, a piecewise-analytic lower-bounding framework embedded in reduced-space spatial branch-and-bound.
result PALM-Mean improves scalability for large datasets compared to general-purpose solvers.
Paper provides a new lower bound on MMSE using Poincaré inequality.
problem Estimating X from noisy Y in exponential family noise.
method Alternative MMSE representation + Poincaré inequality.
result New lower bound on MMSE holds for all distributions.
The paper provides a uniform lower bound for intersection numbers of psi-classes on moduli spaces.
problem Estimating intersection numbers of psi-classes on Deligne-Mumford's moduli spaces.
method Approximates intersection numbers by closed-form expressions and proves a uniform lower bound.
result Proves a lower bound for intersection numbers in terms of approximating expressions and an explicit factor.
We consider the problem of computing upper and lower bounds on the price of a European basket call option, given prices on other similar baskets. Although this problem is very hard to solve exactly in the general case, we show that in some instances the upper and lower bounds can be computed via simple closed-form expr…
In this paper we derive an easily computed approximation to European basket call prices for a local volatility jump-diffusion model. We apply the asymptotic expansion method to find the approximate value of the lower bound of European basket call prices. If the local volatility function is time independent then there i…
Information-theoretic measures such as the entropy, cross-entropy and the Kullback-Leibler divergence between two mixture models is a core primitive in many signal processing tasks. Since the Kullback-Leibler divergence of mixtures provably does not admit a closed-form formula, it is in practice either estimated using …
Proposes an efficient lower bound for Gromov-Wasserstein discrepancy.
problem Comparing structured data from different metric-measure spaces.
method Orthogonal Gromov-Wasserstein (OGW) discrepancy with efficient closed-form lower bound.
result Efficient and tight lower bounds for Gromov-Wasserstein discrepancy.
Study precise sample covariance error for Gaussian centered data.
problem Precise characterization of sample covariance error for Gaussian data.
method Developed a Random Duality Theory (RDT) framework to determine upper and lower bounds.
result Upper and lower bounds match in large-dimensional contexts, matching the spectral norm's limiting value.
New bound on Gaussian process improves generalization.
problem Improving generalization in Gaussian process regression.
method Introducing a new closed-form lower bound on Gaussian process likelihood based on Rényi α-divergence.
result The new bound can control and tune regularization, potentially improving over traditional methods.
This tutorial derives the VAE loss function under Gaussian assumptions.
problem Computational intractability of posterior distributions in Bayesian machine learning.
method Derives the variational lower bound loss function of a standard VAE.
result The Kullback-Leibler divergence has a closed form solution under Gaussian assumptions.
The study sets lower bounds on MMSE for inferring sensitive features from noisy data.
problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.
The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in [0,1]. This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of f-divergences, and it is related to …
New bounds for Neyman-Pearson region using f-divergences.
problem Bounding the Neyman-Pearson region for hypothesis testing.
method Establishing novel lower and upper bounds using f-divergences. result Best possible lower bound for the Neyman-Pearson boundary using hockey-stick f-divergences. Estimates returns for dollar cost averaging using geometric Brownian motion.
problem Estimating returns for dollar cost averaging investing strategy.
method Uses geometric Brownian motion and log-Normal distribution to construct a lower bound for returns. Computes parameters recursively and in closed form for dollar cost averaging. Compares to lump sum investing for matching wealth distributions.
result Probability of negative returns is less than 2.5% for 40 years of annual dollar cost averaging.
Proposes efficient Bayesian logistic regression for large sparse datasets.
problem Infeasibility of theoretical Bayesian methods for large sparse feature sets.
method Low complexity analytical approximations for sparse online logistic and probit regressions.
result Empirical results show superior performance compared to more complex methods.
Improved lower bound for first Dirichlet eigenvalue using variance refinement.
problem Finding a more precise lower bound for the first Dirichlet eigenvalue.
method Refined Jensen-Hölder averaging using variance term.
result Explicit closed-form in-diameter bound strictly stronger than previous estimates.
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.
Novel Hilbert space Gaussian process improves sequential design accuracy and efficiency.
problem Efficiently implementing Gaussian process acquisition functions for expensive simulations.
method Proposed a truncated eigenbasis representation for closed-form evaluation of IMSE acquisition function.
result Significantly lower prediction error and reduced computation time compared to benchmarks.
A new mutual information lower bound for multimodal regression active learning.
problem Lack of effective acquisition functions for multimodal regression active learning.
method Introduces a Two-Index framework for separating epistemic and aleatoric sources of uncertainty, deriving MI-LB as a closed-form approximation.
result MI-LB consistently outperforms baselines on multimodal regression tasks.
Geometric tempering fails for Langevin dynamics, proving convergence limits.
problem Proving convergence and limitations of geometric tempering for Langevin dynamics.
method Theoretical investigation of geometric tempering using Langevin dynamics.
result Geometric tempering can lead to exponential time convergence and poor functional inequalities.
New method lowers spherical perceptron capacity using fully lifted random duality theory.
problem Tackles the negative spherical perceptron capacity, a long-standing open problem.
method Develops fully lifted random duality theory (fl RDT) to characterize capacity.
result Shows remarkable closed-form analytical relations for practical capacity values.
Improved bounds for online prediction with expert advice.
problem Online prediction with expert advice in finite-horizon games.
method Verification arguments from optimal control theory applied to PDEs to find sub- and supersolutions.
result Explicit bounds for any number of experts and horizon, improving upon previous results.
Efficiently identifies important variables in binary outcomes using variational Bayes.
problem Bayesian variable selection for binary outcomes with computational challenges.
method Mean-field variational Bayes approximation with closed-form updates and efficient inference algorithm.
result Successfully identifies important variables and is orders of magnitude faster than MCMC.
New method uses approximate KLD for intractable likelihood models.
problem Designing experiments for models with intractable likelihoods.
method Derive a lower bound of KLD utility, express it in terms of entropies, and evaluate efficiently.
result Demonstrated the performance of the proposed method through numerical examples.
We consider 2-dimensional orientable self-shrinkers Σ for the Mean Curvature Flow of polynomial volume growth immersed in Rn. We look at closed one forms minimizing the norm $\int_Σ\eterm |ω|^2$ in their cohomology class. Any closed form satisfying the Euler-Lagrange equation for this minimization will be …
Study on instanton homology of pretzel knots and pillowcase Floer homology.
problem Investigating instanton knot homology and Floer homology for a family of pretzel knots.
method Analyzes the reduced singular instanton knot homology and computes bounding cochains in the pillowcase.
result Computed bounding cochains in the pillowcase, revealing a sharp experimental law and rigidity asymmetry.
Extends specific relative entropy to multidimensional continuous martingales.
problem Mutual singularity of martingale laws in continuous time.
method Extension of specific relative entropy from one to multiple dimensions, including closed-form expressions for simple examples.
result Establishes that the lower bound on specific relative entropy from Gantert carries over to higher dimensions and is tight.
Develops a framework for optimal investment in assets with different liquidity constraints.
problem Optimal investment-consumption problem for a utility-maximizing investor with lower-bound constraints.
method Generalized martingale approach and decomposition of the problem into subproblems.
result Explicit formulas for optimal strategies derived for power-utility functions.
BAICS identifies best arm with fairness constraints on subpopulations.
problem Identify the best arm while ensuring fairness across subpopulations.
method Formulated and solved BAICS problem, analyzed complexity, designed algorithm.
result Algorithm's sample complexity matches theoretical lower bound.
We investigate upper and lower hedging prices of multivariate contingent claims from the viewpoint of game-theoretic probability and submodularity. By considering a game between "Market" and "Investor" in discrete time, the pricing problem is reduced to a backward induction of an optimization over simplexes. For Europe…
Solves low-rank approximation problems in Hilbert spaces.
problem Low-rank approximation in Hilbert spaces.
method Closed-form solutions and error bounds for bounded linear operators.
result Generalization to bounded linear operators from finite dimensions.
In this paper, we are concerned with the valuation of Guaranteed Annuity Options (GAOs) under the most generalised modelling framework where both interest and mortality rates are stochastic and correlated. Pricing these type of options in the correlated environment is a challenging task and no closed form solution exis…
New method finds better arbitrage opportunities in AMMs.
problem Finding optimal arbitrage trades in multi-token AMMs.
method Closed-form solutions using convex optimisation.
result Better arbitrage opportunities than traditional methods.
New algorithms improve best-arm identification with varying rewards.
problem Identifying the best arm with varying reward variances in fixed budget.
method Proposed two algorithms: SHVar for known variances, SHAdaVar for unknown variances; uses non-uniform budget allocation.
result Bounding misidentification probabilities for both algorithms.
New method calculates DMN log-likelihood faster.
problem Precise and fast computation of DMN log-likelihood.
method Derived a closed form expression using gamma function properties.
result Closed form calculation is faster with same accuracy.
Modern statistical applications involving large data sets have focused attention on statistical methodologies which are both efficient computationally and able to deal with the screening of large numbers of different candidate models. Here we consider computationally efficient variational Bayes approaches to inference …
The Information Bottleneck (IB) is a conceptual method for extracting the most compact, yet informative, representation of a set of variables, with respect to the target. It generalizes the notion of minimal sufficient statistics from classical parametric statistics to a broader information-theoretic sense. The IB curv…
Novel method uses Bayesian filters and PCRLB for state estimation of option prices.
problem Estimating unobserved latent variables from option prices.
method Posterior Cramer-Rao Lower Bound (PCRLB) based adaptive state estimation using various Bayesian filters.
result Proposed method outperforms individual filters and improves forecasting.
VAEs can use constant posterior variances under certain conditions, simplifying model training.
problem Learning variances in VAEs is challenging and unnecessary under certain conditions.
method Proof of non-trivial solutions with constant posterior variances, simplified ELBO formulation, and new sampling method.
result ELBO can be simplified and optimized without learning variances, improving model performance.
A new framework for PPLS combines noise estimation, optimization, and calibration.
problem Probabilistic PLS models need interpretable latent factors and calibrated uncertainty.
method End-to-end pipeline combining noise estimation, constrained optimization, and prediction calibration.
result Achieves near-nominal coverage and native calibrated uncertainty across benchmarks.