Simple Transformers (1) – 基本介紹
介紹 Simple Transformers
Simple Transformers 是一個 Python 的 NLP 套件/框架，旨在減少使用 Transformer 模型時的複雜步驟。能夠讓使用者透過短短幾行的程式碼，快速實現一個 NLP 任務的深度學習模型訓練環境。
Read More »Simple Transformers (1) – 基本介紹Clay
[已解決] CommandNotFoundError: Your shell has not been properly configured to use ‘conda activate’. To initialize your shell, run…
問題描述
今天在我使用 Anaconda 啟用 Python 的環境時，我得到了以下錯誤訊息，導致無法進入虛擬環境。
Read More »[已解決] CommandNotFoundError: Your shell has not been properly configured to use ‘conda activate’. To initialize your shell, run…
[已解決] huggingface/tokenizers: The current process just got forked. after parallelism has already been used. Disabling parallelism to avoid deadlocks
問題描述
今天當我透過 simpletransformers 套件訓練模型時，我得到了一個我之前沒碰過的警告訊息：
Read More »[已解決] huggingface/tokenizers: The current process just got forked. after parallelism has already been used. Disabling parallelism to avoid deadlocks
LeetCode: 581-Shortest Unsorted Continuous Subarray 解題紀錄
題目
Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.
LeetCode: 905-Sort Array By Parity 解題紀錄
題目
Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers.
LeetCode: 844-Backspace String Compare 解題紀錄
題目
Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character.
[已解決] NVIDIA-SMI has failed because it couldn’t communicate with the NVIDIA driver. Make sure that the latest NVIDIA driver is installed and running.
問題描述
最近當我重新配置工作用環境的 Nvidia GPU 驅動程式時，當我安裝過後重新開機，我卻無法透過 nvidia-smi 指令去取得 GPU 的資訊。唯一得到的訊息是：
[Machine Learning] T5 預訓練模型學習筆記
基本介紹
T5 ，全名是 Transfer Learning with a Unified Text-to-Text Transformer，在 2019 年底提出、隔年 2020 年則在 GLUE 上成為榜首，成功擠下了自家的 ALBERT。
Read More »[Machine Learning] T5 預訓練模型學習筆記[Linux] 使用 xfce 終端機來顯示終端機背景圖片
不知道大家是否常常會調整自己的終端機（terminal），好讓終端機看起來更美觀呢？
Read More »[Linux] 使用 xfce 終端機來顯示終端機背景圖片LeetCode: 230-Kth Smallest Element in a BST 解題紀錄
題目
Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree.