arXiv research

Characterizes symmetric Bernoulli distributions with minimal convex sums.

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…

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

Bayesian autoencoders improve OOD detection by addressing Bernoulli likelihood issues.

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

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 …

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

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…

A new sampling method balances multi-label datasets by preserving category frequency order.

Feature selection problems have been extensively studied for linear estimation, for instance, Lasso, but less emphasis has been placed on feature selection for non-linear functions. In this study, we propose a method for feature selection in high-dimensional non-linear function estimation problems. The new procedure is…

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…

A new RBM model handles both linear and log-amplitude spectrograms.

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

BeMF improves recommendation reliability in recommender systems.

We study in detail and explicitly solve the version of Kyle's model introduced in a specific case in \cite{BB}, where the trading horizon is given by an exponentially distributed random time. The first part of the paper is devoted to the analysis of time-homogeneous equilibria using tools from the theory of one-dimensi…

Paper confirms Feldman's conjecture on two-armed bandit problem.

New binary AA methods improve on existing techniques.

Gaussian prior and likelihood improve bandit learning performance.

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

Upper bound on expected supremum of Bernoulli process.

We introduce an infectious default and recovery model for N obligors. Obligors are assumed to be exchangeable and their states are described by N Bernoulli random variables S_{i} (i=1,...,N). They are expressed by multiplying independent Bernoulli variables X_{i},Y_{ij},Y'_{ij}, and default and recovery infections are …

Improves interpretability of anomaly scores in GBRBM-based detection.

A novel method for estimating Bayesian network (BN) parameters from data is presented which provides improved performance on test data. Previous research has shown the value of representing conditional probability distributions (CPDs) via neural networks(Neal 1992), noisy-OR gates (Neal 1992, Diez 1993)and decision tre…

Data processing inequalities link Fisher information to local differential privacy constraints.

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

Finite index solutions to Bernoulli problem are always axially symmetric.

Paper proposes a new estimator for generic discrete distributions.

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. …

Proves a principle for one-phase Bernoulli problem minimizers.

Optimization-based pruning eliminates backpropagation for large language models.

In this paper, we are concerned with obtaining distribution-free concentration inequalities for mixture of independent Bernoulli variables that incorporate a notion of variance. Missing mass is the total probability mass associated to the outcomes that have not been seen in a given sample which is an important quantity…

We consider $N$ Bernoulli random variables, which are independent conditional on a common random factor determining their probability distribution. We show that certain expected functionals of the proportion $L_N$ of variables in a given state converge at rate $1/N$ as $N\rightarrow \infty$. Based on these results, we …

Improved BAI under DP reduces gap to constant.

Convolutional neural networks (CNNs) work well on large datasets. But labelled data is hard to collect, and in some applications larger amounts of data are not available. The problem then is how to use CNNs with small data -- as CNNs overfit quickly. We present an efficient Bayesian CNN, offering better robustness to o…

New ZIPLN model accounts for zero-inflation in multivariate count data.

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, …

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

This paper explores the scenarios under which an attacker can claim that 'Noise and access to the softmax layer of the model is all you need' to steal the weights of a convolutional neural network whose architecture is already known. We were able to achieve 96% test accuracy using the stolen MNIST model and 82% accurac…

We show how to analyze and interpret the correlation structures, the conditional expectation values and correlation coefficients of exchangeable Bernoulli random variables. We study implied default distributions for the iTraxx-CJ tranches and some popular probabilistic models, including the Gaussian copula model, Beta …

Spectral method speeds fitting of binary time series models.

Motivated by the ever-increasing demands for limited communication bandwidth and low-power consumption, we propose a new methodology, named joint Variational Autoencoders with Bernoulli mixture models (VAB), for performing clustering in the compressed data domain. The idea is to reduce the data dimension by Variational…

Study explores geometric structure and prior for beta-logistic distribution.

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

The multi-armed bandit (MAB) problem is a classic example of the exploration-exploitation dilemma. It is concerned with maximising the total rewards for a gambler by sequentially pulling an arm from a multi-armed slot machine where each arm is associated with a reward distribution. In static MABs, the reward distributi…

A framework for robust exploration in reinforcement learning under ambiguity.

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…

Innovative game theory approach optimizes survival analysis metrics.

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…