Paper proposes dense average network for improved power load forecasting.
problem Improving power load forecasting accuracy to save millions for the power industry.
method Introduces dense average connection and constructs dense average network for power load forecasting.
result Proposed model outperforms existing methods on public datasets.
ARMA nets expand receptive fields for dense prediction tasks.
problem Global information in dense prediction problems is challenging for traditional convolutional layers.
method ARMA layers with adjustable autoregressive coefficients replace traditional convolutions.
result ARMA networks improve dense prediction tasks including video prediction and semantic segmentation.
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.
Hyperbolic groups' infinite orbits spread evenly in spaces.
problem Equidistribution of hyperbolic groups in homogeneous spaces.
method Averaging measures along spheres in Cayley graphs converges to Haar measure.
result Infinite orbits of hyperbolic groups equidistribute in homogeneous spaces.
How big is the risk that a few initial failures of nodes in a network amplify to large cascades that span a substantial share of all nodes? Predicting the final cascade size is critical to ensure the functioning of a system as a whole. Yet, this task is hampered by uncertain or changing parameters and missing informati…
Dense neural networks can't approximate all functions.
problem Approximation capabilities of dense neural networks.
method Model compression approach combining weak regularity lemma and graph neural networks.
result Existence of Lipschitz continuous functions not approximable by dense neural networks.
The key idea of current deep learning methods for dense prediction is to apply a model on a regular patch centered on each pixel to make pixel-wise predictions. These methods are limited in the sense that the patches are determined by network architecture instead of learned from data. In this work, we propose the dense…
EASIER-net uses sparse networks to improve prediction accuracy for high-dimensional data.
problem Limited use of neural networks in high-dimensional data with small samples.
method Ensemble by Averaging Sparse-Input Hierarchical networks (EASIER-net) with small modifications to neural network architecture and training procedure.
result EASIER-net achieves higher prediction accuracy than off-the-shelf methods on average.
In this work, a dense recurrent convolutional neural network (DRCNN) was constructed to detect sleep disorders including arousal, apnea and hypopnea using Polysomnography (PSG) measurement channels provided in the 2018 Physionet challenge database. Our model structure is composed of multiple dense convolutional units (…
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.
Neural networks are dense among Lipschitz functions with fixed Lipschitz constant.
problem Characterizing neural network approximations to Lipschitz functions.
method Analyzing L-Lipschitz neural networks and their density in L-Lipschitz functions. result One layer neural networks are dense in the set of all L-Lipschitz functions. We study bipartite community detection in networks, or more generally the network biclustering problem. We present a fast two-stage procedure based on spectral initialization followed by the application of a pseudo-likelihood classifier twice. Under mild regularity conditions, we establish the weak consistency of the p…
RDL-Net improves speech enhancement with fewer parameters and better performance.
problem Improving speech enhancement with fewer parameters and better performance.
method Proposes RDL-Net, a CNN combining residual and dense aggregations without over-allocating parameters.
result RDL-Net achieves higher speech enhancement performance with fewer parameters and lower computational requirements.
Study differential operators on non-compact harmonic manifolds, finding conditions for radial fundamental solutions and dense heat-semigroups.
problem Conditions for differential operators on non-compact harmonic manifolds to have specific properties.
method Analyzing the algebra of differential operators, their commutation properties, and using geometric averages.
result Algebra of differential operators on non-compact harmonic manifolds has specific properties related to radial fundamental solutions and dense heat-semigroups.
Enhanced image denoising with MWRDCNN using residual dense blocks.
problem Image denoising with improved performance and robustness.
method Multi-wavelet residual dense convolutional neural network (MWRDCNN) with residual dense blocks (RDBs).
result Significantly improved performance in image denoising compared to existing techniques.
New framework for dense weighted networks with community-specific patterns.
problem Dense networks with varying edge weights across communities.
method Proposes a new model with functions mapping node characteristics to edge weights, requiring few parameters.
result Developed a bootstrap methodology for generating new networks.
Generative model captures hubs and dense communities in social networks.
problem Capturing both hubs and dense communities in social networks.
method Graphon mixture model with a new condition on sparse graphs.
result Estimation of hub normalized degree and graphon for sparse components.
Method generates dense fields from sparse measurements without needing spatial statistics or examples.
problem Generating dense physical fields from sparse measurements.
method Introduces a differentiable numerical simulator into neural network training.
result Superior results on fluid mechanics problems compared to statistical and neural network methods.
Neural network accuracy improves with denser training samples.
problem Improving neural network accuracy on unseen test samples.
method Bounding empirical training error smoothed across activation regions and using it to discard high-risk test samples.
result Discarding high-risk test samples based on error bounds improves prediction accuracy by up to 20%.
Polynomial-time test for detecting dense subgraphs in heterogeneous networks.
problem Detecting a planted community in heterogeneous networks.
method Proposes a polynomial-time test with a standard normal distribution null limiting distribution.
result The test is efficient and performs well in both simulations and real data.
New models explain residual and dilated dense neural networks using sparse coding.
problem Lack of theoretical understanding of residual and dilated dense neural networks.
method Proposed Res-CSC and MSD-CSC models, derived mathematical relationships, implemented ISTA.
result Mathematical understanding of residual and dilated dense neural networks.
We address feature interpretation and reproducibility issues in dense nets, proposing a modified loss function.
problem Feature interpretation and reproducibility issues in dense nets.
method Proposed a modified loss function to circumvent basis collapse.
result Substantially concise nets with 100x fewer parameters and lower MSE loss.
New models capture heterogeneous network density, improving community detection.
problem Empirical networks are often globally sparse but locally dense.
method Latent Poisson models generating hidden multigraphs.
result These models improve community detection in sparse networks.
Conditional diffusion models can approximate target distributions well with Gaussian-mixture reverse kernels.
problem Approximating target distributions in conditional diffusion models.
method Using finite Gaussian mixtures with ReLU-network logits as reverse kernels, reducing the problem to static conditional density approximation.
result The resulting neural reverse-kernel class is dense in conditional KL divergence under exact terminal matching.
Sparse butterfly network replaces dense layers in neural networks, improving expressibility and performance.
problem Improving expressibility and performance of neural networks with dense layers.
method Replacing dense layers with a butterfly network architecture.
result The proposed architecture significantly reduces the number of weights from quadratic to nearly linear, with comparable or better performance.
Method reconstructs financial networks from aggregate data, revealing critical link density.
problem Reconstructing financial networks from aggregate data is challenging due to unreconstructability phases.
method Random graph generation with desired link density and replicated constraints.
result There is a critical link density below which networks become unreconstructable.
The paper examines logistic regression in sparse network settings, improving inference under varying degrees of dyadic dependence.
problem Improving inference in logistic regression with sparse network data.
method Sparse network asymptotics, martingale central limit theorem, variance decomposition.
result Sparse network asymptotics lead to better variance estimators for logistic regression.
SpaPool combines dense and sparse techniques for efficient graph pooling.
problem Efficiently processing large graphs in graph neural networks.
method Adaptive clustering of graph vertices into clusters.
result SpaPool outperforms existing methods on small-scale graphs.
In this paper, we present UNet++, a new, more powerful architecture for medical image segmentation. Our architecture is essentially a deeply-supervised encoder-decoder network where the encoder and decoder sub-networks are connected through a series of nested, dense skip pathways. The re-designed skip pathways aim at r…
Bayesian networks are typically faithful, with implications for causal inference.
problem Determining the typicality of faithfulness in Bayesian networks.
method Analysis of Bayesian networks over a given DAG, parametrized by conditional exponential families, and nonparametric conditional densities.
result The faithful Bayesian networks are dense and open with respect to the total variation metric, extending existing results for specific classes of Bayesian networks.
Most artificial networks today rely on dense representations, whereas biological networks rely on sparse representations. In this paper we show how sparse representations can be more robust to noise and interference, as long as the underlying dimensionality is sufficiently high. A key intuition that we develop is that …
Paper proposes a method to improve variational inference for sparse networks.
problem Variational inference struggles with sparse networks, leading to inaccurate community detection.
method The method involves hard thresholding the posterior of community assignment after each iteration.
result The proposed method accurately recovers true community labels in sparse networks.
Develops hyperparameter transfer methods for Dense Associative Memories.
problem Challenges in transferring hyperparameters for DenseAMs due to unique architecture and activation functions.
method Derives explicit prescriptions for hyperparameter transfer from small to large models.
result Excellent agreement between theoretical and empirical results.
Proposes a meta-learning method for robust portfolio optimization.
problem Optimizing a robust portfolio ensemble with diverse sub-portfolios.
method Uses a deep generative model with convolutional, LSTM, and dense layers to generate diverse sub-portfolios.
result The ensemble portfolio is robust and generalizes well, balancing performance and diversity.
Recent advances in neuroscience have revealed many principles about neural processing. In particular, many biological systems were found to reconfigure/recruit single neurons to generate multiple kinds of decisions. Such findings have the potential to advance our understanding of the design and optimization process of …
This paper develops several average-case reduction techniques to show new hardness results for three central high-dimensional statistics problems, implying a statistical-computational gap induced by robustness, a detection-recovery gap and a universality principle for these gaps. A main feature of our approach is to ma…
Paper develops Dense NN models for temporal-spatial data with improved performance.
problem Improving predictive performance and robustness in temporal-spatial modeling.
method Fully connected neural networks with ReLU activation, non-asymptotic bounds, manifold modeling, short-range dependence.
result Demonstrates superior performance in temporal-spatial modeling across various synthetic functions.
Detects dense subhypergraphs in random hypergraphs using low-degree polynomials.
problem Detecting a planted dense subhypergraph in a random hypergraph model.
method Degree-n^o(1) polynomials of adjacency tensor entries.
result Thresholds for detection in different density regimes.
The study finds dense clusters of solutions in a simple neural network model, providing bounds for their existence.
problem Exploring the existence of minimizers in a simple neural network model with binary weights.
method Formulating the learning problem as a constraint satisfaction problem and computing moment bounds for the existence of solutions.
result First rigorous steps toward proving the existence of dense clusters of solutions in certain parameter regimes.
In current clinical practice, electroencephalograms (EEG) are reviewed and analyzed by well-trained neurologists to provide supports for therapeutic decisions. The way of manual reviewing is labor-intensive and error prone. Automatic and accurate seizure/nonseizure classification methods are needed. One major problem i…
FuseInit optimizes neural network initialization by fusing layers from deeper networks.
problem Initialization sensitivity of neural networks.
method Fusing neighboring layers from deeper networks trained with random initialization.
result Shallower networks initialized with FuseInit can perform as well as deeper networks.
Tensor Neural Networks improve pricing accuracy for interest rate derivatives.
problem Inaccurate pricing of Bermudan Swaptions using traditional methods.
method Leveraging Tensor Neural Networks to solve backward Stochastic Differential Equations.
result Tensor Neural Networks provide more accurate and robust prices than Dense Neural Networks.
We study the problem of large-scale network embedding, which aims to learn latent representations for network mining applications. Previous research shows that 1) popular network embedding benchmarks, such as DeepWalk, are in essence implicitly factorizing a matrix with a closed form, and 2)the explicit factorization o…
Prototype model improves model auditing and understanding.
problem Auditing and understanding modern language models is expensive and approximate.
method Introduced a sparse, non-negative mixture of learned prototypes trained with clustering objectives.
result Prototype models either surpass or remain within 2.5 percentage points of dense baselines on downstream 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.
Study on detecting and recovering hidden dense cycles in random graphs.
problem Detecting and recovering hidden dense cycles in random graphs.
method Information-theoretic analysis of thresholds for detection and recovery.
result Characterization of information-theoretic thresholds for detection and recovery.
This study presents an ANWSER model (asset network systemic risk model) to quantify the risk of financial contagion which manifests itself in a financial crisis. The transmission of financial distress is governed by a heterogeneous bank credit network and an investment portfolio of banks. Bankruptcy reproductive ratio …
Training large and highly accurate deep learning (DL) models is computationally costly. This cost is in great part due to the excessive number of trained parameters, which are well-known to be redundant and compressible for the execution phase. This paper proposes a novel transformation which changes the topology of th…