WangZixuan

import torch


def chamfer_distance_without_batch(p1, p2, debug=False):

    '''
    Calculate Chamfer Distance between two point sets
    :param p1: size[1, N, D]
    :param p2: size[1, M, D]
    :param debug: whether need to output debug info

synapticarbors

'''
This script is based on the original work of Randal S. Olson (randalolson.com) for the Traveling Salesman Portrait project.
http://www.randalolson.com/2018/04/11/traveling-salesman-portrait-in-python/

Please check out the original project repository for information:

https://github.com/rhiever/Data-Analysis-and-Machine-Learning-Projects

The script was updated by Joshua L. Adelman, adapting the work of Antonio S. Chinchón described in the following blog post:
https://fronkonstin.com/2018/04/17/pencil-scribbles/

mikigom

import tensorflow as tf

"""
Author : @MikiBear_
Tensorflow Implementation of Bilinear Additive Upsampling.
Reference : https://arxiv.org/abs/1707.05847
"""
def bilinear_additive_upsampling(x, to_channel_num, name):
    from_channel_num = x.get_shape().as_list()[3]
    assert from_channel_num % to_channel_num == 0

j-min

# http://pytorch.org/tutorials/beginner/transfer_learning_tutorial.html

def exp_lr_scheduler(optimizer, epoch, init_lr=0.001, lr_decay_epoch=7):
    """Decay learning rate by a factor of 0.1 every lr_decay_epoch epochs."""
    lr = init_lr * (0.1**(epoch // lr_decay_epoch))

    if epoch % lr_decay_epoch == 0:
        print('LR is set to {}'.format(lr))

    for param_group in optimizer.param_groups:

kashif

Cross Entropy Method

How do we solve for the policy optimization problem which is to maximize the total reward given some parametrized policy?

Discounted future reward

To begin with, for an episode the total reward is the sum of all the rewards. If our environment is stochastic, we can never be sure if we will get the same rewards the next time we perform the same actions. Thus the more we go into the future the more the total future reward may diverge. So for that reason it is common to use the discounted future reward where the parameter discount is called the discount factor and is between 0 and 1.

A good strategy for an agent would be to always choose an action that maximizes the (discounted) future reward. In other words we want to maximize the expected reward per episode.

atduskgreg

Interactive Machine Learning

Taught by Brad Knox at the MIT Media Lab in 2014. Course website. Lecture and visiting speaker notes.

• Power to the People: The Role of Humans in Interactive Machine Learning by Knox, Cakmak, Kulesza, Amershi, and Lau
• A Few Useful Things to Know about Machine Learning by Domingos
• Machine Learning that Matters by Wagstaff
• Beyond Concise and Colorful: Learning Intelligible Rules by Pazzani et al.
• [Designing Games with a Purpose] (https://www.cs.cmu.edu/~biglou/GWAP_CACM.pdf) by von Ahn and Dabbish
• [Human Model Evaluation in Interactive Supervised

saliksyed

""" Deep Auto-Encoder implementation
	
	An auto-encoder works as follows:

	Data of dimension k is reduced to a lower dimension j using a matrix multiplication:
	softmax(W*x + b)  = x'
	
	where W is matrix from R^k --> R^j

	A reconstruction matrix W' maps back from R^j --> R^k

myungsub

Vision & Language

• Ask Your Neurons: A Neural-Based Approach to Answering Questions About Images

  • Mateusz Malinowski, Marcus Rohrbach, Mario Fritz

• Aligning Books and Movies: Towards Story-Like Visual Explanations by Watching Movies and Reading Books

  • Yukun Zhu, Ryan Kiros, Rich Zemel, Ruslan Salakhutdinov, Raquel Urtasun, Antonio Torralba, Sanja Fidler

• Learning Query and Image Similarities With Ranking Canonical Correlation Analysis

• Wah Ngo

karpathy

"""
This is a batched LSTM forward and backward pass
"""
import numpy as np
import code

class LSTM:
  
  @staticmethod
  def init(input_size, hidden_size, fancy_forget_bias_init = 3):

debasishg

1. Feature Learning

• Learning Feature Representations with K-means by Adam Coates and Andrew Y. Ng
• The devil is in the details: an evaluation of recent feature encoding methods by Chatfield et. al.
• Emergence of Object-Selective Features in Unsupervised Feature Learning by Coates, Ng
• Scaling Learning Algorithms towards AI Benjio & LeCun
• A Theory of Feature Learning by Brendan van Rooyen, Robert C. Williamson

2. Deep Learning

• Dropout: A Simple Way to Prevent Neural Networks from Overfitting by Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever and Ruslan Salakhutdinov
• [Understanding