| import sys |
| import os |
| import csv |
| import argparse |
| import random |
| from pathlib import Path |
| import numpy as np |
| import torch |
| import pandas as pd |
| import re |
|
|
| from torch.utils.data import DataLoader |
|
|
| try: |
| import wandb |
| except ImportError as e: |
| pass |
|
|
| try: |
| from torch_geometric.data import Batch |
| except ImportError: |
| pass |
|
|
|
|
| def cross_entropy_with_logits_loss(input, soft_target): |
| """ |
| Implementation of CrossEntropy loss using a soft target. Extension of BCEWithLogitsLoss to MCE. |
| Normally, cross entropy loss is |
| \sum_j 1{j == y} -log \frac{e^{s_j}}{\sum_k e^{s_k}} = -log \frac{e^{s_y}}{\sum_k e^{s_k}} |
| Here we use |
| \sum_j P_j *-log \frac{e^{s_j}}{\sum_k e^{s_k}} |
| where 0 <= P_j <= 1 |
| Does not support fancy nn.CrossEntropy options (e.g. weight, size_average, ignore_index, reductions, etc.) |
| |
| Args: |
| - input (N, k): logits |
| - soft_target (N, k): targets for softmax(input); likely want to use class probabilities |
| Returns: |
| - losses (N, 1) |
| """ |
| return torch.sum(- soft_target * torch.nn.functional.log_softmax(input, 1), 1) |
|
|
| def update_average(prev_avg, prev_counts, curr_avg, curr_counts): |
| denom = prev_counts + curr_counts |
| if isinstance(curr_counts, torch.Tensor): |
| denom += (denom==0).float() |
| elif isinstance(curr_counts, int) or isinstance(curr_counts, float): |
| if denom==0: |
| return 0. |
| else: |
| raise ValueError('Type of curr_counts not recognized') |
| prev_weight = prev_counts/denom |
| curr_weight = curr_counts/denom |
| return prev_weight*prev_avg + curr_weight*curr_avg |
|
|
| |
| class ParseKwargs(argparse.Action): |
| def __call__(self, parser, namespace, values, option_string=None): |
| setattr(namespace, self.dest, dict()) |
| for value in values: |
| key, value_str = value.split('=') |
| if value_str.replace('-','').isnumeric(): |
| processed_val = int(value_str) |
| elif value_str.replace('-','').replace('.','').isnumeric(): |
| processed_val = float(value_str) |
| elif value_str in ['True', 'true']: |
| processed_val = True |
| elif value_str in ['False', 'false']: |
| processed_val = False |
| else: |
| processed_val = value_str |
| getattr(namespace, self.dest)[key] = processed_val |
|
|
| def parse_bool(v): |
| if v.lower()=='true': |
| return True |
| elif v.lower()=='false': |
| return False |
| else: |
| raise argparse.ArgumentTypeError('Boolean value expected.') |
|
|
| def save_model(algorithm, epoch, best_val_metric, path): |
| state = {} |
| state['algorithm'] = algorithm.state_dict() |
| state['epoch'] = epoch |
| state['best_val_metric'] = best_val_metric |
| torch.save(state, path) |
|
|
| def load(module, path, device=None, tries=2): |
| """ |
| Handles loading weights saved from this repo/model into an algorithm/model. |
| Attempts to handle key mismatches between this module's state_dict and the loaded state_dict. |
| Args: |
| - module (torch module): module to load parameters for |
| - path (str): path to .pth file |
| - device: device to load tensors on |
| - tries: number of times to run the match_keys() function |
| """ |
| if device is not None: |
| state = torch.load(path, map_location=device) |
| else: |
| state = torch.load(path) |
|
|
| |
| if 'algorithm' in state: |
| prev_epoch = state['epoch'] |
| best_val_metric = state['best_val_metric'] |
| state = state['algorithm'] |
| |
| elif 'state_dict' in state: |
| state = state['state_dict'] |
| prev_epoch, best_val_metric = None, None |
| else: |
| prev_epoch, best_val_metric = None, None |
|
|
| |
| try: module.load_state_dict(state) |
| except: |
| |
| module_keys = module.state_dict().keys() |
| for _ in range(tries): |
| state = match_keys(state, list(module_keys)) |
| module.load_state_dict(state, strict=False) |
| leftover_state = {k:v for k,v in state.items() if k in list(state.keys()-module_keys)} |
| leftover_module_keys = module_keys - state.keys() |
| if len(leftover_state) == 0 or len(leftover_module_keys) == 0: break |
| state, module_keys = leftover_state, leftover_module_keys |
| if len(module_keys-state.keys()) > 0: print(f"Some module parameters could not be found in the loaded state: {module_keys-state.keys()}") |
| return prev_epoch, best_val_metric |
|
|
| def match_keys(d, ref): |
| """ |
| Matches the format of keys between d (a dict) and ref (a list of keys). |
| |
| Helper function for situations where two algorithms share the same model, and we'd like to warm-start one |
| algorithm with the model of another. Some algorithms (e.g. FixMatch) save the featurizer, classifier within a sequential, |
| and thus the featurizer keys may look like 'model.module.0._' 'model.0._' or 'model.module.model.0._', |
| and the classifier keys may look like 'model.module.1._' 'model.1._' or 'model.module.model.1._' |
| while simple algorithms (e.g. ERM) use no sequential 'model._' |
| """ |
| |
| d = {re.sub('model.1.', 'model.classifier.', k): v for k,v in d.items()} |
| d = {k: v for k,v in d.items() if 'pre_classifier' not in k} |
|
|
| |
| |
| success = False |
| probe = list(d.keys())[0].split('.') |
| for i in range(len(probe)): |
| probe_str = '.'.join(probe[i:]) |
| matches = list(filter(lambda ref_k: len(ref_k) >= len(probe_str) and probe_str == ref_k[-len(probe_str):], ref)) |
| matches = list(filter(lambda ref_k: not 'layer' in ref_k, matches)) |
| if len(matches) == 0: continue |
| else: |
| success = True |
| append = [m[:-len(probe_str)] for m in matches] |
| remove = '.'.join(probe[:i]) + '.' |
| break |
| if not success: raise Exception("These dictionaries have irreconcilable keys") |
|
|
| return_d = {} |
| for a in append: |
| for k,v in d.items(): return_d[re.sub(remove, a, k)] = v |
|
|
| |
| if 'model.classifier.weight' in return_d: |
| return_d['model.1.weight'], return_d['model.1.bias'] = return_d['model.classifier.weight'], return_d['model.classifier.bias'] |
| return return_d |
|
|
| def log_group_data(datasets, grouper, logger): |
| for k, dataset in datasets.items(): |
| name = dataset['name'] |
| dataset = dataset['dataset'] |
| logger.write(f'{name} data...\n') |
| if grouper is None: |
| logger.write(f' n = {len(dataset)}\n') |
| else: |
| _, group_counts = grouper.metadata_to_group( |
| dataset.metadata_array, |
| return_counts=True) |
| group_counts = group_counts.tolist() |
| for group_idx in range(grouper.n_groups): |
| logger.write(f' {grouper.group_str(group_idx)}: n = {group_counts[group_idx]:.0f}\n') |
| logger.flush() |
|
|
| class Logger(object): |
| def __init__(self, fpath=None, mode='w'): |
| self.console = sys.stdout |
| self.file = None |
| if fpath is not None: |
| self.file = open(fpath, mode) |
|
|
| def __del__(self): |
| self.close() |
|
|
| def __enter__(self): |
| pass |
|
|
| def __exit__(self, *args): |
| self.close() |
|
|
| def write(self, msg): |
| self.console.write(msg) |
| if self.file is not None: |
| self.file.write(msg) |
|
|
| def flush(self): |
| self.console.flush() |
| if self.file is not None: |
| self.file.flush() |
| os.fsync(self.file.fileno()) |
|
|
| def close(self): |
| self.console.close() |
| if self.file is not None: |
| self.file.close() |
|
|
| class BatchLogger: |
| def __init__(self, csv_path, mode='w', use_wandb=False): |
| self.path = csv_path |
| self.mode = mode |
| self.file = open(csv_path, mode) |
| self.is_initialized = False |
|
|
| |
| self.use_wandb = use_wandb |
| if use_wandb: |
| self.split = Path(csv_path).stem |
|
|
| def setup(self, log_dict): |
| columns = log_dict.keys() |
| |
| for key in ['batch', 'epoch']: |
| if key in columns: |
| columns = [key] + [k for k in columns if k != key] |
|
|
| self.writer = csv.DictWriter(self.file, fieldnames=columns) |
| if self.mode=='w' or (not os.path.exists(self.path)) or os.path.getsize(self.path)==0: |
| self.writer.writeheader() |
| self.is_initialized = True |
|
|
| def log(self, log_dict): |
| if self.is_initialized is False: |
| self.setup(log_dict) |
| self.writer.writerow(log_dict) |
| self.flush() |
|
|
| if self.use_wandb: |
| results = {} |
| for key in log_dict: |
| new_key = f'{self.split}/{key}' |
| results[new_key] = log_dict[key] |
| wandb.log(results) |
|
|
| def flush(self): |
| self.file.flush() |
|
|
| def close(self): |
| self.file.close() |
|
|
| def set_seed(seed): |
| """Sets seed""" |
| if torch.cuda.is_available(): |
| torch.cuda.manual_seed(seed) |
| torch.manual_seed(seed) |
| np.random.seed(seed) |
| random.seed(seed) |
| torch.backends.cudnn.benchmark = False |
| torch.backends.cudnn.deterministic = True |
|
|
| def log_config(config, logger): |
| for name, val in vars(config).items(): |
| logger.write(f'{name.replace("_"," ").capitalize()}: {val}\n') |
| logger.write('\n') |
|
|
| def initialize_wandb(config): |
| if config.wandb_api_key_path is not None: |
| with open(config.wandb_api_key_path, "r") as f: |
| os.environ["WANDB_API_KEY"] = f.read().strip() |
|
|
| wandb.init(**config.wandb_kwargs) |
| wandb.config.update(config) |
|
|
| def save_pred(y_pred, path_prefix): |
| |
| if torch.is_tensor(y_pred): |
| df = pd.DataFrame(y_pred.numpy()) |
| df.to_csv(path_prefix + '.csv', index=False, header=False) |
| |
| elif isinstance(y_pred, dict) or isinstance(y_pred, list): |
| torch.save(y_pred, path_prefix + '.pth') |
| else: |
| raise TypeError("Invalid type for save_pred") |
|
|
| def get_replicate_str(dataset, config): |
| if dataset['dataset'].dataset_name == 'poverty': |
| replicate_str = f"fold:{config.dataset_kwargs['fold']}" |
| else: |
| replicate_str = f"seed:{config.seed}" |
| return replicate_str |
|
|
| def get_pred_prefix(dataset, config): |
| dataset_name = dataset['dataset'].dataset_name |
| split = dataset['split'] |
| replicate_str = get_replicate_str(dataset, config) |
| prefix = os.path.join( |
| config.log_dir, |
| f"{dataset_name}_split:{split}_{replicate_str}_") |
| return prefix |
|
|
| def get_model_prefix(dataset, config): |
| dataset_name = dataset['dataset'].dataset_name |
| replicate_str = get_replicate_str(dataset, config) |
| prefix = os.path.join( |
| config.log_dir, |
| f"{dataset_name}_{replicate_str}_") |
| return prefix |
|
|
| def move_to(obj, device): |
| if isinstance(obj, dict): |
| return {k: move_to(v, device) for k, v in obj.items()} |
| elif isinstance(obj, list): |
| return [move_to(v, device) for v in obj] |
| elif isinstance(obj, float) or isinstance(obj, int): |
| return obj |
| else: |
| |
| |
| return obj.to(device) |
|
|
| def detach_and_clone(obj): |
| if torch.is_tensor(obj): |
| return obj.detach().clone() |
| elif isinstance(obj, dict): |
| return {k: detach_and_clone(v) for k, v in obj.items()} |
| elif isinstance(obj, list): |
| return [detach_and_clone(v) for v in obj] |
| elif isinstance(obj, float) or isinstance(obj, int): |
| return obj |
| else: |
| raise TypeError("Invalid type for detach_and_clone") |
|
|
| def collate_list(vec): |
| """ |
| If vec is a list of Tensors, it concatenates them all along the first dimension. |
| |
| If vec is a list of lists, it joins these lists together, but does not attempt to |
| recursively collate. This allows each element of the list to be, e.g., its own dict. |
| |
| If vec is a list of dicts (with the same keys in each dict), it returns a single dict |
| with the same keys. For each key, it recursively collates all entries in the list. |
| """ |
| if not isinstance(vec, list): |
| raise TypeError("collate_list must take in a list") |
| elem = vec[0] |
| if torch.is_tensor(elem): |
| return torch.cat(vec) |
| elif isinstance(elem, list): |
| return [obj for sublist in vec for obj in sublist] |
| elif isinstance(elem, dict): |
| return {k: collate_list([d[k] for d in vec]) for k in elem} |
| else: |
| raise TypeError("Elements of the list to collate must be tensors or dicts.") |
|
|
| def remove_key(key): |
| """ |
| Returns a function that strips out a key from a dict. |
| """ |
| def remove(d): |
| if not isinstance(d, dict): |
| raise TypeError("remove_key must take in a dict") |
| return {k: v for (k,v) in d.items() if k != key} |
| return remove |
|
|
| def concat_input(labeled_x, unlabeled_x): |
| if isinstance(labeled_x, torch.Tensor): |
| x_cat = torch.cat((labeled_x, unlabeled_x), dim=0) |
| elif isinstance(labeled_x, Batch): |
| labeled_x.y = None |
| x_cat = Batch.from_data_list([labeled_x, unlabeled_x]) |
| else: |
| raise TypeError("x must be Tensor or Batch") |
| return x_cat |
|
|
| class InfiniteDataIterator: |
| """ |
| Adapted from https://github.com/thuml/Transfer-Learning-Library |
| |
| A data iterator that will never stop producing data |
| """ |
| def __init__(self, data_loader: DataLoader): |
| self.data_loader = data_loader |
| self.iter = iter(self.data_loader) |
|
|
| def __next__(self): |
| try: |
| data = next(self.iter) |
| except StopIteration: |
| print("Reached the end, resetting data loader...") |
| self.iter = iter(self.data_loader) |
| data = next(self.iter) |
| return data |
|
|
| def __len__(self): |
| return len(self.data_loader) |
|
|