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

2625247861,048 · Jun 202019922001200920172026
48 results for Graph Prototypical Networks

Graph Prototypical Networks improve few-shot node classification on attributed networks.

problem Few-shot node classification in attributed networks with limited labeled instances.
method Graph Prototypical Networks (GPN) using meta-learning to extract meta-knowledge and identify informative labeled instances.
result GPN achieves superior performance in few-shot node classification.

Bayesian meta-learning on relation graphs improves few-shot relation extraction.

problem Predicting relations in sentences with limited labeled examples.
method Bayesian meta-learning on a global relation graph, using graph neural networks and Langevin dynamics.
result Framework effectively learns and generalizes to new relations.

Recent progress has shown that few-shot learning can be improved with access to unlabelled data, known as semi-supervised few-shot learning(SS-FSL). We introduce an SS-FSL approach, dubbed as Prototypical Random Walk Networks(PRWN), built on top of Prototypical Networks (PN). We develop a random walk semi-supervised lo…

2019-03-06abs ↗pdf ↗

Optimal Transport Graph Neural Networks (OT-GNN) improves graph embeddings by using optimal transport.

problem Graph Neural Networks (GNN) often lose structural or semantic information when aggregating node embeddings.
method Combines optimal transport (OT) with parametric graph models to compute graph embeddings from Wasserstein distances between node embeddings and prototype point clouds.
result OT-GNN outperforms popular methods on molecular property prediction tasks and produces smoother graph representations.

Meta-learning extracts common knowledge from learning different tasks and uses it for unseen tasks. It can significantly improve tasks that suffer from insufficient training data, e.g., few shot learning. In most meta-learning methods, tasks are implicitly related by sharing parameters or optimizer. In this paper, we s…

2019-09-11abs ↗pdf ↗

Paper tackles graph class-incremental learning with task profiling and prompting.

problem Challenges in separating classes from different tasks in graph CIL.
method Laplacian smoothing-based task profiling and graph prompting approach.
result 100% task ID prediction accuracy and significant performance improvement.

This paper introduces hyperspherical prototype networks, which unify classification and regression with prototypes on hyperspherical output spaces. For classification, a common approach is to define prototypes as the mean output vector over training examples per class. Here, we propose to use hyperspheres as output spa…

2019-01-29abs ↗pdf ↗

We propose a novel architecture for kk-shot classification on the Omniglot dataset. Building on prototypical networks, we extend their architecture to what we call Gaussian prototypical networks. Prototypical networks learn a map between images and embedding vectors, and use their clustering for classification. In our…

2017-08-09abs ↗pdf ↗

A new neural network method improves interpretability and detection of outliers.

problem Improving interpretability and detection of outliers in neural networks.
method Prototype-based learning (PbL) using a winner-take-all (WTA) network with two prototypes: positive and negative.
result The negative prototype is similar to the positive one, aligning with the BCM theory.

We propose prototypical networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each new class. Prototypical networks learn a metric space in which classification can be performed by computing distances…

2017-03-15abs ↗pdf ↗

GraphHull models networks with clear multi-scale explanations of community structure.

problem Lack of self-explainable models in graph machine learning.
method Two-level convex hulls with global archetypes and local prototypes.
result GraphHull models networks with clear multi-scale explanations.

Classification in the dissimilarity space has become a very active research area since it provides a possibility to learn from data given in the form of pairwise non-metric dissimilarities, which otherwise would be difficult to cope with. The selection of prototypes is a key step for the further creation of the space. …

2017-12-26abs ↗pdf ↗

We propose infinite mixture prototypes to adaptively represent both simple and complex data distributions for few-shot learning. Our infinite mixture prototypes represent each class by a set of clusters, unlike existing prototypical methods that represent each class by a single cluster. By inferring the number of clust…

2019-02-12abs ↗pdf ↗

Paper proposes integrating hierarchical class structure into prototypical network supervision.

problem Improving classification accuracy in tasks with hierarchical class structures.
method Integrates hierarchical class structure (metric) into prototypical network supervision.
result Consistent improvement of error rate weighted by the cost matrix compared to traditional methods.

ProtoryNet interprets text sequences using prototype trajectories for better understanding.

problem Improving text classification interpretability and accuracy.
method ProtoryNet uses prototype trajectories to interpret text sequences, with prototype pruning for better interpretability.
result ProtoryNet outperforms baseline models and reduces performance gap compared to black-box models.

Towards the challenging problem of semi-supervised node classification, there have been extensive studies. As a frontier, Graph Neural Networks (GNNs) have aroused great interest recently, which update the representation of each node by aggregating information of its neighbors. However, most GNNs have shallow layers wi…

2019-10-07abs ↗pdf ↗

Prototype model improves model auditing and understanding.

