Economic systems, traditionally analyzed as almost independent national systems, are increasingly connected on a global scale. Only recently becoming available, the World Input-Output Database (WIOD) is one of the first efforts to construct the multi-regional input-output (MRIO) tables at the global level. By viewing t…
Modeling economic network evolution using Markov chains.
problem Analyzing the evolving world economic network.
method Finite Markov chains analysis of the world input-output database.
result Paradoxical effect of economic slowdown on network flow.
This paper investigates how economic shocks propagate and amplify through the input-output network connecting industrial sectors in developed economies. We study alternative models of diffusion on networks and we calibrate them using input-output data on real-world inter-sectoral dependencies for several European count…
Method combines clustering and matrix completion for missing data in I/O tables.
problem Reconstructing missing entries in World Input-Output (I/O) matrices due to data collection issues.
method Hierarchical clustering and Matrix Completion with LASSO-like nuclear norm penalty.
result The method effectively predicts missing values from previous and similar countries' data.
Optimal intervention in economic networks modeled as influence maximization, with hard computational problems.
problem Optimal intervention in economic networks modeled as influence maximization.
method Transformed into influence maximization-like form, with theoretical and practical implications.
result Optimal intervention is NP-hard and cannot be approximated to a constant factor in polynomial time.
Nestedness in global trade network revealed using multi-layer approach.
problem Understanding nested structures in international trade networks.
method Constructed a multi-layer network with countries, industries, and transactions; computed nestedness based on buyers' and sellers' involvement.
result Identified variations of nestedness over time and contributing countries and industries.
TCNs can approximate complex input-output maps with limited memory.
problem Approximating complex input-output maps with limited memory.
method Proved TCNs can approximate a wide class of input-output maps with arbitrary error tolerance.
result Deep ReLU TCNs can approximate input-output maps with finite memory to arbitrary error.
Safe neural networks for input-output specifications.
problem Ensuring machine learning models adhere to input-output constraints.
method Designing constrained predictors and combining them safely.
result Demonstrated on synthetic and real-world datasets.
URNNs are as expressive as general RNNs with ReLU activations.
problem Expressiveness of URNNs compared to general RNNs.
method Input-output equivalence between URNNs and contractive RNNs with ReLU activations.
result URNNs are as expressive as general RNNs with ReLU activations.
New approach uses network data to estimate industry interdependence.
problem Estimating interdependence among industries in an economy.
method Applied data science to uncover latent block structure in interfirm buyer-seller networks.
result Proposed model improves predictive accuracy and successfully solves the problem.
New method ranks sectors and countries using local and aggregate I-O data.
problem Ranking sectors and countries in global value chains using incomplete I-O tables.
method Rank-1 approximation to I-O tables using local and aggregate information. result Consistently good performance in reconstructing rankings of upstreamness and downstreamness.
New method compares global value chains across countries and over time.
problem Comparing global value chains (GVCs) across countries and over time.
method Using the World Input-Output Database (WIOD), we construct global value networks and introduce a network-based measure of node similarity.
result Our measure of similarity reveals the most intensive interactions among GVCs across countries and over time.
PNNs model aleatoric uncertainty in scientific machine learning with high accuracy.
problem Aleatoric uncertainty in scientific systems with unequal variance.
method Developed a probabilistic distance metric to optimize PNN architecture and used it in material science applications.
result PNNs yield remarkably accurate output mean estimates and high correlation in predicted intervals.
New approach ties loss curvature to model performance in deep learning.
problem Understanding the relationship between loss curvature and model performance in deep learning.
method Empirical analysis of loss Hessians and theoretical results on input-output Jacobians.
result Novel generalization bound in terms of empirical Jacobian.
We consider the problem of joint modelling of metabolic signals and gene expression in systems biology applications. We propose an approach based on input-output factorial hidden Markov models and propose a structured variational inference approach to infer the structure and states of the model. We start from the class…
Develops neural network approximations for infinite-dimensional input-output maps.
problem Approximating input-output maps between infinite-dimensional spaces.
method Combines neural networks and model reduction techniques.
result Proves convergence of the proposed approximation methodology.
Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.
problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.
Paper presents a method to accurately quantify neural network uncertainty without sampling.
problem Uncertainty quantification in neural networks for reliability and robustness.
method Sample-free moment propagation technique for mean vectors and covariance matrices.
result Analytic solution for covariance of nonlinear activation functions.
Tensor completion method identifies nonlinear systems from input-output data.
problem Identifying nonlinear functions from input-output data pairs.
method Formulated as tensor completion problem with smoothness regularization and solved using block coordinate descent.
result Provable correct nonlinear system identification under certain conditions.
The fragmentation of production across countries has become an important feature of the globalization in recent decades and is often conceptualized by the term, global value chains (GVCs). When empirically investigating the GVCs, previous studies are mainly interested in knowing how global the GVCs are rather than how …
Maxout networks study gradients and propose initialization strategies.
problem Complexity in input-output Jacobian distribution complicates stable parameter initialization.
method Obtained bounds on moments of gradients and formulated initialization strategies.
result Parameter initialization strategies improve training of deep maxout networks.
Paper proposes a method to interpret neural networks by decomposing them into simpler tasks.
problem Understanding the complex nonlinear relationships in trained neural networks.
method Non-negative matrix factorization applied to a trained layered neural network.
result Reveals the roles of hidden units in terms of their contribution to each principal task.
DEPLOYERS models multi-country economic systems using ABM.
problem Simulate complex multi-country economic systems with detailed data.
method Agent-based modeling framework with multi-threaded simulation.
result Simulates thousands of individuals and firms in a realistic environment.
We compress large neural networks for quick adaptation to specific contexts.
problem How to quickly adapt a pretrained large neural network to specific contexts.
method Propose a Bayesian hypernetwork framework to compress the network and encourage sparsity.
result Generated compressed networks are significantly smaller than baseline methods.
New framework improves robustness of implicit neural networks.
problem Ill-posedness and convergence instability in implicit neural networks.
method NEMON framework based on contraction theory for ℓ∞ norm, including well-posedness condition, average iteration, and input-output Lipschitz constant regularization. result Improved accuracy and robustness of implicit models with smaller input-output Lipschitz bounds.
Co-TSFA improves time series forecasting by distinguishing between short-lived and persistent anomalies.
problem Standard forecasting models fail to distinguish between short-lived and persistent anomalies, leading to overreaction or underreaction.
method Co-TSFA learns to ignore forecast-irrelevant anomalies and respond to forecast-relevant ones through input-only and input-output augmentations and a latent-output alignment loss.
result Co-TSFA improves performance under anomalous conditions while maintaining accuracy on normal data.
Divide-and-Conquer Networks learn tasks by splitting and merging inputs.
problem Learning algorithmic tasks from input-output pairs.
method Recursive neural architecture with dynamic splitting and merging operations.
result Significant improvements in generalization error and computational complexity.
Novel spectral method trains RNN for sequence labeling tasks.
problem Training input-output recurrent neural networks for sequence labeling.
method Spectral approach based on cross-moment tensor decomposition.
result Consistent learning with polynomial complexity under certain conditions.
Linear Memory Network separates memory and function in RNNs.
problem Complex transduction problems requiring memory and input-output exploitation.
method Conceptual separation between memory and function, using feedforward and autoencoder components.
result Efficient training and competitive performance on polyphonic music datasets.
GeMA learns latent manifolds to benchmark complex systems.
problem Benchmarking complex systems like rail networks and economies with classical methods.
method Geometric Manifold Analysis (GeMA) using a productivity-manifold variational autoencoder (ProMan-VAE).
result GeMA provides more nuanced efficiency evaluations in complex systems.
JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.
problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.
Procedure removes training data dependency from deep networks, improving generalization.
problem Removing dependency on training data in deep networks for better generalization.
method Deterministic and stochastic parts to ensure forgetting, leveraging activation and weight dynamics.
result New bound on information extraction from black-box networks, ensuring forgetting in activations.
Wide and shallow networks approximate convex functions well.
problem Understanding why wide and shallow neural networks perform well.
method Analyzing the epigraph of the input-output map of shallow and wide neural networks.
result The epigraph of the input-output map approximates a convex function.
Sharp limits found for storing and retrieving input-output associations in linear associative memories.
problem Understanding the fundamental limits of storing and retrieving input-output associations in neural networks.
method Study of a minimal linear associative memory model, introducing a decoupled model and using statistical physics to characterize storage capacity.
result Linear associative memory can store up to 1/2 log(p) associations, providing a sharp statistical-physics characterization.
Generates long programs from inputs, optimizing multiple tasks.
problem Creating long programs from input-output pairs.
method Trains a neural network to map state and outputs to next program statement, optimizing multiple tasks concurrently.
result Creates programs twice as long as existing solutions, improving success rate and runtime.
New method maps global value chains at product level from trade data.
problem Lack of detailed product-level value chain information in existing datasets.
method Machine learning and trade theory applied to international trade data.
result Approximate product-level value chain information inferred from trade patterns.
Deep neural networks undergo hierarchical free-energy landscape transitions with increasing data size.
problem Understanding the design space and dynamics of deep neural networks.
method Statistical mechanical approach based on replica method.
result Hierarchical free-energy landscape transitions with ultrametricity, leading to simpler configurations in deeper layers.
NAIS-Net stabilizes deep networks using non-autonomous dynamical systems.
problem Stabilizing deep neural networks to prevent vanishing/exploding gradients.
method NAIS-Net uses non-autonomous dynamical systems with skip connections to enforce stability.
result NAIS-Net proves to be globally asymptotically stable and reduces generalization gap.
New weight initialisation for ICNNs accelerates learning and improves generalization.
problem Lack of effective initialisation strategies for ICNNs due to their unique weight and activation properties.
method Derived a principled weight initialisation by generalizing signal propagation theory for ICNNs with non-negative weights.
result Principled initialisation effectively accelerates learning and leads to better generalization in ICNNs.
RANP improves neural processes for sequential data.
problem Capturing temporal order and recurrent structure from sequential data.
method Incorporated ANP into a recurrent neural network.
result RANP outperforms NPs and LSTMs in 1D regression and autonomous-driving tasks.
This study reveals a walnut-shaped structure in the Japanese production network.
problem The validity and accuracy of conventional input-output analysis in Japanese production networks.
method Infomap method for community detection.
result Most irreducible communities are at the second level of the walnut structure.
This work introduces a new metric to assess the fidelity of surrogate models to the underlying data-generating signal.
problem The limitations of fidelity-based explanations in explainable AI.
method Introduces the linearity score λ(f) to quantify the extent of a regression network's linear decodability. result High-fidelity surrogates can underperform compared to simpler models and even linear baselines trained directly on the data.
Deep-Energy trains DNNs without labels using energy functions.
problem Training DNNs without manually annotated labels.
method Uses task-specific energy functions to train DNNs unsupervised.
result Trained DNNs provide better quality labels than direct minimization.
Investigates the impact of finite VC dimension on neural network approximation and learning.
problem The influence of VC dimension on neural network approximation and learning from samples.
method Analysis of high-dimensional geometry and statistical learning theory, focusing on VC dimension.
result Finite VC dimension is beneficial for uniform convergence of empirical errors but not for approximation of functions from a probability distribution.
Extensions to given-data Sobol' index estimators for large models.
problem Efficiently compute Sobol' indices for models with many inputs.
method General definition, streaming algorithm, heuristic filtering.
result Comparable accuracy and lower memory usage for large models.
Study explores different network frameworks to understand global trade complexity.
problem Understanding the complexity of global trade networks.
method Investigated single-layer, multiplex, and multi-layer international trade networks using World Input-Output Database.
result Multi-layer networks reveal distinct roles of intra- and cross-industry transactions in entropy evolution.
Empirical study finds large neural networks are more robust to input perturbations and generalize better.
problem Tension between model complexity and generalization in neural networks.
method Empirical exploration of sensitivity to input perturbations in thousands of models across various architectures and datasets.
result Robustness to input perturbations correlates with generalization in neural networks.
Recursive sketches summarize deep networks, aiding quick analysis and learning.
problem Understanding and analyzing complex deep learning models.
method Developed a recursive sketch mechanism to summarize inputs and outputs of modular deep networks.
result Sketches can identify key components and summarize essential information, even if partially erased.