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,657 papers · 148 categories

Trend · papers per month

90180269359 · Jun 202019922001200920172026
48 results for Continuous Convolution

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.

This research studies affine invariance in continuous-domain convolutional neural networks.

problem Recognizing patterns and features under affine transformations in continuous domains.
method Introduces a new criterion for assessing affine invariance, embeds images into the affine Lie group, and analyzes convolution over this group.
result Extends the scope of geometrical transformations that deep-learning pipelines can handle.

Proposes continuous convolution layers for flexible feature map resizing.

problem Fixed stride limitations in discrete convolution layers.
method Introduces Continuous Convolution (CC) layers that use learned continuous functions.
result Dynamic and consistent resizing of feature maps at any scale, non-integer and axis-dependent.

CGNNs use wavelets for continuous function generation in infinite-dimensional spaces.

problem Generating continuous functions in infinite-dimensional spaces for applications like inverse problems.
method Inspired by DCGAN, CGNNs use wavelet multiresolution analysis with convolutional and nonlinear layers.
result CGNNs can be injective under certain conditions on filters and nonlinearity, leading to Lipschitz stability estimates.

Lie groupoid equivariant neural networks are a new type of neural network.

problem Designing neural networks that respect the structure of Lie groupoids.
method Introducing Lie groupoid equivariant convolutions and layers, and showing their equivalence to Lie algebroid-equivariant networks.
result Lie groupoid equivariant neural networks are equivalent to certain Lie algebroid-equivariant networks.

Improved robustness of 1D CNNs for heart arrhythmia classification.

problem Improving the robustness of 1D CNNs for classification tasks.
method Parameterization using Cayley transform and controllability Gramian for Lipschitz-bounded CNNs.
result Improved robustness of trained Lipschitz-bounded 1D CNNs for heart arrhythmia classification.

GCNs converge and remain stable on large random graphs, revealing geometric insights.

problem Understanding the behavior of GCNs on large, sparse random graphs.
method Analysis of GCNs on random graph models with latent variables and geometric edge probabilities.
result GCNs converge to their continuous counterparts as graph size increases, and are stable to small graph deformations.

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that op…

2016-05-17abs ↗pdf ↗

First steps towards a mathematical theory of deep convolutional neural networks for feature extraction were made---for the continuous-time case---in Mallat, 2012, and Wiatowski and Bölcskei, 2015. This paper considers the discrete case, introduces new convolutional neural network architectures, and proposes a mathemati…

2016-05-26abs ↗pdf ↗

Time-continuous dimensional descriptions of emotions (e.g., arousal, valence) allow researchers to characterize short-time changes and to capture long-term trends in emotion expression. However, continuous emotion labels are generally not synchronized with the input speech signal due to delays caused by reaction-time, …

2019-07-05abs ↗pdf ↗

Paper tackles missing data in irregularly-sampled time series.

problem Modeling irregularly-sampled time series data.
method Encoder-decoder framework based on variational autoencoders and generative adversarial networks.
result Models achieve competitive or better classification results on irregularly-sampled multivariate time series.

Deep learning has been widely applied and brought breakthroughs in speech recognition, computer vision, and many other domains. The involved deep neural network architectures and computational issues have been well studied in machine learning. But there lacks a theoretical foundation for understanding the approximation…

2018-05-28abs ↗pdf ↗

Study on VC dimension of GCNNs with input resolution effects.

problem Understanding the generalization capabilities of GCNNs.
method Derived upper and lower bounds for VC dimension, analyzed factors affecting it.
result Extended previous results on VC dimension of GCNNs, providing insights into input resolution dependence.

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 ↗

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 ↗

The classical Serre-Swan's theorem defines a bijective correspondence between vector bundles and finitely generated projective modules over the algebra of continuous functions on some compact Hausdorff topological space. We extend these results to obtain a correspondence between the category of representations of an et…

2008-06-11abs ↗pdf ↗

We propose a novel continual learning method called Residual Continual Learning (ResCL). Our method can prevent the catastrophic forgetting phenomenon in sequential learning of multiple tasks, without any source task information except the original network. ResCL reparameterizes network parameters by linearly combining…

