This paper improves dependency networks using information geometry.
problem Technical disadvantage in dependency networks' learned distribution.
method Interpret pseudo-Gibbs sampling as iterative m-projections onto manifolds.
result Dependency networks can learn faster and have similar performance to Bayesian networks.
Study examines dependence properties of Bayesian neural network units in finite-width networks.
problem Understanding dependence properties of hidden units in practical finite-width Bayesian neural networks.
method Theoretical analysis and empirical evaluation of depth and width impacts.
result Hidden units in finite-width Bayesian neural networks are dependent, contrary to the infinite-width limit assumption.
The paper develops a deep neural network estimator for weakly dependent processes with various loss functions.
problem Learning weakly dependent processes with a broad class of loss functions.
method Sparse-penalized deep neural networks with ψ-weak dependence structure and θ∞-coefficients. result Oracle inequalities for the excess risk of the sparse-penalized deep neural networks estimators.
The paper bounds the excess risk of deep neural networks for weakly dependent processes.
problem Learning with weakly dependent data using deep neural networks.
method Approximation of smooth functions by deep neural networks and a bound on excess risk.
result The excess risk bound for deep learning under weak dependence is close to O(n−1/2) for sufficiently smooth functions. Generalizes memory and forecasting capacities for nonlinear recurrent networks with dependent inputs.
problem Understanding memory and forecasting capabilities in networks with dependent inputs.
method Formulated bounds for memory and forecasting capacities in terms of network size and input properties.
result Proved that memory capacity for linear recurrent networks with independent inputs is given by the rank of the controllability matrix.
Sparse-penalized deep neural networks improve performance in weakly dependent processes.
problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.
Estimates binary labels from dependent data using Markov Random Fields.
problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.
A deep learning model for traffic forecasting in telecommunication networks.
problem Complex spatial-temporal dependency in traffic forecasting.
method Spatio-Temporal Hybrid Graph Convolutional Network (STHGCN) combining GRUs and hybrid-GCN.
result The proposed model outperforms classical and state-of-the-art methods.
Oddnet detects anomalies in dynamic networks using time series methods.
problem Detecting anomalies in temporal networks (e.g., transport, social networks).
method Feature-based network anomaly detection using time series methods.
result Demonstrated effectiveness on synthetic and real-world datasets.
Bayesian networks learn sub-population differences from data.
problem Inference from a single network structure can be misleading when data populations are heterogeneous.
method A mixture of Bayesian networks where component probabilities depend on individual characteristics.
result Identifies both network structures and demographic predictors of sub-population membership.
Graph attention network improves MLTC by capturing label dependencies.
problem Ignoring label dependencies in MLTC tasks.
method Graph attention network model that captures label dependencies.
result The model achieves similar or better performance than state-of-the-art models.
Study on identifying and inferring nonlinear dynamics on unknown networks.
problem Identifying network structure in nonlinear dynamic systems with unknown interactions.
method Showed network structure is not generically identified, requiring sufficient spectral heterogeneity. Developed necessary and sufficient conditions for identification and proposed a semiparametric estimator.
result Necessary and sufficient conditions for identification of network structure in nonlinear dynamic systems.
Neural network method estimates covariate-dependent graphical models with statistical guarantees.
problem Estimating graph structure from covariate-dependent data.
method Neural network approach that allows flexible functional dependency on covariates.
result Theoretical PAC guarantees for the method's performance.
Review of financial dependencies using econophysics and financial economics.
problem Analyzing financial dependencies between markets.
method Combining econophysics and financial economics approaches to model financial markets.
result Information filtering networks effectively describe financial dependencies.
Graphical models have gained a lot of attention recently as a tool for learning and representing dependencies among variables in multivariate data. Often, domain scientists are looking specifically for differences among the dependency networks of different conditions or populations (e.g. differences between regulatory …
New model for clustering dependent community Hawkes processes in temporal networks.
problem Modeling strong dependence and community structure in temporal networks.
method Dependent Community Hawkes (DCH) models combining stochastic block models and Hawkes processes.
result Spectral clustering error bound derived for DCH models.
A new framework predicts links in time-dependent networks using Bernoulli autoregression.
problem Predicting links in time-dependent networks with additional auxiliary information.
method A Bernoulli autoregressive model with regularization for link discovery.
result The model can discover new links not present in the data.
Can engineering neural networks be approached in a disciplined way similar to how engineers build software for civil aircraft? We present nn-dependability-kit, an open-source toolbox to support safety engineering of neural networks for autonomous driving systems. The rationale behind nn-dependability-kit is to consider…
Deep neural nets can estimate regression with dependent data without the curse of dimensionality.
problem Regression with dependent data and structural assumptions on the regression function.
method Deep recurrent neural network estimate under suitable structural assumptions.
result Deep neural nets can circumvent the curse of dimensionality for regression with dependent data.
Deep neural nets learn from weakly dependent processes.
problem Learning from ψ-weakly dependent processes. method Deep neural networks for ψ-weakly dependent processes. result Established consistency of empirical risk minimization algorithm and generalization bound.
Classical causal and statistical inference methods typically assume the observed data consists of independent realizations. However, in many applications this assumption is inappropriate due to a network of dependences between units in the data. Methods for estimating causal effects have been developed in the setting w…
Unified framework DDNs for multi-label classification, improving inference efficiency.
problem Efficient inference for multi-label classification with dependency networks.
method Combining dependency networks and deep learning, proposing novel inference schemes.
result Novel inference schemes outperform basic neural architectures and Markov networks.
A network embedding consists of a vector representation for each node in the network. Its usefulness has been shown in many real-world application domains, such as social networks and web networks. Directed networks with text associated with each node, such as software package dependency networks, are commonplace. Howe…
Improved GNN handles long-range dependencies in multi-relational graphs.
problem Vanishing gradients in GNNs for multi-relational graphs.
method Proposes a Gated Graph Neural Network with improved long-range dependency handling.
result Outperforms popular GNN models in synthetic tasks.
New neural model processes 2D data with long-range dependencies efficiently.
problem Limited receptive field of convolutions for complex 2D tasks.
method Proposes Matrix Shuffle-Exchange network with O(logn) layers and O(n2logn) complexity. result Exceeds convolutional and graph neural network baselines in long-range dependency modeling.
Predicts financial asset dependencies using spatiotemporal patterns.
problem Complex dependency structures in financial assets for risk mitigation.
method Proposes Asset Dependency Matrix (ADM) and Asset Dependency Neural Network (ADNN) with ConvLSTM for spatiotemporal asset dependency prediction.
result ADNN outperforms baselines in predicting asset dependencies and their applications.
The paper analyzes cryptocurrency trading networks using pairwise and high-order dependencies.
problem Understanding information flows and dependencies in cryptocurrency markets.
method Defined a cryptocurrency trading network using weekly log returns, analyzed using Granger causality and O-information.
result High-order dependencies reveal that stable coins play a major role in high-order effects.
The standard linear and logistic regression models assume that the response variables are independent, but share the same linear relationship to their corresponding vectors of covariates. The assumption that the response variables are independent is, however, too strong. In many applications, these responses are collec…
Neural networks learn task-specific features, influenced by nonlinearity.
problem Understanding the nature of task-dependent feature learning in neural networks.
method Investigation of fully-connected, wide neural networks using Bayesian framework.
result The nature of internal representations depends on neuronal nonlinearity, leading to analog, redundant, or sparse coding schemes.
New method constructs multilayer networks from financial data, capturing dependencies across different risk factors.
problem Difficult construction of multilayer networks, neglecting time delays and interdependencies.
method Tucker tensor autoregression for direct multilayer network construction.
result Captures within and between connections, identifies strong interconnections between volumes and prices layers.
Theoretical analysis of deep neural networks for time series data.
problem Theoretical development for deep neural networks on temporally dependent observations is lacking.
method Established non-asymptotic bounds for prediction error of deep neural networks under mixing-type assumptions.
result Deep neural networks can model non-linear time series data with additional logarithmic factors due to dependence.
A2-SBNN models spatial data with copulas for non-Gaussian dependencies.
problem Capturing complex spatial relationships and extreme dependencies in non-Gaussian data.
method Embedding A2 copula into a Bayesian neural network, trained with Wasserstein loss and moment matching.
result A2-SBNN consistently delivers high accuracy across various dependency strengths.
Existing Rademacher complexity bounds for neural networks rely only on norm control of the weight matrices and depend exponentially on depth via a product of the matrix norms. Lower bounds show that this exponential dependence on depth is unavoidable when no additional properties of the training data are considered. We…
A new model integrates LSTM and copulas for high-dimensional financial data.
problem Modeling high-dimensional dependencies across financial markets.
method Variational LSTM with regular vine copulas.
result Outperforms benchmarks in cross-market portfolio forecasting.
Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.
problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.
Node centrality is one of the most important and widely used concepts in the study of complex networks. Here, we extend the paradigm of node centrality in financial and economic networks to consider the changes of node "importance" produced not only by the variation of the topology of the system but also as a consequen…
Paper analyzes deep neural networks with dependent data, establishing convergence rates and error bounds.
problem Statistical analysis of deep neural networks under dependent data.
method Establishes rates of convergence and L2-error bounds for nonparametric sieve estimators of DNNs. result Non-asymptotic probability bounds on L2-errors for DNN estimators under stationary β-mixing data. Representation learning on networks offers a powerful alternative to the oft painstaking process of manual feature engineering, and as a result, has enjoyed considerable success in recent years. However, all the existing representation learning methods are based on the first-order network (FON), that is, the network th…
This paper presents theory for Normalized Random Measures (NRMs), Normalized Generalized Gammas (NGGs), a particular kind of NRM, and Dependent Hierarchical NRMs which allow networks of dependent NRMs to be analysed. These have been used, for instance, for time-dependent topic modelling. In this paper, we first introdu…
Quaternion neural networks improve distant speech recognition.
problem Challenges in distant speech recognition due to noise and reverberation.
method Quaternion neural networks process multi-channel audio signals as quaternion entities, capturing internal and external dependencies.
result QLSTM outperforms real-valued LSTM on multi-channel distant speech recognition tasks.
We propose here a multiplex network approach to investigate simultaneously different types of dependency in complex data sets. In particular, we consider multiplex networks made of four layers corresponding respectively to linear, non-linear, tail, and partial correlations among a set of financial time series. We const…
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.
Proposes a deep network for multi-class classification using spectral training and Gaussian kernel.
problem Multi-class classification with deep networks.
method Spectral training with linear weights and Gaussian kernel activation, constrained on Stiefel Manifold.
result Theoretical guarantee of global optimum and insight into network generalization.
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
Generative neural networks model multivariate time series data.
problem Modeling cross-sectional dependence in multivariate time series data.
method ARMA-GARCH for serial dependence, PCA for dimensionality reduction, GMMN for cross-sectional dependence.
result GMMN-GARCH approach produces better predictive distributions and probabilistic forecasts.
New bound for neural nets on non-iid data.
problem Generalization of deep nets for dependent data.
method Establishes a generalization bound for feed-forward neural networks on φ-mixing data. result Proves neural nets can generalize well on non-iid data.
Accurate and real-time traffic forecasting plays an important role in the Intelligent Traffic System and is of great significance for urban traffic planning, traffic management, and traffic control. However, traffic forecasting has always been considered an open scientific issue, owing to the constraints of urban road …
Enhances social spam detection using multi-level dependency of relational sequences.
problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.