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 …
Adaptive network sparsification improves model compactness and accuracy.
problem Suboptimal network sparsification due to input-independent dropout.
method Dependent variational beta-Bernoulli dropout.
result Significantly more compact networks with consistent accuracy improvements.
A new parallel MCMC method for Indian Buffet Process models.
problem Slow inference in Indian Buffet Process models.
method Hybrid sampler combining collapsed and uncollapsed MCMC for parallel computation.
result Asymptotically exact parallel inference for Indian Buffet Process models.
A beta-negative binomial (BNB) process is proposed, leading to a beta-gamma-Poisson process, which may be viewed as a "multi-scoop" generalization of the beta-Bernoulli process. The BNB process is augmented into a beta-gamma-gamma-Poisson hierarchical structure, and applied as a nonparametric Bayesian prior for an infi…
Characterizes exchangeable feature allocations with specific probability functions.
problem Tackles the characterization of exchangeable feature allocations with product-form probability functions.
method Characterizes the class of exchangeable feature allocations using a countable matrix, sequences of weights, and a consistency condition.
result Provides a characterization of the Indian Buffet Process and Beta--Bernoulli model as the only consistent exchangeable feature allocations with product form.
Stochastic variational inference (SVI) is emerging as the most promising candidate for scaling inference in Bayesian probabilistic models to large datasets. However, the performance of these methods has been assessed primarily in the context of Bayesian topic models, particularly latent Dirichlet allocation (LDA). Deri…
New models discover new topics over time in topic modeling.
problem Discovering new topics over time in topic modeling.
method Nonparametric Bayesian models and Hungarian matching algorithm.
result Significantly faster than existing methods, discovering new topics in large datasets.
New algorithm speeds Bayesian nonparametric model inference.
problem Slow inference in Bayesian nonparametric models.
method Decompose random measures into finite and infinite sub-measures; use different algorithms for each.
result Hybrid algorithm improves scalability and mixing.
While most Bayesian nonparametric models in machine learning have focused on the Dirichlet process, the beta process, or their variants, the gamma process has recently emerged as a useful nonparametric prior in its own right. Current inference schemes for models involving the gamma process are restricted to MCMC-based …
Efficient CVI for NGFA improves GFA inference for large-scale data.
problem Inference limitations in GFA models for large-scale data.
method Collapsed variational inference for nonparametric Bayesian GFA.
result CVI algorithm effectively approximates NGFA posterior in collapsed space.
Super-resolution methods form high-resolution images from low-resolution images. In this paper, we develop a new Bayesian nonparametric model for super-resolution. Our method uses a beta-Bernoulli process to learn a set of recurring visual patterns, called dictionary elements, from the data. Because it is nonparametric…
Modeling correlated mutations in cancer for personalized treatment.
problem Identifying mutations for personalized cancer therapy in heterogeneous profiles.
method Proposed correlated zero-inflated negative binomial process with mixed beta-Bernoulli and variational inference.
result Identified biologically relevant correlations between somatic mutations.
Paper tackles deep learning confounding factors, learns unseen factors.
problem Learning from data with unknown and potentially infinite confounding factors.
method Combines deep generative models with Bayesian non-parametric factor models (Indian Buffet Process).
result Model can learn from data with unknown and potentially infinite confounding factors.
Conjugate pairs of distributions over infinite dimensional spaces are prominent in statistical learning theory, particularly due to the widespread adoption of Bayesian nonparametric methodologies for a host of models and applications. Much of the existing literature in the learning community focuses on processes posses…
AutoSeM automatically selects and balances auxiliary tasks in MTL.
problem Choosing and balancing auxiliary tasks in MTL.
method AutoSeM uses a Beta-Bernoulli multi-armed bandit with Thompson Sampling for task selection and a Gaussian Process for learning the mixing ratio.
result AutoSeM achieves significant performance boosts on GLUE language understanding tasks.
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.
This paper introduces a Bayesian framework for optimizing online experiments to maximize profit.
problem Statistical flaws and reliance on proxy metrics in A/B tests compromise their effectiveness.
method Hierarchical Bayesian model for estimating conversion probability and monetary value, decision-theoretic stopping rule.
result The framework ensures experiments conclude when no variant offers a significant profit improvement, conserving resources.
Proposes a flexible feature allocation model for sparse factor analysis.
problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.
PPT optimizes transformer behavior by steering its latent posterior using prior samples.
problem Eliciting desired behavior from transformers without backpropagation.
method Posterior Prefix Tuning (PPT) uses predictive Monte Carlo (PMC) samples and importance sampling to optimize the latent posterior.
result PPT optimizes transformer behavior without backpropagation, achieving high utility across different utility functions.
The paper improves theoretical guarantees for Thompson Sampling in cascading bandits.
problem Optimizing online recommender systems with cascading bandits.
method Develops and analyzes new Thompson Sampling algorithms for cascading bandits.
result Establishes the first theoretical guarantees on Thompson Sampling for cascading bandits.
Bayesian model identifies cancer pathways using genomic data.
problem Identifying altered pathways associated with specific cancer types.
method Bayesian semi-nonnegative tri-matrix factorization incorporating biological prior knowledge.
result Pathways identified can be used as prognostic biomarkers.
Introduces a new class of hybrid processes combining Markov chains and Hawkes processes.
problem Characterize and ensure existence and uniqueness of complex hybrid marked point processes.
method Defines hybrid marked point processes implicitly via intensity and state process interactions, proving existence and uniqueness under general assumptions.
result Proves existence and uniqueness of hybrid marked point processes, extending existing results.
This chapter is an attempt to present a mathematical theory of compound fractional Poisson processes. The chapter begins with the characterization of a well-known Lévy process: The compound Poisson process. The semi-Markov extension of the compound Poisson process naturally leads to the compound fractional Poisson proc…
A deep Neyman-Scott process uses Poisson processes for efficient inference in complex point processes.
problem Efficient inference in complex hierarchical point processes.
method Developed an efficient posterior sampling via Markov chain Monte Carlo for likelihood-based inference.
result More hidden Poisson processes improve likelihood fitting and event prediction.
The study examines Hawkes processes and their long-term behavior.
problem Understanding the long-term behavior of Hawkes processes.
method Proving functional limit theorems under various conditions on the dispersion of child events.
result Functional limit theorems hold for Hawkes processes with different levels of child event dispersion.
Paper discovers process models from online event streams.
problem Discovering process models from continuous event streams.
method Generic architecture for process discovery in event streams.
result The proposed architecture enables process discovery from event streams.
Elliptical processes generalize Gaussian and Student-t models with fat tails and computational efficiency.
problem Need for models with fat tails and computational tractability.
method Represent elliptical distributions as continuous mixtures of Gaussian distributions, derive closed-form expressions for marginal and conditional distributions.
result Elliptical processes offer advantages in robust regression compared to Gaussian processes.
Directly proves CRP from stick-breaking process without measure theory.
problem Indirect proof of CRP from stick-breaking process is complex.
method Direct proof using stick-breaking process to CRP, avoiding measure theory.
result Direct proof connects stick-breaking process to CRP.
We show that the stick-breaking construction of the beta process due to Paisley, et al. (2010) can be obtained from the characterization of the beta process as a Poisson process. Specifically, we show that the mean measure of the underlying Poisson process is equal to that of the beta process. We use this underlying re…
SNP extends Neural Processes to handle temporal dependencies in sequences.
problem Handling temporal dependencies in sequences of stochastic processes.
method Integrates a temporal state-transition model into Neural Processes.
result First 4D model capable of dynamic 3D scene modeling.
We investigate the Student-t process as an alternative to the Gaussian process as a nonparametric prior over functions. We derive closed form expressions for the marginal likelihood and predictive distribution of a Student-t process, by integrating away an inverse Wishart process prior over the covariance kernel of a G…
Efficient methods for Lévy models using SINH-regular processes.
problem Efficient numerical methods for evaluating Lévy models.
method Defining SL-processes and sSL-processes, deriving properties of characteristic exponent, and showing all popular Lévy processes can be subordinated to Brownian motion.
result All crucial properties of characteristic exponent are consequences of a specific representation, and all popular Lévy processes are SL- or sSL-subordinated Brownian motion.
GRM uses graph neural networks to score process activity relevance.
problem Improving business processes with performance measures.
method Graph Relevance Miner (GRM) based on graph neural networks.
result Quantitatively evaluated relevance scores with four datasets.
Researchers study the geometric properties of a specific type of stable processes.
problem Understanding the information geometry of tempered stable processes.
method Derivation of α-divergence, Fisher information matrices, and α-connections.
result Obtained Fisher information matrices and α-connections for statistical manifolds.
This study bridges discrete and continuous state spaces using the Ehrenfest process and diffusion models.
problem Understanding the relationship between discrete and continuous state spaces in stochastic processes.
method Investigates time-continuous Markov jump processes on discrete state spaces and their correspondence to state-continuous diffusion processes.
result The time-reversal of the Ehrenfest process converges to the time-reversed Ornstein-Uhlenbeck process, bridging discrete and continuous state spaces.
Paper proposes a new method for online process discovery.
problem Online process discovery requires limited memory.
method Mapped online process discovery to cache memory management and applied cache replacement policies.
result Implemented and evaluated a new approach for online process discovery.
Student's-T processes improve on Gaussian processes by handling outliers and variance more flexibly.
problem Outliers and variance limitations in Gaussian processes.
method Generalization of Gaussian processes using Student's-T distribution, with new kernel function and update rule.
result Student's-T processes provide better performance in Bayesian optimization, especially with outliers.
The fractional Poisson process (FPP) is a counting process with independent and identically distributed inter-event times following the Mittag-Leffler distribution. This process is very useful in several fields of applied and theoretical physics including models for anomalous diffusion. Contrary to the well-known Poiss…
Proposes a new BSP-Tree process for flexible space partition modeling.
problem Limited modelling flexibility of axis-aligned partitions in Mondrian process.
method Introduces a self-consistent Binary Space Partitioning (BSP)-Tree process with oblique cuts.
result Clear inferential improvements over standard Mondrian process and related methods.
Elliptical processes extend Gaussian models with heavier tails.
problem Regression and classification with non-Gaussian likelihoods or heavy tails.
method Spline normalizing flow for variational inference of elliptical distributions.
result Elliptical processes outperform Gaussian processes in non-Gaussian settings.
Introduces GIMP processes for multivariate equity derivatives.
problem Evaluating multivariate equity derivatives with martingale pricing.
method Defines GIMP processes with no-Granger-causality of increments in a Markov setting.
result GIMP processes are closed under time change and maintain martingale property.
Recurrent neural networks improve process instance classification.
problem Classifying ongoing process instances based on activities.
method Applied recurrent neural networks, specifically GRU, to classify business process instances.
result GRU outperforms LSTM in training time with similar accuracy.
In this paper, we obtain the finite-horizon and infinite-horizon ruin probability asymptotics for risk processes with claims of subexponential tails for non-stationary arrival processes that satisfy a large deviation principle. As a result, the arrival process can be dependent, non-stationary and non-renewal. We give t…
Deep learning predicts business process events with high precision.
problem Predicting next events in business processes.
method Recurrent neural networks applied to deep learning.
result Deep learning surpasses state-of-the-art in prediction precision.
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…
The paper analyzes multivariate Hawkes processes and their induced population processes.
problem Analyzing the time-dependent joint probability distribution of multivariate Hawkes processes.
method Exact and asymptotic analysis of general multivariate Hawkes processes and their induced population processes.
result Full characterization of the time-dependent joint transform of the multivariate population process and its intensity process.
This paper introduces belief propagation for Gaussian reciprocal processes and links it to stability theory.
problem Efficient inference algorithms for reciprocal processes, especially those with a single loop network.
method Introduces belief propagation for Gaussian reciprocal processes and links it to stability theory.
result Established a link between convergence analysis of belief propagation for Gaussian reciprocal processes and stability theory for differentially positive systems.