This research optimizes handover between fog nodes in vehicular IoT using machine learning.
problem Smooth transition of device connections and offloaded tasks between fog nodes in vehicular IoT.
method Proposes a three-layer feed-forward neural network and a dual stacked RNN with LSTM cells to predict fog nodes and minimize service interruption.
result Achieved 99.2% accuracy in predicting fog nodes with a test set.
Fog learning distributes ML model training across heterogeneous devices and networks.
problem Challenges with conventional federated learning in heterogeneous networks.
method Intelligent distribution of ML model training across nodes from edge devices to cloud servers.
result Enhanced federated learning with multi-layer hybrid framework considering network, heterogeneity, and proximity.
Task offloading is an emerging technology in fog-enabled networks. It allows users to transmit tasks to neighbor fog nodes so as to utilize the computing resources of the networks. In this paper, we investigate a stochastic task offloading model and propose a multi-armed bandit framework to formulate this model. We con…
Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s…
Bayesian method predicts runtime metrics for fog manufacturing.
problem Accurate prediction of runtime performance metrics in fog manufacturing.
method Bayesian sparse regression for multivariate mixed responses.
result Enhanced prediction and statistical inferences of runtime metrics.
Paper tackles caching in fog radio access networks using RL.
problem Distributed edge caching in fog radio access networks with fluctuating traffic demands.
method Q-learning framework for optimal caching policy, value function approximation.
result Proposed method outperforms traditional methods in simulations.
Adversarial fog tests autonomous navigation models.
problem Neural networks are fooled by adversarial perturbations, but fog naturally creates similar perturbations.
method Introduced a new type of adversarial perturbation using generative models and Cycle-Consistent Generative Adversarial Networks.
result Generated adversarial fog images help test autonomous navigation models.
The method constructs arbitrage-free option surfaces from noisy quotes using Chebyshev bases and a fog post-fit layer.
problem Constructing arbitrage-free option price surfaces from noisy bid-ask quotes.
method Chebyshev tensor bases, linear sampling, no-arbitrage operators, quadratic objective, OSQP solvers, fog post-fit layer, Hamiltonian energy.
result High inside-spread coverage (98-99%) and low no-arbitrage violations (below 1%) in stable periods, controlled leakage in stressed periods.
Deep RNN detects FoG episodes in Parkinson's disease with high accuracy.
problem Detecting freezing episodes in Parkinson's disease patients.
method Deep Recurrent Neural Network (RNN) with Long Short-Term Memory cells on 3D-accelerometer measurements.
result Frequency domain features from trunk sensor achieve an AUC score of 93% in subject-independent method.
Machine Learning (ML) algorithms, like Convolutional Neural Networks (CNN), Support Vector Machines (SVM), etc. have become widespread and can achieve high statistical performance. However their accuracy decreases significantly in energy-constrained mobile and embedded systems space, where all computations need to be c…
DefogGAN predicts hidden RTS game information to aid strategic decision-making.
problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.
Footfall based biometric system is perhaps the only person identification technique which does not hinder the natural movement of an individual. This is a clear edge over all other biometric systems which require a formidable amount of human intervention and encroach upon an individual's privacy to some extent or the o…
A hybrid neural network optimizes AI deployment on edge and cloud for energy efficiency.
problem Energy and resource constraints in edge devices for deep learning models.
method Conditionally deep hybrid neural network with quantized layers at edge and full-precision layers at cloud.
result Early classification at the edge reduces energy consumption by 5.5x on CIFAR-10 dataset.
Paper proves extended Minkowski Inequality using nonlinear potential theory.
problem Proving an extended Minkowski Inequality for smooth bounded sets.
method Using monotonicity formulas derived from p-capacitary potentials and level set flow. result Stronger conclusions in dimensions n≥8 compared to previous methods. This paper introduces early exits in neural networks for faster inference.
problem Reducing inference time and preventing overfitting in neural networks.
method Designing and training multi-output neural networks with early exits.
result Significant reductions in inference time and improved robustness.
Geometric quantization extended to arbitrary connected spaces using path integration.
problem Constructing a Prequantum Groupoid for arbitrary connected parasymplectic spaces.
method Define a Total Group of Periods and a Prequantum Groupoid with connected isotropy.
result The Prequantum Groupoid Tω is isomorphic to the group of symmetries of the Dynamical System. LUNAR uses cellular automata for real-time data classification in fast streams.
problem Real-time machine learning challenges with fast data streams and concept drift.
method Streamified cellular automata approach for incremental learning and adaptation.
result Competitive performance in classification compared to established online learning methods.
Compositional Network Embedding learns node embeddings from node features.
problem Cold-start problem and lack of robustness to noise in existing network embedding methods.
method Generative framework that combines node attribute embeddings through a graph-based loss.
result Effectiveness and generalization of compositional network embeddings, especially on unseen nodes.
LC-GNN improves GNNs for node classification by incorporating label consistency.
problem Limited performance of GNNs due to label consistency assumption not always holding.
method LC-GNN uses node pairs with the same label but unconnected to expand GNN's receptive field.
result LC-GNN outperforms traditional GNNs in semi-supervised node classification.
Paper introduces Deep Node Ranking for efficient node classification and embedding.
problem Efficient node classification and embedding in complex networks.
method Autoencoder-based neural network architecture with node ranking scheme.
result Competitive or better classification performance, higher speed, and lower space requirements.
SENSE enhances node sequences in graphs using vector embeddings.
problem Efficiently capturing graph node sequences for applications.
method SENSE-S learns node embeddings and composes them for sequences, preserving node order.
result SENSE-S increases multi-label classification and link-prediction accuracy by up to 50% and 78% respectively.
Generates missing node attributes for better graph-based tasks.
problem Missing or incomplete node attributes degrade graph-based algorithms' performance.
method Deep adversarial learning-based method (NANG) to generate node attributes.
result Generated node attributes improve node classification and link prediction.
Proposes GIL for semi-supervised graph classification.
problem Semi-supervised classification of graph data with limited labeled nodes.
method Graph Inference Learning framework that learns node label inference from graph topology.
result Significantly improves semi-supervised node classification performance.
P-GNNs learn node embeddings considering node positions in graphs.
problem Capturing node positions in graph structures.
method Samples anchor nodes, computes distances, and learns weighted aggregation.
result P-GNNs outperform state-of-the-art GNNs in link prediction and community detection.
Embedding graph nodes into a vector space can allow the use of machine learning to e.g. predict node classes, but the study of node embedding algorithms is immature compared to the natural language processing field because of a diverse nature of graphs. We examine the performance of node embedding algorithms with respe…
CADE learns dual node representations for better generalization.
problem Transductive graph embeddings cannot generalize to unseen nodes or across different graphs.
method CADE combines real-time neighborhoods with neighbor-attentioned representation, preserving known node memory.
result CADE outperforms state-of-the-art methods in generalization and context-awareness.
This paper explores deep reinforcement learning for IoT autonomy.
problem Autonomous control of IoT devices without human intervention.
method Deep reinforcement learning applied to IoT systems.
result A comprehensive survey of DRL applications in AIoT.
SANNE model generates embeddings for unseen nodes in graph networks.
problem Lack of embeddings for unseen nodes in graph networks.
method SANNE uses a transformer self-attention network to generate embeddings.
result SANNE achieves state-of-the-art results for node classification.
Study finds significant instability in node embeddings due to randomness.
problem Stability of node embeddings under random variations.
method Evaluated five node embedding algorithms (HOPE, LINE, node2vec, SDNE, GraphSAGE) on synthetic and empirical graphs.
result Significant instability in embedding spaces and downstream task accuracy.
Proposes ML-GCN for multi-label network node representation learning.
problem Complex multi-label networks with correlated labels.
method Two Siamese GCNs model node-label and label-label interactions, integrated under a unified objective function.
result Effective node representation learning with preserved label interactions.
CatGCN improves GCNs by modeling feature interactions for categorical node features.
problem Suboptimal initial node representations in GCNs due to lack of feature interaction modeling.
method Integrates explicit interaction modeling (local and global) into initial node representation learning for categorical node features.
result CatGCN enhances initial node representations through feature interaction modeling, leading to improved model performance.
HighwayGraph models long-distance node relations in GNNs with improved performance.
problem Limited-layer information propagation in GNNs hinders long-distance node relation modeling.
method Proposes two solutions: implicit and explicit modeling of long-distance node relations using shallow GNN architectures and a self-training framework.
result HighwayGraph achieves consistent and significant improvements over four GNNs on three benchmark datasets.
This paper studies node embeddings of networks, revealing their geometric properties.
problem Understanding the geometric properties of node embeddings in random networks.
method Characterization of ergodic limits, generalization, and convex relaxations of random walk node embedding objectives.
result The optimal node embedding Grammians have rank 1 for a nuclear norm relaxation of the non-randomized objective.
A new method improves node classification in graphs with limited labels.
problem Semi-supervised multi-label node classification in attributed graphs.
method Collaborative Graph Walk (Multi-Label-Graph-Walk) using reinforcement learning.
result Significantly better multi-label classification performance compared to state-of-the-art methods.
Vanishing nodes cause hidden nodes to behave similarly, complicating deep neural network training.
problem Complicating deep neural network training due to hidden nodes behaving similarly.
method Introduced vanishing node indicator (VNI) to quantify node redundancy and correlated behavior.
result The effective number of nodes vanishes to one as VNI increases, indicating a challenging training scenario.
Paper proves impossibility of three desirable properties in node embedding.
problem Understanding limitations of node embedding methods.
method Axiomatic approach to node embedding, proving impossibility of three properties.
result No node embedding method can satisfy all three desirable properties simultaneously.
ARGEW improves node embeddings for weighted homophilous graphs by emphasizing strong edge weights.
problem Lack of accurate node embeddings for weighted homophilous graphs.
method ARGEW (Augmentation of Random walks by Graph Edge Weights) augments random walks by emphasizing nodes with larger edge weights.
result ARGEW produces embeddings where node pairs with strong edge weights have closer embeddings.
GraphCL learns node representations by maximizing similarity between perturbed node features.
problem Learning node representations in graph data without labeled data.
method Contrastive learning of node embeddings using graph neural networks and a loss function.
result Significantly outperforms state-of-the-art in unsupervised node classification benchmarks.
H-GCN enhances GCNs by pooling nodes to hyper-nodes for better global information.
problem Limited global information in shallow GCNs for semi-supervised node classification.
method Hierarchical graph pooling and refinement of coarsened graphs.
result H-GCN outperforms state-of-the-art methods on various graph datasets.
SPARC tackles cold-start nodes in graphs by using spectral embeddings.
problem Cold-start nodes in graphs lacking initial connections.
method Introduces SPARC, a framework utilizing spectral embeddings to predict on cold-start nodes.
result SPARC outperforms existing models on cold-start nodes across tasks.
SIGNNAP learns stable and identifiable node representations in GNNs against graph perturbations.
problem Fragility of GNN models to graph perturbations leading to unreliable node representations.
method SIGNNAP proposes a novel model that learns stable and identifiable node representations in an unsupervised manner, formalizing stability and identifiability through a contrastive objective and preserving smoothness with existing GNN backbones.
result SIGNNAP demonstrates effectiveness in learning stable and identifiable node representations in GNNs against graph perturbations on six benchmarks.
PanRep learns universal node embeddings for heterogeneous graphs.
problem Learning universal node embeddings for heterogeneous graphs.
method Graph Neural Network (GNN) model with four decoders capturing different properties.
result PanRep outperforms unsupervised and supervised methods in node classification and link prediction.
A new method improves graph node embeddings by considering both nearby and distant node similarities.
problem Improving graph node embeddings by considering both nearby and distant node similarities.
method Distance-aware Negative Sampling (DNS) which maximizes cohesion at nearby node-pairs and separation at distant node-pairs.
result DNS outperforms baseline methods in downstream node classification tasks on various datasets and GRL algorithms.
Proposes an alternative approach to propagate labels in GCNs using network diffusion and clustering.
problem Challenges of training GCNs with limited labeled data and bias in network diffusion methods.
method Clustering nodes into communities, using diffusion to quantify proximity, and comparing topological profiles.
result Identifies nodes most similar to labeled nodes, improving label propagation in GCNs.
Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches …
FONDUE identifies ambiguous nodes in networks for better analysis.
problem Ambiguous nodes in network data.
method Network embedding for node disambiguation.
result FONDUE outperforms existing methods in ambiguous node identification.
TuneUp improves GNN training by focusing on hard-to-learn nodes.
problem Sub-optimal training of GNNs on all nodes equally.
method Two-stage training: base GNN + tail node improvement.
result Significant improvement in tail node prediction performance.
Proposes active learning for meta-learning in graph node response prediction.
problem Difficulty in improving performance with meta-learning due to unbalanced observations.
method Combines graph convolutional neural networks and reinforcement learning for both prediction and node selection.
result Can predict responses and select nodes even for unseen response variables.