Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

78157235313 · Jun 202019922001200920172026
48 results for manifold convolutions

Coordinate-independent convolutions on manifolds avoid reference frame ambiguity.

problem Applying convolutions on non-Euclidean manifolds without reference frame ambiguity.
method Developed coordinate-independent and gauge-equivariant convolutions on Riemannian manifolds.
result Coordinate-independent convolutions are equivariant under local gauge transformations.

Convolution Neural Network (CNN) has gained tremendous success in computer vision tasks with its outstanding ability to capture the local latent features. Recently, there has been an increasing interest in extending convolution operations to the non-Euclidean geometry. Although various types of convolution operations h…

2017-10-31abs ↗pdf ↗

We introduce the new notion of convolution of a (smooth or generalized) valuation on a group GG and a valuation on a manifold MM acted upon by the group. In the case of a transitive group action, we prove that the spaces of smooth and generalized valuations on MM are modules over the algebra of compactly supported g…

2015-07-17abs ↗pdf ↗

We introduce two constructions in geometric deep learning for 1) transporting orientation-dependent convolutional filters over a manifold in a continuous way and thereby defining a convolution operator that naturally incorporates the rotational effect of holonomy; and 2) allowing efficient evaluation of manifold convol…

2019-09-13abs ↗pdf ↗

Study shows consistency of shallow GCNNs on sampled point clouds under manifold assumption.

problem Consistency of shallow GCNNs on sampled point clouds under manifold assumption.
method Functional analysis perspective, weakly compact product of unit balls, Sobolev regularity, frequency cutoff.
result Proves ΓΓ-convergence of regularized empirical risk minimization functionals and convergence of their global minimizers.

Unified theory for adaptive image convolutions using metric perspectives.

problem Fixed kernels in convolutions limit adaptability in image processing.
method Metric perspective on images as 2D manifolds with local distances, proposing metric convolutions.
result Metric convolutions provide better generalisation and competitive performance.

Study dynamics of LpL^p-multipliers on harmonic manifolds with exponential volume growth.

problem Characterize the behavior of LpL^p-multipliers on harmonic manifolds of purely exponential volume growth.
method Analyzing the dynamics of LpL^p-multipliers on non-compact harmonic manifolds, using Fourier transformation and properties of radial functions.
result Show that LpL^p-multipliers acting nicely on smooth functions with compact support for p2p\leq 2 cannot be chaotic.

The paper introduces a new loss function to prevent overfitting in semi-supervised graph networks.

problem Overfitting in semi-supervised graph networks trained with cross-entropy loss.
method Proposes an unsupervised manifold smoothness loss to regularize the graph convolutional networks.
result Adding the proposed loss consistently improves performance of graph networks.

The paper extends Laplacian spectra approximations to vector bundles.

problem Approximating the spectrum of the connection Laplacian.
method Extending the graph connection Laplacian to vector bundles and proving spectrum approximation.
result The spectrum of the extended operator approximates the spectrum of the connection Laplacian.

ConvResNets approximate Besov functions and classify on low-dimensional manifolds.

problem Lack of statistical theories for deep learning on high-dimensional data.
method Exploits low-dimensional geometric structures of real-world data sets using ConvResNets.
result ConvResNets can approximate Besov functions and learn classifiers with optimal excess risk.

The Euclidean scattering transform was introduced nearly a decade ago to improve the mathematical understanding of convolutional neural networks. Inspired by recent interest in geometric deep learning, which aims to generalize convolutional neural networks to manifold and graph-structured domains, we define a geometric…

2019-05-24abs ↗pdf ↗

LNPE enhances local connections in embeddings using extended neighbor propagation.

problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.

Deep, wide ConvResNets can approximate functions and their smoothness.

problem Function approximation and smoothness in deep networks.
method Analyzing ConvResNets, proving their ability to approximate functions and their smoothness.
result Large ConvResNets can approximate functions and exhibit sufficient first-order smoothness.

This paper presents a novel framework for generating texture mosaics with convolutional neural networks. Our method is called GANosaic and performs optimization in the latent noise space of a generative texture model, which allows the transformation of a content image into a mosaic exhibiting the visual properties of t…

2017-12-01abs ↗pdf ↗

Paper proposes S2S^2ConvSCN for robust subspace clustering and classification.

problem Insufficient handling of nonlinear manifolds, data corruptions, and out-of-sample data.
method Self-supervised convolutional subspace clustering network (S2S^2ConvSCN) with FC layer, CIM for robustness, and BD regularization.
result Robust S2S^2ConvSCN outperforms baseline on unseen data.

The principle of equivariance to symmetry transformations enables a theoretically grounded approach to neural network architecture design. Equivariant networks have shown excellent performance and data efficiency on vision and medical imaging problems that exhibit symmetries. Here we show how this principle can be exte…

2019-02-11abs ↗pdf ↗

Enhanced autoencoders improve ROMs for PDEs by capturing essential properties.

problem Autoencoders struggle to capture essential properties for accurate ROMs.
method Introduced symmetric Convolutional AutoEncoders (CAEs) that preserve manifold properties.
result Symmetric CAEs yield more accurate latent trajectories and robust models.

