https://chen-gz.github.io//GGEtaWelcome to my blog. 2024-09-03T01:34:33+00:00 Guangzong Chen https://chen-gz.github.io// Jekyll © 2024 Guangzong Chen /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png Transformer2024-09-02T00:00:00+00:00 2024-09-02T00:00:00+00:00 https://chen-gz.github.io//posts/transformer/ Guangzong Chen Introduction to the Transformer Model Welcome to the second post in our NLP series! If you haven’t read the previous post yet, you can find it here. In this post, we will delve into the fascinating world of the Transformer model. The original paper on the Transformer model can be found here. It was published by Vaswani et al. in 2017 and is titled “Attention Is All You Need”. This paper introd... Nature Language Processing2024-08-31T00:00:00+00:00 2024-08-31T00:00:00+00:00 https://chen-gz.github.io//posts/nlp/ Guangzong Chen In this series of posts related to NLP, we will begin by discussing several foundational concepts and basic methodologies used to address the problem. Subsequently, we will cover the latest methods, such as GPTs. I presume the audience is familiar with the fundamental concepts of neural networks and multi-layer perceptrons (MLP). Word Embedding Computer-based methods operate on numerical dat... Linux font2024-07-20T00:00:00+00:00 2024-07-20T00:00:00+00:00 https://chen-gz.github.io//posts/linux-font/ Guangzong Chen Here is the rewritten text in markdown format: Linux Fonts: Solving Display Issues After installing Arch Linux, you may encounter issues with font rendering while using a web browser. Unfortunately, online search results from ChatGPT and Google might not provide an immediate solution. Fortunately, installing the following fonts can generally resolve this problem: ttf-font-awesome: Provid... Codeforce Round 9262024-02-20T00:00:00+00:00 2024-05-18T04:31:31+00:00 https://chen-gz.github.io//posts/codeforces-round-926/ Guangzong Chen Porblem D Sasha and a Walk in the City The statement of this problem is not clear. Problem statement from the comment in tutorial page. Given a tree, you need to color each node in black or white. How many colorings exist such that the path between any two vertices contains atmost 2 black vertices. Define the state of dynamic programming as the tutorial. Let $dp_v$ be the number of no... Binary indexed tree2023-10-04T00:00:00+00:00 2023-10-04T00:00:00+00:00 https://chen-gz.github.io//posts/binary-indexed-tree/ Guangzong Chen Background A Fenwick tree or binary indexed tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.[^1] Space and Time Complexity \[\begin{array}{lll} \text { Algorithm } & \text { Average } & \text { Worst case } \\ \text { Space } & \mathrm{O}(n) & \mathrm{O}(n) \\ \text { Search } & \mathrm{O}(\log n) & \mathrm...