In this work, we propose the kernel Pitman-Yor process (KPYP) for nonparametric clustering of data with general spatial or temporal interdependencies. The KPYP is constructed by first introducing an infinite sequence of random locations. Then, based on the stick-breaking construction of the Pitman-Yor process, we defin…
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
48 results for “Pitman-Yor process”
Bayesian nonparametric approaches, in particular the Pitman-Yor process and the associated two-parameter Chinese Restaurant process, have been successfully used in applications where the data exhibit a power-law behavior. Examples include natural language processing, natural images or networks. There is also growing em…
The Dirichlet process and its extension, the Pitman-Yor process, are stochastic processes that take probability distributions as a parameter. These processes can be stacked up to form a hierarchical nonparametric Bayesian model. In this article, we present efficient methods for the use of these processes in this hierar…
Pitman-Yor Diffusion Treesstat.ML
We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clustering, a generalization of the Dirichlet Diffusion Tree (Neal, 2001) which removes the restriction to binary branching structure. The generative process is described and shown to result in an exchangeable distribution over data points. We prove som…
Efficiently resolves entities via scaled Ewens--Pitman model.
problem Entity resolution in large datasets.
method Microclustering Ewens--Pitman model with variational inference.
result Significant speed-up in entity resolution with competitive performance.
In many applications, a finite mixture is a natural model, but it can be difficult to choose an appropriate number of components. To circumvent this choice, investigators are increasingly turning to Dirichlet process mixtures (DPMs), and Pitman-Yor process mixtures (PYMs), more generally. While these models may be well…
Bayesian nonparametric estimation of coverage probabilities and distinct counts from sketched datastat.ME
Bayesian method estimates coverage from sketching imperfect data.
problem Estimating coverage probabilities from compressed data.
method Bayesian nonparametric approach using Dirichlet process prior.
result Estimators accurately recover distinct counts and frequencies.
It has always been a great challenge for clustering algorithms to automatically determine the cluster numbers according to the distribution of datasets. Several approaches have been proposed to address this issue, including the recent promising work which incorporate Bayesian Nonparametrics into the -means clusterin…
We investigate a class of feature allocation models that generalize the Indian buffet process and are parameterized by Gibbs-type random measures. Two existing classes are contained as special cases: the original two-parameter Indian buffet process, corresponding to the Dirichlet process, and the stable (or three-param…
Bayesian method improves estimation of unseen species.
problem Estimating unseen species in biological and physical sciences.
method Bayesian nonparametric approach with Pitman-Yor prior and Gaussian credible intervals.
result Improves asymptotic credible intervals for unseen species estimation.
We investigate the class of -stable Poisson-Kingman random probability measures (RPMs) in the context of Bayesian nonparametric mixture modeling. This is a large class of discrete RPMs which encompasses most of the the popular discrete RPMs used in Bayesian nonparametrics, such as the Dirichlet process, Pitman-Yor p…
Generalized autoregressive conditional heteroscedasticity (GARCH) models have long been considered as one of the most successful families of approaches for volatility modeling in financial return series. In this paper, we propose an alternative approach based on methodologies widely used in the field of statistical mac…
Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process mixture models make this assumption, as do all other infinitely exchangeable cluste…
Enhances CMS with Bayesian nonparametrics for better low-frequency token estimation.
problem Improving frequency estimation of low-frequency tokens in data streams.
method Integrates Bayesian nonparametrics (Pitman-Yor process) into CMS for more accurate frequency estimation.
result CMS-PYP outperforms CMS and CMS-DP in estimating low-frequency tokens.
Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process mixture models make this assumption, as do all other infinitely exchangeable cluste…
The continuum-of-urns scheme, generalized beta and Indian buffet processes, and hierarchies thereofmath.PR
We describe the combinatorial stochastic process underlying a sequence of conditionally independent Bernoulli processes with a shared beta process hazard measure. As shown by Thibaux and Jordan [TJ07], in the special case when the underlying beta process has a constant concentration function and a finite and nonatomic …
Power-Law Graph Cutscs.CV
Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering tasks, spectral graph cu…
Bayesian nonparametric modeling for predicting dynamic dependencies in multiple object trackingcs.LG
Bayesian methods improve tracking multiple objects through dynamic dependencies.
problem Tracking multiple objects with time-varying cardinality and unordered measurements.
method Employing Bayesian nonparametric models, specifically dependent Dirichlet and Pitman-Yor processes, for state estimation and Monte Carlo sampling for trajectory learning.
result The proposed methods outperform existing algorithms in estimating the time-varying number of objects and identifying object associations.
We describe an adaptation of the simulated annealing algorithm to nonparametric clustering and related probabilistic models. This new algorithm learns nonparametric latent structure over a growing and constantly churning subsample of training data, where the portion of data subsampled can be interpreted as the inverse …
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…
We introduce a class of hybrid marked point processes, which encompasses and extends continuous-time Markov chains and Hawkes processes. While this flexible class amalgamates such existing processes, it also contains novel processes with complex dynamics. These processes are defined implicitly via their intensity and a…
Deep Neyman-Scott Processesstat.ML
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.
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.
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…
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.
The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business proc…
A Technique for Determining Relevance Scores of Process Activities using Graph-based Neural Networkscs.LG
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.
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…
Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…
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.
Ruin Probabilities for Risk Processes with Non-Stationary Arrivals and Subexponential Claimsq-fin.RM
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…
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.
Study on error probability for classification of heavy-tailed renewal processes.
problem Error probability in classification of heavy-tailed renewal processes.
method Asymptotic expressions for Bhattacharyya bound on misclassification error probabilities.
result Obtained asymptotic expressions for misclassification error probabilities.
Study shows convergence rates for BSDEs approximated by compound Poisson processes.
problem Analyzing convergence rates of BSDEs driven by Lévy processes.
method Approximating Lévy processes by compound Poisson processes and studying BSDEs.
result Optimal convergence rates derived for BSDEs in -norm and Wasserstein distance.
Resemblance of the power-law scaling behavior of a non-Markovian and nonlinear point processescond-mat.stat-mech
Non-Markovian point process shows power-law scaling, similar to nonlinear Markovian process.
problem Understanding the scaling behavior of non-Markovian point processes.
method Analyzed a confined fractional Brownian motion-driven point process and compared it to a nonlinear Markovian process.
result A nonlinear Markovian process can reproduce the power-law scaling behavior of a non-Markovian point process.
State spaces of multifactor approximations of nonnegative Volterra processes are linear transformations of the nonnegative orthant.
problem Characterizing state spaces of multifactor approximations of nonnegative Volterra processes.
method Explicit linear transformation of the nonnegative orthant.
result State spaces of multifactor approximations of nonnegative Volterra processes are given by explicit linear transformation of the nonnegative orthant.
Automated process discovery is a class of process mining methods that allow analysts to extract business process models from event logs. Traditional process discovery methods extract process models from a snapshot of an event log stored in its entirety. In some scenarios, however, events keep coming with a high arrival…
The paper models user-advertiser interactions using point processes.
problem Causal inference problems in user-advertiser interaction.
method Temporal marked point processes and neural point processes.
result Neural point processes as practical solutions.
Paper introduces a new model for cyber insurance pricing.
problem Inaccurate pricing of cyber insurance due to multiple, contagious losses.
method Developed a bivariate compound dynamic contagion process.
result Analytical expressions for the compound process and its moments.
Dirac Processes and Default Riskq-fin.PR
We introduce Dirac processes, using Dirac delta functions, for short-rate-type pricing of financial derivatives. Dirac processes add spikes to the existing building blocks of diffusions and jumps. Dirac processes are Generalized Processes, which have not been used directly before because the dollar value of non-Real nu…
Improved Gaussian process experts model for complex data.
problem Limitations of standard Gaussian processes: scalability and predictive performance.
method Proposes a new mixture model of Gaussian process experts based on kernel stick-breaking processes.
result Improved predictive performance compared to existing models.
Study of Markov-modulated affine processes for richer models in finance.
problem Richer models in various applications.
method Martingale problem approach, characteristic function derivation, mathematical properties study.
result Existence and characteristic function of Markov-modulated affine processes.
New self-exciting random evolutions (SEREs) for modeling traffic and transport processes.
problem Modeling self-exciting and clustering effects in traffic and transport processes.
method Introducing a new process based on a superposition of a Markov chain and a Hawkes process, and constructing self-exciting random evolutions (SEREs).
result Developed new models and limit theorems for SEREs, including averaging and diffusion approximation.