Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })(); GitHub - AnasNeumann/simplemaml: A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017 · GitHub
Skip to content

Repository files navigation

SIMPLE MAML

A generic Python and TensorFlow function that implements a simple version of the "Model-Agnostic Meta-Learning (MAML) Algorithm for Fast Adaptation of Deep Networks" as designed by Chelsea Finn et al. 2017 [1]. Especially, this implementation focuses on regression and prediction problems.

Original algorithm adapted for regression

original-algorithm

Usage

  1. Install with pip install simplemaml
  2. In your python code:
    • from simplemaml import MAML
    • MAML(model=your_model, tasks=your_array_of_tasks, etc.)
  3. Your task should be in one of the two follwing formats:
    • tasks=[{"inputs": [], "target": []}, etc.]
    • tasks=[{"train": {"inputs": [], "target": []}, "test": {"inputs": [], "target": []}}, etc.]

You can also download the lib as a .whl file using pip download simplemaml --only-binary=:all: --no-deps

More about the algorithm

Tools needed

Refer to this repository in scientific documents

Neumann, Anas. (2023). Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems. GitHub repository: https://github.com/AnasNeumann/simplemaml.

@misc{simplemaml,
author = {Anas Neumann},
title = {Simple Python and TensorFlow implementation of the optimization-based Model-Agnostic Meta-Learning (MAML) algorithm for supervised regression problems},
year = {2023},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/AnasNeumann/simplemaml}},
commit = {main}
}

Complete code

