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.
A novel disentangled graph autoencoder improves treatment effect estimation from networked observational data.
problem Treatment effect estimation from observational data is challenging due to unconfoundedness assumption and latent confounders.
method Proposes a disentangled variational graph autoencoder to disentangle latent factors and enforce factor independence.
result Extensive experiments show superior performance compared to state-of-the-art approaches.
CONE evaluates treatment assignment functions using networked observational data to mitigate hidden confounding bias.
problem Evaluate treatment assignment functions using networked observational data with hidden confounders.
method CONE framework that learns partial representations of latent confounders and combines them for counterfactual evaluation.
result Network information mitigates hidden confounding bias in counterfactual evaluation.
New method combines observational and interventional data for causal model learning.
problem Identifying causal structures from observational data alone is limited.
method Continuous optimization and neural networks for integrating observational and interventional data.
result Strong benchmark results on structure recovery tasks.
Consider observing an undirected network that is `noisy' in the sense that there are Type I and Type II errors in the observation of edges. Such errors can arise, for example, in the context of inferring gene regulatory networks in genomics or functional connectivity networks in neuroscience. Given a single observed ne…
Graphical models are commonly used to represent conditional dependence relationships between variables. There are multiple methods available for exploring them from high-dimensional data, but almost all of them rely on the assumption that the observations are independent and identically distributed. At the same time, o…
Biological networks are a very convenient modelling and visualisation tool to discover knowledge from modern high-throughput genomics and postgenomics data sets. Indeed, biological entities are not isolated, but are components of complex multi-level systems. We go one step further and advocate for the consideration of …
Can evolving networks be inferred and modeled without directly observing their nodes and edges? In many applications, the edges of a dynamic network might not be observed, but one can observe the dynamics of stochastic cascading processes (e.g., information diffusion, virus propagation) occurring over the unobserved ne…
The paper explores how to learn from incomplete online social networks.
problem Learning from partially observed networks via node querying.
method Developed algorithms NOL* for sequential node querying to maximize network observability.
result It is possible to sequentially learn which nodes to query for maximal network observability.
DAERNN models censored data using neural networks with data augmentation.
problem Handling censored data in expectile regression.
method Data augmentation based Expectile Regression Neural Networks (ERNNs).
result DAERNN outperforms existing censored ERNNs methods and achieves comparable predictive performance to fully observed data.
We consider several estimation and learning problems that networked agents face when making decisions given their uncertainty about an unknown variable. Our methods are designed to efficiently deal with heterogeneity in both size and quality of the observed data, as well as heterogeneity over time (intermittence). The …
Bayesian networks are a versatile and powerful tool to model complex phenomena and the interplay of their components in a probabilistically principled way. Moving beyond the comparatively simple case of completely observed, static data, which has received the most attention in the literature, in this paper we will revi…
New method uncovers hidden causal connections in multivariate point process networks.
problem Unobserved hidden variables confound causal discovery in high-dimensional point process networks.
method Proposes a deconfounding procedure to estimate causal interactions among observed nodes with unknown unobserved processes.
result The method accurately identifies causal interactions among observed processes, even with hidden variables.
TGNN4I model forecasts irregularly observed graph data using ODEs.
problem Forecasting graph-structured data with irregular time steps and partial observations.
method Introduces a time-continuous latent state in each node using ODEs and GRUs, integrating graph neural network layers.
result Validated usefulness of graph structure and time-continuous dynamics in irregular observation settings.
A new method for analyzing high-dimensional time-series data using deep neural networks.
problem Challenges in modeling high-dimensional time-series data with explicit state and observation processes.
method Deep Direct Discriminative Decoders (D4) for high-dimensional observation processes.
result D4 outperforms traditional SSMs and RNNs in various time-series data applications.
Nonparametric neural-network estimation of current-status data
problem Estimation of conditional cumulative distribution function with current-status data
method Neural-network sieve maximum likelihood estimator
result Explicit convergence rate for Hölder smoothness
The paper uses neural networks to forecast time series data.
problem Forecasting high-dimensional stationary processes.
method Encoder-decoder neural network structure to model past observations.
result Upper bounds for forecast error under specific assumptions.
R package abn fits Bayesian models to observational data.
problem Analyzing complex observational datasets with Bayesian networks.
method Bayesian and information theoretic scoring, exact and greedy search algorithms.
result Effective modeling of mixed data types and prior knowledge integration.
Sig-PCA integrates model outputs and observations to correct model biases.
problem Improving model accuracy and reliability by correcting biases and numerical approximations.
method Sig-PCA framework that combines summary statistics from model outputs with localized observations via a neural network.
result Corrects model outputs to align closely with observational data, preserving essential statistical information.
Graph neural networks learn PDEs from sparse, irregular data.
problem Learning PDEs from irregularly spaced data.
method Continuous-time differential model with graph neural networks for arbitrary discretizations.
result Efficient inference with continuous-time adjoint method.
Improves LSTM performance by initializing states via manifold learning.
problem Improving LSTM performance through better initialization.
method Learning an intrinsic data manifold to initialize LSTM internal states.
result Improved LSTM performance through consistent initialization.
Network models have been popular for modeling and representing complex relationships and dependencies between observed variables. When data comes from a dynamic stochastic process, a single static network model cannot adequately capture transient dependencies, such as, gene regulatory dependencies throughout a developm…
Bayesian neural networks help quantify prediction uncertainties in neural models.
problem Uncertainty in neural network predictions due to model randomness and lack of knowledge.
method Bayesian statistical framework to categorize uncertainty.
result Errors in neural network predictions can be obtained and characterized.
New algorithms sample random graph homomorphisms for network analysis.
problem Sampling random graph homomorphisms from a graph into a large network.
method Proposed two MCMC algorithms with bounds on mixing times and concentration.
result Network observables are stable under renormalized cut distance.
Paper addresses state estimation in sensor networks with intermittent data.
problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.
New neural network model improves treatment effect estimation.
problem Estimating treatment effects from observational data.
method Proposes a neural network model leveraging covariates and neighboring instances.
result Reports better treatment effect estimation performance.
DeepTMR reorders matrices without prior knowledge of structural patterns.
problem Matrix reordering without prior structural knowledge.
method DeepTMR uses a neural network to automatically extract features and reorder matrices.
result Trained network produces denoised mean matrix for visualization.
New method for inferring network topology from partial data.
problem Inferring network topology from limited node data.
method Vector autoregressive model and Gaussian mixture algorithm.
result The proposed method converges to the network combination matrix in probability.
New method estimates treatment effects in network data, accounting for spillover effects.
problem Treatment effect estimation in networks with spillover effects.
method Augmented inverse probability weighting (AIPW) with cross-fitting and machine learning.
result Semiparametric treatment effect estimator converges at parametric rate and follows Gaussian distribution.
We consider estimating the edge-probability matrix of a network generated from a graphon model when the full network is not observed---only some overlapping subgraphs are. We extend the neighbourhood smoothing (NBS) algorithm of Zhang et al. (2017) to this missing-data set-up and show experimentally that, for a wide ra…
Integrates nearest neighbors with neural networks for more accurate treatment effect estimation.
problem Inaccurate causal effect estimations from observational data.
method NNCI methodology integrating nearest neighbors with neural network models.
result Improves treatment effect estimations on various benchmarks.
We propose a novel approach for inferring the individualized causal effects of a treatment (intervention) from observational data. Our approach conceptualizes causal inference as a multitask learning problem; we model a subject's potential outcomes using a deep multitask network with a set of shared layers among the fa…
We present Causal Generative Neural Networks (CGNNs) to learn functional causal models from observational data. CGNNs leverage conditional independencies and distributional asymmetries to discover bivariate and multivariate causal structures. CGNNs make no assumption regarding the lack of confounders, and learn a diffe…
Framework generates causal probabilities from observational data.
problem Generating causal probabilities from observational data.
method Moment-matching graph-networks for causal inference.
result Automated sampling of latent space conditional probability distributions.
The paper uses neural networks to learn system dynamics from data with Lipschitz regularization.
problem Learning governing equations from time-sampled data.
method Lipschitz regularized deep neural networks for ODE system identification.
result Lipschitz regularization improves the smoothness and generalization of the learned function.
Deep learning model detects and corrects outliers in crowd-sourced weather data.
problem Data quality issues in crowd-sourced weather data.
method Bayesian deep learning approach with Gaussian-uniform mixture density network.
result Automated outlier detection in spatio-temporal environmental modeling.
A new algorithm speeds up neural network training with less data.
problem Slow convergence of traditional neural network training methods.
method Decouples hidden layers and updates connections through bootstrapping, resampling, and linear regression.
result Empirically shows faster convergence with fewer data points.
Validates network bootstraps for uncertainty quantification in network visualisation.
problem Quantifying uncertainty in network embeddings when only a single observation is available.
method Statistical indistinguishable embeddings using k-nearest neighbour smoothing, validated by an exchangeable network test.
result Proposes a principled, distribution-free network bootstrap that passes the exchangeable network test.
Study predicts traffic congestion based on population mobility data.
problem Predicting traffic congestion in multimodal transport networks.
method Machine learning methods applied to population mobility data.
result Likely prediction of congestion based on population movements.
Paper shows minimum observation time for network recovery.
problem Inferring latent networks from event-based observations.
method Two-stage estimator using clipped and binned event data.
result Observation time of order log(d) is sufficient and necessary.
New approach to neural networks by incorporating observation noise and arbitrary prior means.
problem Misspecification on noisy data and limitations of NTK-GP equivalence.
method Introducing a regularizer for observation noise and proposing a shifted network for arbitrary prior means.
result Removes key obstacles to practical Gaussian process modeling in neural networks.
SymmPI predicts unobserved values under group symmetries, improving over existing methods.
problem Quantifying uncertainty in predictions under group symmetries.
method Distributional equivariant transformations to preserve symmetries.
result SymmPI provides valid coverage and performs favorably in simulations and empirical data.
SIMPGEN improves SWOT SSH data interpretation by removing noise and preserving fine-scale features.
problem Noisy data and limited fine-scale observations in oceanic processes.
method Simulation-Informed Metric and Prior for Generative Ensemble Networks (SIMPGEN) combining real SWOT observations with simulated reference data.
result SIMPGEN effectively removes noise, preserving fine-scale features better than existing neural methods.
Network science provides valuable insights across numerous disciplines including sociology, biology, neuroscience and engineering. A task of major practical importance in these application domains is inferring the network structure from noisy observations at a subset of nodes. Available methods for topology inference t…
We discuss a variant of `blind' community detection, in which we aim to partition an unobserved network from the observation of a (dynamical) graph signal defined on the network. We consider a scenario where our observed graph signals are obtained by filtering white noise input, and the underlying network is different …
FLASH-MAX predicts electromagnetic fields from sparse data in seconds.
problem Predicting homogeneous electromagnetic fields from sparse pointwise observations.
method Exact-by-construction neural network architecture that satisfies Maxwell's equations symbolically.
result FLASH-MAX achieves sub-1% relative validation error from 1K sparse observations in seconds.
New method identifies key genes affecting phenotypes in biological systems.
problem Identifying genes that drive specific phenotypes in complex biological systems.
method Data-driven observability decomposition using Koopman operators.
result Koopman operator representation identifies genes that drive phenotypes.
Networks capture our intuition about relationships in the world. They describe the friendships between Facebook users, interactions in financial markets, and synapses connecting neurons in the brain. These networks are richly structured with cliques of friends, sectors of stocks, and a smorgasbord of cell types that go…