Search Results for author:
Found 6 papers, 3 papers with code
Inferring the Graph of Networked Dynamical Systems under Partial Observability and Spatially Colored Noise
In a Networked Dynamical System (NDS), each node is a system whose dynamics are coupled with the dynamics of neighboring nodes.
Learning the Causal Structure of Networked Dynamical Systems under Latent Nodes and Structured Noise
To address the challenge of noise correlation and partial observability, we assign to each pair of nodes a feature vector computed from the time series data of observed nodes.
Recovering the Graph Underlying Networked Dynamical Systems under Partial Observability: A Deep Learning Approach
This renders the features amenable to train a variety of classifiers to perform causal inference.
PSO-Convolutional Neural Networks with Heterogeneous Learning Rate
In such framework, the vector of weights of each ConvNet is typically cast as the position of a particle in phase space whereby PSO collaborative dynamics intertwines with Stochastic Gradient Descent (SGD) in order to boost training performance and generalization.
Ranked #39 on
Image Classification
on CIFAR-10
Graph Learning Under Partial Observability
Many optimization, inference and learning tasks can be accomplished efficiently by means of decentralized processing algorithms where the network topology (i. e., the graph) plays a critical role in enabling the interactions among neighboring nodes.
Graph Learning over Partially Observed Diffusion Networks: Role of Degree Concentration
This claim is proved for three matrix estimators: i) the Granger estimator that adapts to the partial observability setting the solution that is exact under full observability ; ii) the one-lag correlation matrix; and iii) the residual estimator based on the difference between two consecutive time samples.
