Research
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,982 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Negative-binomial distribution

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…

2013-12-31abs ↗pdf ↗

A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency for a covariate present in a sample to both repeat itself and excite related ones…

2016-04-25abs ↗pdf ↗

NegBio-VAE models neural spike counts with negative binomial distribution.

problem Limited biological plausibility of continuous latent variables in VAEs for neural spike modeling.
method Proposes a negative binomial latent-variable model with a dispersion parameter for overdispersed spike count modeling.
result NegBio-VAE outperforms competing models in reconstruction and generation tasks.

New model predicts weekly earthquakes with better tail risk assessment.

problem Violation of Poisson assumption in seismic data.
method Neural network for per-cell overdispersion estimation.
result 8.6% reduction in mean pinball deviation, 12.5% lower CRPS in tail events.

We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce a combinatorial stochastic process known as the negative binomial process (NBP)…

2011-11-08abs ↗pdf ↗

Unified NMF models for various noise distributions, improving feature extraction.

problem Inadequate assumptions for NMF under complex data distributions.
method Unified framework using MM-algorithms for traditional and convex NMF under Tweedie and Negative Binomial models.
result Unified multiplicative update rules for all models, including novel updates for convex NMF.

The study uses Gaussian Processes with Tweedie likelihood for forecasting intermittent time series.

problem Forecasting intermittent time series with high accuracy and flexibility.
method The approach combines Gaussian Processes with two forecast distributions: negative binomial and Tweedie.
result TweedieGP provides better probabilistic forecasts, especially for high quantiles.

By developing data augmentation methods unique to the negative binomial (NB) distribution, we unite seemingly disjoint count and mixture models under the NB process framework. We develop fundamental properties of the models and derive efficient Gibbs sampling inference. We show that the gamma-NB process can be reduced …

2012-09-05abs ↗pdf ↗

Transformer learns to estimate negative binomial parameters efficiently.

problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.

Develops a data augmentation method for models with gamma functions.

problem Models with gamma functions lack natural conjugate priors, complicating inference and prediction.
method Derives Pólya Inverse Gamma distributions and applies them to scalable EM and MCMC algorithms.
result Provides scalable algorithms for inference and prediction in models with gamma functions.

Develops methods to construct exchangeable sequences of random multisets.

problem Creating models for random multisets with unknown base measures.
method Uses exchangeable sequences of point processes and conditional-i.i.d. negative binomial processes.
result Provides constructions for negative binomial processes with random base measures.

Bayesian models predict Collatz stopping times with high accuracy.

problem Predicting the total stopping time of Collatz sequences.
method Developed two complementary models: a hierarchical Negative Binomial regression and a mechanistic generative approximation.
result Bayesian models outperform generative approximations in predicting Collatz stopping times.

The paper proposes a variational autoencoder for discrete data analysis.

problem Sparse, high-dimensional, and overdispersed discrete data analysis.
method Variational autoencoder based on negative-binomial distribution.
result The proposed models achieve significantly better performance on text analysis, collaborative filtering, and multi-label learning compared to state-of-the-art baselines.

The seemingly disjoint problems of count and mixture modeling are united under the negative binomial (NB) process. A gamma process is employed to model the rate measure of a Poisson process, whose normalization provides a random probability measure for mixture modeling and whose marginalization leads to an NB process f…

2012-09-15abs ↗pdf ↗

PSO optimizes model parameters in nonstandard distributions.

problem Estimating model parameters in nonstandard distributions using existing algorithms.
method Particle Swarm Optimization (PSO) as an alternative optimization routine.
result PSO produces more optimal or convergent results than existing algorithms.

Study optimizes smart contract adoption under high demand variability using Negative Binomial models.

problem Effective supply chain management under high demand variability.
method Combines dynamic Negative Binomial demand modeling with endogenous smart contract adoption optimization.
result The NB model outperforms other benchmarks in forecasting and optimizing smart contract adoption and order quantity.

A faster Bayesian method for estimating spatial count data models.

problem Bayesian estimation of spatial count data models is computationally expensive and slow.
method Derive a Variational Bayes (VB) method for posterior inference in negative binomial models with spatial dependence.
result The VB method is up to 50 times faster than MCMC and offers similar accuracy.

The paper proposes count echo state networks for forecasting graduate student enrollments.

problem Forecasting graduate student enrollments from historical data.
method Developed hierarchical count echo state networks and compared them to Poisson autoregressions and negative binomial models.
result Hierarchical negative binomial based echo state network is the superior model.

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…

2011-12-15abs ↗pdf ↗

Global models outperform local models in forecasting intermittent time series.

problem Forecasting intermittent time series with zeros in supply chains.
method Comparison of state-of-the-art probabilistic local and global models on five datasets.
result TiDE, a simple neural network architecture, achieves the best accuracy among global models.

A new method for modeling insurance claim frequencies using random proportions.

problem Inaccurate fitting of classical distributions to insurance claim frequency data.
method Modeling claim frequencies using random proportions of insurance contracts and applying goodness-of-fit tests.
result A new statistical approach for better modeling insurance claim frequencies.

Improved concentration inequalities for sub-Weibull variables enhance statistical and machine learning applications.

problem Improving concentration inequalities for sub-Weibull random variables.
method Developed new concentration inequalities for sums of independent sub-Weibull random variables, including a new sub-Weibull parameter.
result New concentration inequalities with sharper constants and a mixture of sub-Gaussian and sub-Weibull tails.

We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom fo…

2018-01-05abs ↗pdf ↗

New model predicts travel demand uncertainty with high accuracy.

problem Uncertainty and sparsity in sparse travel demand prediction.
method Spatial-Temporal Zero-Inflated Negative Binomial Graph Neural Network (STZINB-GNN).
result STZINB-GNN outperforms benchmarks in predicting travel demand uncertainty.

New formulae identify discrete probability laws without needing normalization constants.

problem Characterizing non-normalized discrete probability distributions.
method Derive explicit formulae for mass functions using Stein's method.
result Developed tools for solving statistical problems without normalization constants.

Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings, however, it might not be clear which subclass of graphical models to use, particularly…

2013-01-17abs ↗pdf ↗

CANN models improve insurance claim count predictions using telematics data.

problem Improving insurance claim count predictions with telematics data.
method Combining classical actuarial models with neural networks for telematics data.
result CANN models outperform traditional models in predicting insurance claims.

Data thinning splits observations into independent parts for convolution-closed distributions.

problem Validation of unsupervised learning results in settings with limited data.
method Data thinning, splitting observations into independent parts following the same distribution.
result Data thinning provides an attractive alternative to cross-validation in settings with limited sample splitting.

Paper proposes a new estimator for generic discrete distributions.

problem Estimating gradients for stochastic nodes in deep generative models.
method Generalized Gumbel-Softmax estimator using truncation, Gumbel-Softmax trick, and linear transformation.
result Efficacy and practical value demonstrated in synthetic examples and topic models.