activatedgeek / activatedgeek/tight-pac-bayes
Infinite recursion when using transpose
- Vorherrschende Sprache
- Jupyter Notebook
- Sterne
- 18
- Forks
- 6
- PR-Merge-Kennzahlen
- Keine gemergten PRs in 30 T.
Beschreibung
Hello! If I do Projector.T @ W it goes into an infinite loop. The code seems to be off. Any ideas?
File "/skunk-pod-storage-brg-40mit-2eedu-pvc/smi_compression/pactl/linear_operator_base.py", line 196, in matvec
y = self._matvec(x)
File "/skunk-pod-storage-brg-40mit-2eedu-pvc/smi_compression/pactl/linear_operator_base.py", line 513, in _matvec
return (self.A._rmatvec((x)))
File "/skunk-pod-storage-brg-40mit-2eedu-pvc/smi_compression/pactl/linear_operator_base.py", line 247, in _rmatvec
return self.T.matvec(x)
File "/skunk-pod-storage-brg-40mit-2eedu-pvc/smi_compression/pactl/linear_operator_base.py", line 196, in matvec
y = self._matvec(x)
Beitragsleitfaden
Für dieses Repository ist kein Beitragsleitfaden indexiert
Rechercherichtung
Inspect `smi_compression/pactl/linear_operator_base.py` at the traceback sites (around lines 196, 247, and 513), focusing on `matvec`, `_matvec`, `_rmatvec`, and how `self.T` is resolved. Reproduce with the same operation pattern (`Projector.T @ W`) to confirm the recursive call chain. Then run whatever tests or checks in the project cover `pactl` linear-operator behavior and mark it done when the transpose call returns normally without looping or stack overflow.
Vom Indexierungsmodell aus dem Issue-Text verfasst.
Bewertung
- Tech-Stack
- python
- Bereich
- machine-learning
- Issue-Typ
- Bug
- Schwierigkeit
- 2/5
- Geschätzter Aufwand
- 1-3 Stunden
- Aktivitätsstatus
- Veraltet
- Klarheit
- Größtenteils klar
- Anfängerfreundlichkeit
- 44/100