A new method for continual learning in GANs learns new modes with limited data.
problem Learning new target modes with limited samples while preserving previously learned ones.
method Mode-affinity score for generative modeling, generator replay, and weighted label generation.
result Gains over state-of-the-art methods, even with fewer training samples.
Deep learning helps remove secondary B-mode polarization to detect primordial gravitational waves.
problem Removing secondary B-mode polarization from CMB data to detect primordial gravitational waves. method Applied deep learning (ResUNet-CMB) to estimate and remove multiple sources of secondary B-mode polarization. result Deep learning can produce nearly optimal, unbiased estimates of the amplitude of primordial gravitational waves.
A new method learns from multi-modal sequences with external memory.
problem Learning new modes in a dynamic environment without prior knowledge.
method Maintains a neural episodic memory with a Dirichlet Process prior to store mode descriptors and transfers knowledge through retrieval.
result Performs continual learning favorably compared to mainstream approaches.
Estimates mode from partial feedback, improving AI learning pipelines.
problem Estimating the mode of a distribution with partial feedback.
method Entropy coding, coarse sufficient statistics, bandit algorithms.
result Statistically and computationally efficient solution to mode estimation.
The paper explores when to prioritize easy or hard samples in learning tasks.
problem Determining the optimal order of learning easy or hard samples.
method Theoretical analyses and experiments were conducted to propose and validate four priority modes.
result Four priority modes (easy-first, hard-first, medium-first, two-ends-first) can be flexibly applied.
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.
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.
Time-lagged autoencoders (TAEs) have been proposed as a deep learning regression-based approach to the discovery of slow modes in dynamical systems. However, a rigorous analysis of nonlinear TAEs remains lacking. In this work, we discuss the capabilities and limitations of TAEs through both theoretical and numerical an…
Study reveals issues with neural autoregressive models and proposes mode recovery cost.
problem Unreasonable affinity of neural autoregressive models to short and long sequences.
method Investigates modes of ground-truth, empirical, and decoding-induced distributions via mode recovery cost.
result Mode recovery cost varies depending on ground-truth distribution and impacts decoding-induced distribution.
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.
Modified PCA algorithm with continual learning preserves features of previous modes for multimode process monitoring.
problem Catastrophic forgetting of previous modes in monitoring models for successive modes.
method Modified PCA algorithm with elastic weight consolidation (EWC) to preserve features of previous modes.
result PCA-EWC algorithm effectively monitors multimode processes without performance decrease.
Recent years have witnessed an increased focus on interpretability and the use of machine learning to inform policy analysis and decision making. This paper applies machine learning to examine travel behavior and, in particular, on modeling changes in travel modes when individuals are presented with a novel (on-demand)…
New method makes neural networks transparent, revealing learning modes.
problem Lack of interpretability in neural networks.
method Weight pathway analysis (WPA) to decompose neural networks into subnetworks.
result Neural networks store and utilize information holographically, with linear and nonlinear learning modes.
This research improves asset life prediction by integrating deep learning with mixture distributions.
problem Predicting residual useful life for assets with multiple failure modes.
method Integrates mixture (log)-location-scale distribution with deep learning.
result Proposed models outperform existing methods in predicting residual useful life.
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.
Improves generative model coverage of underrepresented modes.
problem Generative models miss underrepresented modes in data.
method Leverage score sampling for complete mode coverage.
result Significantly improves mode coverage compared to standard methods.
Dynamic Mode Decomposition (DMD) yields a linear, approximate model of a system's dynamics that is built from data. We seek to reduce the order of this model by identifying a reduced set of modes that best fit the output. We adopt a model selection algorithm from statistics and machine learning known as Least Angle Reg…
Long-term human motion can be represented as a series of motion modes---motion sequences that capture short-term temporal dynamics---with transitions between them. We leverage this structure and present a novel Motion Transformation Variational Auto-Encoders (MT-VAE) for learning motion sequence generation. Our model j…
New tools for constructing disintegrations and studying their modes.
problem Difficulty in constructing disintegrations and understanding their modes.
method Developed comprehensive mathematical tools for constructing disintegrations and analyzing their modes.
result Disagreement between restricted density and disintegration density in certain cases.
GAN+VER improves GANs by regularizing entropy to reduce mode collapse.
problem Mode collapse in GANs where the generator fails to capture all modes.
method Maximizing a variational lower bound on the entropy of generated samples.
result Significant improvement in evaluation metrics for real and generated samples.
Study improves cross-modal bike-share and transit demand prediction.
problem Cross-modal ripple effects in urban transportation demand.
method Transfer learning and stacked LSTM models for cross-modal demand prediction.
result Transfer learning models outperform unimodal models in cross-modal demand prediction.
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.
Unified model predicts multi-mode failure with multi-sensor data.
problem Independent failure mode and RUL prediction ignores inherent relationship.
method Hierarchical Bayesian framework with Cox model, Gaussian process, and multinomial distributions.
result Robust uncertainty quantification and accurate prediction of multi-mode failure.
New model generates data without mode collapse or mixture.
problem Mode collapse and mode mixture in generative models.
method Inspired by AE-OT, improved sample generation algorithm.
result Free from mode collapse and mixture issues.
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.
Improves meta-learning efficiency with mixed-mode differentiation.
problem Efficiently calculating complex derivatives in meta-learning.
method Mixed-Flow Meta-Gradients (MixFlow-MG) for scalable differentiation.
result Significant memory and time improvements in meta-learning tasks.
Simple mode exploration methods do not improve performance in neural networks.
problem Improving predictive probabilities in neural networks.
method Exploring local regions around diverse solutions using simple methods.
result Simple mode exploration methods do not improve performance.
One of the key advantages of Inductive Logic Programming systems is the ability of the domain experts to provide background knowledge as modes that allow for efficient search through the space of hypotheses. However, there is an inherent assumption that this expert should also be an ILP expert to provide effective mode…
The paper studies kernel smoothing and mean shift for directional data, deriving convergence rates and mode estimation.
problem Statistical and computational problems of kernel smoothing for directional data.
method Generalization of mean shift to directional data, derivation of convergence rates, and investigation of mode estimation.
result Statistical convergence rates of directional KDE and its derivatives, ascending property of directional mean shift, and mode estimation.
Learning an optimal policy from a multi-modal reward function is a challenging problem in reinforcement learning (RL). Hierarchical RL (HRL) tackles this problem by learning a hierarchical policy, where multiple option policies are in charge of different strategies corresponding to modes of a reward function and a gati…
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.
We study two procedures (reverse-mode and forward-mode) for computing the gradient of the validation error with respect to the hyperparameters of any iterative learning algorithm such as stochastic gradient descent. These procedures mirror two methods of computing gradients for recurrent neural networks and have differ…
Theoretical work on mode collapse in variational inference models.
problem Mode collapse in variational inference models, where models focus on a few modes instead of all possible ones.
method Theoretical investigation of mode collapse in Gaussian mixture models, identifying key low-dimensional statistics and equations governing their evolution.
result Mode collapse is present even in favorable scenarios, driven by mean alignment and vanishing weight mechanisms.
New model explains GAN training dynamics and mode collapse.
problem Mode collapse in GANs, where generators fail to reproduce diversity.
method Simplified model using particles in output space, coupled by universal kernel.
result Gradient regularizers can optimally yield convergence through critical damping.
Generative adversarial networks (GANs) are innovative techniques for learning generative models of complex data distributions from samples. Despite remarkable recent improvements in generating realistic images, one of their major shortcomings is the fact that in practice, they tend to produce samples with little divers…
Neural networks can learn optimal auction mechanisms and satisfy mode connectivity.
problem Optimal auction design in complex settings.
method Generalized RochetNet and affine maximizer auctions.
result Neural networks (RochetNet and generalized version) satisfy mode connectivity.
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…
A new method computes gradients without backpropagation.
problem Optimization of machine learning models.
method Forward mode automatic differentiation to compute gradients.
result Forward gradient is an unbiased estimate of the gradient, eliminating the need for backpropagation.
Proposes using mode connectivity to improve adversarial robustness of neural networks.
problem Improving adversarial robustness of deep neural networks.
method Employing mode connectivity in loss landscapes to study adversarial robustness and propose methods for improvement.
result Path connection learned using limited bonafide data can effectively mitigate adversarial effects while maintaining original accuracy.
Neurons predict future scalar inputs by learning top modes of lag vectors.
problem Predicting future scalar inputs with physiological delays.
method Normal Mode Decomposition to extract independently evolving modes.
result Temporal filters of neurons correspond to left eigenvectors of a generalized eigenvalue problem.
MMCGAN uses explicit manifold learning to improve GAN performance.
problem GAN mode collapse and unstable training.
method Introduces Minimum Manifold Coding (MMC) as a prior to guide GAN training.
result MMCGAN effectively alleviates mode collapse and stabilizes GAN training.
The posteriors over neural network weights are high dimensional and multimodal. Each mode typically characterizes a meaningfully different representation of the data. We develop Cyclical Stochastic Gradient MCMC (SG-MCMC) to automatically explore such distributions. In particular, we propose a cyclical stepsize schedul…
Mode decomposition is a prototypical pattern recognition problem that can be addressed from the (a priori distinct) perspectives of numerical approximation, statistical inference and deep learning. Could its analysis through these combined perspectives be used as a Rosetta stone for deciphering mechanisms at play in de…
ICAL improves deep learning model accuracy and NLL with optimized batch labeling.
problem Deep Bayesian Active Learning for efficient model training.
method ICAL uses HSIC to measure dependency and optimizes batch size scaling.
result Significant improvements in model accuracy and NLL on image datasets.
HHT feature generation enhances financial time series forecasting.
problem Forecasting nonstationary financial time series.
method CEEMD and HHT for decomposition, machine learning integration.
result HHT-enhanced models outperform traditional models in forecasting.
New framework assesses graph-learning datasets for better evaluation.
problem Insufficient evaluation of graph-learning datasets and methods.
method Introduces Rings framework for dataset ablations and proposes performance separability and mode complementarity measures.
result Demonstrates utility of Rings framework for graph-learning dataset evaluation.
Framework predicts remaining useful life of DSH subsystems under unknown failure modes.
problem Predicting remaining useful life of DSH subsystems with unknown failure modes.
method Unsupervised framework using mixture of Gaussian regressions and Expectation-Maximization algorithm.
result Improved prediction accuracy and interpretability of RUL.
For dynamical systems that can be modelled as asymptotically stable linear systems forced by Gaussian noise, this paper develops methods to infer or estimate their modes from observations in real time. The modes can be real or complex. For a real mode, we wish to infer its damping rate and mode shape. For a complex mod…