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

21426384 · Feb 202019922001200920172026
48 results for Graph-based CNN

DeepSphere improves spherical CNNs by balancing efficiency and rotation equivariance.

problem Designing efficient and rotation-equivariant convolutional layers for spherical data.
method Graph-based approach to represent spherical data, focusing on the number of vertices and neighbors.
result DeepSphere achieves state-of-the-art performance and demonstrates efficiency and flexibility.

PETNet improves AD diagnosis using graph-based CNN on PET images.

problem Early diagnosis of Alzheimer's Disease using PET imaging.
method PETNet, a graph-based CNN architecture for 3D PET image analysis.
result PETNet shows improved performance over deep learning and other methods on ADNI dataset.

We propose an extension of Convolutional Neural Networks (CNNs) to graph-structured data, including strided convolutions and data augmentation on graphs. Our method matches the accuracy of state-of-the-art CNNs when applied on images, without any prior about their 2D regular structure. On fMRI data, we obtain a signifi…

2018-02-27abs ↗pdf ↗

We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained …

2019-04-12abs ↗pdf ↗

In this paper, we propose a new experimental protocol and use it to benchmark the data efficiency --- performance as a function of training set size --- of two deep learning algorithms, convolutional neural networks (CNNs) and hierarchical information-preserving graph-based slow feature analysis (HiGSFA), for tasks in …

2019-07-03abs ↗pdf ↗

Spherical data is found in many applications. By modeling the discretized sphere as a graph, we can accommodate non-uniformly distributed, partial, and changing samplings. Moreover, graph convolutions are computationally more efficient than spherical convolutions. As equivariance is desired to exploit rotational symmet…

2019-04-08abs ↗pdf ↗

Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors including like, comment, share etc. However, most of the existing methods still use single click behavior as the unique criterion of judging…

2018-11-30abs ↗pdf ↗

UAG defends GNNs against adversarial attacks by quantifying and explaining uncertainties.

problem Lack of uncertainty quantification in GNNs makes them vulnerable to adversarial attacks.
method UAG uses Bayesian Uncertainty Technique (BUT) and Uncertainty-aware Attention Technique (UAT).
result UAG outperforms state-of-the-art solutions in defending adversarial attacks on GNNs.

Recent advances in representation learning on graphs, mainly leveraging graph convolutional networks, have brought a substantial improvement on many graph-based benchmark tasks. While novel approaches to learning node embeddings are highly suitable for node classification and link prediction, their application to graph…

2018-11-03abs ↗pdf ↗

Graph Convolutional Networks (GCNs) have recently become the primary choice for learning from graph-structured data, superseding hash fingerprints in representing chemical compounds. However, GCNs lack the ability to take into account the ordering of node neighbors, even when there is a geometric interpretation of the …

2019-09-11abs ↗pdf ↗

New algorithm improves graph-based active learning by identifying unexplored regions.

problem Improving graph-based active learning by identifying unexplored regions.
method Poisson Reweighted Laplacian Uncertainty Sampling (PWLL) with a diagonal perturbation.
result PWLL effectively identifies unexplored regions in graph-based data.

Bayesian analysis shows unlabeled data improve graph-based semi-supervised learning.

problem Improving semi-supervised learning with limited labeled data.
method Bayesian nonparametric approach using unlabeled data for graph-based learning.
result Posterior contracts optimally around the truth with sufficient unlabeled data.

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 ↗

Knowledge graph based simple question answering (KBSQA) is a major area of research within question answering. Although only dealing with simple questions, i.e., questions that can be answered through a single knowledge base (KB) fact, this task is neither simple nor close to being solved. Targeting on the two main ste…

2019-04-04abs ↗pdf ↗

Graph-based methods for anomaly detection and semi-supervised learning.

problem Detecting unusual clinical actions and anomalies in hospital data.
method Label propagation, harmonic solution, regularization, graph connectivity analysis.
result Effective anomaly detection and semi-supervised learning methods for healthcare data.

