We apply network Lasso to semi-supervised regression problems involving network structured data. This approach lends quite naturally to highly scalable learning algorithms in the form of message passing over an empirical graph which represents the network structure of the data. By using a simple non-parametric regressi…
Study analyzes Echo State Network parameters for Rossler attractor dynamics.
problem Understanding the influence of network type on Echo State Network performance.
method Experimental analysis of Echo State Network parameters using Rossler attractor.
result Exploration of how network type affects Echo State Network performance.
Sobol method applied to probabilistic networks for sensitivity analysis.
problem Measuring influence of probabilistic network nodes on a quantity of interest.
method Transforms global sensitivity analysis into marginalization inference exploiting network structure.
result Efficient computation of sensitivity indices for complex networks.
Develops rMultiNet R package for multilayer network analysis.
problem Analyzing multilayer network data.
method Two frameworks: MMSBM and MMLSM for generating multilayer networks; methods for node and layer embedding; clustering.
result Provides tools for multilayer network analysis.
Network analysis improves stock return forecasting.
problem Improving stock return forecasting using network properties.
method Network analysis of stock return correlations, using individual and global properties of stocks.
result 50% improvement in R2 score for long-term stock returns forecasting, 3% for short-term.
i-cNRL learns network differences with interpretability.
problem Comparing unique network characteristics.
method Contrastive network representation learning (cNRL) integrating machine learning schemes.
result i-cNRL reveals unique network patterns with interpretability.
Unified platform SOCRATES for neural network analysis.
problem Analyzing neural networks for bugs and fairness.
method Standardized format, assertion language, and multiple analysis algorithms.
result Unified platform for neural network analysis.
This paper surveys some recent developments in fundamental limits and optimal algorithms for network analysis. We focus on minimax optimal rates in three fundamental problems of network analysis: graphon estimation, community detection, and hypothesis testing. For each problem, we review state-of-the-art results in the…
Study disrupts Sicilian Mafia networks using data analysis.
problem Challenges in disrupting resilient criminal networks.
method Social Network Analysis methods applied to real-world datasets.
result Neutralizing only 5% of affiliates can disrupt network connectivity by 70%.
The study examines network analysis for predicting stock market performance.
problem Understanding lead-lag relationships in the NYSE.
method Network analysis of the NYSE to identify lead-lag effects.
result Network analysis reveals valuable insights for investors and analysts.
New method improves blockchain analysis by handling temporal changes and scalability.
problem Limited focus on evolving nature and scalability of blockchain transaction networks.
method Incremental approach with Metropolis-Hastings random walks.
result Comparable performance in node classification tasks with reduced computational overhead.
New method combines FMEA and Bayesian Network for root cause analysis in lithium-ion battery production.
problem Complex cause-effect relationships in lithium-ion battery production.
method Combining FMEA with Bayesian Network to detect and resolve inconsistencies.
result Holistic method builds large-scale cross-process Bayesian Failure Network for root cause analysis.
Metaparametric neural networks improve survival analysis without prior knowledge.
problem Current neural networks restrict survival analysis to pre-determined times and fixed function shapes.
method Metaparametric neural network framework that extends existing methods to estimate generic functions.
result Metaparametric neural networks outperform state-of-the-art methods in capturing nonlinearities and identifying temporal patterns.
This work analyzes how different layers in deep neural networks contribute to generalization error.
problem Understanding the role of each layer in deep neural networks for generalization.
method Spectral analysis, Neural Tangent Kernel, Hermite polynomials, Spherical Harmonics.
result Initial layers in deep neural networks have a larger bias towards high-frequency functions.
The paper analyzes a neural network two-sample test using kernel analysis.
problem Determining if two datasets come from the same distribution.
method Time-analysis on a neural tangent kernel (NTK) two-sample test, extending to realistic neural network dynamics.
result Training times needed to detect deviations are well-separated in null and alternative hypothesis scenarios.
This paper creates a comprehensive BTC transaction network dataset spanning 15 years.
problem Lack of a full-history BTC graph and network property dataset.
method Thorough analysis of BTC transaction network, creating a dataset and investigating decentralization.
result First systematic investigation of BTC's asset decentralization and design of decentralization degrees.
We discuss social network analysis from the perspective of economics. We organize the presentaion around the theme of externalities: the effects that one's behavior has on others' well-being. Externalities underlie the interdependencies that make networks interesting. We discuss network formation, as well as interactio…
Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with minor adversarial or even accidental perturbations. Consequences of such errors can …
Improved stability analysis of neural network systems using Zames-Falb multipliers.
problem Analyzing stability of linear systems with neural network nonlinearities.
method Using integral quadratic constraints, sector-bounded and slope-restricted structure, and acausal Zames-Falb multipliers.
result Flexible and versatile framework for stability analysis with improved computational efficiency.
A new method uses physics-informed neural networks to solve reliability analysis problems without simulations.
problem Solving reliability analysis problems without the need for expensive simulations.
method Physics-informed neural networks to learn directly from problem physics.
result Eliminates the need for expensive simulations and achieves highly accurate results.
There is often latent network structure in spatial and temporal data and the tools of network analysis can yield fascinating insights into such data. In this paper, we develop a nonparametric method for network reconstruction from spatiotemporal data sets using multivariate Hawkes processes. In contrast to prior work o…
Complex network analysis reveals dominant stocks in financial stock returns correlations.
problem Inferring financial stock returns correlations from complex network analysis.
method Simulated geometric Brownian motion for stocks, complex network analysis, eigenvector centrality, clustering.
result Returns correlation matrix is dominated by stocks with high eigenvector centrality and clustering.
We derive a novel sensitivity analysis of input variables for predictive epistemic and aleatoric uncertainty. We use Bayesian neural networks with latent variables as a model class and illustrate the usefulness of our sensitivity analysis on real-world datasets. Our method increases the interpretability of complex blac…
Qualitative analysis of MC dropout for NN model uncertainty.
problem Measuring uncertainty in neural network models.
method Mathematical formulation of Monte Carlo dropout and its benefits/costs in NN models.
result Potential benefits and associated costs of using MC dropout in NN models.
This study uses persistent homology to analyze complex transitional networks from time series data.
problem Lack of effective tools to summarize complex topology in transitional networks.
method Persistent homology from topological data analysis applied to coarse-grained state-space networks (CGSSN).
result CGSSN improves dynamic state detection and noise robustness compared to other methods.
Generalizes neural tangent kernel analysis for two-layer networks with noise and regularization.
problem Limitations of NTK analysis in deep learning practice.
method Generalized NTK analysis for two-layer neural networks with weight decay and gradient noise.
result Noisy gradient descent with weight decay exhibits 'kernel-like' behavior and converges linearly.
Package provides sensitivity analysis for neural networks.
problem Understanding how input variables affect neural network predictions.
method Partial derivatives method to calculate sensitivities.
result Allows evaluation of variable importance and input-output relationships.
We develop a neural network model to classify liver cancer patients into high-risk and low-risk groups using genomic data. Our approach provides a novel technique to classify big data sets using neural network models. We preprocess the data before training the neural network models. We first expand the data using wavel…
This study analyzes cryptocurrency market crashes using complex network analysis.
problem Identifying and understanding dynamics of cryptocurrency market crashes.
method Complex network analysis of cryptocurrency market during pre-crash, crash, and post-crash periods.
result Network density and clustering coefficient spike during crashes, indicating uninformed panic sell-off.
Paper analyzes sample complexity of polynomial neural networks.
problem Understanding the sample complexity of polynomial neural networks.
method Extends previous literature to polynomial neural networks and analyzes sample complexity.
result Obtains novel results on sample complexity of polynomial neural networks.
New method embeds correlation networks to reveal underlying time series patterns.
problem Analyzing correlation networks derived from time series data.
method Spectral embedding of noisy correlation networks, leveraging Fourier basis elements.
result Spectral embedding recovers true vertex-level latent representations under suitable assumptions.
Networks play a central role in modern data analysis, enabling us to reason about systems by studying the relationships between their parts. Most often in network analysis, the edges are given. However, in many systems it is difficult or impossible to measure the network directly. Examples of latent networks include ec…
Improved survival analysis using square root Cox's models and neural networks.
problem Feature selection in survival analysis.
method Square root Cox's survival analysis by the fittest linear and neural networks model, directly tuning penalty parameter λ.
result Substantially improved over traditional methods, achieving phase transition in feature selection.
VAEs analyzed using harmonic analysis, showing how variance controls frequency content and robustness.
problem Understanding and optimizing VAEs for robustness and frequency control.
method Viewing VAE latent space as Gaussian space, deriving results on variance and frequency content, and demonstrating soft Lipschitz constraints.
result Increasing encoder variance reduces high frequency content and improves adversarial robustness.
RTFN extracts robust temporal features for time series analysis.
problem Challenges in extracting sufficient shapelets from time series data.
method Combines temporal feature networks and attentional LSTM networks.
result RTFN outperforms in supervised and unsupervised time series analysis.
This paper analyzes convergence of FL for neural networks using NTK.
problem Theoretical guarantees of FL for neural networks with explicit forms and multi-step updates are unexplored.
method FL-NTK framework for federated learning of ReLU neural networks trained by gradient descent.
result FL-NTK converges to a global-optimal solution at a linear rate with proper learning parameters.
H-GAT improves stock selection by capturing complex higher-order stock relations and integrating both technical and fundamental analysis.
problem Stock selection difficulty and lack of comprehensive analysis.
method Higher-order Graph Attention Network (H-GAT) that incorporates both technical and fundamental analysis.
result H-GAT outperforms existing methods in stock selection metrics.
Paper introduces a core-periphery model for identifying informative network structures.
problem Noise and bias in non-informative periphery structures obscure the informative core in complex networks.
method Spectral algorithms for core identification as a preprocessing step for network analysis.
result The proposed method outperforms traditional core-periphery methods in various downstream tasks.
A new method selects features for ERGMs to improve network modeling.
problem ERGM degeneracy creates unrealistic network structures.
method Stochastic step-wise feature selection to overcome computational burden and improve network accommodation.
result Enhanced ERGM modeling with more accurate interpretations.
New KNN test improves association analysis of high-dimensional sequencing data.
problem Challenges in using neural networks for high-dimensional sequencing data analysis.
method Kernel-based neural network (KNN) test for complex association analysis.
result KNN test outperforms SKAT in detecting non-linear and interaction effects.
Neural networks trained with actor-critic algorithms converge to ODEs under weak convergence analysis.
problem Challenges in convergence analysis due to changing data distributions in online learning.
method Geometric ergodicity of data samples, Poisson equation, weak convergence techniques.
result Actor and critic networks converge to solutions of ODEs with random initial conditions.
Water pollution is a major global environmental problem, and it poses a great environmental risk to public health and biological diversity. This work is motivated by assessing the potential environmental threat of coal mining through increased sulfate concentrations in river networks, which do not belong to any simple …
Method analyzes hyperparameters using HSIC for better neural network performance.
problem Complex hyperparameter spaces in deep learning.
method Goal-oriented sensitivity analysis using HSIC.
result Robust analysis index quantifies hyperparameters' impact.
Derives a biologically plausible neural network for Slow Feature Analysis.
problem Learning latent features from time series data.
method Starting from an SFA objective, derives Bio-SFA with a biologically plausible neural network implementation.
result Validates Bio-SFA on naturalistic stimuli, reproducing interesting properties of brain cells.
Proposes QGC to distinguish between lower and upper tail connectivity in financial networks.
problem Identifying systemically important firms using financial data.
method Quantile Granger Causality (QGC) using Lasso penalized quantile regressions.
result QGC networks detect systemic risk more accurately than mean-based networks.
New method solves PDEs on spheres using physics-informed convolutional neural networks.
problem Solving PDEs on surfaces, especially spheres, with high accuracy and efficiency.
method Physics-informed convolutional neural networks (PICNN) with theoretical analysis and approximation results.
result Established fast convergence rates for PICNN solving PDEs on spheres.
Network analysis improves risk assessment for surety bonds.
problem Network effects in surety bonds increase risk assessment complexity.
method Modelled contractor network as directed graph, extended Friedkin-Johnsen model with stochastic process.
result Network effects increase average risk for surety organizations.
Paper studies the theoretical equivalence between implicit and explicit neural networks in high dimensions.
problem Lack of theoretical analysis of implicit and explicit neural networks.
method Examined high-dimensional implicit neural networks and established their equivalence to explicit networks.
result Equivalence between implicit and explicit neural networks in high dimensions.