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.
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 …
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.
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…
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.
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 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.
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…
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.
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.
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.
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 …
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.
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.
Paper constructs conjugate pairs for Bayesian nonparametric models with continuous likelihoods.
problem Limited conjugate pairs for Bayesian nonparametric models with continuous likelihoods.
method Develops a general construction for prior, likelihood, and posterior in conjugate pairs for processes with Levy measure densities from positive exponential families.
result Demonstrates conjugacy for processes with Levy measure densities from positive exponential families.
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.
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.
Study develops time-continuous models and probabilistic descriptions for agent-based economic market models.
problem Formulating and describing agent-based economic market models in a time-continuous and probabilistic manner.
method Derived time-continuous formulations, discussed impact of time-scaling, proved stability, presented probabilistic descriptions using kinetic theory.
result Time-continuous formulations and probabilistic descriptions for agent-based economic market models.
Hybrid model combines interpretable and black-box models for better transparency and performance.
problem Balancing interpretability and predictive performance in machine learning models.
method Proposes a Hybrid Predictive Model (HPM) integrating an interpretable model with a black-box model, using principled objective functions and customized training algorithms.
result Hybrid models achieve an efficient trade-off between transparency and predictive performance.
The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.
problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.
Boosts generative models by combining multiple meta-models.
problem Challenges in creating a single generative model that accurately represents complex data.
method Cascades multiple meta-models (like RBM and VAE) to create a stronger generative model.
result Derives a decomposable variational lower bound for training and evaluating the boosted model.
The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.
problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.
Study on limits of community detection in various network models.
problem Limits of community detection in network models.
method Analysis of several network models including Stochastic Block Model, Exponential Random Graph Model, Latent Space Model, Directed Preferential Attachment Model, and Directed Small-world Model.
result Information-theoretic limits for recovery of node labels in network models.
Gauge Flow Models use a learnable Gauge Field in Generative Flow Models.
problem Improving generative model performance.
method Integrates a learnable Gauge Field into Flow ODEs.
result Gauge Flow Models outperform traditional Flow Models in Flow Matching experiments.
The study examines how model predictions hold up under model extensions.
problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.
MALC combines interpretable linear models with black-box models for better predictions and transparency.
problem Combining interpretability with black-box models for better predictions.
method Formulates MALC as a convex optimization problem and uses accelerated proximal gradient method for training.
result MALC provides an efficient frontier balancing prediction accuracy and transparency.
Alternative approach to model selection using transformation analysis.
problem Over-simplistic models lead to erroneous interpretations.
method Step-wise complexity reduction to identify simpler, better-interpretable models.
result Transformation models improve model fit and interpretability.
Revises Bayesian model averaging for foundation models.
problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.
Paper introduces symmetric divergence link models for probability distributions.
problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.
The paper tests stock return models and uses LSTM to predict stock returns.
problem Validating stock return models and predicting stock returns.
method Used Fama-French three-factor, four-factor, and five-factor models; also used LSTM model.
result Fama-French five-factor model shows better validity for stock returns.
New method to handle credit portfolio model uncertainties.
problem Model risk in credit portfolio models.
method Demonstrates comprehensive yet easy-to-implement approach to uncertainty in model parameters.
result Comprehensive method to deal with model uncertainties.
A new neural network model predicts multi-symbol tokens over multiple scales.
problem Language modeling with improved flexibility and performance.
method A learned dictionary of multi-symbol tokens using BPE compression.
result The model outperforms LSTM on language modeling tasks, especially for smaller models.
Researchers review challenges in interpreting additive models, especially neural additive models.
problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.
Distill-and-Compare audits black-box models by training transparent models to mimic them.
problem Auditing proprietary, opaque black-box risk scoring models.
method Model distillation and comparison of transparent student models to black-box models.
result Identifies missing features in black-box models, improving transparency.
Proposes a decision-theoretic approach for enhancing model interpretability in Bayesian frameworks.
problem Challenges the traditional approach of restricting model structure for interpretability in Bayesian frameworks.
method Introduces an interpretability utility function and a two-step method involving a reference model and a proxy model.
result Demonstrates that the proposed method generates more accurate models with the same level of interpretability.
Novel hybrid modeling combines ML and physics for real-time diagnosis.
problem Real-time diagnosis of complex systems.
method Combines machine learning and physics-based models to create reduced-order models.
result Generated models are two orders of magnitude simpler, improving efficiency.
CRS model improves ranking data modeling with theoretical guarantees.
problem Lack of rich, multimodal models for ranking data.
method Contextual Repeated Selection (CRS) model for multimodal ranking data.
result CRS model significantly outperforms existing methods in various ranking contexts.
Sigma models linked to Gross-Neveu models via quiver varieties.
problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.
New Cartan model for equivariant cohomology developed.
problem Developing a new framework for equivariant cohomology.
method Introducing a new operator dC and constructing a Cartan model. result Relations between new BRST and Weil models established.
Eigen-stratified models reduce model size and improve performance.
problem Large model size in Laplacian-regularized stratified models.
method Formulate eigen-stratified models with linear combinations of bottom eigenvectors of the graph Laplacian.
result Significant reduction in model size with eigen-stratified models.
Semi-parametric models improve robot dynamics modeling accuracy.
problem Improving inverse dynamics model accuracy in robotics.
method Comparison of semi-parametric Gaussian process regression and a novel model-based neural network.
result Semi-parametric Gaussian process regression yields the most accurate models.
A novel kernel approach for model selection in simulator-based models.
problem Model selection for simulator-based statistical models with limited prior knowledge.
method Iteratively updates model weights and parameters using Bayes' rule and kernel recursive ABC algorithm.
result Demonstrates effectiveness on dynamical systems in ecology and epidemiology.