Akahsizrr commited on
Commit
550c236
·
verified ·
1 Parent(s): 16c8abd

Upload alea/ngram.py with huggingface_hub

Browse files
Files changed (1) hide show
  1. alea/ngram.py +57 -0
alea/ngram.py CHANGED
@@ -77,8 +77,65 @@ class NGramEncoder(nn.Module):
77
  return self.proj(torch.cat(feats, dim=-1))
78
 
79
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
80
  def ngram_param_count(vocab_size, d_model, orders=(2, 3, 4),
81
  buckets=262144, d_ng=128):
82
  ngram = len(orders) * buckets * d_ng + len(orders) * d_ng * d_model
83
  aux = vocab_size * d_model + 1
84
  return ngram, aux
 
 
 
 
 
 
77
  return self.proj(torch.cat(feats, dim=-1))
78
 
79
 
80
+ class NGramEncoderMH(nn.Module):
81
+ """Multi-hash compositional n-gram encoder.
82
+
83
+ Improvements over NGramEncoder at fixed param budget:
84
+ - K=2 independent tables per order; a collision must hit BOTH tables
85
+ to fully collide (effective capacity >> single table of same size).
86
+ - Thin rows (d_ng=64) buy 2x table coverage vs d_ng=128.
87
+ - Bucket budgets skewed toward higher orders (heavier tails).
88
+
89
+ Table pair per order uses a quotient-remainder split of one rolling
90
+ hash: h mod B1 selects row in table1, h // B1 selects row in table2
91
+ (valid since h < B1*B2 and B1*B2*P < 2^63 for B<=2M).
92
+ """
93
+
94
+ def __init__(self, d_model, orders=(3, 4, 5, 6), b1=262144, b2=262144,
95
+ d_ng=64):
96
+ super().__init__()
97
+ self.orders = tuple(orders)
98
+ self.b1, self.b2 = b1, b2
99
+ self.mod = b1 * b2
100
+ self.embs1 = nn.ModuleList(
101
+ [nn.Embedding(b1, d_ng) for _ in self.orders])
102
+ self.embs2 = nn.ModuleList(
103
+ [nn.Embedding(b2, d_ng) for _ in self.orders])
104
+ for e in list(self.embs1) + list(self.embs2):
105
+ nn.init.normal_(e.weight, std=0.02)
106
+ self.proj = nn.Linear(len(self.orders) * d_ng, d_model)
107
+ nn.init.zeros_(self.proj.weight)
108
+ nn.init.zeros_(self.proj.bias)
109
+
110
+ def _hash(self, ids, n):
111
+ """Rolling hash mod (b1*b2) -> (idx1, idx2), each [B,L]."""
112
+ B, L = ids.shape
113
+ dev = ids.device
114
+ h = torch.zeros(B, L, dtype=torch.long, device=dev)
115
+ for k in range(n - 1, -1, -1):
116
+ shifted = torch.full_like(ids, _SENTINEL)
117
+ if k > 0:
118
+ shifted[:, k:] = ids[:, :-k]
119
+ else:
120
+ shifted = ids
121
+ h = (h * _HASH_P + shifted) % self.mod
122
+ return h % self.b1, h // self.b1
123
+
124
+ def forward(self, input_ids):
125
+ feats = []
126
+ for e1, e2, n in zip(self.embs1, self.embs2, self.orders):
127
+ i1, i2 = self._hash(input_ids, n)
128
+ feats.append(e1(i1) + e2(i2))
129
+ return self.proj(torch.cat(feats, dim=-1))
130
+
131
+
132
  def ngram_param_count(vocab_size, d_model, orders=(2, 3, 4),
133
  buckets=262144, d_ng=128):
134
  ngram = len(orders) * buckets * d_ng + len(orders) * d_ng * d_model
135
  aux = vocab_size * d_model + 1
136
  return ngram, aux
137
+
138
+
139
+ def ngram_mh_param_count(d_model, orders=(3, 4, 5, 6), b1=262144,
140
+ b2=262144, d_ng=64):
141
+ return len(orders) * ((b1 + b2) * d_ng + d_ng * d_model)