problem Auditing and understanding modern language models is expensive and approximate.
method Introduced a sparse, non-negative mixture of learned prototypes trained with clustering objectives.
result Prototype models either surpass or remain within 2.5 percentage points of dense baselines on downstream tasks.

We present a novel class of convolutional neural networks (CNNs) for set functions, i.e., data indexed with the powerset of a finite set. The convolutions are derived as linear, shift-equivariant functions for various notions of shifts on set functions. The framework is fundamentally different from graph convolutions b…

2019-09-05abs ↗pdf ↗

Interpretability has emerged as a crucial aspect of building trust in machine learning systems, aimed at providing insights into the working of complex neural networks that are otherwise opaque to a user. There are a plethora of existing solutions addressing various aspects of interpretability ranging from identifying …

2017-11-15abs ↗pdf ↗

SRR detects early signs of financial crises using multi-layer graphs.

problem Predicting systemic financial transitions from evolving market interactions.
method Systemic Risk Radar (SRR) models financial markets as multi-layer graphs.
result Graph-derived features provide useful early-warning signals compared to feature-based models.

The key issue of few-shot learning is learning to generalize. This paper proposes a large margin principle to improve the generalization capacity of metric based methods for few-shot learning. To realize it, we develop a unified framework to learn a more discriminative metric space by augmenting the classification loss…

2018-07-08abs ↗pdf ↗

ProtoNAM models tabular data with neural networks, making predictions transparent.

problem Tabular data analysis using neural networks lacks transparency and accuracy compared to tree-based methods.
method ProtoNAM introduces prototypes into neural networks to model tabular data while maintaining explainability.
result ProtoNAM outperforms existing NN-based GAMs and provides insights into learned feature patterns.

Induction of common sense knowledge about prototypical sequences of events has recently received much attention. Instead of inducing this knowledge in the form of graphs, as in much of the previous work, in our method, distributed representations of event realizations are computed based on distributed representations o…

2013-12-18abs ↗pdf ↗

A new method improves few-shot learning by combining ProtoNet with LFD.

problem Few-shot learning struggles with high variance support sets.
method Combines ProtoNet with Local Fisher Discriminant Analysis.
result Superior classification accuracy on miniImageNet and tieredImageNet.

DDCL-INCRT learns its own structure during training, reducing unnecessary complexity.

problem Fixed-size neural network architectures require manual tuning, leading to overfitting.
method Combines DDCL (Deep Dual Competitive Learning) and INCRT (Incremental Transformer) to self-organize network structure.
result The network self-organizes into a hierarchy of heads, reducing unnecessary complexity.

Sleep staging is a crucial task for diagnosing sleep disorders. It is tedious and complex as it can take a trained expert several hours to annotate just one patient's polysomnogram (PSG) from a single night. Although deep learning models have demonstrated state-of-the-art performance in automating sleep staging, interp…

2019-10-14abs ↗pdf ↗

Few-shot models have become a popular topic of research in the past years. They offer the possibility to determine class belongings for unseen examples using just a handful of examples for each class. Such models are trained on a wide range of classes and their respective examples, learning a decision metric in the pro…

2019-06-03abs ↗pdf ↗

FiberNet integrates geometry into machine learning for clearer classification.

problem Lack of interpretability in traditional deep learning.
method Reformulates classification as geometric optimization on fiber bundles, introducing learnable Riemannian metrics and variational prototype optimization.
result Clear geometric interpretability and efficiency in classification.

Transferring learned models to novel tasks is a challenging problem, particularly if only very few labeled examples are available. Although this few-shot learning setup has received a lot of attention recently, most proposed methods focus on discriminating novel classes only. Instead, we consider the extended setup of …

2019-07-22abs ↗pdf ↗

This work builds a sensor graph from DC sensors for anomaly detection.

problem Anomaly detection in data centers with complex sensor relationships.
method Data-driven pipeline (ts2graph) to build a sensor graph from sensor time series.
result Graph neural network (GNN) outperforms existing methods by 2-3 times in anomaly detection.

Supervised deep-embedding methods project inputs of a domain to a representational space in which same-class instances lie near one another and different-class instances lie far apart. We propose a probabilistic method that treats embeddings as random variables. Extending a state-of-the-art deterministic method, Protot…

2019-09-25abs ↗pdf ↗

Prototype-based memory network learns visual categories from unlabeled data.

problem Learning from nonstationary, unlabeled data with sequential dependencies.
method Online prototype-based memory network with contrastive loss.
result Significantly better category recognition compared to state-of-the-art methods.

Prototypal analysis is introduced to overcome two shortcomings of archetypal analysis: its sensitivity to outliers and its non-locality, which reduces its applicability as a learning tool. Same as archetypal analysis, prototypal analysis finds prototypes through convex combination of the data points and approximates th…

2017-01-31abs ↗pdf ↗