A new framework predicts links in time-dependent networks using Bernoulli autoregression.
problem Predicting links in time-dependent networks with additional auxiliary information.
method A Bernoulli autoregressive model with regularization for link discovery.
result The model can discover new links not present in the data.
We introduce a novel multivariate random process producing Bernoulli outputs per dimension, that can possibly formalize binary interactions in various graphical structures and can be used to model opinion dynamics, epidemics, financial and biological time series data, etc. We call this a Bernoulli Autoregressive Proces…
The paper proves ML estimators are strongly consistent for identifying edge weights in BAR models.
problem Identifying edge weights in Bernoulli Autoregressive (BAR) models.
method Maximum Likelihood (ML) estimation for two variants of BAR models.
result ML estimators are strongly consistent for edge weight identification.
Vector autoregressive models characterize a variety of time series in which linear combinations of current and past observations can be used to accurately predict future observations. For instance, each element of an observation vector could correspond to a different node in a network, and the parameters of an autoregr…
CRBMs improve financial regime detection with PCD and free energy analysis.
problem Detecting systemic risk regimes in financial time series.
method Extended RBM to CRBM with autoregressive conditioning and PCD. Decomposed free energy into magnitude and correlation components.
result CRBM's free energy metric distinguishes between magnitude shocks and market regimes.
SpinSVAR estimates SVAR models with sparse input, improving accuracy and scalability.
problem Estimating SVAR models with sparse input assumptions.
method SpinSVAR models input as independent Laplacian variables, enforcing sparsity and using least absolute error regression.
result SpinSVAR outperforms state-of-the-art methods in accuracy and runtime, identifying significant structural shocks.
We consider the problem of estimating the parameters of a multivariate Bernoulli process with auto-regressive feedback in the high-dimensional setting where the number of samples available is much less than the number of parameters. This problem arises in learning interconnections of networks of dynamical systems with …
Characterizes symmetric Bernoulli distributions with minimal convex sums.
problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.
Upper bound on expected supremum of Bernoulli process.
problem Bounding the supremum of Bernoulli processes.
method Using properties of the index set and function class, extending earlier results on Gaussian processes.
result An upper bound on the expected supremum of a Bernoulli process.
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.
problem Entire solutions to the Bernoulli free boundary problem with finite Morse index in 3D.
method Proof of axial symmetry for finite index solutions.
result Finite index solutions to the Bernoulli problem in 3D are axially symmetric.
Proves a principle for one-phase Bernoulli problem minimizers.
problem One-phase Bernoulli problem minimizers.
method Strong maximum principle, Alt-Caffarelli functional, Hardt-Simon-type foliation.
result Constructs a foliation for global 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 …
Bayesian autoencoders improve OOD detection by addressing Bernoulli likelihood issues.
problem Out-of-distribution (OOD) detection fails with Bernoulli likelihood for certain datasets.
method Proposes Bayesian autoencoders and alternative likelihood models to fix the issue.
result Bayesian autoencoders and alternative likelihood models improve OOD detection accuracy.
This paper proposed a new regression model called l1-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.
problem Classifying steady Euler flows with Morse-Bott Bernoulli functions.
method Constructing non-vanishing steady solutions using integrable systems and topology.
result Steady Euler flows with Morse-Bott Bernoulli functions exist only on graph three-manifolds.
The paper cleans label noise in supervised classification using Bernoulli sampling.
problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.
This paper tackles open problem of tight bounds for KBs with Bernoulli rewards.
problem Open problem of tight bounds for Kernelized Bandits with Bernoulli rewards.
method Focus on Bernoulli model, not subgaussian noise, and optimize function in RKHS.
result Open problem remains unsolved in this context.
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.
problem Modeling binary time series data with latent linear dynamical systems.
method Spectral learning of probit-Bernoulli latent linear dynamical systems.
result Spectral method provides robust, fixed-cost estimator.
A new method for efficient nonlinear process monitoring using random Bernoulli features.
problem High computational demands and real-time responsiveness in online monitoring systems.
method Random Bernoulli principal component analysis to capture nonlinear patterns efficiently.
result The proposed methods offer excellent scalability and reduced computational complexity.
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…
Multivariate Bernoulli autoregressive (BAR) processes model time series of events in which the likelihood of current events is determined by the times and locations of past events. These processes can be used to model nonlinear dynamical systems corresponding to criminal activity, responses of patients to different med…
A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.
problem Optimizing parameters of finite mixture models of Bernoulli and categorical distributions.
method Mean Field Games theory applied to multi-population systems.
result The Mean Field Games approach provides a method to compute mixture model parameters.
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…
New L-functions for 3-manifolds connect to Witten invariants and relate to generalized Bernoulli polynomials.
problem Understanding L-functions for 3-manifolds and their invariants. method Using Mellin transforms and asymptotic techniques, proving entire functions and their values.
result Linear relations between L-function values at negative integers, generalizing known zeta functions. A new neural subsampling method reduces data volume for deep models.
problem Efficiently process huge volumes of high-dimensional data like images.
method Two-stage end-to-end neural subsampling model that optimizes for arbitrary downstream tasks.
result Outperforms baselines under low subsampling rates on various tasks.
Improved regret bounds for DP-KLUCB and DP-IMED in Bernoulli bandits.
problem Minimizing regret in stochastic bandits under ε-global Differential Privacy.
method Developed DP versions of KLUCB and IMED, proving tighter lower bounds and matching upper bounds.
result DP-KLUCB and DP-IMED achieve asymptotically optimal regret under ε-global DP.
Paper compares credit portfolio risks using robust Bernoulli mixture models.
problem Tackles risk bounds and comparison of credit portfolio losses.
method Uses Bernoulli mixture models with conditional independence and stochastic increasing defaults.
result Provides conditions for comparing conditional default probabilities and portfolio losses.
New acquisition functions improve Bernoulli LSE.
problem Efficiently estimating regions where a Bernoulli function is above or below a threshold.
method Developed new look-ahead acquisition functions for Gaussian process classification models.
result Demonstrated clear benefits of new acquisition functions on benchmark and real-world tasks.
Autoregressive models are among the best performing neural density estimators. We describe an approach for increasing the flexibility of an autoregressive model, based on modelling the random numbers that the model uses internally when generating data. By constructing a stack of autoregressive models, each modelling th…
Let {Tt} 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 {Tt} is Bernoulli, or {Tt} is isomorphic to the product of a Bernoulli flow and a rotational flow. Appli…
This work proposes an efficient autoregressive model for text generation.
problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.
BeMF improves recommendation reliability in recommender systems.
problem Improving reliability in recommender systems beyond accuracy.
method Bernoulli Matrix Factorization (BeMF) for model-based collaborative filtering.
result BeMF selects more reliable predictions, improving recommendation quality.
Autoregressive sequence models achieve state-of-the-art performance in domains like machine translation. However, due to the autoregressive factorization nature, these models suffer from heavy latency during inference. Recently, non-autoregressive sequence models were proposed to reduce the inference time. However, the…
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…
Bayesian method for multivariate autoregressive models with exogenous inputs.
problem Estimating uncertainties in autoregressive models with exogenous inputs.
method Recursive Bayesian estimation via message passing in a factor graph.
result Produces full posterior distributions for autoregressive coefficients and noise precision.
Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…
Study analyzes symmetric two-armed Bernoulli bandit problem with zero mean gap.
problem Analyzing symmetric two-armed Bernoulli bandit problem with zero mean gap.
method Associated with a solution of a linear heat equation, compute leading order terms of minmax optimal regret and pseudoregret.
result Explicitly compute leading order terms in three scaling regimes for the gap.
Exact simulation of correlated binary outcomes using PMF constraints and linear programming.
problem Simulating dependent Bernoulli outcomes with specific means and correlations.
method Formulate the problem over the joint Bernoulli PMF, impose constraints, and solve as a linear program. Use convex-hull characterization and truncated-moment completion scheme for feasibility and simulation.
result Exact simulation framework for correlated binary outcomes, providing a convex-hull characterization and truncated-moment completion scheme.
Alternative sampling method for autoregressive models using Langevin dynamics.
problem Efficiently sampling from autoregressive models.
method Initialize sequences with white noise and follow Langevin dynamics on global log-likelihood.
result Parallelizes and generalizes sampling process for autoregressive models.
A new sampling method balances multi-label datasets by preserving category frequency order.
problem Sampling challenges in multi-label datasets with varying label frequencies.
method Uses multivariate Bernoulli distribution and label dependencies to estimate and weight label combinations.
result Produces a more balanced sub-sample with enhanced representation of minority categories.
A new RBM model handles both linear and log-amplitude spectrograms.
problem Handling amplitude spectra with existing models.
method Proposed gamma-Bernoulli RBM that uses gamma distribution.
result The model can naturally handle positive numbers and log-amplitude spectrograms.
Proposes a non-parametric method for deep discrete latent variable models.
problem Learning sparse discrete latent representations in deep models.
method Iterative algorithm with Beta-Bernoulli process prior and local data scaling.
result Improves sparsity and scalability of deep discrete latent variable models.
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 …
Paper proposes AXE loss for non-autoregressive machine translation, improving performance.
problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.
Improved training of GRBMs for image generation.
problem Training Gaussian-Bernoulli RBMs efficiently and effectively.
method Introduces a novel Gibbs-Langevin sampling algorithm and a modified contrastive divergence (CD) algorithm.
result Demonstrates robust training of GRBMs with large learning rates, removing the need for tricks.