2020-02-17abs ↗pdf ↗

This study presents a novel end-to-end architecture that learns hierarchical representations from raw EEG data using fully convolutional deep neural networks for the task of neonatal seizure detection. The deep neural network acts as both feature extractor and classifier, allowing for end-to-end optimization of the sei…

2017-09-18abs ↗pdf ↗

Quantum CNNs improve on multi-channel data processing.

problem Lack of efficient processing for multi-channel data in QCNNs.
method Developed hardware-adaptable quantum circuit ansatzes for convolutional kernels.
result Quantum CNNs outperform existing QCNNs on multi-channel data classification tasks.

A scattering transform defines a signal representation which is invariant to translations and Lipschitz continuous relatively to deformations. It is implemented with a non-linear convolution network that iterates over wavelet and modulus operators. Lipschitz continuity locally linearizes deformations. Complex classes o…

2011-12-05abs ↗pdf ↗

Graph convolutions can enhance high frequencies, leading to over-sharpening.

problem Graph convolutions suffer from over-smoothing and poor performance on heterophilic graphs.
method Rigorously prove that linear graph convolutions minimize a generalized Dirichlet energy, showing that weight matrices induce edge-wise attraction or repulsion.
result Graph convolutions can enhance high frequencies, leading to over-sharpening instead of over-smoothing.

DNArch learns CNN architectures by backpropagation.

problem Discovering optimal CNN architectures.
method Differentiable Neural Architectures (DNArch) learns CNN architectures by backpropagation, controlling kernel sizes, channels, downsampling positions, and depth.
result DNArch finds performant CNN architectures across various tasks.

Rotation intertwining maps from the set of convex bodies in Rn into itself that are continuous linear operators with respect to Minkowski and Blaschke addition are investigated. The main focus is on Blaschke-Minkowski homomorphisms. We show that such maps are represented by a spherical convolution operator. An applicat…

2012-07-31abs ↗pdf ↗

With a view towards applications in the theory of infinite-dimensional representations of finite-dimensional Lie supergroups, we introduce a new category of supermanifolds. In this category, supermanifolds of `maps' and `fields' (fibre bundle sections) exist. In particular, loop supergroups can be realised globally in …

2011-09-14abs ↗pdf ↗

Exact bounds derived for neural network outputs with noisy inputs.

problem Bounding the output distribution of neural networks with random inputs.
method Applying ReLU NNs to derive bounds for general NNs, then using these to find exact error guarantees.
result Exact upper and lower bounds for the output distribution of neural networks with random inputs.

Novel Haar-Laplacian for directed graphs enhances spectral graph applications.

problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.

DeepPocket uses graph convolutional reinforcement learning for better financial portfolio management.

problem Maximizing return on investment while managing risk in correlated financial assets.
method Graph convolutional reinforcement learning framework with feature extraction, local information collection, and actor-critic reinforcement learning.
result DeepPocket outperformed market indexes on five real-life datasets over three investment periods, including during the Covid-19 crisis.

Framework detects and ranks suspicious market manipulation using temporal convolutions and expert assessment.

problem Detecting and deterring rogue agents in financial markets.
method Weakly supervised learning, expert assessment, similarity search.
result Promising preliminary results in detecting and ranking suspicious market manipulation.

New methods improve translation-equivariant neural processes for modeling unknown functions.

problem Modeling unknown latent functions from irregularly sampled measurements.
method Volterra series and set Fourier convolutions to address translation-equivariance and efficiency.
result Improved translation-equivariant neural processes with analytical transparency and linear scalability.

This paper uses deep RL to optimize market quotes from LOB data.

problem Optimizing quotes for market making from complex LOB data.
method Attn-LOB neural network with convolutional filters and attention mechanism for feature extraction; hybrid reward function for continuous action space.
result The RL agent outperforms traditional methods in market making tasks.

Monotone aggregation of dependent random vectors has an absolutely continuous distribution under certain conditions.

problem Monotone aggregation of dependent random vectors
method Coordinatewise monotonicity and uniform lower-increment conditions
result One-dimensional push-forwards of dependent random vectors have an absolutely continuous distribution