Skip to content

Instantly share code, notes, and snippets.

Gustav Larsson gustavla

Block or report user

Report or block gustavla

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
View numpy-format-proposal-v1.md
View mnist.py
from __future__ import division, print_function, absolute_import
import os
import struct
from array import array
import numpy as np
def load_mnist(section="training", offset=0, count=None, ret='xy',
x_dtype=np.float64, y_dtype=np.int64, path=None):
"""
View MNIST loader
from __future__ import division, print_function, absolute_import
import os
import struct
from array import array
import numpy as np
def load_mnist(section="training", offset=0, count=None, ret='xy',
x_dtype=np.float64, y_dtype=np.int64, path=None):
"""
View gist:9499068
# Author: Nelle Varoquaux, Andrew Tulloch
# Uses the pool adjacent violators algorithm (PAVA), with the
# enhancement of searching for the longest decreasing subsequence to
# pool at each step.
import numpy as np
cimport numpy as np
cimport cython
You can’t perform that action at this time.