Saved in:
Bibliographic Details
Main Authors: Kozdoba, Mark, Perets, Binyamin, Mannor, Shie
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2307.13763
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911776470204416
author Kozdoba, Mark
Perets, Binyamin
Mannor, Shie
author_facet Kozdoba, Mark
Perets, Binyamin
Mannor, Shie
contents We propose a new approach to non-parametric density estimation that is based on regularizing a Sobolev norm of the density. This method is statistically consistent, and makes the inductive bias of the model clear and interpretable. While there is no closed analytic form for the associated kernel, we show that one can approximate it using sampling. The optimization problem needed to determine the density is non-convex, and standard gradient methods do not perform well. However, we show that with an appropriate initialization and using natural gradients, one can obtain well performing solutions. Finally, while the approach provides pre-densities (i.e. not necessarily integrating to 1), which prevents the use of log-likelihood for cross validation, we show that one can instead adapt Fisher divergence based score matching methods for this task. We evaluate the resulting method on the comprehensive recent anomaly detection benchmark suite, ADBench, and find that it ranks second best, among more than 15 algorithms.
format Preprint
id arxiv_https___arxiv_org_abs_2307_13763
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Sobolev Space Regularised Pre Density Models
Kozdoba, Mark
Perets, Binyamin
Mannor, Shie
Machine Learning
Artificial Intelligence
We propose a new approach to non-parametric density estimation that is based on regularizing a Sobolev norm of the density. This method is statistically consistent, and makes the inductive bias of the model clear and interpretable. While there is no closed analytic form for the associated kernel, we show that one can approximate it using sampling. The optimization problem needed to determine the density is non-convex, and standard gradient methods do not perform well. However, we show that with an appropriate initialization and using natural gradients, one can obtain well performing solutions. Finally, while the approach provides pre-densities (i.e. not necessarily integrating to 1), which prevents the use of log-likelihood for cross validation, we show that one can instead adapt Fisher divergence based score matching methods for this task. We evaluate the resulting method on the comprehensive recent anomaly detection benchmark suite, ADBench, and find that it ranks second best, among more than 15 algorithms.
title Sobolev Space Regularised Pre Density Models
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2307.13763