Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added bte_with_cpd experiment tutorial notebook #389

Merged
merged 7 commits into from
Dec 11, 2020
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion docs/tutorials.rst
Original file line number Diff line number Diff line change
Expand Up @@ -17,4 +17,5 @@ The following tutorials highlight what one can do with the ``ProgLearn`` package
tutorials/uncertaintyforest_conditionalentropyestimates
tutorials/uncertaintyforest_mutualinformationestimates
tutorials/xor_nxor_exp
tutorials/xor_rxor_exp
tutorials/xor_rxor_exp
tutorials/xor_rxor_with_cpd
186 changes: 186 additions & 0 deletions docs/tutorials/functions/xor_rxor_with_cpd_functions.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,186 @@
import numpy as np
import random
import seaborn as sns
import matplotlib.pyplot as plt
import matplotlib

from joblib import Parallel, delayed
from math import log2, ceil

from proglearn.forest import LifelongClassificationForest, UncertaintyForest
from proglearn.sims import *
from proglearn.progressive_learner import ProgressiveLearner
from proglearn.deciders import SimpleArgmaxAverage
from proglearn.transformers import TreeClassificationTransformer, NeuralClassificationTransformer
from proglearn.voters import TreeClassificationVoter, KNNClassificationVoter
from pycpd import AffineRegistration

def get_colors(colors, inds):
c = [colors[i] for i in inds]
return c

def cpd_reg(template, target, max_iter=50):
registration = AffineRegistration(X=target, Y=template, max_iterations=max_iter)
deformed_template = registration.register(template)

return deformed_template[0]

def plot_xor_rxor(data, labels, title):
colors = sns.color_palette("Dark2", n_colors=2)
fig, ax = plt.subplots(1, 1, figsize=(8, 8))
ax.scatter(data[:, 0], data[:, 1], c=get_colors(colors, labels), s=50)
ax.set_xticks([])
ax.set_yticks([])
ax.set_title(title, fontsize=30)
#plt.tight_layout()
ax.axis("off")
plt.show()

def experiment(n_task1, n_task2, n_test=1000,
task1_angle=0, task2_angle=np.pi/2,
n_trees=10, max_depth=None, random_state=None,
register=False):

"""
A function to do backwards transfer efficiency experiment
between two tasks. Task 1 is XOR. Task 2 is RXOR.
A registered Task 2

Parameters
----------
n_task1 : int
Total number of train sample for task 1.

n_task2 : int
Total number of train dsample for task 2

n_test : int, optional (default=1000)
Number of test sample for each task.

task1_angle : float, optional (default=0)
Angle in radian for task 1.

task2_angle : float, optional (default=numpy.pi/2)
Angle in radian for task 2.

n_trees : int, optional (default=10)
Number of total trees to train for each task.

max_depth : int, optional (default=None)
Maximum allowable depth for each tree.

random_state : int, RandomState instance, default=None
Determines random number generation for dataset creation. Pass an int
for reproducible output across multiple function calls.

register: boolean, default=False
Register task2 to task1 before feeding to forest.

Returns
-------
errors : array of shape [6]
Elements of the array is organized as single task error task1,
multitask error task1, single task error task2,
multitask error task2, naive UF error task1,
naive UF task2.
"""

if n_task1==0 and n_task2==0:
raise ValueError('Wake up and provide samples to train!!!')

if random_state != None:
np.random.seed(random_state)

errors = np.zeros(6,dtype=float)

default_transformer_class = TreeClassificationTransformer
default_transformer_kwargs = {"kwargs" : {"max_depth" : max_depth}}

default_voter_class = TreeClassificationVoter
default_voter_kwargs = {}

default_decider_class = SimpleArgmaxAverage
default_decider_kwargs = {"classes" : np.arange(2)}
progressive_learner = ProgressiveLearner(default_transformer_class = default_transformer_class,
default_transformer_kwargs = default_transformer_kwargs,
default_voter_class = default_voter_class,
default_voter_kwargs = default_voter_kwargs,
default_decider_class = default_decider_class,
default_decider_kwargs = default_decider_kwargs)
uf = ProgressiveLearner(default_transformer_class = default_transformer_class,
default_transformer_kwargs = default_transformer_kwargs,
default_voter_class = default_voter_class,
default_voter_kwargs = default_voter_kwargs,
default_decider_class = default_decider_class,
default_decider_kwargs = default_decider_kwargs)
naive_uf = ProgressiveLearner(default_transformer_class = default_transformer_class,
default_transformer_kwargs = default_transformer_kwargs,
default_voter_class = default_voter_class,
default_voter_kwargs = default_voter_kwargs,
default_decider_class = default_decider_class,
default_decider_kwargs = default_decider_kwargs)

#source data
X_task1, y_task1 = generate_gaussian_parity(n_task1, angle_params=task1_angle)
test_task1, test_label_task1 = generate_gaussian_parity(n_test, angle_params=task1_angle)

#target data
X_task2, y_task2 = generate_gaussian_parity(n_task2, angle_params=task2_angle)
test_task2, test_label_task2 = generate_gaussian_parity(n_test, angle_params=task2_angle)


if register:
X_task2 = cpd_reg(X_task2.copy(), X_task1.copy())

progressive_learner.add_task(X_task1, y_task1, num_transformers=n_trees)
progressive_learner.add_task(X_task2, y_task2, num_transformers=n_trees)

uf.add_task(X_task1, y_task1, num_transformers=2*n_trees)
uf.add_task(X_task2, y_task2, num_transformers=2*n_trees)

uf_task1=uf.predict(test_task1, transformer_ids=[0], task_id=0)
l2f_task1=progressive_learner.predict(test_task1, task_id=0)

errors[0] = 1 - np.mean(
uf_task1 == test_label_task1
)
errors[1] = 1 - np.mean(
l2f_task1 == test_label_task1
)

return errors


def bte_v_angle(angle_sweep,task1_sample,task2_sample,mc_rep, adaptation):
mean_te = np.zeros(len(angle_sweep), dtype=float)
for ii,angle in enumerate(angle_sweep):
error = np.array(
Parallel(n_jobs=-1,verbose=0)(
delayed(experiment)(
task1_sample,task2_sample,
task2_angle=angle*np.pi/180,
max_depth=ceil(log2(task1_sample)),
register=adaptation
) for _ in range(mc_rep)
)
)

mean_te[ii] = np.mean(error[:,0])/np.mean(error[:,1])
return mean_te

def plot_bte_v_angle(angle_sweep, mean_te1, mean_te2):
sns.set_context("talk")
fig, ax = plt.subplots(1,1, figsize=(8,8))
task = ['R-XOR as Task 2', 'A-XOR as Task 2']
ax.plot(angle_sweep, mean_te1, linewidth = 3, label=task[0])
ax.plot(angle_sweep, mean_te2, linewidth = 3, label=task[1])
ax.set_xticks(range(0,91,10))
ax.set_xlabel('Angle of Rotation (Degrees)')
ax.set_ylabel('Backward Transfer Efficiency (XOR)')
ax.hlines(1, 0,90, colors='gray', linestyles='dashed',linewidth=1.5)
ax.legend(loc='upper center', fontsize=20, frameon=False)

right_side = ax.spines["right"]
right_side.set_visible(False)
top_side = ax.spines["top"]
top_side.set_visible(False)
260 changes: 260 additions & 0 deletions docs/tutorials/xor_rxor_with_cpd.ipynb

Large diffs are not rendered by default.