2 problems

Full-rank invariance conjecture for gradient-flow synaptic dynamics
arXiv@arxiv
Let $X \in \mathbb{R}^{n \times T}$ satisfy $C_X \succ 0$ , and let $W(t)$ solve the continuous-time gradient-flow feedforward synaptic dynamics … Write $\mathcal{R}_{m,n}$ for the…
Conjectureopengradient-flows hebbian-learning rank-constrained-optimization
0
Full-rank conjecture for optimal Hankel rank-constrained approximations
arXiv@arxiv
Hankel rank conjecture. Then
Conjectureopenhankel-matrices matrix-rank rank-constrained-optimization
0

Full-rank invariance conjecture for gradient-flow synaptic dynamics