arkaung.github.io

Arkar Min Aung

Deep Learning Engineer

• Code
• Writing
• Google Scholar
• Email: aaung@pm.me

Get in touch with me if you are:

• Interested in conducting various experiments for forward-forward algorithm.
  • I am exploring using different overlaying paradigms for positive and negative data when training with FFA.
  • I am exploring hybrid apporaches where we train parts of the network with FFA and other parts with back propagation.
• Interested in self-driving cars, measuring uncertainty in deep neural networks, active learning and knowledge distillation.

I organize

• AI Discussions
• Independent research group working on a novel active learning technique using knowledge distillation. For more info on this, please send me an email.

Papers I recently read

• The Forward-Forward Algorithm: Some Preliminary Investigations
• Hydra: Preserving Ensemble Diversity for Model Distillation
• Subclass distillation
• Learning Active Learning from Data
• AutoML-Zero: Evolving Machine Learning Algorithms From Scratch

---

If you are coming here from LeetCode and want to see my posts there:

Difficulty	Question	Solution With Diagram
Easy	1232. Check If It Is a Straight Line	1232. Check If It Is a Straight Line - [Python] O(1) space O(n) Runtime - using slope formula
Medium	525. Contiguous Array	525. Contiguous Array - [Python] HashMap solution + Thinking Process Diagram
Medium	1143. Longest Common Subsequence	1143. Longest Common Subsequence - [Python] DP solution with Explanation + Thinking process + Diagram
Medium	91. Decode Ways	91. Decode Ways - [Python] Thinking process diagram (DP + DFS)
Medium	1277. Count Square Submatrices with All Ones	1277. Count Square Submatrices with All Ones - [Python] DP Solution + Thinking Process Diagrams (O(mn) runtime; O(1) space)
Medium	221. Maximal Square	221. Maximal Square - [Python] Thinking Process Diagrams - DP Approach
Medium	986. Interval List Intersections	986. Interval List Intersections - [Python] Two Pointer Approach + Thinking Process Diagrams
Hard	124. Binary Tree Maximum Path Sum	124. Binary Tree Maximum Path Sum - [Python] Recursion stack thinking process diagram

This site is open source. Improve this page.