Model-Agnostic Meta-Learning
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Learning to Evaluate: Cost-Effective Model Evaluation on Unlabeled Data with Meta-Learning
Announce Type: replace Abstract: The rapid advancement of machine learning has led to an unprecedented expansion of model ecosystems, making it increasingly difficult to assess the reliability of newly released models on unseen and unlabeled data. Existing evaluation pipelines typically rely on costly annotation, repeated fine-tuning, or assumptions that do not generalize well to new models. We introduce MetaEvaluator, a cost-effective, model-agnostic framework for fast, label-free...
Learning to Evaluate: Cost-Effective Model Evaluation on Unlabeled Data with Meta-Learning
Announce Type: replace Abstract: The rapid advancement of machine learning has led to an unprecedented expansion of model ecosystems, making it increasingly difficult to assess the reliability of newly released models on unseen and unlabeled data. Existing evaluation pipelines typically rely on costly annotation, repeated fine-tuning, or assumptions that do not generalize well to new models. We introduce MetaEvaluator, a cost-effective, model-agnostic framework for fast, label-free...
Few-Shot Prediction for Pulsar Noise with Long Short-Term Memory Network
Announce Type: cross Abstract: This work proposes a novel solution to predict pulsar timing residuals with limited data, addressing the critical challenge of data scarcity across spin-frequency subgroups of millisecond pulsars in PTA datasets. The proposed solution applies a Long Short-Term Memory (LSTM) network optimized using the model-agnostic meta-learning algorithm, enabling rapid adaptation to new frequency domain by fine-tuning the LSTM network with only a few-shot of ground truth...
ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization
Announce Type: replace Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts. To address this issue, we uncover the Satisficing Generalization Edge, which we validate both theoretically and experimentally: identifying a...
A Pan-Cancer Multi-Omic SuperLearner for Regulated Cell Death Survival Topologies
Introduction: Regulated cell death (RCD) pathways profoundly influence tumor progression and immune modulation. In prior work, we constructed a comprehensive database mapping 25 forms of RCD across seven multi-omic layers encompassing 33 tumor types (CancerRCDShiny). Despite their robust ability to identify risk populations, translating these prognostic signatures into personalized clinical workflows requires a shift from generalized cohort stratification to individualized risk mapping.