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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for sinc convolution

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 ↗

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 ↗

Convolutional autoencoders improve personalized recommendations from image-based data.

problem Lack of personalized recommendations in gastronomic platforms using image data.
method Used convolutional autoencoders to extract features from images and improve personalized recommendations.
result Convolutional autoencoders outperform standard deep features in image-based personalized recommendation systems.

RecNets use RNNs to process image channels in a compact, recurrent way.

problem Creating efficient neural network architectures for computer vision.
method Introducing RecNets with CRC layers that simulate recurrent processing of image channels.
result RecNets achieve superior size-accuracy trade-off compared to other compact models.

In this work we detail the application of a fast convolution algorithm computing high dimensional integrals to the context of multiplicative noise stochastic processes. The algorithm provides a numerical solution to the problem of characterizing conditional probability density functions at arbitrary time, and we applie…

2011-07-07abs ↗pdf ↗

Paper analyzes the free energy of CNNs with skip connections in Bayesian learning.

problem Dependency of CNNs with skip connections on the number of parameters.
method Examines the Bayesian free energy of CNNs with and without skip connections.
result The upper bound of free energy of Bayesian CNN with skip connections does not depend on overparametrization.

Enhanced deep CNNs improve cardiac abnormality diagnosis from ECGs.

problem Diagnosing cardiac abnormalities from 12-lead ECGs.
method Training an enhanced deep convolutional neural network with hand-crafted features, data preprocessing, and augmentation.
result Promising generalization performance in ECG diagnosis.

Bayesian convolutional deep sets improve ambiguity in stationary process modeling.

problem Ambiguity in translation equivariant functional representations due to insufficient data points.
method Introduce Bayesian convolutional deep sets with task-dependent stationary prior.
result Improves representation quality compared to kernel smoother and non-parametric models.

Optimizes CNN architectures by analyzing receptive fields without training.

problem CNNs often have too many layers, making them resource-intensive and less effective.
method Layer-wise analysis of receptive fields to identify unproductive layers.
result Identifies and removes unproductive layers, improving CNN performance and efficiency.

HKConv learns hyperbolic features by aggregating kernel points.

problem Challenges in learning good hyperbolic representations using Euclidean operations.
method Proposes HKConv, a trainable hyperbolic convolution that correlates local features with kernel points and aggregates them.
result HKConv learns expressive local features according to hyperbolic geometry and enjoys equivariance to permutation and invariance to parallel transport.

This paper proposes a new Quantum Spatial Graph Convolutional Neural Network (QSGCNN) model that can directly learn a classification function for graphs of arbitrary sizes. Unlike state-of-the-art Graph Convolutional Neural Network (GCNN) models, the proposed QSGCNN model incorporates the process of identifying transit…

2018-09-04abs ↗pdf ↗

This paper removes the finite variance assumption for deep convolutional neural networks.

problem Removing the finite variance assumption for deep convolutional neural networks.
method Assuming iid parameters distributed according to a stable distribution, the paper shows that the infinite-channel limit of a deep feed-forward convolutional neural network is a multivariate stable stochastic process.
result The infinite-channel limit of a deep feed-forward convolutional neural network, under suitable scaling, is a multivariate stable stochastic process.

Recurrent Neural Networks (RNNs) with sophisticated units that implement a gating mechanism have emerged as powerful technique for modeling sequential signals such as speech or electroencephalography (EEG). The latter is the focus on this paper. A significant big data resource, known as the TUH EEG Corpus (TUEEG), has …

2018-01-03abs ↗pdf ↗

Compressing convolutional neural networks (CNNs) is essential for transferring the success of CNNs to a wide variety of applications to mobile devices. In contrast to directly recognizing subtle weights or filters as redundant in a given CNN, this paper presents an evolutionary method to automatically eliminate redunda…

2017-07-25abs ↗pdf ↗

Proposes a new layer for efficient 3D shape discrimination.

problem Irregular structure and redundancy in 3D point clouds hinder efficient inter-class discrimination.
method Integrates Blended Convolution and Synthesis layer that projects and synthesizes 3D point clouds, followed by 3D convolution in the unit ball.
result End-to-end architecture achieves compelling results on 3D shape recognition and retrieval.