defMAML(model, alpha=0.005, beta=0.005, optimizer=keras.optimizers.SGD, c_loss=keras.losses.mse, f_loss=keras.losses.MeanSquaredError(), meta_epochs=100, meta_tasks_per_epoch=[10, 30], inputs_dimension=1, validation_split=0.2, k_folds=0, tasks=[], cumul=False):
""" Simple MAML algorithm implementation for supervised regression. :param model: A Keras model to be trained using MAML. :param alpha: Learning rate for task-specific updates. :param beta: Learning rate for meta-updates. :param optimizer: Optimizer to be used for training. :param c_loss: Loss function for calculating training loss. :param meta_epochs: Number of meta-training epochs. :param meta_tasks_per_epoch: Range of tasks to sample per epoch. :param inputs_dimension: the input dimension (for sequence-to-sequence models). :param validation_split: Ratio of data to use for validation in each task (could be fixed or random between two values). :param k_folds: cross-validation with k_folds each time a task is called for meta-learning. :param tasks: List of tasks for meta-training. :param cumul: choose between sum and mean gradients during the outer loop. :return: Tuple of trained model and evolution of losses over epochs. """if"train"intasks[0] and"test"intasks[0]:
build_task_f=_get_taskbuild_task_param= {"dimension": inputs_dimension}
elifk_folds>0:
build_task_f=_k_fold_taskbuild_task_param= {"dimension": inputs_dimension, "k": k_folds}
else:
build_task_f=_split_taskbuild_task_param= {"dimension": inputs_dimension, "split": validation_split}
iftf.config.list_physical_devices('GPU'):
withtf.device('/GPU:0'):
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
else:
return_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul)
def_split_task(t, param):
d=param["dimension"]
split=param["split"]
v=random.uniform(split[0], split[1]) ifisinstance(split,list) elsesplitsplit_idx=int(len(t["inputs"]) *v)
train_input=t["inputs"][:split_idx] ifd<=1else [t["inputs"][:split_idx] for_inrange(d)]
test_input=t["inputs"][split_idx:] ifd<=1else [t["inputs"][split_idx:] for_inrange(d)]
train_target, test_target=t["target"][:split_idx], t["target"][split_idx:]
returntrain_input, test_input, train_target, test_targetdef_k_fold_task(t, param):
d=param["dimension"]
k=param["k"]
fold=random.randint(0, k-1)
fold_size= (len(t["inputs"]) //k)
v_start=fold*fold_sizev_end= (fold+1) *fold_sizeiffold<k-1elselen(t["inputs"])
t_i=np.concatenate((t["inputs"][:v_start], t["inputs"][v_end:]), axis=0)
train_input=t_iifd<=1else [t_ifor_inrange(d)]
test_input=t["inputs"][v_start:v_end] ifd<=1else [t["inputs"][v_start:v_end] for_inrange(d)]
train_target=np.concatenate((t["target"][:v_start], t["target"][v_end:]), axis=0)
test_target=t["target"][v_start:v_end]
returntrain_input, test_input, train_target, test_targetdef_get_task(t, param):
d=param["dimension"]
train_input=t["train"]["inputs"] ifd<=1else [t["train"]["inputs"] for_inrange(d)]
test_input=t["test"]["inputs"] ifd<=1else [t["test"]["inputs"] for_inrange(d)]
returntrain_input, test_input, t["train"]["target"], t["test"]["target"] def_MAML_compute(model, alpha, beta, optimizer, c_loss, f_loss, meta_epochs, meta_tasks_per_epoch, build_task_f, build_task_param, tasks, cumul):
log_step=meta_epochs//10ifmeta_epochs>10else1optim_test=optimizer(learning_rate=alpha)
optim_train=optimizer(learning_rate=beta)
model_copy=tf.keras.models.clone_model(model)
model_copy.build(model.input_shape)
model_copy.set_weights(model.get_weights())
optim_test.build(model.trainable_variables)
optim_train.build(model_copy.trainable_variables)
model.compile(loss=f_loss, optimizer=optim_test)
model_copy.compile(loss=f_loss, optimizer=optim_train)
losses=[]
total_loss=0.forstepinrange (meta_epochs):
sum_gradients= [tf.zeros_like(variable) forvariableinmodel.trainable_variables]
num_tasks_sampled=random.randint(meta_tasks_per_epoch[0], meta_tasks_per_epoch[1])
model_copy.set_weights(model.get_weights())
for_inrange(num_tasks_sampled):
train_input, test_input, train_target, test_target=build_task_f(random.choice(tasks), build_task_param)
# 1. Inner loop: Update the model copy on the current taskwithtf.GradientTape(watch_accessed_variables=False) astrain_tape:
train_tape.watch(model_copy.trainable_variables)
train_pred=model_copy(train_input)
train_loss=tf.reduce_mean(c_loss(train_target, train_pred))
g=train_tape.gradient(train_loss, model_copy.trainable_variables)
optim_train.apply_gradients(zip(g, model_copy.trainable_variables))
# 2. Compute gradients with respect to the test datawithtf.GradientTape(watch_accessed_variables=False) astest_tape:
test_tape.watch(model_copy.trainable_variables)
test_pred=model_copy(test_input)
test_loss=tf.reduce_mean(c_loss(test_target, test_pred))
g=test_tape.gradient(test_loss, model_copy.trainable_variables)
fori, gradientinenumerate(g):
sum_gradients[i] +=gradient# 3. Meta-update: apply the accumulated gradients to the original modelcumul_gradients= [grad/ (1.0ifcumulelsenum_tasks_sampled) forgradinsum_gradients]
optim_test.apply_gradients(zip(cumul_gradients, model.trainable_variables))
total_loss+=test_loss.numpy()
loss_evol=total_loss/(step+1)
losses.append(loss_evol)
ifstep%log_step==0:
print(f'Meta epoch: {step+1}/{meta_epochs}, Loss: {loss_evol}')
returnmodel, losses

Build a new version of the lib (after updating the version number in setup.py)

  1. rm -rf dist/ build/ simplemaml.egg-info/
  2. python3 setup.py sdist bdist_wheel
  3. twine upload dist/*

REFERENCES

[1] Finn, C., Abbeel, P. & Levine, S.. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. Proceedings of the 34th International Conference on Machine Learning, in Proceedings of Machine Learning Research 70:1126-1135 Available from https://proceedings.mlr.press/v70/finn17a.html and https://proceedings.mlr.press/v70/finn17a/finn17a.pdf.

About

A simple generic (TensorFlow) function that implements the MAML algorithm for regression problems as designed by Chelsea Finn et al. 2017

Topics

Resources

Stars

4 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages