https://github.com/arkaung/arkaung.github.io
Ark's Log
https://github.com/arkaung/arkaung.github.io
Last synced: 4 months ago
JSON representation
Ark's Log
- Host: GitHub
- URL: https://github.com/arkaung/arkaung.github.io
- Owner: ArkAung
- License: unlicense
- Created: 2017-01-22T17:09:01.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2023-01-14T02:44:38.000Z (over 3 years ago)
- Last Synced: 2025-10-25T05:49:40.818Z (9 months ago)
- Size: 92.8 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Arkar Min Aung
## Deep Learning Engineer
* [Code](https://www.github.com/arkaung)
* [Writing](https://medium.com/@ark_aung)
* [Google Scholar](https://scholar.google.com/citations?user=KRZfXJQAAAAJ)
* Email:
## Get in touch with me if you are:
* Interested in conducting various experiments for [forward-forward algorithm](https://www.cs.toronto.edu/~hinton/FFA13.pdf).
* 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](https://arkaung.github.io/aidiscussions/)
* 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](https://www.cs.toronto.edu/~hinton/FFA13.pdf)
* [Hydra: Preserving Ensemble Diversity for Model Distillation ](https://openreview.net/forum?id=ByeaXeBFvH)
* [Subclass distillation](https://arxiv.org/pdf/2002.03936.pdf)
* [Learning Active Learning from Data](https://papers.nips.cc/paper/7010-learning-active-learning-from-data.pdf)
* [AutoML-Zero: Evolving Machine Learning Algorithms From Scratch](https://arxiv.org/pdf/2003.03384.pdf)
---
### 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](https://leetcode.com/problems/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](https://leetcode.com/discuss/topic/620137) |
| Medium | [525. Contiguous Array](https://leetcode.com/problems/contiguous-array/) | [525. Contiguous Array - [Python] HashMap solution + Thinking Process Diagram](https://leetcode.com/discuss/topic/653541) |
| Medium | [1143. Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [1143. Longest Common Subsequence - [Python] DP solution with Explanation + Thinking process + Diagram](https://leetcode.com/discuss/topic/598508) |
| Medium | [91. Decode Ways](https://leetcode.com/problems/decode-ways/) | [91. Decode Ways - [Python] Thinking process diagram (DP + DFS)](https://leetcode.com/discuss/topic/608268) |
| Medium | [1277. Count Square Submatrices with All Ones](https://leetcode.com/problems/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)](https://leetcode.com/discuss/topic/643429) |
| Medium | [221. Maximal Square](https://leetcode.com/problems/maximal-square/) | [221. Maximal Square - [Python] Thinking Process Diagrams - DP Approach](https://leetcode.com/discuss/topic/600149) |
| Medium | [986. Interval List Intersections](https://leetcode.com/problems/interval-list-intersection) | [986. Interval List Intersections - [Python] Two Pointer Approach + Thinking Process Diagrams](https://leetcode.com/discuss/topic/647482) |
| Hard | [124. Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [124. Binary Tree Maximum Path Sum - [Python] Recursion stack thinking process diagram](https://leetcode.com/discuss/topic/603423) |