Python

[已解決][PyTorch] 編譯（compile）後模型權重多出 “_orig_mod” 的前綴問題

Clay
2023-12-032023-12-04
Machine Learning, Python, PyTorch

問題描述

在 2023 年初，PyTorch 的 2.0 版本新增了一個 torch.compile() 的新功能，讓我們能夠在模型訓練/推理時能夠進一步提昇速度。與混合精度訓練的協同工作，經常能使我的訓練速度提昇一倍左右。

[已解決] RuntimeError: OrderedDict mutated during iteration – OrderedDict 不能在迭代時發生變化

Clay
2023-12-022023-12-02
Python

問題描述

今天我在讀取已經被 torch.compile() 之後儲存起來的模型權重，發現模型權重是使用 OrderedDict 資料結構儲存著，而這種結構本身是有序序列，換言之它的資料內容是需要嚴格遵守排序的。

Neo4j 圖形資料庫（Graph Database）安裝與透過 Python 調用

Clay
2023-11-272023-11-27
Database

介紹

Neo4j 是一個圖形資料庫（Graph Database），跟一般傳統的資料庫相比，圖形資料庫的重點是『圖』，也就是節點（實體/Entity）之間的關係與連接。每個節點可以代表一個對象（如人、事物、地點…），而邊則表示節點之間的關係（如朋友、擁有、位於…）

LeetCode: 1561-Maximum Number of Coins You Can Get 解題紀錄

Clay
2023-11-242023-11-24
C++, LeetCode, Python

題目

There are 3n piles of coins of varying size, you and your friends will take piles of coins as follows:

LeetCode: 2391-Minimum Amount of Time to Collect Garbage 解題紀錄

Clay
2023-11-202023-11-20
C++, LeetCode, Python

題目

You are given a 0-indexed array of strings garbage where garbage[i] represents the assortment of garbage at the i^th house. garbage[i] consists only of the characters 'M', 'P' and 'G' representing one unit of metal, paper and glass garbage respectively. Picking up one unit of any type of garbage takes 1 minute.

LeetCode: 2849-Determine if a Cell Is Reachable at a Given Time 解題紀錄

Clay
2023-11-082023-11-08
C++, LeetCode, Python

題目

You are given four integers sx, sy, fx, fy, and a non-negative integer t.

In an infinite 2D grid, you start at the cell (sx, sy). Each second, you must move to any of its adjacent cells.

LeetCode: 1921-Eliminate Maximum Number of Monsters 解題紀錄

Clay
2023-11-072023-11-07
C++, LeetCode, Python

題目

You are playing a video game where you are defending your city from a group of n monsters. You are given a 0-indexed integer array dist of size n, where dist[i] is the initial distance in kilometers of the ith monster from the city.