Yet another guide to deploy Plotly Dash on AWS Elastic Beanstalk

In August, I got interested in Amazon Web Service (AWS) and spent some time to get an AWS Cloud Practitioner certificate. To put into practice what I have learned during the training, why not develop a web application, I asked myself. Thus, I decided to create a Plotly Dash dashboard and deploy it on AWS. The service that I chose is AWS Elastic Beanstalk. You can find, on the Internet, several guides written by amateurs to teach you how to deploy Dash on AWS. However, there is something lacking in all these guides. Therefore, I, also an amateur, decided to write a guide myself. In the following, I will show you how to achieve this “feat” step by step. To understand this guide, it is a prerequisite to know how to develop a Dash application and what AWS Elastic Beanstalk is.

Read More

A walk-through of Hao Huang's solution to the sensitivity conjecture

Earlier this month (July, 2019), mathematician Hao Huang posted a proof of the Sensitivity Conjecture, which has troubled mathematicians for 30 years. To people’s surprise, this proof is only 2 page’s long and involves only undergraduate level math. On the Internet, you can find some reports, written for the general public, about the background story and the interpretation of the sensitivity conjecture. Also, several experts, such as Terence Tao, are elaborating on it. Here, writing for students and non-experts, I will summarize the key steps in Hao Huang’s proof, in an attempt to help them quickly grasp the essential.

Read More

Using the Nash Equilibrium to build a minimalist PvE list for Pokémon GO

Abstract. This post introduces the concept of Nash Equilibrium into Pokémon GO meta-game, with the intention to build a minimalist PvE list. The idea is to build an all-round team for gym battles or for boss raids with few Pokémon. This approach allows the players to concentrate their resources to build a small team of strong Pokémon instead of a large group of mildly strong Pokémon. To demonstrate the usage of the Nash Equilibrium, I use Timeout as the win condition for gym battles and total damage output for boss raids. The resulting minimalist lists are for reference; I provided, at the end of the post, the dataset and the code necessary for the readers to build their own minimalist lists.

Read More

Why Elo ratings are less efficient for Yugioh Duel Links than for chess?

Yugioh Duel Links is a digital collectible card game (CCG), which could be played on mobile devices. Like many other CCGs, there is an in-game Ladder system, where players compete with each other to prove themselves as the best duelist in the world. However, many players complain about the mechanism of this Ladder and suggest replacing it with the Elo system. In this post, I can show you, thanks to the cutting-edge research of DeepMind, that the Elo system, or any other systems using averaging, is unavoidably inefficient for Duel links.

Read More

Important inequalities in convex optimization, proofs and intuition

Many talk about data science and machine learning with enthusiasm, but few know about one of the most important building components behind them – convex optimization. Indeed, nowadays nearly every data science problem will first be transformed into an optimization problem and then solved by standard methods. Convex optimization, albeit basic, is the most important concept in optimization and the starting point of all understanding. If you are an aspiring data scientist, convex optimization is an unavoidable subject that you had better learn sooner than later.

Read More