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

Trend · papers per month

17345067 · Feb 202019922001200920172026
48 results for graph-augmented CNN

PiNGDA learns beneficial noise for graph augmentation stability.

problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.

This study compares GNNs and GA-MLPs, finding GA-MLPs can distinguish graphs but not count walks.

problem Comparing expressive power and graph isomorphism testing capabilities of GNNs and GA-MLPs.
method GA-MLPs augment node features with multi-hop operators and apply MLPs node-wise; GNNs are compared as a baseline.
result GA-MLPs can distinguish almost all non-isomorphic graphs but cannot count attributed walks, unlike GNNs.

GraphACL learns graph representations without augmentation or homophily assumptions.

problem Learning graph representations on heterophilic graphs (nodes with different labels and features).
method Asymmetric Contrastive Learning for Graphs (GraphACL) considers an asymmetric view of neighboring nodes.
result GraphACL significantly outperforms state-of-the-art methods on both homophilic and heterophilic graphs.

GANF uses normalizing flows to detect anomalies in multiple time series.

problem Detecting anomalies in multiple time series with interdependencies.
method Bayesian network integration with normalizing flows for unsupervised anomaly detection.
result GANF effectively detects anomalies and identifies distribution drift in time series data.

Generative models for source code are an interesting structured prediction problem, requiring to reason about both hard syntactic and semantic constraints as well as about natural, likely programs. We present a novel model for this problem that uses a graph to represent the intermediate state of the generated output. T…

2018-05-22abs ↗pdf ↗

Enhances VC startup success predictions using graph augmented time series models.

problem Challenges in predicting startup success due to limited financial data and subjective forecasts.
method Integrates inter-company relationships into time series analysis using GraphRAG.
result Significantly outperforms previous models in startup success predictions.

In recent years, deep learning poses a deep technical revolution in almost every field and attracts great attentions from industry and academia. Especially, the convolutional neural network (CNN), one representative model of deep learning, achieves great successes in computer vision and natural language processing. How…

2018-06-12abs ↗pdf ↗

We attempt to interpret how adversarially trained convolutional neural networks (AT-CNNs) recognize objects. We design systematic approaches to interpret AT-CNNs in both qualitative and quantitative ways and compare them with normally trained models. Surprisingly, we find that adversarial training alleviates the textur…

2019-05-23abs ↗pdf ↗

Simplified Butterfly-Net2 improves CNN efficiency in solving PDEs and signal processing tasks.

problem Improving CNN efficiency in solving PDEs and signal processing tasks.
method Introducing BNet2, a simplified Butterfly-Net, and Fourier transform initialization.
result BNet2 achieves similar accuracy as CNN but with fewer parameters and improves accuracy over randomly initialized CNN.

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.

State-of-the-art image recognition systems use sophisticated Convolutional Neural Networks (CNNs) that are designed and trained to identify numerous object classes. Such networks are fairly resource intensive to compute, prohibiting their deployment on resource-constrained embedded platforms. On one hand, the ability t…

2018-12-16abs ↗pdf ↗

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.

This paper proposes a generic method to learn interpretable convolutional filters in a deep convolutional neural network (CNN) for object classification, where each interpretable filter encodes features of a specific object part. Our method does not require additional annotations of object parts or textures for supervi…

2019-01-08abs ↗pdf ↗

The past several years have seen both an explosion in the use of Convolutional Neural Networks (CNNs) and the design of accelerators to make CNN inference practical. In the architecture community, the lion share of effort has targeted CNN inference for image recognition. The closely related problem of video recognition…

2018-10-16abs ↗pdf ↗

Large receptive field CNNs improve distant speech recognition.

problem Degrading performance of ASR systems in noisy environments.
method Investigated large receptive field CNN variants including recursive, dilated, and hourglass networks.
result Stacked hourglass networks show significant improvements in distant speech recognition.

Paper revisits graph-CNNs using Laplace-Beltrami spectral filters and polynomials.

problem Improving spectral graph convolutional neural networks (graph-CNNs).
method Developed Laplace-Beltrami CNN (LB-CNN) by replacing graph Laplacian with LB operator and approximating spectral filters using Chebyshev, Laguerre, and Hermite polynomials.
result Classification accuracy of LB-CNN is not dependent on the type of polynomials or operators.

Convolutional Neural Networks (CNNs) require a large amount of annotated data to learn from, which is often difficult to obtain in the medical domain. In this paper we show that the sample complexity of CNNs can be significantly improved by using 3D roto-translation group convolutions (G-Convs) instead of the more conv…

2018-04-12abs ↗pdf ↗

iGCL preserves graph semantics in latent space augmentations.

problem Manual tuning of augmentation ratios and unexpected graph changes.
method iGCL uses a Variational Graph Auto-Encoder to learn augmentations in the latent space, optimizing an upper bound for contrastive loss.
result iGCL achieves state-of-the-art performance on graph-level and node-level tasks.