Latent feature models are widely used to decompose data into a small number of components. Bayesian nonparametric variants of these models, which use the Indian buffet process (IBP) as a prior over latent features, allow the number of features to be determined from the data. We present a generalization of the IBP, the …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,932 papers · 148 categories
Trend · papers per month
35 results for “IBP”
New method CROWN-IBP combines IBP and CROWN for efficient verifiable robust neural networks.
problem Training verifiably robust neural networks is challenging and computationally expensive.
method CROWN-IBP combines interval bound propagation and linear relaxation for efficient training.
result CROWN-IBP achieves significant improvements in verifiable robustness on MNIST and CIFAR datasets.
Hierarchical IBP model for Bayesian neural networks in continual learning.
problem Resource allocation in continual learning with dynamic network complexity.
method Indian Buffet process (IBP) and Hierarchical-IBP (H-IBP) priors for structure learning, online variational inference with reparameterization.
result Our model effectively learns the number of weights in each layer, overcoming overfitting and underfitting.
By expressing prior distributions as general stochastic processes, nonparametric Bayesian methods provide a flexible way to incorporate prior knowledge and constrain the latent structure in statistical inference. The Indian buffet process (IBP) is such an example that can be used to define a prior distribution on infin…
We are often interested in explaining data through a set of hidden factors or features. When the number of hidden features is unknown, the Indian Buffet Process (IBP) is a nonparametric latent feature model that does not bound the number of active features in dataset. However, the IBP assumes that all latent features a…
IBP-R improves verified adversarial robustness with simple, effective interval bound propagation.
problem Improving verifiability of adversarially trained networks.
method Coupling adversarial attacks with interval bound propagation for minimized verification gap.
result State-of-the-art verified robustness-accuracy trade-offs for small perturbations on CIFAR-10.
Proposes ETB for tighter bounds in robust training of deep networks.
problem Training robust deep neural networks to adversarial attacks.
method Proposes ETB, a provably tighter bound approach for interval bound propagation.
result Achieves orders of magnitudes tighter bounds compared to IBP.
Paper proposes faster certified robust training methods with short warmup.
problem Certified robust training methods require long warmup schedules, making training costly.
method Proposes three improvements: new weight initialization, BN, and regularization.
result Achieves 65.03% verified error on CIFAR-10 and 82.36% on TinyImageNet with short warmup.
New IBOs resolve contradictions in mutual information optimization.
problem Contradictions in mutual information optimization between IBP, PIBP, and recent results.
method Formulated and optimized variational bounds on new IBOs.
result New IBOs account for parameter selection in trained models.
Recent work has shown that it is possible to train deep neural networks that are provably robust to norm-bounded adversarial perturbations. Most of these methods are based on minimizing an upper bound on the worst-case loss over all possible adversarial perturbations. While these techniques show promise, they often res…
Nonparametric models are versatile, albeit computationally expensive, tool for modeling mixture models. In this paper, we introduce spectral methods for the two most popular nonparametric models: the Indian Buffet Process (IBP) and the Hierarchical Dirichlet Process (HDP). We show that using spectral methods for the in…
Improved disentangled representation learning using a non-parametric latent density model.
problem Limited disentanglement in VAE due to constraints on latent density independence and complexity.
method Utilized the Indian Buffet Process (IBP) as a non-parametric latent density model to allow richer modeling capacity.
result IBP-VAE outperformed state-of-the-art VAEs in disentangling latent factors across various datasets.
Inference for latent feature models is inherently difficult as the inference space grows exponentially with the size of the input data and number of latent features. In this work, we use Kurihara & Welling (2008)'s maximization-expectation framework to perform approximate MAP inference for linear-Gaussian latent featur…
New IBP formulae for rough stochastic Volterra processes.
problem Deriving IBP formulae for path-dependent stochastic Volterra processes.
method Developed a new fractional IBP formula that interpolates between standard and Bismut-Elworthy-Li formulae.
result For rough noise, the expectation is differentiable along constant directions under certain Hölder continuity conditions.
Paper tackles robust optimal transport with improved computational complexity and barycenter approximation.
problem Computing robust optimal transport and its barycenter efficiently.
method Sinkhorn-based algorithms for robust optimal transport and iterative Bregman projections for barycenter approximation.
result Improved computational complexity for robust optimal transport and barycenter approximation.
A Bayesian nonparametric approach for continual learning using neural networks.
problem Catastrophic forgetting in neural networks during sequential task settings.
method Indian Buffet Process (IBP) prior for dynamic model expansion and factorization of weight matrices.
result The method promotes positive knowledge transfer between tasks and allows for dynamic model complexity.
The analysis of comorbidity is an open and complex research field in the branch of psychiatry, where clinical experience and several studies suggest that the relation among the psychiatric disorders may have etiological and treatment implications. In this paper, we are interested in applying latent feature modeling to …
The continuum-of-urns scheme, generalized beta and Indian buffet processes, and hierarchies thereofmath.PR
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 …
Study on Wasserstein barycenters with computational hardness and fast algorithm development.
problem Computing Wasserstein barycenters of discrete probability measures with fixed support.
method Developed a deterministic variant of IBP algorithm, FastIBP, with improved complexity.
result Demonstrated favorable performance of FastIBP in practice.
Paper provides efficient robustness certificates for neural networks.
problem Ensuring neural networks are robust against adversarial attacks.
method Two-step approach: 1) Efficient convex optimization for robustness certificates with bounded Hessian eigenvalues, 2) Curvature-based regularization during training.
result Significantly higher certified robust accuracy achieved compared to existing methods.
A nonparametric Bayesian extension of Factor Analysis (FA) is proposed where observed data is modeled as a linear superposition, , of a potentially infinite number of hidden factors, . The Indian Buffet Process (IBP) is used as a prior on to incorporate sparsity and to …
Using nonparametric methods has been increasingly explored in Bayesian hierarchical modeling as a way to increase model flexibility. Although the field shows a lot of promise, inference in many models, including Hierachical Dirichlet Processes (HDP), remain prohibitively slow. One promising path forward is to exploit t…
Matrix factorisation methods decompose multivariate observations as linear combinations of latent feature vectors. The Indian Buffet Process (IBP) provides a way to model the number of latent features required for a good approximation in terms of regularised reconstruction error. Previous work has focussed on latent fe…
Proposes batch version of Greenkhorn for multimarginal OT, proving convergence.
problem Optimal transport problems with multiple marginals.
method Batch Greenkhorn algorithm, iterative Bregman projections, greedy control.
result Global linear rate of convergence and explicit iteration complexity bounds.
Analyzing multivariate time series data is important to predict future events and changes of complex systems in finance, manufacturing, and administrative decisions. The expressiveness power of Gaussian Process (GP) regression methods has been significantly improved by compositional covariance structures. In this paper…
We present the Wright-Fisher Indian buffet process (WF-IBP), a probabilistic model for time-dependent data assumed to have been generated by an unknown number of latent features. This model is suitable as a prior in Bayesian nonparametric feature allocation models in which the features underlying the observed data exhi…
We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…
We propose a probabilistic model to infer supervised latent variables in the Hamming space from observed data. Our model allows simultaneous inference of the number of binary latent variables, and their values. The latent variables preserve neighbourhood structure of the data in a sense that objects in the same semanti…
Bayesian model learns optimal number of latent dimensions for Boolean data.
problem Optimal number of latent dimensions in Boolean data models.
method Indian Buffet Process prior over factor matrices for non-parametric Boolean factorisation.
result Posterior inference is efficient and the number of latent dimensions is transparently inferred.
Deep Generative Model with Beta Bernoulli Process for Modeling and Learning Confounding Factorscs.LG
While deep representation learning has become increasingly capable of separating task-relevant representations from other confounding factors in the data, two significant challenges remain. First, there is often an unknown and potentially infinite number of confounding factors coinciding in the data. Second, not all of…
Paper aims to ensure reliable detection of out-of-distribution data with certifiable worst-case guarantees.
problem Deep neural networks are overconfident with OOD inputs, posing safety risks.
method Enforces low confidence and bounds in an -ball around OOD points using interval bound propagation (IBP).
result Certifiable worst-case guarantees for OOD detection are possible without significant loss in accuracy.
New expressive losses improve adversarial robustness without sacrificing accuracy.
problem Training networks for robustness at the expense of accuracy.
method Formalizing expressivity, using convex combinations of adversarial attacks and IBP bounds.
result Trivial expressive losses yield state-of-the-art results in various settings.
SAWAR improves SA models by making them more robust to data uncertainties.
problem Improving survival analysis models' robustness to data uncertainties.
method Adversarial robustness through Min-Max optimization with CROWN-IBP.
result SAWAR outperforms baseline methods and SOTA models across various metrics.
HYDRA prunes robust neural networks to improve both benign and adversarial robustness.
problem Lack of robustness against adversarial attacks and large neural network size in deep learning.
method HYDRA integrates pruning techniques with adversarial training and verifiable robust training objectives.
result HYDRA achieves compressed networks with state-of-the-art benign and robust accuracy.
Nonnegative Matrix Factorization (NMF) aims to factorize a matrix into two optimized nonnegative matrices appropriate for the intended applications. The method has been widely used for unsupervised learning tasks, including recommender systems (rating matrix of users by items) and document clustering (weighting matrix …