Improves graph-based active learning for non-Gaussian models.

problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.

Galerkin method outperforms graph-based methods in spectral decompositions.

problem Improving spectral decomposition methods in machine learning.
method Restricting study to a small set of test functions using the Galerkin method.
result Statistical and computational superiority of Galerkin method over graph-based approaches.

Survey of methods to incorporate external knowledge into stock price prediction.

problem Challenges in predicting stock prices due to market volatility and non-linearity.
method Survey of methods for acquiring and incorporating external knowledge into stock price prediction models.
result Systematic synthesis of previous studies on external knowledge types and their application in stock price prediction.

The paper extends graph-based semi-supervised learning to infinite-dimensional Wasserstein space.

problem Graph-based semi-supervised learning in high-dimensional data.
method Laplace Learning in the Wasserstein space, proving variational convergence and characterizing the Laplace-Beltrami operator.
result Consistent classification performance in high-dimensional settings.

Shapley Flow interprets model predictions using a graph-based approach to feature importance.

problem Existing feature importance methods ignore or hide feature dependencies.
method Shapley Flow considers the entire causal graph and assigns credit to edges.
result Shapley Flow provides a deeper, graph-based view of feature importance.

Improves document summarization by combining word embeddings and n-grams.

problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.

This paper detects function-level obfuscation in binary code using graph-based methods.

problem Detecting and characterizing function-level obfuscation in binary code.
method Graph-based approaches, including GNNs, are compared on various datasets.
result GNNs outperform baselines in function-level obfuscation detection, especially in a 11-class classification task.

GATES improves neural architecture search by modeling operations as information transformation.

problem Improving predictor-based neural architecture search efficiency.
method GATES models operations as information transformation, covering both node and edge cell search spaces.
result GATES boosts sample efficiency and improves predictor performance.

Improved graph-based semi-supervised learning with model change active learning.

problem Identifying which unlabelled data points to label to best improve classifier performance.
method Pairing model change active learning with graph-based semi-supervised learning methods.
result Improved multiclass classification performance over prior methods.

Poisson learning improves graph-based semi-supervised learning at very low label rates.

problem Degeneracy of Laplacian semi-supervised learning at low label rates.
method Replaces label assignment with source and sink placement, solving Poisson equation.
result Provably more stable and informative predictions than Laplacian learning.

Paper proposes graph-based separable transforms for video coding.

problem Improving video coding efficiency by better capturing residual block statistics.
method Derives graph-based separable transforms (GBSTs) from line graphs with weights determined by parameters.
result GBSTs achieve about 0.4% average coding gain over existing transforms in VVC.

Recommender system is an important component of many web services to help users locate items that match their interests. Several studies showed that recommender systems are vulnerable to poisoning attacks, in which an attacker injects fake data to a given system such that the system makes recommendations as the attacke…

2018-09-11abs ↗pdf ↗

A scalable graph-based SSL method for large-scale data with few labels.

problem Challenges in semi-supervised learning with limited labeled data and large unlabeled data.
method Constructs a graph from a small set of high-dense vertexes to learn relationships and improve performance.
result Achieves good classification performance, especially with few labels.

Graph-based Bayesian SSL uses graph theory to propagate labels from a few to many unlabeled features.

problem Efficiently propagating labels from a small set of labeled data to a large set of unlabeled data.
method Probabilistic framework using graph theory and Bayesian statistics.
result Mathematical foundations for improving the accuracy and efficiency of label propagation.

Knowledge distillation (KD) is a technique to derive optimal performance from a small student network (SN) by distilling knowledge of a large teacher network (TN) and transferring the distilled knowledge to the small SN. Since a role of convolutional neural network (CNN) in KD is to embed a dataset so as to perform a g…

2019-07-04abs ↗pdf ↗

GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.

problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.

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 ↗