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

3571106141 · Jun 202019922001200920172026
48 results for Chen-type convolution

New algorithms compute Volterra signature efficiently for time series analysis.

problem Efficient computation of Volterra signature with matrix-valued kernels.
method Decomposed Chen-type convolution relation, introduced FFT-based and exact recursion algorithms.
result Efficient algorithms for Volterra signature computation with various complexities.

We investigate some relations concerning the first and the second Beltrami operators corresponding to the fundamental forms I, II, III of a surface in the three-dimensional Euclidean space and we study surfaces which are of finite type in the sense of B.-Y. Chen with respect to the fundamental forms II and III.

2015-10-30abs ↗pdf ↗

In this paper, we study ruled surfaces and quadrics in the 3-dimensional Euclidean space which are of finite IIIIII-type, that is, they are of finite type, in the sense of B.-Y. Chen, with respect to the third fundamental form. We show that helicoids and spheres are the only ruled and quadric surfaces of finite IIIIII-ty…

2017-10-19abs ↗pdf ↗

We give necessary and sufficient conditions for the real distributions defined by a metallic pseudo-Riemannian structure to be integrable and geodesically invariant, in terms of associated tensor fields to the metallic structures and of adapted connections. In the integrable case, we prove a Chen-type inequality for th…

2019-03-10abs ↗pdf ↗

In [6] we proved Chen's inequality regarded as a problem of constrained maximum. In this paper we introduce a Riemannian invariant obtained from Chen's invariant, replacing the sectional curvature by the Ricci curvature of k-order. This invariant can be estimated, in the case of submanifolds M in space forms $\widetild…

2006-05-12abs ↗pdf ↗

Study geometric inequalities for CR-submanifolds using curvature invariants.

problem Geometric inequalities for CR-submanifolds in almost Hermitian spaces.
method Comparing mutual curvature invariants with Chen-type invariants and proving geometric inequalities.
result Proved geometric inequalities with intermediate mean curvature squared for CR-submanifolds.

Establish generalized Chen inequalities for Riemannian submersions and Riemannian maps with applications.

problem Generalized Chen inequalities for Riemannian submersions and Riemannian maps.
method Employing generalized δ-invariants introduced by Chen.
result Optimal inequalities involving δ-invariants and extrinsic invariants.

We classify Hopf hypersurfaces of non-flat complex space forms CP^m(4) and CH^m(-4), denoted jointly by CQ^m(4c), that are of 2-type in the sense of B. Y. Chen, via the embedding into a suitable (pseudo) Euclidean space of Hermitian matrices by projection operators. This complements and extends earlier classifications …

2010-05-19abs ↗pdf ↗

The study classifies hypersurfaces in quaternionic space forms with constant principal curvatures.

problem Classifying hypersurfaces in quaternionic space forms with specific curvature properties.
method Analyzing curvature-adapted real hypersurfaces in non-flat quaternionic space forms HPm\mathbb HP^m and HHm\mathbb HH^m.
result Classification of hypersurfaces including geodesic hyperspheres, tubes, and specific examples in HPm\mathbb HP^m and HHm\mathbb HH^m.

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.

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 ↗

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.

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 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.

Convolution and pooling improve kernel methods in image classification.

problem Understanding the interplay between approximation and generalization in convolutional architectures.
method Characterized RKHS of kernels with convolution, pooling, and downsampling, computed generalization error.
result Convolution and pooling operations trade off approximation with generalization power.

Convolutional networks outperform fully-connected ones in certain tasks.

problem Understanding the computational advantage of convolutional networks over fully-connected networks.
method Demonstrated a computational advantage through a specific problem class.
result Convolutional networks can solve certain problems that fully-connected networks cannot, even with gradient descent.

Proposes a fixed smooth convolutional layer to reduce checkerboard artifacts in CNNs.

problem Checkerboard artifacts in CNNs during upsampling and strided convolution.
method Fixed convolutional layer with adjustable smoothness, applied to four CNNs and GANs.
result Significantly improves classification performance and image generation quality.

This work proposes hyperbolic deep convolutional neural networks for better pattern recognition.

problem The limitations of Euclidean deep convolutional neural networks in capturing intricate patterns.
method Developed Hyperbolic DCNN based on Poincaré Disc, analyzing expansive convolution in non-Euclidean space.
result Hyperbolic convolutional architecture outperforms Euclidean ones in pattern recognition tasks.

New linear flows using exponential of linear transformations improve generative models.

problem Improving generative models in machine learning.
method Developed convolution exponentials and generalized Sylvester Flows using the exponential of linear transformations.
result Convolution exponentials and Convolutional Sylvester Flows outperform other models in log-likelihood.

Convolutional neural networks (CNNs) have achieved breakthrough performances in a wide range of applications including image classification, semantic segmentation, and object detection. Previous research on characterizing the generalization ability of neural networks mostly focuses on fully connected neural networks (F…

2019-10-03abs ↗pdf ↗

Proposes a new convolutional neural network for non-grid data.

problem Limited applicability of standard CNNs to non-grid structured data.
method Introduces Parametric Continuous Convolution (PCC) with learnable kernel functions.
result Significant improvement in point cloud segmentation and lidar motion estimation.

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.

Recently, many researchers have been focusing on the definition of neural networks for graphs. The basic component for many of these approaches remains the graph convolution idea proposed almost a decade ago. In this paper, we extend this basic component, following an intuition derived from the well-known convolutional…

2018-11-23abs ↗pdf ↗

Yes, they do. This paper provides the first empirical demonstration that deep convolutional models really need to be both deep and convolutional, even when trained with methods such as distillation that allow small or shallow models of high accuracy to be trained. Although previous research showed that shallow feed-for…

2016-03-17abs ↗pdf ↗

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.

Ensemble learning is a method of combining multiple trained models to improve model accuracy. We propose the usage of such methods, specifically ensemble average, inside Convolutional Neural Network (CNN) architectures by replacing the single convolutional layers with Inner Average Ensembles (IEA) of multiple convoluti…

2018-08-30abs ↗pdf ↗

Simplifies convolutions using tensor networks and einsum for efficient second-order methods.

problem Complexity in analyzing and applying convolutions in deep learning.
method Viewing convolutions as tensor networks, drawing diagrams, and using einsum for efficient computation.
result Accelerates a KFAC variant up to 4.5x with reduced memory overhead.

Introduces new algebraic structures for relational groupoids and proves a reduction theorem.

problem Developing algebraic tools for relational groupoids.
method Introduces relational groupoids and convolution algebras, provides examples, and proves a reduction theorem.
result Establishes a reduction theorem recovering the usual convolution of Lie groupoids.

The paper proposes an ensemble of convolution-based methods for fault detection in gearboxes.

problem Fault detection in planetary gearboxes using vibration signals.
method Ensemble of three convolution kernel-based methods (ROCKET, 1D CNN with ResNet, FCN).
result Outperforms other approaches with over 98.8% accuracy.