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.
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.
Optimizes task offloading in fog networks with limited feedback.
problem Optimizing task offloading in fog networks with limited feedback.
method Multi-armed bandit framework and UCB-type algorithm.
result Maximizes long-term happiness metric in task offloading.
FoG RF achieves high accuracy with low energy consumption.
problem Energy efficiency in ML algorithms for constrained systems.
method Field of Groves (FoG) implementation of random forests.
result FoG RF achieves comparable accuracy to CNNs and SVMs with significantly lower energy consumption.
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.
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.
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.
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.
Paper proposes an algorithm to minimize long-term latency in task offloading.
problem Minimizing long-term latency in task offloading.
method Formulated a stochastic programming problem and proposed an algorithm for non-stationary bandit model.
result Proved asymptotic optimality of the proposed algorithm in a non-stationary fog-enabled network.
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.
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 presents a biometric system using footfalls for person identification.
problem Natural movement and privacy concerns in biometric systems.
method Fog computing architecture with geophones and data compression.
result Achieved high accuracy (73-95%) in person identification.
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.
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.
SparseIDS uses RL to significantly reduce packet inspection in IDSs.
problem Efficiently inspecting large volumes of network packets for security threats.
method SparseIDS employs RL to learn optimal packet sampling strategies.
result SparseIDS reduces packet inspection by more than 75% while maintaining high accuracy.
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. Optimizes QoS in FSO links over South Africa using ensemble learning.
problem Impact of weather on QoS in FSO links.
method Ensemble learning models (Random Forest, ADaBoost Regression, Stacking Regression, Gradient Boost Regression, Multilayer Neural Network) applied to meteorological data.
result Significant enhancement in QoS with RMSE and R-squared values of 0.0032 and 0.9906 respectively at George.
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. 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.
New framework tackles deep financial reporting bottleneck by improving hallucination and coherence.
problem Statistical smoothing trap in LLMs limits deep financial reporting quality.
method DeepNews Framework integrates information foraging, schema-guided planning, and adversarial prompting.
result DeepNews system achieves 25% acceptance rate in blind test, significantly outperforming SOTA.
Survey on deep learning for social network analysis.
problem Encoding social network data into useful low-dimensional representations.
method Review of neural network models for node and subgraph embeddings in various network types.
result Advancements in deep learning for complex network analysis.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
New model reconstructs networks by identifying regular components.
problem Uncovering the complexity of network structures.
method Low-rank pursuit based self-representation network model.
result Reconstructs networks and measures their regulability.
Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
DCNs mimic neuronal networks for improved neural classification.
problem Lack of topological similarity between DNNs and biological neural networks.
method Developed DCNs with topologies inspired by real-world neuronal networks.
result High classification accuracy achieved by DCNs.
Study 986 diverse networks to reveal structural diversity across domains.
problem Understanding structural diversity in networks across various domains.
method Machine learning techniques (random forest, confusion matrix) on 986 real-world networks and 575 generated networks.
result Networks in the same partition have similar underlying functions, constraints, and generative mechanisms, regardless of their origins.
Network recasting transforms network architecture for faster inference.
problem Accelerate inference process through network transformation.
method Block-wise recasting of source blocks in a teacher network to target blocks in a student network.
result Transforms network architecture while preserving accuracy and reducing inference time.
Highly accurate classification of network categories achieved.
problem Distinguishing between different types of networks (e.g., social vs. web graphs).
method Used a random forest classifier on both real-world and synthetic networks.
result Achieved a 94.2% classification accuracy.
Network Lens identifies node behaviors in heterogeneous networks with high accuracy.
problem Identifying different behaviors in various parts of large heterogeneous networks.
method Zoom into network using different-sized lenses to capture local structure, weight signatures to predict node labels.
result Achieved a peak accuracy of ~42% on two networks with ~100,000 and ~1,000,000 nodes, significantly better than random.
DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
problem Vulnerability of capsule networks to adversarial attacks.
method Compared capsule networks to convolutional neural networks using various adversarial attacks.
result Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Deep ReLU networks can be simplified to a three-layer model.
problem Understanding the behavior of deep neural networks.
method Constructive proof and algorithm to transform deep networks into shallow ones.
result Deep ReLU networks can be represented by a simpler three-layer structure.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
Paper proposes algorithms for embedding directed networks with text associated nodes.
problem Learning embeddings for directed networks with text associated nodes.
method PCTADW-1 and PCTADW-2 neural network algorithms.
result Embeddings improve node classification quality on software package dependency networks.
Network embedding helps predict speed limits on incomplete Danish road network.
problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.
New method identifies common organizational principles in networks.
problem Challenging to cluster networks of different size and density.
method Introduces a new network comparison methodology.
result Identifies common organizational principles in networks.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.
New approach learns latent motifs in networks for mesoscale structure analysis.
problem Understanding large-scale behavior in complex systems through mesoscale structures.
method Network dictionary learning (NDL) combining network sampling and nonnegative matrix factorization.
result Networks can be approximated using a small set of latent motifs.
The paper surveys network methods for understanding economic and financial systems.
problem Understanding interconnectedness among economic and financial entities.
method Survey of network theory, measures, and structures for economic and financial networks.
result Network methods provide tools to quantify structural properties of economic systems.
Researchers develop a method to count and analyze motifs in temporal networks.
problem Understanding the role of network motifs in temporal networks.
method Developed a notion of temporal network motifs and designed fast algorithms for counting them.
result Different motifs occur at different time scales, providing insights into temporal network structure and function.
Paper links network Lasso to network flow optimization.
problem Joint clustering and optimization of networked data.
method Exploration of duality between network Lasso and network flow optimization.
result nLasso is equivalent to a minimum-cost flow problem on the data network structure.
SyNGLER generates synthetic networks efficiently while preserving key structural properties.
problem Efficiently generating realistic synthetic networks with preserved structural properties.
method SyNGLER uses latent space network models to learn and reconstruct node embeddings, then generates synthetic networks.
result SyNGLER produces synthetic networks that better preserve key network characteristics than existing approaches.
Taking inspiration from biological evolution, we explore the idea of "Can deep neural networks evolve naturally over successive generations into highly efficient deep neural networks?" by introducing the notion of synthesizing new highly efficient, yet powerful deep neural networks over successive generations via an ev…
Paper introduces method to make neural networks symmetrical.
problem Creating symmetrical neural networks for data with inherent symmetries.
method Introduces a method for modifying neural networks to enforce equivariance.
result Group convolutional neural networks are a special case of the introduced framework.
Deep networks better approximate functions with compositional structure.
problem Approximating functions with complex structures.
method Design deep networks with compositional structure, leveraging the blessing of compositionality.
result Deep networks can approximate functions better than shallow networks when the function has a compositional structure.