Machine Learning Engineer

At HyperScience we bring AI to the office. Our software takes over menial work that people are doing today and frees them to focus on more complex tasks. We believe that AI is destined to be the biggest event in the history of human labor since the Industrial Revolution, and we want to be a part of it.

Our mission is to build a general purpose AI platform that lets other developers easily build machine learning applications. We believe AI is destined to be the biggest event in the history of human labor since the industrial revolution. There are already many applications, ranging from self-driving cars to medical software that diagnoses patients, where AI gets the job done faster, better and cheaper. However, HyperScience will make that kind of AI available to everyone. Working at HyperScience, you will advance the state of the art by developing novel machine learning approaches, you will build self-configuring, self-healing, self-tuning distributed systems and you will deliver developer-centric tools you’d love using yourself. Additionally, you’ll see your code matter by working directly with customers. Despite still being in stealth, we have paying customers who are already using HyperScience in production. The team consists exclusively of engineers who have experience working on machine learning and internet-scale apps. We’re backed by top tier investors.

- Given a set of machine generated log entries, write a program that reliably infers the “fields”. For inspiration, look at logs in /var/log/. - You are given a dataset containing badge swipe data for a large company. Each data point consists of:- employee ID- building name- floor- timestamp. It was recently discovered that an attacker gained unauthorized access using a cloned badge. How will you find whose badge was cloned? - There is a set S containing n colors of marbles. There are a different number of marbles of each color. For example, there could be R red marbles, G green marbles, B blue marbles and so on. R, G and B could all be different. There is a process P that draws 3 marbles. The only guarantee is that P will always draw 3 marbles of 3 distinct colors. What is the probability of observing a given subset? - Given an undirected graph G = (V,E), and an integer k, the cycle-elimination problem is to decide if all the cycles of the graph can be eliminated by deleting at most k edges from the graph. Either show that the problem is NP-complete, or describe a polynomial-time algorithm for it.

Candidates should have a strong desire to work in an unstructured, fast moving startup environment. We want people to join our team who are generally excited about the problems we're solving and who want to join a growing team with responsibilities that have real potential to expand quickly and dramatically over time.