JRFs improve semi-supervised learning by balancing generation and classification.
problem Mode missing and mode covering issues in GANs and VAEs, and conflict between good classification and generation.
method Joint-stochastic-approximation random fields (JRFs) for deep undirected generative models.
result JRFs achieve good classification and generation results in SSL.
This work proposes a new feature for transportation mode classification using GPS trajectories.
problem Classifying transportation modes from GPS trajectories to optimize urban mobility.
method The Ordinal Pattern Transition Graph and its self-transition probability are used for classification.
result The proposed feature outperforms existing methods in transportation mode classification.
A two-layer classifier improves smartphone transportation mode recognition.
problem Improving accuracy of transportation mode classification.
method Two-layer hierarchical classifier combining time and frequency domain features.
result Maximum classification accuracy of 97.02%.
Hybrid model for multimodal distributions using diffusion and classification.
problem Sampling from multimodal distributions with correct proportions.
method Divide-and-conquer strategy: identify modes, train classifiers, diffusion models, bridge sampling.
result Framework effectively handles multimodal distributions in high dimensions.
Paper proposes using DMD for feature extraction in image classification.
problem Lack of labelled data for machine learning.
method Dynamic Mode Decomposition (DMD) for feature extraction.
result DMD features with RKS give competitive results.
Method learns hierarchical representations of samples and features simultaneously.
problem Hierarchical structures in samples and features not considered by existing methods.
method Jointly learns hierarchical representations via Tree-Wasserstein Distance alternating between samples and features.
result Method improves performance in link prediction and node classification tasks.
Ensemble CNNs improve mode classification in smartphone travel surveys.
problem Classifying transportation modes from smartphone travel survey data.
method Developed an ensemble of CNN models with different architectures and hyper-parameters, combined using average voting, majority voting, optimal weights, and a Random Forest meta-learner.
result The ensemble method with Random Forest as meta-learner achieved 91.8% accuracy, surpassing other methods.
Classifies collective motions in biological networks using graph dynamic mode decomposition.
problem Classifying complex collective motions in biological networks based on transient and complexly changing network properties.
method Data-driven spectral analysis (graph dynamic mode decomposition) to extract dynamical properties.
result Contextual node information and physical properties are crucial for classifying collective motions.
Study identifies failure modes of machine learning models in out-of-distribution settings.
problem Machine learning models fail to generalize well to new, unseen data.
method Theoretical study of gradient-descent-trained linear classifiers on easy-to-learn tasks, followed by experiments on modern neural networks.
result Two failure modes of spurious correlations are uncovered: geometric and statistical.
A significantly faster algorithm is presented for the original kNN mode seeking procedure. It has the advantages over the well-known mean shift algorithm that it is feasible in high-dimensional vector spaces and results in uniquely, well defined modes. Moreover, without any additional computational effort it may yield …
A new tensor-based method improves multi-dimensional data classification accuracy.
problem Efficient representation and classification of multi-dimensional data from multiple sensors.
method n-mode generalized difference subspace (n-mode GDS) for tensor data, with improved metric based on geodesic distance.
result The proposed method outperforms existing methods in gesture and action recognition.
Predicting transportation modes from GPS (Global Positioning System) records is a hot topic in the trajectory mining domain. Each GPS record is called a trajectory point and a trajectory is a sequence of these points. Trajectory mining has applications including but not limited to transportation mode detection, tourism…
New method predicts RUL and failure modes from partial data.
problem Predicting RUL and failure modes from incomplete data.
method Formulated as vector General Value Function (GVF) prediction on an absorbing degradation process, using TD(n,λ) for estimation. result TD improves RUL and failure-mode prediction compared to Monte Carlo methods, especially under scarce complete labels.
The paper explores trading off consistency and dimensionality in convex surrogates for multiclass classification.
problem Designing consistent surrogate losses for multiclass classification with high-dimensional outcomes.
method Investigates embedding outcomes into convex polytopes and examining consistency under low-noise assumptions.
result Consistency can be achieved with less than n−1 dimensions, but hallucination occurs for some distributions. Paper tackles imbalanced time series classification with a novel oversampling method.
problem Imbalanced time series classification challenges due to high dimensionality and correlation.
method Density-ratio based clustering followed by shrinkage technique for covariance estimation, then generating synthetic samples.
result OHIT outperforms state-of-the-art methods in F1, G-mean, and AUC metrics.
Deep learning model predicts protein-ligand binding modes from docking data.
problem Improving protein-ligand binding mode prediction accuracy.
method Dual-graph architecture with separate sub-networks for ligand topology and protein-ligand interactions.
result Deep learning model outperforms docking programs in binding mode prediction.
ACA method improves gradient estimation for neural ODEs, reducing error and training time.
problem Inaccurate gradient estimation methods hinder the performance of neural ODEs on benchmark tasks.
method Adaptive Checkpoint Adjoint (ACA) method that applies trajectory checkpointing, deletes redundant components, and supports adaptive solvers.
result ACA reduces error rate by half and training time by half compared to adjoint and naive methods on image classification tasks.
Random forest identifies key features for diagnosing machine faults.
problem Identifying specific factors causing machine faults.
method Gaussian mixture model clustering, spectrum analysis, random forest classification.
result Identified significant features for different machine states.
This paper uses deep learning to classify different types of cracks from acoustic emission events.
problem Classifying different types of cracks from acoustic emission events.
method Combining deep neural networks with Bidirectional Long Short Term Memory and statistical analysis.
result Achieves 92% accuracy in classifying different types of cracks.
We investigate the emergence of a structure in the correlation matrix of assets' returns as the time-horizon over which returns are computed increases from the minutes to the daily scale. We analyze data from different stock markets (New York, Paris, London, Milano) and with different methods. Result crucially depends …
A machine learning model improves MV CDSS accuracy.
problem Limited input data for MV CDSS due to missing physiologic monitoring device information.
method Developed a machine learning classifier for 5 MV modes with high accuracy.
result Average F1-score of 97.52% for per-breath classification.
New method decomposes KL error using refined information and mode interactions.
problem Learning probability distributions over discrete variables with higher-order interactions.
method Using information geometry, refined mode interactions, and a novel Monte-Carlo sampling technique.
result Complete decomposition of KL error and efficient data use.
Adaptive tensor modeling preserves continuity in multidimensional data.
problem Discretization of continuous multidimensional data loses important information.
method Functional Tucker decomposition (FTD) with RKHS modeling.
result FTD enables adaptive and expressive tensor modeling.
In this work we propose a method for reducing the dimensionality of tensor objects in a binary classification framework. The proposed Common Mode Patterns method takes into consideration the labels' information, and ensures that tensor objects that belong to different classes do not share common features after the redu…
GMM uses mmWave radar to classify traffic modes in poor lighting.
problem Classifying traffic modes in poor lighting conditions.
method GMM on mmWave radar point clouds.
result Good segmentation performance in pedestrian and car classification.
Transfer learning improves chatter detection accuracy with EEMD over WPT.
problem Improving chatter detection accuracy in metal cutting using transfer learning.
method Wavelet Packet Transform (WPT) and Ensemble Empirical Mode Decomposition (EEMD) for feature extraction; Support Vector Machine (SVM), Logistic Regression, Random Forest Classification, and Gradient Boosting with RFE for classification; Transfer learning applied to different turning configurations.
result EEMD outperforms WPT in transfer learning applications, achieving up to 95% accuracy.
This work aims to reduce inexplicable errors in deep neural networks by obtaining class-level semantics and penalizing misclassifications.
problem Deep neural networks misclassify images, leading to inexplicable errors that can harm trust and societal impact.
method Obtain class-level semantics, propose Weighted Loss Functions (WLFs), and train classifiers with these methods.
result Trained networks have more explicable failure modes and comparable accuracy to existing methods.
Periodic surfaces have a limited number of bending modes, equal to their membrane modes.
problem Understanding the limitations of bending modes in periodic surfaces.
method Analyzing deformation modes of periodic, piecewise smooth, simply connected surfaces.
result Effective membrane modes and bending modes are orthogonal, limiting the total number of modes to 3.
Sparse-mode DMD disambiguates local and global modes in spatiotemporal data.
problem Disambiguating local and global modes in spatiotemporal data.
method Sparse-mode DMD with sparsity-promoting regularization.
result Explicitly constructs discrete and continuous spectra.
Study classifies mappings of bivariate normal densities, revealing three types with distinct geometric and statistical properties.
problem Understanding the properties of two-component bivariate normal mixtures.
method Classification via A-equivalence and statistical analysis. result Three distinct types of mappings with specific geometric and statistical properties, and upper bounds for the number of modes.
In image classification tasks, the ability of deep CNNs to deal with complex image data has proven to be unrivalled. However, they require large amounts of labeled training data to reach their full potential. In specialised domains such as healthcare, labeled data can be difficult and expensive to obtain. Active Learni…
Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…
Proposes a method to sample from flat basins of posterior distributions in Bayesian deep learning.
problem Sampling from multi-modal posterior distributions leads to overfitting due to trapping in bad modes.
method Introduces an auxiliary guiding variable to bias MCMC sampling towards flat basins of the energy landscape.
result The method converges faster and outperforms existing methods in sampling from flat basins of the posterior.
The paper develops methods to infer modes of linear systems from noisy data.
problem Detecting oscillations in power flow in AC electrical networks.
method Develops methods to infer modes (real or complex) from observations of linear systems forced by Gaussian noise.
result Inference of damping rates, frequencies, and mode shapes for real and complex modes.
Characterizes neutral deformation modes of minimal surfaces.
problem Understanding the energy content of deformation modes of minimal surfaces.
method Analyzes the energy content of stretching, drilling, and bending modes of minimal surfaces.
result All isometries of a minimal surface are globally neutral and give rise to soft elasticity.
VINNAS uses variational inference to avoid mode collapse in neural architecture search.
problem Mode collapse in gradient-based NAS methods, leading to suboptimal architectures.
method Differentiable variational inference with variational dropout and automatic relevance determination.
result State-of-the-art accuracy with up to twice fewer non-zero parameters.
TAEs discover slow modes but mix them with max variance modes.
problem Discovering slow modes in dynamical systems.
method Theoretical and numerical analysis of TAEs.
result TAEs learn a mixture of slow and max variance modes.
Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.
problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.
Generative model creates diverse neural network weights efficiently.
problem Creating high-performance and diverse weights for neural networks.
method Trains a hypernetwork mapping latent vectors to high-performance weights, balancing accuracy and diversity.
result Generated weights form a diverse manifold, improving classification accuracy.
Simplified non-contrastive learning avoids representation collapse.
problem Training failure modes in self-supervised learning.
method Hyperdimensional computing and inductive bias.
result The approach avoids representation collapses.
Randomized fiber projections enhance neural network accuracy.
problem Improving neural network performance with limited resources.
method Training neural networks on randomized speckled images from multi-mode fiber projectors.
result Classification accuracy is higher with randomized fiber data than with direct images.
Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.
problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.
Cautious Weight Decay modifies weight decay for better optimization.
problem Improving optimization in deep learning models.
method Applies weight decay selectively based on parameter sign alignment.
result Consistently improves model performance across various tasks and scales.
Proposes hinge-Wasserstein to improve uncertainty estimation in regression tasks.
problem Estimating multimodal aleatoric uncertainty in regression tasks from images.
method Regression-by-classification paradigm with hinge-Wasserstein loss.
result Hinge-Wasserstein loss improves uncertainty estimation on challenging tasks.
Geodesics connect model modes in neural network loss landscapes.
problem Connecting modes in neural network loss landscapes.
method Reframed mode connectivity in Information Geometry, hypothesized geodesics as mode-connecting paths, proposed algorithm to approximate geodesics.
result Geodesics achieve mode connectivity in neural networks.
A new, efficient k-modes algorithm improves clustering of categorical data.
problem Clustering categorical data using existing methods like k-means is inefficient. method Developed a novel k-modes algorithm called OTQT, which improves on existing methods. result OTQT finds more accurate clusters per iteration and is faster overall.
New method prevents mode collapse in deep SVDD for anomaly detection.
problem Mode collapse in deep SVDD due to architectural constraints.
method Two regularizers: noise injection and minibatch variance penalization.
result Regularized deep SVDD outperforms state-of-the-art methods.
Multimodal clustering is an unsupervised technique for mining interesting patterns in n-adic binary relations or n-mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n…