Scalable and Interpretable Marked Point Processes

• URL: http://arxiv.org/abs/2105.14574v1
• Date: Sun, 30 May 2021 15:37:57 GMT
• Title: Scalable and Interpretable Marked Point Processes
• Authors: Aristeidis Panos, Ioannis Kosmidis, Petros Dellaportas
• Abstract summary: We introduce a novel inferential framework for marked point processes that enjoys both scalability and interpretability. The framework is based on variational inference and it aims to speed up inference for a flexible family of marked point processes.
• Score: 5.070542698701158
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a novel inferential framework for marked point processes that enjoys both scalability and interpretability. The framework is based on variational inference and it aims to speed up inference for a flexible family of marked point processes where the joint distribution of times and marks can be specified in terms of the conditional distribution of times given the process filtration, and of the conditional distribution of marks given the process filtration and the current time. We assess the predictive ability of our proposed method over four real-world datasets where results show its competitive performance against other baselines. The attractiveness of our framework for the modelling of marked point processes is illustrated through a case study of association football data where scalability and interpretability are exploited for extracting useful informative patterns.

Related papers

• Unlocking Point Processes through Point Set Diffusion [42.96573032954792]
  We introduce Point Set Diffusion, a point diffusion-based latent variable model that can represent arbitrary processes on general metric spaces without relying on the intensity function. Our approach enables efficient, parallel sampling and flexible generation for complex conditional tasks defined on the metric space.
  arXiv  Detail & Related papers  (2024-10-29T19:33:18Z)
• Estimating Agreement by Chance for Sequence Annotation [3.039887427447867]
  We introduce a novel model for generating random annotations, which serves as the foundation for estimating chance agreement in sequence annotation tasks. We successfully derive the analytical form of the distribution, enabling the computation of the probable location of each annotated text segment and subsequent chance agreement estimation.
  arXiv  Detail & Related papers  (2024-07-16T04:32:47Z)
• Flow Factorized Representation Learning [109.51947536586677]
  We introduce a generative model which specifies a distinct set of latent probability paths that define different input transformations. We show that our model achieves higher likelihoods on standard representation learning benchmarks while simultaneously being closer to approximately equivariant models.
  arXiv  Detail & Related papers  (2023-09-22T20:15:37Z)
• Extracting Interpretable Local and Global Representations from Attention on Time Series [0.135975510645475]
  This paper targets two transformer attention based interpretability methods working with local abstraction and global representation. We distinguish local and global contexts, and provide a comprehensive framework for both general interpretation options.
  arXiv  Detail & Related papers  (2023-09-16T00:51:49Z)
• RTB Formulation Using Point Process [1.7132914341329852]
  We propose a general framework for modelling repeated auctions in the Real Time Bidding (RTB) ecosystem using point processes. We specify the player's optimal strategy under various scenarios. It is critical to consider the joint distribution of utility and market condition instead of estimating the marginal distributions independently.
  arXiv  Detail & Related papers  (2023-08-17T17:57:59Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• FineDiving: A Fine-grained Dataset for Procedure-aware Action Quality Assessment [93.09267863425492]
  We argue that understanding both high-level semantics and internal temporal structures of actions in competitive sports videos is the key to making predictions accurate and interpretable. We construct a new fine-grained dataset, called FineDiving, developed on diverse diving events with detailed annotations on action procedures.
  arXiv  Detail & Related papers  (2022-04-07T17:59:32Z)
• Reachability analysis in stochastic directed graphs by reinforcement learning [67.87998628083218]
  We show that the dynamics of the transition probabilities in a Markov digraph can be modeled via a difference inclusion. We offer a methodology to design reward functions to provide upper and lower bounds on the reachability probabilities of a set of nodes.
  arXiv  Detail & Related papers  (2022-02-25T08:20:43Z)
• Learning Conditional Invariance through Cycle Consistency [60.85059977904014]
  We propose a novel approach to identify meaningful and independent factors of variation in a dataset. Our method involves two separate latent subspaces for the target property and the remaining input information. We demonstrate on synthetic and molecular data that our approach identifies more meaningful factors which lead to sparser and more interpretable models.
  arXiv  Detail & Related papers  (2021-11-25T17:33:12Z)
• Adaptive Conformal Inference Under Distribution Shift [0.0]
  We develop methods for forming prediction sets in an online setting where the data generating distribution is allowed to vary over time in an unknown fashion. Our framework builds on ideas from conformal inference to provide a general wrapper that can be combined with any black box method. We test our method, adaptive conformal inference, on two real world datasets and find that its predictions are robust to visible and significant distribution shifts.
  arXiv  Detail & Related papers  (2021-06-01T01:37:32Z)
• Beyond Individual and Group Fairness [90.4666341812857]
  We present a new data-driven model of fairness that is guided by the unfairness complaints received by the system. Our model supports multiple fairness criteria and takes into account their potential incompatibilities.
  arXiv  Detail & Related papers  (2020-08-21T14:14:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.