aiqbench analysis
This research advances the statistical theory of nonsymmetric Determinantal Point Processes (DPPs) by establishing identification conditions and proposing efficient estimation techniques like averaged stochastic gradient descent. The work is particularly relevant for AI practitioners dealing with complex dependency structures in large-scale cybersecurity datasets, such as enterprise authentication logs and sector breach data. By relaxing the standard nonpositive dependence constraint, this study offers new tools for modeling scenarios requiring positive pairwise correlations within random set distributions.
Identication and Estimation of Nonsymmetric Determinantal Point Processes
arXiv:2610.14520v1 Announce Type: cross Abstract: Determinantal point processes (DPPs) provide tractable distributions for nite random sets, but the usual symmetric-kernel specication imposes nonpositive pairwise dependence. Statistical research on nonsymmetric DPPs, which can accommodate positive dependence, remains limited. We study identication and estimation for this class. First, we establish the equivalence of two sucient conditions for a nonsymmetric kernel to dene a valid DPP. Second, we develop the identication theory for nonsymmetric DPPs. Third, we develop cardinality-truncated maximum-likelihood estimation and estimation by averaged stochastic gradient descent. Under suitable identication and regularity conditions, we establish consistency and asymptotic normality for both estimators. Simulations examine identication, the eects of truncation, and the nite-sample performance of the estimators. We illustrate the methods with two cyber applications at markedly dierent sampling frequencies: weekly sector-by-breach data and second-by-second enterprise authentication data with more than ve million set observations.
Abstract:Determinantal point processes (DPPs) provide tractable distributions for nite random sets, but the usual symmetric-kernel specication imposes nonpositive pairwise dependence. Statistical research on nonsymmetric DPPs, which can accommodate positive dependence, remains limited. We study identication and estimation for this class. First, we establish the equivalence of two sucient conditions for a nonsymmetric kernel to dene a valid DPP. Second, we develop the identication theory for nonsymmetric DPPs. Third, we develop cardinality-truncated maximum-likelihood estimation and estimation by averaged stochastic gradient descent. Under suitable identication and regularity conditions, we establish consistency and asymptotic normality for both estimators. Simulations examine identication, the eects of truncation, and the nite-sample performance of the estimators. We illustrate the methods with two cyber applications at markedly dierent sampling frequencies: weekly sector-by-breach data and second-by-second enterprise authentication data with more than ve million set observations.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2610.14520 [stat.ML]
(or arXiv:2610.14520v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.14520 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 234 words
Related coverage
Links #5: 2026/07
LessWrong · Jul 31, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
A Mike's-Eye View of ARC's Research
AI Alignment Forum · Jun 9, 2026
Distributional Determinantal Point Process for Repulsive Clustering of Distributions
arXiv · Jul 27, 2026