TildAlice – Tech Blog for Developers
Python, AI, Deep Learning, Data Analysis, Computer Vision, Reinforcement Learning โ tips and tutorials
Latest Posts
-
Why I Switched from Ledger to Open Source Hardware Wallets
Ledger's closed firmware and Recover controversy made me rethink security. Here's why open source hardware wallets like OneKey matter for self-custody.
-
LoRA vs Adapter vs Prefix Tuning: PEFT Memory Comparison
Compare LoRA, Adapter, and Prefix Tuning memory usage in this PEFT benchmark. Discover which method delivers the best efficiency trade-offs.
-
Sorting Algorithm Speed: 100 to 10K Elements Benchmark
At 1000 elements, Python's sorted() beats hand-written quicksort by 47x. Real benchmark data for interview-size arrays with the numbers behind why.
-
Python Type Hints: runtime vs typing-only Annotations
Most Python type hints do nothing at runtime. See which annotations actually validate, real performance numbers, and the isinstance() trap with generics.
-
Gymnasium Custom Env Step() Returns Invalid Shape: 5 Fixes
Fix Gymnasium custom env step() shape errors with 5 proven solutions. Learn proper observation space handling and avoid common pitfalls.
-
Pydantic 40x Validation Overhead: When Type Hints Break Performance
Pydantic validation adds 40x overhead to Python type checking. Discover when Pydantic hurts performance and how to optimize validation for speed.
-
YOLO vs Detectron2 vs MMDetection: Training Speed Test
Trained 5-class detection on 3 frameworksโYOLO took 2.1h, MMDet Faster R-CNN 4.9h. One gave 40% better box precision. Real training times, mAP, VRAM costs.
-
Quick Sort vs Merge Sort vs Heap Sort: Python Speed Test
Quick Sort beats Merge Sort by 40% on random arrays โ but only with random pivots. Heap Sort is 2x slower despite identical O(n log n) complexity.