Self-paced ensemble learning improves audio classification models.
problem Improving performance of individual models in speech and audio classification.
method A self-paced ensemble learning scheme where models learn from each other over several iterations.
result SPEL significantly outperforms baseline ensemble models.
DSPL tackles distributed self-paced learning for large datasets.
problem Training process for each instance weight in SPL depends on others, making it hard to distribute.
method DSPL reformulates SPL into a distributed setting using ADMM for parallel optimization of model and instance weights.
result DSPL outperforms existing methods on synthetic and real datasets.
Self-paced learning improves PLL by prioritizing training examples.
problem Learning from partially labeled data where each instance has multiple candidate labels.
method Integrates self-paced learning into PLL, ranking training examples and labels.
result The proposed SP-PLL algorithm outperforms baseline methods in partial label learning.
Adversarial learning for mixture Hawkes processes improves performance.
problem Learning mixture models of Hawkes processes from event sequences.
method Iterative self-paced learning with adversarial self-paced mechanism.
result The proposed method outperforms traditional methods consistently.
Self-paced learning selects tasks in a human-like progression for better multitask machine learning.
problem Improving multitask machine learning performance through effective task selection.
method Iterative selection of most appropriate tasks, learning task parameters, and updating shared knowledge using a bi-convex loss function.
result Self-paced task selection outperforms baseline methods in various multitask learning scenarios.
Self-paced CNN boosts CT image patch classification.
problem Limited training samples in medical image analysis.
method Multi-stage self-paced learning framework with a CNN.
result Self-paced CNN outperforms original network with scarce labels.
Proposes a self-paced multi-label learning method to handle diverse labels efficiently.
problem Learning from multi-label data with a large label space is NP-hard and prone to overfitting.
method Self-paced multi-label learning with diversity (SPMLD) approach, incorporating gradual label inclusion and diversity maintenance.
result The proposed SPMLD framework optimizes a non-convex objective function using block coordinate descent.
This paper uses concave conjugacy theory to analyze self-paced learning.
problem Understanding the intrinsic mechanism of self-paced learning.
method Proposes a concave conjugacy theory to analyze self-paced learning.
result Proves the equivalence of SPL regime and a latent concave objective.
New method SP-PPCA reduces outlier impact in PCA.
problem Outliers make standard PCA and PPCA less robust.
method Integrates self-paced learning into PPCA, using iterative optimization.
result SP-PPCA effectively reduces or eliminates outlier impact.
SPLBoost improves robustness of AdaBoost by incorporating self-paced learning.
problem AdaBoost's sensitivity to random noise/outliers.
method Integrating self-paced learning into Boosting framework.
result SPLBoost achieves improved robustness compared to traditional Boosting algorithms.
A new framework for deep learning from multiple experts tackles long-tailed data issues.
problem Training deep networks on imbalanced data distributions.
method Learning From Multiple Experts (LFME) framework, involving self-paced expert selection and curriculum instance selection.
result LFME achieves superior performance compared to state-of-the-art methods.
SPL-ADVisE improves deep learning convergence and accuracy.
problem Training deep neural networks with self-paced learning and adaptive embeddings.
method Integrates self-paced learning and deep metric learning using Magnet Loss for dynamic mini-batch selection.
result SPL-ADVisE converges faster and achieves higher accuracy on fine-grained datasets.
SPMTC improves multi-task clustering by self-paced training and soft version.
problem Local optima and outliers in traditional MTC models.
method Self-paced multi-task clustering (SPMTC) with alternating optimization.
result SPMTC reduces local optima risk and improves clustering performance.
A new framework boosts classifier performance on imbalanced data.
problem Learning from highly imbalanced massive datasets.
method Self-paced ensemble with under-sampling to harmonize data hardness.
result Robust performance even under overlapping classes and skewed distribution.
Paper proposes IRL methods for limited interaction scenarios.
problem Learning with limited teacher interaction.
method Curriculum Inverse Reinforcement Learning (CIRL) and Self-Paced Inverse Reinforcement Learning (SPIRL).
result Training strategies can accelerate learning compared to random or batch methods.
This paper improves cross-modal learning to rank by using self-paced learning with non-linear mapping functions.
problem Challenges in learning cross-modal similarity, especially with linear mapping functions and equal importance assumption.
method Incorporates self-paced learning theory with diversity into cross-modal learning to rank, using non-linear mapping functions.
result Significant improvements over state-of-the-art methods in cross-modal retrieval tasks.
Deep learning predicts stock trends from chaotic online news.
problem Predicting stock trends from volatile and non-stationary stock market data.
method Hybrid Attention Networks and self-paced learning mechanism.
result Demonstrated effectiveness in predicting stock trends from online news.
Proposes an ensemble framework for outlier detection with embedded feature selection.
problem Improving performance of outlier detection in noisy data.
method Unified feature selection and outlier detection, thresholded self-paced learning, alternate algorithm.
result The proposed framework ODEFS outperforms existing methods on real-world datasets.
SPCA improves PCA by learning from simple to complex samples.
problem Noise and outliers in complex data.
method Self-paced Principal Component Analysis (SPCA) that integrates samples from simple to more complex.
result SPCA improves state-of-the-art results on popular datasets.
A new QSAR model selects relevant molecular descriptors for bioactivity prediction.
problem Redundant, noisy, and irrelevant descriptors in QSAR models.
method SPL-Logsum method using regularization and self-paced learning.
result SPL-Logsum method outperforms other methods in classification performance and model interpretability.
Paper improves neural network accuracy by focusing on uncertain samples.
problem Improving neural network accuracy through better instance weighting.
method Estimates sample uncertainty in SGD to re-weight training instances.
result Reliable improvements in accuracy across various network architectures.
Improves sample efficiency in reinforcement learning by controlling task distribution.
problem Learning and generalization of behaviors across related tasks in intelligent robots.
method Introduces a novel relative entropy reinforcement learning algorithm that allows the agent to control the intermediate task distribution.
result The proposed curriculum learning scheme drastically improves sample efficiency and enables learning in challenging scenarios.
Automatically generates a deep RL curriculum for faster and more stable learning.
problem How to automatically generate a curriculum for deep RL agents.
method Interprets curriculum generation as an inference problem, learning task distributions progressively.
result Curricula significantly improve learning performance across various environments and deep RL algorithms.
SelectNet selectively adds unlabelled data to balance imbalanced training data.
problem Training from imbalanced data in machine learning.
method SelectNet trains a deep neural network to add unlabelled data with predicted labels to the training dataset.
result SelectNet effectively balances imbalanced training data, improving classifier performance.
Proposes MEDIC to improve incremental learning by preventing forgetting and intransigence.
problem Challenges of forgetting old knowledge and intransigence on new knowledge in incremental learning.
method Maximum Entropy Regularizer (MER) and DropOut Sampling (DOS) to penalize uncertain knowledge and reduce class imbalance.
result Proposed method 'MEDIC' outperforms state-of-the-art algorithms in accuracy, forgetting, and intransigence.
Self-PU combines self-training with PU learning for improved binary classification.
problem Binary classification from unlabeled data and few labeled positives.
method Integrates self-paced training, self-calibrated loss, and self-distillation.
result Significantly improved performance on Alzheimer's Disease classification.
China and EU race to develop hydrogen for energy transition.
problem Developing hydrogen for sustainable energy systems.
method Comparative analysis framework using key factors.
result Customized solutions for local hydrogen industries.
Meta-learning adapts models for unseen tasks across AI, robotics, and NLP.
problem Adapting models to unseen tasks efficiently and accurately.
method Black-box, metric-based, layered, and Bayesian approaches.
result Meta-learning enhances model generalization and adaptation to unseen tasks.
Meta-learning improves neural networks by adapting learning algorithms.
problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.
metric-learn simplifies metric learning in Python.
problem Performing distance metric learning efficiently.
method Unified scikit-learn compatible interface for supervised and weakly-supervised metric learning.
result Unified interface for cross-validation and model selection.
Meta-learning speeds up learning new tasks.
problem Designing and improving machine learning pipelines.
method Observing and learning from different machine learning approaches.
result Learning new tasks much faster than traditional methods.
Survey explores how transfer learning improves deep reinforcement learning.
problem Challenges in reinforcement learning efficiency and effectiveness.
method Categorizes and analyzes transfer learning approaches.
result Transfer learning enhances reinforcement learning performance.
Machine learning models adapt to motor learning but face challenges.
problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.
Dropout learning is analyzed as ensemble learning to prevent overfitting.
problem Overfitting in deep learning models.
method Dropout learning ignores some inputs and hidden units with a probability, p, and combines them with the learned network.
result Combining neglected hidden units with the learned network can be seen as ensemble learning.
Optimal learning paths designed for E-learning systems using reinforcement learning.
problem Designing optimal learning paths for E-learning systems.
method Developed a hierarchical skill model and a proficiency level model, applied reinforcement learning to find the optimal learning strategy.
result Demonstrated the effectiveness of the proposed framework via numerical experiments.
New theory improves deep learning performance without statistical assumptions.
problem Improving deep learning performance without statistical assumptions.
method Measure-theoretic theory for machine learning, derived regularization method.
result New regularization method outperforms previous methods in various datasets.
Dex improves reinforcement learning by solving complex environments incrementally.
problem Training reinforcement learning agents for complex, ever-changing environments.
method Incremental learning approach, using optimal weights from simpler environments.
result Incremental learning yields superior performance across multiple Dex environments.
HGAIL learns policies without expert demonstrations.
problem Lack of expert demonstrations in imitation learning.
method Combines hindsight and GAIL to learn policies.
result Comparable performance to current methods, with curriculum learning.
New method uses bi-level optimization to learn useful representations for imitation learning.
problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.
Tabular Q-Learning with learned state abstractions solves continuous control tasks.
problem Challenging reinforcement learning problems in continuous control.
method Learned state abstraction to transform continuous state-space into discrete.
result Tabular Q-Learning with learned abstractions achieves efficient learning in unseen tasks.
Unsupervised meta-learning speeds up reinforcement learning tasks.
problem Efficiently solving new reinforcement learning tasks.
method Formulating unsupervised meta-reinforcement learning and using mutual information for task proposals.
result Unsupervised meta-reinforcement learning effectively acquires accelerated procedures without manual task design.
Pymc-learn simplifies probabilistic machine learning for non-specialists.
problem Making probabilistic machine learning accessible to non-experts.
method Inspired by scikit-learn, Pymc-learn provides a high-level language for probabilistic models.
result Pymc-learn brings probabilistic machine learning to non-specialists with ease, performance, and flexibility.
Study Whittle index learning algorithms for restless bandits with constant stepsizes.
problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.
AI learns to learn sequentially without forgetting.
problem Preventing catastrophic forgetting in machine learning models.
method Meta-learning a neuromodulatory activation-gating function to control selective activation in deep neural networks.
result State-of-the-art continual learning performance with 600 classes (9,000 updates).
Paper discusses flaws in traditional RL for lifelong learning.
problem Traditional RL fails to model lifelong learning systems.
method Simplified prototype of lifelong RL system.
result Insights into lifelong RL, showing traditional RL's limitations.
New unsupervised learning technique learns independent kernels for better machine learning tasks.
problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.
Poisson learning doesn't solve graph semi-supervised learning issues.
problem Global information loss in graph-based semi-supervised learning.
method Poisson learning is Laplace regularization with thresholding.
result Poisson learning cannot overcome the global information loss problem.
Meta-learning helps models learn quickly from few samples.
problem Deep learning requires many samples, which are hard to get.
method Meta-learning optimizes models to adapt quickly to new tasks.
result Meta-learning can improve model efficiency and adaptability.