Shapelet is a discriminative subsequence of time series. An advanced shapelet-based method is to embed shapelet into accurate and fast random forest. However, it shows several limitations. First, random shapelet forest requires a large training cost for split threshold searching. Second, a single shapelet provides limi…
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,982 papers · 148 categories
Trend · papers per month
48 results for “discriminative shapelets”
Learning Interpretable Shapelets for Time Series Classification through Adversarial Regularizationcs.LG
Adversarial regularization helps learn interpretable shapelets for time series classification.
problem Difficult to interpret learned shapelets in time series classification.
method Use of adversarial regularization to constrain model to learn more interpretable shapelets.
result Adversarially regularized method learns interpretable shapelets.
A new evolutionary approach discovers shapelets for time series classification.
problem Discovering discriminative shapelets for time series classification.
method Evolutionary computation to evolve shapelets and their lengths.
result The approach finds better shapelets with fewer shapelets and less computational complexity.
Interpretable neural model for few-shot time-series classification.
problem Few-shot time-series classification challenges.
method Dual Prototypical Shapelet Networks (DPSN) framework.
result DPSN framework outperforms state-of-the-art methods, especially with limited data.
Pattern sampling reduces time series classification complexity.
problem High computational complexity of exhaustive search for shapelets.
method Pattern sampling using a weighted trie to extract discriminative patterns.
result Significant reduction in computational and memory resources.
Proposes a new method to extract time-aware shapelets for better time series modeling.
problem Challenges in achieving reliable efficiency and interpretability in time series modeling.
method Designs a two-level timing factor to extract time-aware shapelets and constructs a shapelet evolution graph.
result Improves time series modeling by extracting time-aware shapelets and incorporating them into embeddings.
A new algorithm reduces time complexity for binary time series classification.
problem High time complexity of ensemble shapelet transform limits its application.
method Introduces short isometric shapelet transform with two strategies: fixed shapelet length and single linear classifier.
result Demonstrates superior performance and reduced time complexity.
We propose a new formulation of Multiple-Instance Learning (MIL). In typical MIL settings, a unit of data is given as a set of instances called a bag and the goal is to find a good classifier of bags based on similarity from a single or finitely many "shapelets" (or patterns), where the similarity of the bag from a sha…
UniShape improves time series classification by selecting relevant subsequences.
problem Classifying time series data requires capturing interpretable shapelets.
method UniShape uses a shape-aware adapter to aggregate multiscale subsequences into class tokens.
result UniShape achieves state-of-the-art classification performance.
New formulation of MIL using shapelets for better classifier of bags.
problem Finding a good classifier of bags based on shapelets.
method Formulation using all possible shapelets, reduced to DC programs, and heuristic options.
result Richer class of classifiers with theoretical justification and empirical validation.
Extends shapelet transform to irregular time series, improving interpretability and efficiency.
problem Limitations of shapelet transform for irregular, partially observed time series.
method Continuous-time formulation, regularisation penalty, learned pseudometric.
result Efficient training without sacrificing interpretability for irregular, partially observed time series.
Applications of shapelet transform to time series classification of earthquake, wind and wave datacs.LG
Shapelet transform improves time series classification for earthquake, wind, and wave events.
problem Autonomous detection of specific events from large time series datasets in civil engineering.
method Shapelet transform for local similarity in time series subsequences, combined with machine learning.
result Shapelet transform yields a new feature representation for time series signals in civil engineering.
New algorithm for uncertain time series classification.
problem Uncertainty in time series data.
method Uncertain dissimilarity measure based on Euclidean distance and uncertain shapelet transform.
result Effectiveness of the uncertain shapelet transform algorithm on state-of-the-art datasets.
RTFN extracts robust temporal features for time series analysis.
problem Challenges in extracting sufficient shapelets from time series data.
method Combines temporal feature networks and attentional LSTM networks.
result RTFN outperforms in supervised and unsupervised time series analysis.
SigTime learns interpretable signatures from time series data.
problem Discovering meaningful patterns in time series data with high complexity and limited interpretability.
method Jointly trains two Transformer models using shapelet-based and feature engineering representations.
result Learned shapelets serve as interpretable signatures for time series classification.
EQShapelets detect earthquakes with high accuracy and interpretability.
problem Automated detection and cataloging of earthquakes.
method Time-series shape-based approach embedded in machine learning.
result EQShapelets detected all cataloged and 281 uncataloged events with lower false detection rate.
Method summarizes and predicts time series data for COVID-19 cases and deaths.
problem Summarizing and predicting time series data for multiple related time series.
method Hierarchical algorithm generating shapelets for centroids, nearest neighbor search for labeling, dynamic time warping for non-uniform lengths.
result Predictive model for individual time series based on aggregated statistics.
New algorithms benchmarked for multivariate time series classification.
problem Comparing algorithms for multivariate time series classification.
method Review and comparison of recent MTSC algorithms using the UEA archive.
result HIVE-COTE ensemble is most accurate for MTSC, but dynamic time warping is competitive.
Co-eye: A Multi-resolution Symbolic Representation to TimeSeries Diversified Ensemble Classificationcs.LG
Co-eye combines multiple symbolic representations to improve time series classification accuracy.
problem Challenges in time series classification due to domain diversity.
method Inspired by compound eyes, Co-eye uses multiple symbolic representations and hyper-parameterised lenses to classify time series data.
result Co-eye outperforms state-of-the-art techniques in accuracy and robustness across various domains.
The study quantifies and compares aleatoric and epistemic discrimination in ML models.
problem Sources of discrimination in ML models and their impact on performance.
method Quantifying aleatoric and epistemic discrimination using statistical experiments and model accuracy.
result State-of-the-art fairness interventions are effective at removing epistemic discrimination but not aleatoric discrimination in datasets with missing values.
Time series classification has received great attention over the past decade with a wide range of methods focusing on predictive performance by exploiting various types of temporal features. Nonetheless, little emphasis has been placed on interpretability and explainability. In this paper, we formulate the novel proble…
Discrimination-aware classification is receiving an increasing attention in data science fields. The pre-process methods for constructing a discrimination-free classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee f…
Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.
problem Improving the accuracy of autoregressive diffusion models for generating molecular graphs.
method Deriving ways to use a discriminator with a pretrained generative model in the discrete case, including optimal and sub-optimal scenarios.
result Using a discriminator can correct pretrained models and improve exact sampling from the data distribution.
Solves GAN mode collapse by assigning minibatches to multiple discriminators.
problem Mode collapse in GANs where models generate similar samples.
method Multiple discriminators, microbatching, and changing tasks.
result Promotes sample diversity in generated sets.
Kernel discriminant analysis uses nonlinear embeddings to improve classification.
problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.
Lower-dimensional video discriminators improve GAN performance.
problem High curvature in unconstrained video discriminator loss surfaces.
method Proposed Lower-Dimensional Video Discriminators (LDVD GANs).
result LDVD GANs double Temporal-GAN performance and achieve state-of-the-art performance.
Discriminative clustering uses mutual information to cluster data.
problem Clustering data into cohesive groups.
method Discriminative clustering using mutual information.
result Mutual information has been a cornerstone of discriminative clustering.
Pairwise discriminators stabilize adversarial training by ensuring the generator's alignment is preserved.
problem Stability issues in adversarial training when using sub-optimal discriminators.
method Introducing a family of objectives using pairwise discriminators, ensuring the generator's alignment is preserved.
result Only the generator needs to converge, and the alignment is preserved with any discriminator.
PBN combines generative and discriminative capabilities in a neural network.
problem Combining generative and discriminative capabilities in neural networks.
method Convolutional PBN, sharing FF-NN embodiment, combining generative and discriminative qualities.
result PBN shows excellent qualities from either generative or discriminative viewpoint.
Study on GANs under and overfitting using discriminator unseen data.
problem Understanding and mitigating under and overfitting in GANs.
method Using discriminators unseen by the generator to measure generalization.
result Model capacity of the discriminator affects generator quality; large discriminator capacities do not prevent overfitting.
Study infinite Euclidean distance discriminants of algebraic varieties.
problem Understanding the structure of data points with infinitely many critical points in Euclidean distance correspondence.
method Developed computer code to compute discriminants and proved properties of fibers.
result Infinite Euclidean distance discriminants contain all data points with infinitely many critical points for the nearest-point problem.
Discriminators can be good feature extractors despite their task focus.
problem Discriminators' features are often considered useless for downstream tasks.
method Theoretical analysis and feature space examination to understand discriminator's role.
result Discriminator features are robust and can prevent mode collapse, making them useful for transfer learning.
Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Arestat.ML
Optimized GAN discriminator using polyharmonic interpolation.
problem Optimizing the discriminator in GANs with higher-order gradient regularization.
method Polyharmonic interpolation and variational calculus.
result The optimal discriminator is a polyharmonic radial basis function.
Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.
problem Mode collapse in GANs.
method Introducing dual discriminator -GANs and extending the approach to arbitrary functions.
result The approach reduces the optimization problem to a linear combination of an -divergence and a reverse -divergence.
GNNs improve graph signal discrimination by adding nonlinearities.
problem Improving graph signal discrimination in physical networks.
method Analyzing the discriminability of GNNs and their relation to graph filter banks.
result GNNs are at least as discriminative as linear graph filter banks.
We study two important concepts in adversarial deep learning---adversarial training and generative adversarial network (GAN). Adversarial training is the technique used to improve the robustness of discriminator by combining adversarial attacker and discriminator in the training phase. GAN is commonly used for image ge…
Paper proposes distributed sparse multicategory discriminant analysis for classification.
problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.
Generative Adversarial Networks (GANs) can successfully approximate a probability distribution and produce realistic samples. However, open questions such as sufficient convergence conditions and mode collapse still persist. In this paper, we build on existing work in the area by proposing a novel framework for trainin…
New method computes discriminative classifiers from generative models.
problem Discriminative vs generative classifiers are often seen as distinct, but this work shows they can be equivalent.
method General theoretical result showing generative classifiers can be computed discriminatively.
result Bayesian Maximum Posterior classifier from generative models matches discriminative classifier definition.
Proposes a curriculum-based dropout discriminator for domain adaptation.
problem Improving domain adaptation using deep learning networks trained on large labeled datasets.
method Introduces a curriculum-based dropout discriminator that gradually increases sample variance and uses reverse gradients to align source and target feature representations.
result The proposed model outperforms state-of-the-art results in domain adaptation tasks.
Proposes a sparse classifier for discriminative Gaussian Mixture Models.
problem Softmax-based discriminative models assume unimodality, leading to parameter redundancy.
method Sparse Bayesian learning for GMM-based discriminative model, reducing parameters and complexity.
result The SDGM outperforms existing softmax-based discriminative models.
New findings show fixed-kernel discriminators are weaker than feature-learning ones.
problem Comparing performance of fixed-kernel and feature-learning discriminators.
method Using function classes and , constructing pairs of distributions, and linking IPMs with sliced Wasserstein distances.
result Fixed-kernel IPM and SD cannot discriminate certain distributions that feature-learning IPM and SD can.
Abstract: Analogs of Hilbert-Chow morphism for generalized discriminants.
problem No specific problem stated in the abstract.
method No specific method stated in the abstract.
result No specific key result stated in the abstract.
Paper formalizes anti-discrimination law in automated systems.
problem Algorithmic discrimination in legal contexts.
method Decision-theoretic framework grounded in UK anti-discrimination law.
result Introduced 'conditional estimation parity' metric for ML fairness.
Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objec…
The paper addresses instability in KL divergence estimation using a neural network discriminator.
problem Unstable estimation of KL divergence due to discriminator complexity.
method Using a Reproducing Kernel Hilbert Space (RKHS) to control discriminator complexity.
result Theoretical bound on error probability of KL estimates based on discriminator complexity in RKHS.
We consider a pseudo-Riemannian metric that changes signature along a smooth curve on a surface, called the discriminant curve. The discriminant curve separates the surface locally into a Riemannian and a Lorentzian domain. We study the local behaviour and properties of geodesics at a point on the discriminant where th…
A new method quantifies feature-map discriminativeness for efficient pruning of deep neural networks.
problem Efficiently pruning deep neural networks to reduce computation while maintaining accuracy.
method Presented a novel mathematical formulation (Discriminant Information, DI) to quantify feature-map discriminativeness, enabling efficient pruning and intra-layer mixed precision quantization.
result Our pruned ResNet50 achieves 44% FLOPs reduction without any Top-1 accuracy loss.