说明：读书笔记（类型为 Feeling）并非原创，内容和图均来自原作，仅用于学习交流。
Growth
Collection
AI
NLP
- 胡思乱想
- 知识图谱
- 论文和模型：
- 2021 通过最优转移进行词表学习：VOLT
- 2021 SimCSE 和 R-Drop 在 TextCNN 上的实验
- 2021 R-Drop
- 2021 简单的对比学习框架：SimCSE
- 2021 高效深度学习：让模型更小、更快、更好
- 2021 预训练模型的过去、现在和未来
- 2021 Few-Shot NER and BERT Noisy Learning：ProtoBERT
- 2020 SqueezeBERT
- 2020 深度探索 Bert：BERTology
- 2020 Bert-Flow
- 2020 Funnel Transformer
- 2020 PEGASUS
- 2020 DeBERTa
- 2020 Reformer
- 2019 UniLM
- 2019 Sentence-Bert
- 2019 Bart
- 2019 DistilBERT
- 2019 ALBERT
- 2019 GPT2
- 2019 ELECTRA
- 2019 CTRL
- 2019 RoBERTa
- 2019 ERNIE
- 2019 XLNet
- 2019 Bert
- 2018 Attributes External Feature
- 2017 Transformer Code
- 2017 Transformer Paper
- 2016 Node2Vec
- 2016 NER with Bi-LSTM and CRF
- 2015 Bahdanau Attention
- 2015 Luong Attention
- 2004 TextRank Keyword Extraction
- 读书笔记：SLP
- Regular Expressions, Text Normalization, and Edit Distance Note (SLP Ch02)
- Language Model Note (SLP Ch03)
- Naive Bayes and Sentiment Classification Note (SLP Ch04)
- Logistic Regression Note (SLP Ch05)
- Vector Semantics Note (SLP Ch06)
- Neural Networks and Neural Language Models Note (SLP Ch07)
- Part-of-Speech Tagging Note (SLP Ch08)
- Sequence Processing with Recurrent Networks Note (SLP Ch09)
- Encoder-Decoder Models Attention and Contextual Embedding Note (SLP Ch10)
- Formal Grammars of English Note (SLP Ch12)
- Syntactic Parsing Note (SLP Ch13)
- Statistical Parsing Note (SLP Ch14)
- Information Extraction Note (SLP Ch18)
- 读书笔记：冯志伟《自然语言计算机形式分析的理论与方法》
RecSearchCTR
DeepLearning
MachineLearning
DataScience
- 高性能数据处理 | Yam
- List, Dict, Array, Series, DataFrame 相互转换
- Numpy 入门
- Pandas 入门
- 绘制文本分类数据
- QA 小课堂：Introduction | Yam
Math
Unix
- Ubuntu16.04 安装 VirtualBox & Vagrant 管理 VirtualBox 各种问题总结 | Yam
- AINLP GPU 使用体验指南 | Yam
- Unix Cheat Sheet | Yam
- Docker Memo | Yam
- Git Memo | Yam
Raspberrypi
Coding
- LeetCode
- Longest Substring Without Repeating Characters (LeetCode 3)
- Median of Two Sorted Arrays (LeetCode 4)
- Longest Palindromic Substring (LeetCode 5)
- Generate Parentheses (LeetCode 22) | Yam
- Swap Nodes in Paris (LeetCode 24)
- Search in Rotated Sorted Array (LeetCode 33, 81, 153)
- Find First and Last Position of Element in Sorted Array (LeetCode 34)
- 剑指 Offer2（Python 版）解析