Learning Penalty for Optimal Partitioning via Automatic Feature Extraction

• URL: http://arxiv.org/abs/2505.07413v1
• Date: Mon, 12 May 2025 10:07:55 GMT
• Title: Learning Penalty for Optimal Partitioning via Automatic Feature Extraction
• Authors: Tung L Nguyen, Toby Hocking,
• Abstract summary: Changepoint detection identifies significant shifts in data sequences, making it important in areas like finance, genetics, and healthcare.<n>The Optimal Partitioning algorithms efficiently detect these changes, using a penalty parameter to limit the changepoints number.<n>This study proposes a novel approach that uses recurrent neural networks to learn this penalty directly from raw sequences by automatically extracting features.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Changepoint detection identifies significant shifts in data sequences, making it important in areas like finance, genetics, and healthcare. The Optimal Partitioning algorithms efficiently detect these changes, using a penalty parameter to limit the changepoints number. Determining the appropriate value for this penalty can be challenging. Traditionally, this process involved manually extracting statistical features, such as sequence length or variance to make the prediction. This study proposes a novel approach that uses recurrent neural networks to learn this penalty directly from raw sequences by automatically extracting features. Experiments conducted on 20 benchmark genomic datasets show that this novel method surpasses traditional methods in partitioning accuracy in most cases.

Related papers

• Enhancing Changepoint Detection: Penalty Learning through Deep Learning Techniques [2.094821665776961]
  This study introduces a novel deep learning method for predicting penalty parameters. It leads to demonstrably improved changepoint detection accuracy on large benchmark supervised labeled datasets.
  arXiv  Detail & Related papers  (2024-08-01T18:10:05Z)
• Subject-specific Deep Neural Networks for Count Data with High-cardinality Categorical Features [1.2289361708127877]
  We propose a novel hierarchical likelihood learning framework for introducing gamma random effects into a Poisson deep neural network. The proposed method simultaneously yields maximum likelihood estimators for fixed parameters and best unbiased predictors for random effects. State-of-the-art network architectures can be easily implemented into the proposed h-likelihood framework.
  arXiv  Detail & Related papers  (2023-10-18T01:54:48Z)
• Change Point Detection with Conceptors [0.6526824510982799]
  offline change point detection retrospectively locates change points in a time series. Many nonparametric methods that target i.i.d. mean and variance changes fail in the presence of nonlinear temporal dependence. We propose use of a conceptor matrix to learn the characteristic dynamics of a baseline training window with arbitrary dependence structure. The associated echo state network acts as a featurizer of the data, and change points are identified from the nature of the interactions between the features and their relationship to the baseline state.
  arXiv  Detail & Related papers  (2023-08-11T16:32:00Z)
• Fast Classification with Sequential Feature Selection in Test Phase [1.1470070927586016]
  This paper introduces a novel approach to active feature acquisition for classification. It is the task of sequentially selecting the most informative subset of features to achieve optimal prediction performance. The proposed approach involves a new lazy model that is significantly faster and more efficient compared to existing methods.
  arXiv  Detail & Related papers  (2023-06-25T21:31:46Z)
• Low-rank extended Kalman filtering for online learning of neural networks from streaming data [71.97861600347959]
  We propose an efficient online approximate Bayesian inference algorithm for estimating the parameters of a nonlinear function from a potentially non-stationary data stream. The method is based on the extended Kalman filter (EKF), but uses a novel low-rank plus diagonal decomposition of the posterior matrix. In contrast to methods based on variational inference, our method is fully deterministic, and does not require step-size tuning.
  arXiv  Detail & Related papers  (2023-05-31T03:48:49Z)
• Invariance Learning in Deep Neural Networks with Differentiable Laplace Approximations [76.82124752950148]
  We develop a convenient gradient-based method for selecting the data augmentation. We use a differentiable Kronecker-factored Laplace approximation to the marginal likelihood as our objective.
  arXiv  Detail & Related papers  (2022-02-22T02:51:11Z)
• Transformers Can Do Bayesian Inference [56.99390658880008]
  We present Prior-Data Fitted Networks (PFNs) PFNs leverage in-context learning in large-scale machine learning techniques to approximate a large set of posteriors. We demonstrate that PFNs can near-perfectly mimic Gaussian processes and also enable efficient Bayesian inference for intractable problems.
  arXiv  Detail & Related papers  (2021-12-20T13:07:39Z)
• Dynamic Bayesian Approach for decision-making in Ego-Things [8.577234269009042]
  This paper presents a novel approach to detect abnormalities in dynamic systems based on multisensory data and feature selection. Growing neural gas (GNG) is employed for clustering multisensory data into a set of nodes. Our method uses a Markov Jump particle filter (MJPF) for state estimation and abnormality detection.
  arXiv  Detail & Related papers  (2020-10-28T11:38:51Z)
• Change Point Detection in Time Series Data using Autoencoders with a Time-Invariant Representation [69.34035527763916]
  Change point detection (CPD) aims to locate abrupt property changes in time series data. Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the autocorrelation statistics of the signal. We employ an autoencoder-based methodology with a novel loss function, through which the used autoencoders learn a partially time-invariant representation that is tailored for CPD.
  arXiv  Detail & Related papers  (2020-08-21T15:03:21Z)
• Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shift [81.74795324629712]
  We call prediction-time batch normalization, which significantly improves model accuracy and calibration under covariate shift. We show that prediction-time batch normalization provides complementary benefits to existing state-of-the-art approaches for improving robustness. The method has mixed results when used alongside pre-training, and does not seem to perform as well under more natural types of dataset shift.
  arXiv  Detail & Related papers  (2020-06-19T05:08:43Z)
• AdaS: Adaptive Scheduling of Stochastic Gradients [50.80697760166045]
  We introduce the notions of textit"knowledge gain" and textit"mapping condition" and propose a new algorithm called Adaptive Scheduling (AdaS) Experimentation reveals that, using the derived metrics, AdaS exhibits: (a) faster convergence and superior generalization over existing adaptive learning methods; and (b) lack of dependence on a validation set to determine when to stop training.
  arXiv  Detail & Related papers  (2020-06-11T16:36:31Z)
• Robust Learning Rate Selection for Stochastic Optimization via Splitting Diagnostic [5.395127324484869]
  SplitSGD is a new dynamic learning schedule for optimization. The method decreases the learning rate for better adaptation to the local geometry of the objective function. It essentially does not incur additional computational cost than standard SGD.
  arXiv  Detail & Related papers  (2019-10-18T19:38:53Z)

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.