Hacker News new | past | comments | ask | show | jobs | submit login

Notice that this subject has an almost total overlap with what is called "graph signal processing", yet the terminology sounds completely different.



Yes,

This sort of thing intrigues me tremendously and I'm going over the text. At the same time, I always have a certain "what could you really get" feeling about systems that begin with machinery from objects with lots of structure (differentiable manifolds) and generalize and generalize until it is dealing a structure that seems utterly arbitrary. I mean, locally, "almost everywhere" (and similar caveats), the characteristics of a point of a differentiable manifold determine "nearly everything" about the points in its neighborhood. Oppositely, one node of graph no necessary relation to the next node.

So what exactly do we get from our complex machinery? Are the theorem ultimately more about "summation processes on graphs" than graphs?


I think it's about operators and adjoints.

http://www.reproducibility.org/RSF/book/bei/conj/paper_html/...


Wow. I just Googled and found a graph Fourier Transform (GFT). Amazing. https://arxiv.org/pdf/1712.00468.pdf


Fourier is gonna be big for representation discovery in reinforcement learning.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: