Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2975938901,186 · Jun 202019922001200920172026
48 results for network information

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.

Review of information plane analyses in neural networks, highlighting mixed results and methodological challenges.

problem Understanding the relationship between information-theoretic compression and neural network performance.
method Literature review and detailed analysis of information quantity estimation methods.
result Information plane compression is not necessarily information-theoretic but compatible with geometric compression.

Study of Bayes optimal learning in high-dimensional linear regression with network side information.

problem Bayes optimal learning in high-dimensional linear regression with network side information.
method Introduce a Reg-Graph model and an iterative AMP algorithm for Bayes optimality under general conditions.
result Characterization of the limiting mutual information between latent signal and data observed.

DCGANs generate drainage networks quickly from samples.

problem High computational costs in generating large numbers of drainage networks.
method DCGANs trained with connectivity-informed directional information.
result Connectivity-informed DCGANs outperform other methods in reproducing accurate drainage networks.

This study analyzes information flow networks in Chinese stock sectors using transfer entropy.

problem Understanding information transmission and market dynamics in Chinese stock sectors.
method Daily closing price data of 28 sectors from 2000 to 2017, transfer entropy, maximum spanning arborescence (MSA).
result The composite sector is an information source, and the non-bank financial sector is an information sink.

Whatever information a deep neural network has gleaned from training data is encoded in its weights. How this information affects the response of the network to future data remains largely an open question. Indeed, even defining and measuring information entails some subtleties, since a trained network is a determinist…

2019-05-29abs ↗pdf ↗

Theory proposes neural networks can be initialized for optimal information transmission.

problem Optimizing neural networks for optimal information transmission and representation.
method Developed a corrected mean-field framework to study neural networks as information channels, proving mutual information maximization at dynamic isometry.
result Mutual information maximization is realized between inputs and propagated signals when neural networks are initialized at dynamic isometry.

Algorithm ensures fair information spread in social networks with community structure.

problem Disparities in information coverage between communities in social networks.
method Fits a model to the social network, uses community structure, and determines optimal seed allocations for fair coverage.
result Empirical accuracy demonstrated on simulated and real networks.

Informer improves financial market prediction accuracy with global time stamp features.

problem Intra-day minute-scale financial market prediction challenges.
method Informer network, a novel deep learning model with smaller computational complexity and global time stamp features.
result Informer achieves best performance on MAE, RMSE, and MAPE evaluation criteria across all datasets.

Adaptive weights improve physics-informed neural networks and deep operator networks.

problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Growing number of network devices and services have led to increasing demand for protective measures as hackers launch attacks to paralyze or steal information from victim systems. Intrusion Detection System (IDS) is one of the essential elements of network perimeter security which detects the attacks by inspecting net…

2019-11-26abs ↗pdf ↗

With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks. Analyzing these networks sheds light on different aspe…

2017-12-04abs ↗pdf ↗

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

In online social media systems users are not only posting, consuming, and resharing content, but also creating new and destroying existing connections in the underlying social network. While each of these two types of dynamics has individually been studied in the past, much less is known about the connection between th…

2014-03-11abs ↗pdf ↗

This work tackles community detection in networks with node attributes, achieving exact recovery.

problem Community detection in networks with correlated node attributes.
method Information-theoretic criterion and iterative clustering algorithm maximizing joint likelihood.
result Exact recovery of community labels under a general model for network and node attributes.

Unified information-theoretic objectives for training deep neural networks.

problem Difficulty in computing information-theoretic quantities for large deep neural networks.
method Review and unify competing objectives, develop surrogate objectives.
result Surrogate objectives allow applying information bottleneck to modern neural network architectures.

New method extracts cosmological information from dark matter halo catalogues using graph neural networks.

problem Quantifying cosmological information from large-scale structure data.
method Implicit likelihood approach with Information Maximising Neural Networks (IMNNs) on graph representations of dark matter halo catalogues.
result Graph neural network summaries can extract information from noisy catalogues and improve parameter constraints.

The study examines Fisher information matrices and neural tangent kernels for simple ReLU networks with random weights.

problem Understanding the relationship between Fisher information matrices and neural tangent kernels for 2-layer ReLU networks.
method Analyzes Fisher information matrices and neural tangent kernels for 2-layer ReLU networks with random hidden weights, focusing on spectral decomposition and eigenfunctions.
result Obtained an approximation formula for functions represented by 2-layer neural networks.

DyHATR learns dynamic heterogeneous networks for better link prediction.

problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.

Neural networks have been proposed recently for positioning and channel charting of user equipments (UEs) in wireless systems. Both of these approaches process channel state information (CSI) that is acquired at a multi-antenna base-station in order to learn a function that maps CSI to location information. CSI-based p…

2019-09-29abs ↗pdf ↗

Paper identifies key function spaces for ReLU networks based on Fisher information.

problem Understanding the structure of Fisher information matrices in ReLU networks.
method Spectral decomposition of Fisher information matrices, focusing on the first three eigenspaces.
result The first three eigenspaces account for 97.7% of the trace of the Fisher information matrix, corresponding to spherical harmonic functions of order ≤2.

In network embedding, random walks play a fundamental role in preserving network structures. However, random walk based embedding methods have two limitations. First, random walk methods are fragile when the sampling frequency or the number of node sequences changes. Second, in disequilibrium networks such as highly bi…

2018-05-09abs ↗pdf ↗

Study neural networks by mapping correlations, revealing essential statistics.

problem Understanding information processing in trained neural networks.
method Characterize neural network as distribution transformations, focusing on correlation functions.
result Higher-order correlations are crucial for internal layers, while input layer captures more.

MCFNet recovers spatial detail and fuses it with semantic information for real-time segmentation.

problem Recovering spatial detail information and fusing it with semantic information in real-time.
method Proposes a new architecture (MCFNet) with feature refinement and fusion modules, and a gating unit.
result Achieves competitive performance with high speed (75.5% mIOU, 151.3 FPS on Cityscapes).

The Fisher information metric is an important foundation of information geometry, wherein it allows us to approximate the local geometry of a probability distribution. Recurrent neural networks such as the Sequence-to-Sequence (Seq2Seq) networks that have lately been used to yield state-of-the-art performance on speech…

2017-10-25abs ↗pdf ↗

Several methods of estimating the mutual information of random variables have been developed in recent years. They can prove valuable for novel approaches to learning statistically independent features. In this paper, we use one of these methods, a mutual information neural estimation (MINE) network, to present a proof…

2019-04-22abs ↗pdf ↗

Network data appears in very diverse applications, like biological, social, or sensor networks. Clustering of network nodes into categories or communities has thus become a very common task in machine learning and data mining. Network data comes with some information about the network edges. In some cases, this network…

2018-11-02abs ↗pdf ↗

A neural network approach for feature selection using mutual information.

problem Feature ranking and selection leading to sub-optimal solutions for class separability.
method Stochastic mutual information gradient estimation for dimensionality reduction.
result The network projects features onto an output space maximizing mutual information with class labels.

Tensor networks reveal limitations for efficient text description but suggest potential for images.

problem Efficiently describing large text and image data sets using tensor networks.
method Investigation of mutual information scaling, introduction of mutual information estimators, and use of autoregressive and convolutional neural networks.
result Text data cannot be efficiently described by 1D tensor networks, while images may be better described by 2D tensor networks.

EPINE enhances network embedding by improving adjacency matrix-based high-order proximity.

problem Inaccurate and poorly designed calculation of high-order proximity in network embedding.
method EPINE redefines high-order proximity intuitively and proposes a scalable algorithm for accurate calculation.
result EPINE outperforms existing methods in network reconstruction, link prediction, and node classification.