FC2T2: The Fast Continuous Convolutional Taylor Transform with Applications in Vision and Graphics. Lange, H. & Kutz, J. N. arXiv:2111.00110 [cs], October, 2021. arXiv: 2111.00110![FC2T2: The Fast Continuous Convolutional Taylor Transform with Applications in Vision and Graphics [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Series expansions have been a cornerstone of applied mathematics and engineering for centuries. In this paper, we revisit the Taylor series expansion from a modern Machine Learning perspective. Specifically, we introduce the Fast Continuous Convolutional Taylor Transform (FC2T2), a variant of the Fast Multipole Method (FMM), that allows for the efficient approximation of low dimensional convolutional operators in continuous space. We build upon the FMM which is an approximate algorithm that reduces the computational complexity of N-body problems from O(NM) to O(N+M) and finds application in e.g. particle simulations. As an intermediary step, the FMM produces a series expansion for every cell on a grid and we introduce algorithms that act directly upon this representation. These algorithms analytically but approximately compute the quantities required for the forward and backward pass of the backpropagation algorithm and can therefore be employed as (implicit) layers in Neural Networks. Specifically, we introduce a root-implicit layer that outputs surface normals and object distances as well as an integral-implicit layer that outputs a rendering of a radiance field given a 3D pose. In the context of Machine Learning, $N$ and $M$ can be understood as the number of model parameters and model evaluations respectively which entails that, for applications that require repeated function evaluations which are prevalent in Computer Vision and Graphics, unlike regular Neural Networks, the techniques introduce in this paper scale gracefully with parameters. For some applications, this results in a 200x reduction in FLOPs compared to state-of-the-art approaches at a reasonable or non-existent loss in accuracy.
@article{lange_fc2t2_2021,
title = {{FC2T2}: {The} {Fast} {Continuous} {Convolutional} {Taylor} {Transform} with {Applications} in {Vision} and {Graphics}},
shorttitle = {{FC2T2}},
url = {http://arxiv.org/abs/2111.00110},
abstract = {Series expansions have been a cornerstone of applied mathematics and engineering for centuries. In this paper, we revisit the Taylor series expansion from a modern Machine Learning perspective. Specifically, we introduce the Fast Continuous Convolutional Taylor Transform (FC2T2), a variant of the Fast Multipole Method (FMM), that allows for the efficient approximation of low dimensional convolutional operators in continuous space. We build upon the FMM which is an approximate algorithm that reduces the computational complexity of N-body problems from O(NM) to O(N+M) and finds application in e.g. particle simulations. As an intermediary step, the FMM produces a series expansion for every cell on a grid and we introduce algorithms that act directly upon this representation. These algorithms analytically but approximately compute the quantities required for the forward and backward pass of the backpropagation algorithm and can therefore be employed as (implicit) layers in Neural Networks. Specifically, we introduce a root-implicit layer that outputs surface normals and object distances as well as an integral-implicit layer that outputs a rendering of a radiance field given a 3D pose. In the context of Machine Learning, \$N\$ and \$M\$ can be understood as the number of model parameters and model evaluations respectively which entails that, for applications that require repeated function evaluations which are prevalent in Computer Vision and Graphics, unlike regular Neural Networks, the techniques introduce in this paper scale gracefully with parameters. For some applications, this results in a 200x reduction in FLOPs compared to state-of-the-art approaches at a reasonable or non-existent loss in accuracy.},
urldate = {2021-11-07},
journal = {arXiv:2111.00110 [cs]},
author = {Lange, Henning and Kutz, J. Nathan},
month = oct,
year = {2021},
note = {arXiv: 2111.00110},
keywords = {artificial intelligence, computer vision and pattern recognition, machine learning, uses sympy},
}
Downloads: 0
{"_id":"Xekq8TdyEKAFD2tfN","bibbaseid":"lange-kutz-fc2t2thefastcontinuousconvolutionaltaylortransformwithapplicationsinvisionandgraphics-2021","author_short":["Lange, H.","Kutz, J. N."],"bibdata":{"bibtype":"article","type":"article","title":"FC2T2: The Fast Continuous Convolutional Taylor Transform with Applications in Vision and Graphics","shorttitle":"FC2T2","url":"http://arxiv.org/abs/2111.00110","abstract":"Series expansions have been a cornerstone of applied mathematics and engineering for centuries. In this paper, we revisit the Taylor series expansion from a modern Machine Learning perspective. Specifically, we introduce the Fast Continuous Convolutional Taylor Transform (FC2T2), a variant of the Fast Multipole Method (FMM), that allows for the efficient approximation of low dimensional convolutional operators in continuous space. We build upon the FMM which is an approximate algorithm that reduces the computational complexity of N-body problems from O(NM) to O(N+M) and finds application in e.g. particle simulations. As an intermediary step, the FMM produces a series expansion for every cell on a grid and we introduce algorithms that act directly upon this representation. These algorithms analytically but approximately compute the quantities required for the forward and backward pass of the backpropagation algorithm and can therefore be employed as (implicit) layers in Neural Networks. Specifically, we introduce a root-implicit layer that outputs surface normals and object distances as well as an integral-implicit layer that outputs a rendering of a radiance field given a 3D pose. In the context of Machine Learning, $N$ and $M$ can be understood as the number of model parameters and model evaluations respectively which entails that, for applications that require repeated function evaluations which are prevalent in Computer Vision and Graphics, unlike regular Neural Networks, the techniques introduce in this paper scale gracefully with parameters. For some applications, this results in a 200x reduction in FLOPs compared to state-of-the-art approaches at a reasonable or non-existent loss in accuracy.","urldate":"2021-11-07","journal":"arXiv:2111.00110 [cs]","author":[{"propositions":[],"lastnames":["Lange"],"firstnames":["Henning"],"suffixes":[]},{"propositions":[],"lastnames":["Kutz"],"firstnames":["J.","Nathan"],"suffixes":[]}],"month":"October","year":"2021","note":"arXiv: 2111.00110","keywords":"artificial intelligence, computer vision and pattern recognition, machine learning, uses sympy","bibtex":"@article{lange_fc2t2_2021,\n\ttitle = {{FC2T2}: {The} {Fast} {Continuous} {Convolutional} {Taylor} {Transform} with {Applications} in {Vision} and {Graphics}},\n\tshorttitle = {{FC2T2}},\n\turl = {http://arxiv.org/abs/2111.00110},\n\tabstract = {Series expansions have been a cornerstone of applied mathematics and engineering for centuries. In this paper, we revisit the Taylor series expansion from a modern Machine Learning perspective. Specifically, we introduce the Fast Continuous Convolutional Taylor Transform (FC2T2), a variant of the Fast Multipole Method (FMM), that allows for the efficient approximation of low dimensional convolutional operators in continuous space. We build upon the FMM which is an approximate algorithm that reduces the computational complexity of N-body problems from O(NM) to O(N+M) and finds application in e.g. particle simulations. As an intermediary step, the FMM produces a series expansion for every cell on a grid and we introduce algorithms that act directly upon this representation. These algorithms analytically but approximately compute the quantities required for the forward and backward pass of the backpropagation algorithm and can therefore be employed as (implicit) layers in Neural Networks. Specifically, we introduce a root-implicit layer that outputs surface normals and object distances as well as an integral-implicit layer that outputs a rendering of a radiance field given a 3D pose. In the context of Machine Learning, \\$N\\$ and \\$M\\$ can be understood as the number of model parameters and model evaluations respectively which entails that, for applications that require repeated function evaluations which are prevalent in Computer Vision and Graphics, unlike regular Neural Networks, the techniques introduce in this paper scale gracefully with parameters. For some applications, this results in a 200x reduction in FLOPs compared to state-of-the-art approaches at a reasonable or non-existent loss in accuracy.},\n\turldate = {2021-11-07},\n\tjournal = {arXiv:2111.00110 [cs]},\n\tauthor = {Lange, Henning and Kutz, J. Nathan},\n\tmonth = oct,\n\tyear = {2021},\n\tnote = {arXiv: 2111.00110},\n\tkeywords = {artificial intelligence, computer vision and pattern recognition, machine learning, uses sympy},\n}\n\n","author_short":["Lange, H.","Kutz, J. N."],"key":"lange_fc2t2_2021","id":"lange_fc2t2_2021","bibbaseid":"lange-kutz-fc2t2thefastcontinuousconvolutionaltaylortransformwithapplicationsinvisionandgraphics-2021","role":"author","urls":{"Paper":"http://arxiv.org/abs/2111.00110"},"keyword":["artificial intelligence","computer vision and pattern recognition","machine learning","uses sympy"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/zotero-group/nicoguaro/525293","dataSources":["YtBDXPDiQEyhyEDZC","fhHfrQgj3AaGp7e9E","qzbMjEJf5d9Lk78vE","45tA9RFoXA9XeH4MM","MeSgs2KDKZo3bEbxH","nSXCrcahhCNfzvXEY","ecatNAsyr4f2iQyGq","tpWeaaCgFjPTYCjg3"],"keywords":["artificial intelligence","computer vision and pattern recognition","machine learning","uses sympy"],"search_terms":["fc2t2","fast","continuous","convolutional","taylor","transform","applications","vision","graphics","lange","kutz"],"title":"FC2T2: The Fast Continuous Convolutional Taylor Transform with Applications in Vision and Graphics","year":2021}