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.
Semi-decentralized federated learning combines device-to-server and device-to-device communications for faster convergence.
This paper proposes a new D2D data sharing approach to improve distributed machine learning training speed.
D2D converts CLDs into SDMs to explore leverage points under uncertainty.
Recently, how to expand data transmission to reduce cell data and repeated cell transmission has received more and more research attention. In mobile social networks, content popularity prediction has always been an important part of traffic offloading and expanding data dissemination. However, current mainstream conte…
D2D-SPL uses discrete states and a classifier to train RL faster.
Floating Content (FC) is a communication paradigm for the local dissemination of contextualized information through D2D connectivity, in a way which minimizes the use of resources while achieving some specified performance target. Existing approaches to FC dimensioning are based on unrealistic system assumptions that m…
Fog learning distributes ML model training across heterogeneous devices and networks.
Spectrum management and resource allocation (RA) problems are challenging and critical in a vast number of research areas such as wireless communications and computer networks. The traditional approaches for solving such problems usually consume time and memory, especially for large size problems. Recently different ma…
Paper introduces uncertainty injection for deep learning robust optimization.
Develops a neural framework for probabilistic forecasting of dynamical systems.
In most illiquid markets, there is no obvious proxy for the market price of an asset. The European corporate bond market is an archetypal example of such an illiquid market where mid-prices can only be estimated with a statistical model. In this OTC market, dealers / market makers only have access, indeed, to partial i…
Recently multi-domain recommender systems have received much attention from researchers because they can solve cold-start problem as well as support for cross-selling. However, when applying into multi-domain items, although algorithms specifically addressing a single domain have many difficulties in capturing the spec…
A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.
We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…
Community detection improves stock market portfolio optimization.
We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…
Study exact community detection in k-community Gaussian mixtures with different intensities.
The paper introduces a method for detecting principal communities and embedding vertices.
Improved distributed learning with reduced communication costs.
Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…
MACC learns communication protocols by adapting counterfactual reasoning.
A novel framework for adaptive multi-agent communication in reinforcement learning.
A framework for multi-agent communication over noisy channels in reinforcement learning.
Discovering community structure in complex networks is a mature field since a tremendous number of community detection methods have been introduced in the literature. Nevertheless, it is still very challenging for practioners to determine which method would be suitable to get insights into the structural information of…
The analysis of temporal networks has a wide area of applications in a world of technological advances. An important aspect of temporal network analysis is the discovery of community structures. Real data networks are often very large and the communities are observed to have a hierarchical structure referred to as mult…
Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sci…
GRADE models evolving graph dynamics by learning node and community representations.
Paper studies fundamental limits of communication in distributed learning.
Study recovers community structure from coarse graph measurements.
New algorithm reduces communication traffic in decentralized learning.
New method detects overlapping communities in weighted graphs without pure nodes assumption.
I2C enables agents to learn efficient communication without redundancy.
Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.
This paper focuses on two fundamental tasks of graph analysis: community detection and node representation learning, which capture the global and local structures of graphs, respectively. In the current literature, these two tasks are usually independently studied while they are actually highly correlated. We propose a…
We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the indu…
Paper proposes a method to detect fair communities in graphs considering demographic attributes.
Generative model for creating graphs with new communities.
Study examines Fed's pandemic communication strategies.
We propose and analyze a generic method for community recovery in stochastic block models and degree corrected block models. This approach can exactly recover the hidden communities with high probability when the expected node degrees are of order or higher. Starting from a roughly correct community partition …
Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate …
The paper introduces curvature-based clustering algorithms for graph analysis.
Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCB…
Local network community detection aims to find a single community in a large network, while inspecting only a small part of that network around a given seed node. This is much cheaper than finding all communities in a network. Most methods for local community detection are formulated as ad-hoc optimization problems. In…
Attention to entropic communication improves message decoding and cooperation.
New algorithms reduce communication costs in collaborative learning.
Study shows it's impossible to count communities without finding them.
Community detection in graphs has been extensively studied both in theory and in applications. However, detecting communities in hypergraphs is more challenging. In this paper, we propose a tensor decomposition approach for guaranteed learning of communities in a special class of hypergraphs modeling social tagging sys…
A new MARL framework for community-based cooperation with transfer and active exploration.