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

4478941,3411,788 · Jun 202019922001200920172026
48 results for count data models

Flow Matching for count data improves sample quality and efficiency.

problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.

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.

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 ↗

Generative model identifies temporal count data components with regime-dependent contributions.

problem Modeling temporal count data with regime-dependent dynamics.
method Generative framework combining regime-adaptive dynamics with Poisson log-normal emissions.
result Established identifiability of the model and revealed co-variation patterns and regime shifts.

Better neural arithmetic logic units improve cell counting model generalization.

problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.

Bayesian model tackles spatial count data issues with flexible non-parametric techniques.

problem Challenges in traditional parametric models for spatial count data with unbalanced distributions and complex dependencies.
method Bayesian semi-parametric spatial dispersed count model combining non-parametric techniques and adapted count models.
result Demonstrates superior performance in managing dispersion and capturing intricate spatial patterns.

New phases identified in neural scaling laws with compute limits.

problem Understanding neural scaling laws under compute constraints.
method Solved neural scaling model with stochastic gradient descent, derived loss curves, analyzed model-parameter-count phases.
result Identified 4 phases (+3 subphases) in data-complexity/target-complexity phase-plane, derived exponents.

ENTED efficiently decomposes binary and count tensors using nonparametric Gaussian processes.

problem Handling high-dimensional and sparse binary and count data with traditional tensor decompositions.
method ENTED uses nonparametric Gaussian processes and sparse orthogonal variational inference to handle binary and count tensors.
result ENTED outperforms traditional methods in binary and count tensor completion tasks.

This work refines Cover's theory for binary classification on low-dimensional data.

problem The challenge of analyzing how low-dimensional data structures affect classification models.
method Refines Cover's function-counting theory to account for low-dimensional data structure.
result Derives dichotomy counts and analyzes the impact of data structure on classification models.

This paper proposes learning to jump for generative modeling of sparse, skewed, heavy-tailed data.

problem Limited ability of diffusion models in modeling sparse, skewed, heavy-tailed data.
method Forward count thinning process and reverse count thickening process to train a deep neural network.
result Learning to jump performs better than learning to denoise for non-negative, sparse data.

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.

Semiparametric STAR model improves mental health data analysis.

problem Overdispersed, zero-inflated, bounded count data in self-reported mental health surveys.
method STAR transformation and rounding of latent Gaussian model, nonparametric transformation estimation, EM algorithm for maximum likelihood.
result Substantial improvements in goodness-of-fit compared to existing models.

A gamma process dynamic Poisson factor analysis model is proposed to factorize a dynamic count matrix, whose columns are sequentially observed count vectors. The model builds a novel Markov chain that sends the latent gamma random variables at time (t1)(t-1) as the shape parameters of those at time tt, which are linked …

2015-12-30abs ↗pdf ↗

Tree-based variational inference improves PLN model for hierarchical count data.

problem Limited applicability of PLN model in ecosystems due to lack of hierarchical tree structures.
method Introduced PLN-Tree model integrating structured variational inference techniques.
result Enhanced generative improvements and practical interpretability in microbiome modeling.

Counting the number of clusters, when these clusters overlap significantly is a challenging problem in machine learning. We argue that a purely mathematical quantum theory, formulated using the path integral technique, when applied to non-physics modeling leads to non-physics quantum theories that are statistical in na…

2020-01-03abs ↗pdf ↗

ZICO learns DAGs from zero-inflated count data efficiently.

problem Learning network structures from zero-inflated count data.
method ZICO uses node-wise likelihoods with canonical links and a differentiable surrogate constraint for acyclicity.
result ZICO achieves superior performance and faster runtimes on simulated data.

Proposes a method to handle sparse multiway count data with false zeros using zero-truncated Poisson regression.

problem Handling sparse multiway count data corrupted by false zeros.
method Zero-truncated Poisson regression with tensor completion.
result Accurate estimation of multiway count data from approximately IR2log22(I)IR^2\log_2^2(I) non-zero counts.

New method identifies causal structure in count data using cumulants and path analysis.

problem Challenges in discovering causal structure from count data, especially due to non-identifiability.
method Poisson Branching Structural Causal Model (PB-SCM) with path analysis using high-order cumulants.
result Causal order is identifiable under specific conditions in PB-SCM using cumulant information.

Enhances count process modelling with Markov-modulated non-homogeneous Poisson process.

problem Count data modelling challenges, especially in complex scenarios.
method Introduces a flexible frequency perturbation measure into Markov-modulated Poisson process framework.
result Natural incorporation of observed event arrivals and latent factors.

We tackle anomaly detection in sparse time series data.

problem Sparse time series with low signal-to-noise ratios and non-uniform performance.
method We introduce a novel generative procedure for benchmark datasets and demonstrate how anomaly score smoothing improves performance.
result Anomaly score smoothing consistently improves performance in low-count time series anomaly detection.

Accurate statistical models of neural spike responses can characterize the information carried by neural populations. But the limited samples of spike counts during recording usually result in model overfitting. Besides, current models assume spike counts to be Poisson-distributed, which ignores the fact that many neur…

2016-05-10abs ↗pdf ↗

In this paper, we study a new graph learning problem: learning to count subgraph isomorphisms. Different from other traditional graph learning problems such as node classification and link prediction, subgraph isomorphism counting is NP-complete and requires more global inference to oversee the whole graph. To make it …

2019-12-25abs ↗pdf ↗

We develop deep Poisson-gamma dynamical systems (DPGDS) to model sequentially observed multivariate count data, improving previously proposed models by not only mining deep hierarchical latent structure from the data, but also capturing both first-order and long-range temporal dependencies. Using sophisticated but simp…

2018-10-26abs ↗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.

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 models and predicts co-occurrence counts using Gamma regression.

problem Predicting relevance between items or users from high-dimensional sparse co-occurrence count data.
method Shared parameter alternating zero-inflated Gamma regression models (SA-ZIG) with Fisher scoring and learning rate adjustment.
result SA-ZIG with learning rate adjustment performs satisfactorily in predicting relevance.

Develops a method to model multivariate count processes with Cox processes and shot noise intensities.

problem Modeling and estimating dependent count processes using granular data.
method Multivariate Cox process with shot noise intensities, connected via Lévy copulas.
result Allows for over-dispersion, auto-correlation, and realistic features in count processes.

A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.

problem Improving offline reinforcement learning performance.
method Integrates count-based conservatism into model-based offline reinforcement learning.
result The learned policy is near-optimal and outperforms existing methods.

In this paper a neuro-robotics model capable of counting using gestures is introduced. The contribution of gestures to learning to count is tested with various model and training conditions. Two studies were presented in this article. In the first, we combine different modalities of the robot's neural network, in the s…

2019-07-09abs ↗pdf ↗

Fenrir efficiently estimates Bayesian MLN-DLMs for scalable inference.

problem Computational challenges in Bayesian MLN-DLMs for longitudinal count compositional data.
method Novel algorithm for MAP estimation and accurate posterior marginal approximation.
result Fenrir can be three orders of magnitude more efficient than Stan.