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

Trend · papers per month

79158237316 · Jun 202019922001200920172026
48 results for Penalized Negative Binomial Regression

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.

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.

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.

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 propose a method for estimating coefficients in multivariate regression when there is a clustering structure to the response variables. The proposed method includes a fusion penalty, to shrink the difference in fitted values from responses in the same cluster, and an L1 penalty for simultaneous variable selection an…

2017-07-12abs ↗pdf ↗

We use the theory of normal variance-mean mixtures to derive a data augmentation scheme for models that include gamma functions. Our methodology applies to many situations in statistics and machine learning, including Multinomial-Dirichlet distributions, Negative binomial regression, Poisson-Gamma hierarchical models, …

2019-05-29abs ↗pdf ↗

Paper reformulates UOT as non-negative penalized linear regression for efficient algorithms.

problem Optimal transport with relaxed marginal conditions.
method Reformulate UOT as non-negative penalized linear regression, propose multiplicative updates.
result Efficient algorithms for UOT with quadratic penalties, continuity of solutions.

The paper analyzes LASSO penalization for high-dimensional Beta regression models.

problem Theoretical analysis of LASSO in high-dimensional Beta regression.
method Non-convexity handling through a neighborhood framework, debiasing for confidence intervals, proximal gradient algorithm.
result Non-asymptotic bound on 1\ell_1-error of stationary points.

Count data take on non-negative integer values and are challenging to properly analyze using standard linear-Gaussian methods such as linear regression and principal components analysis. Generalized linear models enable direct modeling of counts in a regression context using distributions such as the Poisson and negati…

2020-01-10abs ↗pdf ↗

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 ↗

The least absolute shrinkage and selection operator (lasso) and ridge regression produce usually different estimates although input, loss function and parameterization of the penalty are identical. In this paper we look for ridge and lasso models with identical solution set. It turns out, that the lasso model with shri…

2014-01-10abs ↗pdf ↗

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.

A new LDA model with covariates for mixed-membership clusters.

problem Modeling mixed-membership clusters in discrete data with covariates.
method Negative binomial regression embedded within LDA, slice sampling within Gibbs sampling.
result Model successfully retrieves true parameter values and predicts cluster abundances using covariates.

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.

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 ↗

We present a family of expectation-maximization (EM) algorithms for binary and negative-binomial logistic regression, drawing a sharp connection with the variational-Bayes algorithm of Jaakkola and Jordan (2000). Indeed, our results allow a version of this variational-Bayes approach to be re-interpreted as a true EM al…

2013-05-31abs ↗pdf ↗

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 fused lasso penalizes a loss function by the L1L_1 norm for both the regression coefficients and their successive differences to encourage sparsity of both. In this paper, we propose a Bayesian generalized fused lasso modeling based on a normal-exponential-gamma (NEG) prior distribution. The NEG prior is assumed in…

2016-02-16abs ↗pdf ↗

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.

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.

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 develop constructions for exchangeable sequences of point processes that are rendered conditionally-i.i.d. negative binomial processes by a (possibly unknown) random measure called the base measure. Negative binomial processes are useful in Bayesian nonparametrics as models for random multisets, and in applications …

2019-08-17abs ↗pdf ↗

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 ↗

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 ↗

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.

New method improves mHealth user engagement using Thompson sampling for count data.

problem Optimizing mHealth interventions for distal outcomes through proximal context.
method Combines count data models with Thompson sampling for contextual bandits.
result Improves user engagement in mHealth trials compared to existing methods.

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 ↗

The paper analyzes stability and asymptotic behavior of hedging strategies in binomial and trinomial models.

problem Stability and asymptotic analysis of hedging strategies in incomplete financial models.
method Discrete-time Föllmer-Schweizer decomposition, perturbation analysis, and asymptotic approximation.
result Explicit formulas for leading order correction terms in asymptotic analysis.

This paper provides formulas for minimum cost super-hedging in a multi-asset binomial market.

problem Finding minimum cost super-hedging strategies in a multi-asset, incomplete market model.
method Explicit formulas for minimum cost super-hedging strategies for various European type multi-asset contingent claims.
result Explicit formulas for non-negative local residuals of super-hedging strategies.

Models predict fire and other emergencies in Edmonton.

problem Accurate prediction of emergency events for timely response.
method Data collection, descriptive analysis, feature selection, and negative binomial regression.
result Models perform well, with acceptable prediction errors for weekly and monthly periods.

Sparse-penalized deep neural networks improve performance in weakly dependent processes.

problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.