New method solves PDEs on spheres using physics-informed convolutional neural networks.

problem Solving PDEs on surfaces, especially spheres, with high accuracy and efficiency.
method Physics-informed convolutional neural networks (PICNN) with theoretical analysis and approximation results.
result Established fast convergence rates for PICNN solving PDEs on spheres.

Motivated by the study of Hörmander's sums-of-squares operators and their generalizations, we define the convolution algebra of transverse distributions associated to a singular foliation. We prove that this algebra is represented as continuous linear operators on the spaces of smooth functions and generalized function…

2019-10-07abs ↗pdf ↗

DeepCAM learns convolutional dictionaries for image processing.

problem Processing high-dimensional signals like images efficiently.
method Introduces a Deep Convolutional Analysis Dictionary Model (DeepCAM) using convolutional dictionaries.
result DeepCAM achieves performance comparable to other methods on single image super-resolution.

This work introduces a method for almost equivariance in neural networks using Lie algebra convolutions.

problem Real-world data often does not conform to strict group equivariances, leading to underperformance in models.
method Definition and practical implementation of almost equivariance through Lie algebra convolutions.
result Demonstrated the validity of the approach through benchmarking against fully equivariant settings.

Spectral graph convolutional neural networks (CNNs) require approximation to the convolution to alleviate the computational complexity, resulting in performance loss. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network defined in the vertex domain. We provi…

2017-10-28abs ↗pdf ↗

Generative flows are attractive because they admit exact likelihood optimization and efficient image synthesis. Recently, Kingma & Dhariwal (2018) demonstrated with Glow that generative flows are capable of generating high quality images. We generalize the 1 x 1 convolutions proposed in Glow to invertible d x d convolu…

2019-01-30abs ↗pdf ↗

VC dimensions of group CNNs are infinite for certain kernels and groups.

problem Estimating the generalization capacity of group convolutional neural networks.
method Identifying precise VC dimension estimates for simple sets of group CNNs.
result Two-parameter families of convolutional neural networks have an infinite VC dimension for infinite groups and certain kernels.

We introduce a guide to help deep learning practitioners understand and manipulate convolutional neural network architectures. The guide clarifies the relationship between various properties (input shape, kernel shape, zero padding, strides and output shape) of convolutional, pooling and transposed convolutional layers…

2016-03-23abs ↗pdf ↗

In a graph convolutional network, we assume that the graph GG is generated wrt some observation noise. During learning, we make small random perturbations ΔGΔG of the graph and try to improve generalization. Based on quantum information geometry, ΔGΔG can be characterized by the eigendecomposition of the graph Laplaci…

2019-03-11abs ↗pdf ↗

Enhances group convolutional networks with attention to learn meaningful relationships.

problem Lack of explicit means to learn meaningful relationships among symmetry patterns.
method Introduces attentive group equivariant convolutions, applying attention during convolution.
result Consistently outperforms conventional group convolutional networks on benchmark datasets.

We introduce Group equivariant Convolutional Neural Networks (G-CNNs), a natural generalization of convolutional neural networks that reduces sample complexity by exploiting symmetries. G-CNNs use G-convolutions, a new type of layer that enjoys a substantially higher degree of weight sharing than regular convolution la…

2016-02-24abs ↗pdf ↗

In recent times, the use of separable convolutions in deep convolutional neural network architectures has been explored. Several researchers, most notably (Chollet, 2016) and (Ghosh, 2017) have used separable convolutions in their deep architectures and have demonstrated state of the art or close to state of the art pe…

2017-01-16abs ↗pdf ↗

Proves DCNNs with expansive convolution are strongly universally consistent.

problem Theoretical consistency of deep convolutional neural networks (DCNNs).
method Empirical risk minimization on DCNNs with expansive convolution (with zero-padding).
result DCNNs with expansive convolution are strongly universally consistent.

Functor connects Lie groupoid algebras to bornological structures.

problem Establishing a functorial relationship between Lie groupoid convolution algebras and bornological structures.
method Developed a monoidal functor from differentiable stacks to Morita 2-category of complete bornological algebras.
result Convolution algebras are self-induced and convolution modules are smooth.

Convolutional Neural Networks, as most artificial neural networks, are commonly viewed as methods different in essence from kernel-based methods. We provide a systematic translation of Convolutional Neural Networks (ConvNets) into their kernel-based counterparts, Convolutional Kernel Networks (CKNs), and demonstrate th…

2019-03-19abs ↗pdf ↗

New method enforces orthogonality in convolutional layers for improved robustness.

problem Improving adversarial robustness in deep learning models.
method Applying the Cayley transform to skew-symmetric convolutions in the Fourier domain.
result The proposed method preserves orthogonality and enhances adversarial robustness compared to existing techniques.

GCNs improve regression tasks by aggregating neighbor signals.

problem GCNs' statistical properties in regression tasks are poorly understood.
method Examined two GCN convolutions and their impact on learning error.
result GCNs have a bias-variance trade-off that depends on neighborhood size and topology.