arXiv research

Sharp bounds found for various risk measures using generalized FGM copulas.

Let $\{T^t\}$ be a smooth flow with positive speed and positive topological entropy on a compact smooth three dimensional manifold, and let $μ$ be an ergodic measure of maximal entropy. We show that either $\{T^t\}$ is Bernoulli, or $\{T^t\}$ is isomorphic to the product of a Bernoulli flow and a rotational flow. Appli…

BeMF improves recommendation reliability in recommender systems.

Improves interpretability of anomaly scores in GBRBM-based detection.

We develop constructions for exchangeable sequences of point processes that are rendered conditionally-i.i.d. negative binomial processes by a (possibly unknown) random measure called the base measure. Negative binomial processes are useful in Bayesian nonparametrics as models for random multisets, and in applications …

Physics-informed model predicts beam stiffness and monitors structural health.

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

The beta-Bernoulli process provides a Bayesian nonparametric prior for models involving collections of binary-valued features. A draw from the beta process yields an infinite collection of probabilities in the unit interval, and a draw from the Bernoulli process turns these into binary-valued features. Recent work has …

Study finds a measure for sponge components of Lalley-Gatzouras type.

We introduce a quantitative condition on orbits of dynamical systems which measures their aperiodicity. We show the existence of sequences in the Bernoulli-shift and geodesics on closed hyperbolic manifolds which are as aperiodic as possible with respect to this condition.

This paper addresses the mapping problem. Using a conjugate prior form, we derive the exact theoretical batch multi-object posterior density of the map given a set of measurements. The landmarks in the map are modeled as extended objects, and the measurements are described as a Poisson process, conditioned on the map. …

Characterizes symmetric Bernoulli distributions with minimal convex sums.

Upper bound on expected supremum of Bernoulli process.

A framework for robust exploration in reinforcement learning under ambiguity.

In this paper, we consider the multivariate Bernoulli distribution as a model to estimate the structure of graphs with binary nodes. This distribution is discussed in the framework of the exponential family, and its statistical properties regarding independence of the nodes are demonstrated. Importantly the model can e…

Finite index solutions to Bernoulli problem are always axially symmetric.

This work extends score-based methods to binary data on the Boolean hypercube.

Proves a principle for one-phase Bernoulli problem minimizers.

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional simplex. Under certain conditions, this random walk is self-similar and corresponds …

We describe the combinatorial stochastic process underlying a sequence of conditionally independent Bernoulli processes with a shared beta process hazard measure. As shown by Thibaux and Jordan [TJ07], in the special case when the underlying beta process has a constant concentration function and a finite and nonatomic …

This paper was presented and written for two seminars: a national UK University Risk Conference and a Risk Management industry workshop. The target audience is therefore a cross section of Academics and industry professionals. The current ongoing global credit crunch has highlighted the importance of risk measurement i…

Let S be a nonexceptional oriented surface of finite type. We construct an uncountable family of probability measures on the space of area on holomorphic quadratic differentials over the moduli space for S containing the usual Lebesgue measure. These measures are invariant under the Teichmueller geodesic flow, and they…

Bayesian autoencoders improve OOD detection by addressing Bernoulli likelihood issues.

This paper proposed a new regression model called $l_1$-regularized outlier isolation and regression (LOIRE) and a fast algorithm based on block coordinate descent to solve this model. Besides, assuming outliers are gross errors following a Bernoulli process, this paper also presented a Bernoulli estimate model which, …

Study on free boundary problems in RCD spaces, proving existence and regularity.

This research simplifies computation of feature attribution methods under certain conditions.

Bayesian nonparametric (BNP) models provide elegant methods for discovering underlying latent features within a data set, but inference in such models can be slow. We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed a…

We solve Euler equations on graph manifolds, classifying steady flows with Morse-Bott Bernoulli functions.

The paper cleans label noise in supervised classification using Bernoulli sampling.

A drone-based MOT algorithm tracks vehicles using neural network detections and TPMBM filter.

This paper tackles open problem of tight bounds for KBs with Bernoulli rewards.

Dasgupta and Shulman showed that a two-round variant of the EM algorithm can learn mixture of Gaussian distributions with near optimal precision with high probability if the Gaussian distributions are well separated and if the dimension is sufficiently high. In this paper, we generalize their theory to learning mixture…

Spectral method speeds fitting of binary time series models.

EBUCB framework achieves optimal regret with bounded approximate inference error.

We consider the problem of estimating the support of a vector $β^* \in \mathbb{R}^{p}$ based on observations contaminated by noise. A significant body of work has studied behavior of $\ell_1$-relaxations when applied to measurement matrices drawn from standard dense ensembles (e.g., Gaussian, Bernoulli). In this paper,…

The paper develops sampling methods for ocean phenomena based on temperature and salinity measurements.

A new method for efficient nonlinear process monitoring using random Bernoulli features.

We study the fundamental problem of learning an unknown, smooth probability function via pointwise Bernoulli tests. We provide a scalable algorithm for efficiently solving this problem with rigorous guarantees. In particular, we prove the convergence rate of our posterior update rule to the true probability function in…

The issue of model risk in default modeling has been known since inception of the Academic literature in the field. However, a rigorous treatment requires a description of all the possible models, and a measure of the distance between a single model and the alternatives, consistent with the applications. This is the pu…

A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.

Variational autoencoders (VAE) have quickly become a central tool in machine learning, applicable to a broad range of data types and latent variable models. By far the most common first step, taken by seminal papers and by core software libraries alike, is to model MNIST data using a deep network parameterizing a Berno…

First order invariants of generic immersions of manifolds of dimension nm-1 into manifolds of dimension n(m+1)-1, m,n>1 are constructed using the geometry of self-intersections. The range of one of these invariants is related to Bernoulli numbers. As by-products some geometrically defined invariants of regular homotopy…

Develops thermodynamic formalism for quasimorphisms on negatively curved spaces.

New $L$-functions for 3-manifolds connect to Witten invariants and relate to generalized Bernoulli polynomials.

In previous work, theoretical analysis based on the tensor Restricted Isometry Property (t-RIP) established the robust recovery guarantees of a low-tubal-rank tensor. The obtained sufficient conditions depend strongly on the assumption that the linear measurement maps satisfy the t-RIP. In this paper, by exploiting the…

A cornerstone of human statistical learning is the ability to extract temporal regularities / patterns from random sequences. Here we present a method of computing pattern time statistics with generating functions for first-order Markov trials and independent Bernoulli trials. We show that the pattern time statistics c…

Improved regret bounds for DP-KLUCB and DP-IMED in Bernoulli bandits.

New Gibbs sampling reduces GLMB filtering complexity to linear time.