Variation calculus is a great lens through which to look at many physics and CS problems. It is IMO under-taught and under-utilized, especially in the machine learning discipline. The framework is basically minimization in functional space (as opposed to R^n or a subset thereof, the more common case). The (to me) surprising thing is that finding an extremum in functional space (i.e. infinite-dimensional space) can be…
I studied computer vision in grad school when these were some of the state of the art methods, like the Mumford-Shah segmentation model and various inpainting models that set up the problem basically as a calculus of variations problem over the appropriate Sobolev space of image intensity functions and/or discontinuity-permitting boundary functions. I’ve worked as a practitioner in computer vision as well and I think…
I really don't see why these two things need be pitted against each others.
What you're describing (Euler-lagrange applied to computer vision problems) is a direct application of the calculus of variation to the image itself.
It's rather naive because it uses an extremely weak representation of the content of the image (i.e. a bunch of pixels which essentially means working with a piecewise-constant basis of the functional space), and as you noted, it is easily beaten by modern techniques.
However: Deep neural nets are nothing but another, much more powerful "basis" of functional space (I put "basis" in quote because they're not linear. OTOH, they're generative).
A deep net is a finite set of real numbers that maps to a point in functional space, and any arbitrary continuous maps from R^n to R^p can be approximated by deep nets given enough weights and neurons.
So, if deep nets are dense in functional space, and "training" a deep net is nothing but solving a minimization problem in functional space, then I don't see why the "calculus of variation" ==> "PDE" via Euler-Lagrange route can't bee applied to training deep nets instead of backprop-based minimizers.
Now, if you're claiming that backprop works better than solving the PDE induced by Euler-Lagrange on the functional minimization problem of training a deep-net, I'm very happy to believe you, but I've yet to see literature demonstrating this.