Superior performance and ease of implementation have fostered the adoption of Convolutional Neural Networks (CNNs) for a wide array of inference and reconstruction tasks. CNNs implement three basic blocks: convolution, pooling and pointwise nonlinearity. Since the two first operations are well-defined only on regular-s…

2018-03-06abs ↗pdf ↗

This paper reports the method and evaluation results of MedAusbild team for ISIC challenge task. Since early 2017, our team has worked on melanoma classification [1][6], and has employed deep learning since beginning of 2018 [7]. Deep learning helps researchers absolutely to treat and detect diseases by analyzing medic…

2018-07-24abs ↗pdf ↗

Graph scattering transforms are stable to metric perturbations of network topology.

problem Stability of graph data representations under metric perturbations.
method Extending scattering transforms to network data using multiresolution graph wavelets and graph convolutions.
result Graph scattering transforms are stable to metric perturbations of the underlying network topology.

TTW aligns time-series faster and more accurately than existing methods.

problem Efficiently aligning multiple time-series signals with varying lengths.
method TTW uses a sinc convolutional kernel and gradient-based optimization for linear time and sequence complexity.
result TTW outperforms existing methods in time-series averaging and classification tasks.

Two deep learning models improve indoor location prediction from WiFi fingerprints.

problem Indoor location prediction from WiFi fingerprints.
method Convolutional mixture density recurrent neural network and VAE-based semi-supervised learning model.
result Proposed models outperform existing methods in real-world datasets.

AEGCN uses autoencoder constraints to improve graph node classification.

problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.

Sparse molecular representations improve interpretability in graph neural networks.

problem Difficulty in understanding which molecular graph aspects drive deep learning predictions.
method Constrain weights in a graph convolutional neural network using the Gini index to maximize representation inequality.
result The Gini-constrained approach does not degrade evaluation metrics and allows for interpretable representation combination.

Graph neural networks can be adapted to new graphs with a limit object called graphon NNs.

problem Transferability of graph neural networks across different graphs.
method Introduced graphon NNs as limit objects of GNNs and proved a bound on the difference between GNN and graphon-NN outputs.
result The bound on the difference between GNN and graphon-NN outputs vanishes with growing number of nodes if the graph convolutional filters are bandlimited.

A new method for comparing image probability measures using convolution operators.

problem Efficiently comparing images using conventional sliced Wasserstein methods.
method Proposed convolution sliced Wasserstein (CSW) methods with stride, dilation, and non-linear activation.
result CSW demonstrates favorable performance over conventional sliced Wasserstein in image comparison and deep generative modeling.

This paper uses graph convolutional networks to improve the accuracy of neural architecture search.

problem Improving the precision of sampled sub-networks in weight-sharing NAS.
method Training a graph convolutional network to fit the performance of sampled sub-networks.
result Achieved higher rank correlation coefficient and better final architecture performance.

Graph convolutional networks refine organ segmentation using uncertainty analysis.

problem Challenges in organ segmentation due to variability and tissue similarity.
method Uncertainty analysis of graph convolutional networks for semi-supervised learning.
result Improved segmentation accuracy (1% for pancreas, 2% for spleen) compared to state-of-the-art methods.

Max-pooling architectures are theoretically analyzed and shown to be globally optimized and generalize well.

problem Theoretical understanding and optimization of max-pooling in deep learning architectures.
method Theoretical analysis of a convolutional max-pooling architecture, focusing on a pattern detection problem.
result Max-pooling architectures can be globally optimized and generalize well, even for highly over-parameterized models.

Proposes ECLSTM for more accurate RUL estimation from time series data.

problem Predicting Remaining Useful Life (RUL) from multivariate time series data.
method Embedded Convolutional LSTM (ECLSTM) with automated hyperparameter optimization.
result ECLSTM outperforms state-of-the-art approaches on benchmark data sets.

A new method compresses point clouds efficiently, outperforming existing techniques.

problem Efficiently compressing large point cloud datasets for VR applications.
method Learned convolutional transforms and uniform quantization for joint rate and distortion optimization.
result Significant rate-distortion improvement (51.5% BDBR savings) on Microsoft Voxelized Upper Bodies dataset.