Graphs help agents learn emergent communication.
problem Learning robust communication protocols in multi-agent systems.
method Graph convolutional networks to model emergent language and cooperation.
result Agents learn to generalize beyond training samples, revealing true factors of variation.
Self-supervised learning of visual semantics in image games.
problem Learning visual semantics in referential emergent language games.
method Investigating the impact of feature extractor weights and tasks on visual semantics, using various image augmentations and additional tasks.
result Communication systems can learn visual semantics in a self-supervised manner by playing the right types of games.
Graph neural networks help AI agents learn more complex language.
problem Understanding how AI agents learn and use language.
method Developed graph referential games to compare different AI models.
result Graph neural networks enable AI to learn more complex, compositional language.
Self-referential meta learning avoids explicit optimization by modifying itself.
problem Dependency on human engineering in meta learning algorithms.
method Investigates self-referential meta learning systems that modify themselves without explicit optimization.
result Self-referential neural networks can improve their own modifications without explicit optimization.
Cycles in causal learning cause feedback loops under intervention.
problem Cyclic causal structures lead to feedback loops in causal inference.
method Theoretical observations about self-referential distributions and their factorizations.
result Cyclic causal dependence can exist even when observational data suggest independence.
The paper investigates how supervised learning and self-play improve sample efficiency in teaching AI to communicate.
problem Improving sample efficiency in training AI to use natural language.
method Investigates the relationship between supervised learning and self-play, introduces supervised self-play (S2P).
result First training agents via supervised learning followed by self-play outperforms self-play followed by supervised learning.
Dynamic meta-learning improves multi-agent communication with natural language.
problem Static population-based approaches struggle with adapting to human partners using natural language.
method Dynamic population-based meta-learning approach.
result Agents outperform all prior work in communicating with seen partners and humans.
Interpretation of electroencephalogram (EEG) signals can be complicated by obfuscating artifacts. Artifact detection plays an important role in the observation and analysis of EEG signals. Spatial information contained in the placement of the electrodes can be exploited to accurately detect artifacts. However, when few…
In this paper the introduction of notion of reference vector paves the way for a combination of classical and social approaches in the framework of referential preferences given by matrix groups. It is shown that individual demand issue from rational decision does not depend on that reference.
New phenomena in 4-manifolds show discs with special properties.
problem Exploring special properties of discs in 4-manifolds.
method Construction of discs with geometrically dual spheres and analysis of isotopy.
result Discs with common geometrically dual spheres are not properly isotopic but are otherwise related.
Tian and Yau constructed a complete Ricci-flat Kähler metric on the complement of an ample and smooth anticanonical divisor. We inquire into the behaviour of this metric towards the boundary divisor and prove a slow decay rate of the difference to an appropriate explicitely given referential metric.
We introduce a method to infer lead-lag networks of agents' actions in complex systems. These networks open the way to both microscopic and macroscopic states prediction in such systems. We apply this method to trader-resolved data in the foreign exchange market. We show that these networks are remarkably persistent, w…
FHRN uses continuous-time dynamics to stabilize reentrant neural computation.
problem Stabilizing reentrant neural computation.
method Formulated as a continuous-time neural-ODE system, revealing norm-regulated reentry.
result Achieves stable oscillatory trajectories through population-level gain modulation.
Clinical electroencephalographic (EEG) data varies significantly depending on a number of operational conditions (e.g., the type and placement of electrodes, the type of electrical grounding used). This investigation explores the statistical differences present in two different referential montages: Linked Ear (LE) and…
Sharp pseudospectral bounds prevent transient amplification in coupled gradient descent.
problem Transient amplification in coupled gradient descent systems.
method Developed a sharp pseudospectral theory for block-triangular Jacobians, proving Kreiss constant bounds and matching minimax lower bounds.
result Obtained a finite-horizon iteration-complexity bound of O(K(J)2log(1/δ)) for stochastic coupled descent. Revisits elastic string model to explain interest rate correlations.
problem Describing the forward interest rate curve using an elastic string model.
method Reinterprets Baaquie and Bouchaud's (2004) model to highlight market forces.
result Model accurately reproduces FRC correlation structure with minimal parameters.
Financial and economic history is strewn with bubbles and crashes, booms and busts, crises and upheavals of all sorts. Understanding the origin of these events is arguably one of the most important problems in economic theory. In this paper, we review recent efforts to include heterogeneities and interactions in models…
A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.
problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.
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.
problem Improving portfolio optimization in financial markets.
method Community detection in correlation-based networks of worldwide stock markets.
result Portfolios constructed using community detection outperform traditional methods.
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.
problem Community detection in k-community Gaussian mixtures with varying intensities.
method Explicitly find the threshold for exact recovery of maximum likelihood estimation.
result Threshold for exact recovery of maximum likelihood estimation is identified.
The paper introduces a method for detecting principal communities and embedding vertices.
problem Detecting and embedding vertices in graphs with community structure.
method Principal graph encoder embedding method that detects principal communities and produces vertex embeddings.
result The method successfully detects principal communities and produces accurate vertex embeddings.
Improved distributed learning with reduced communication costs.
problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT), improving significantly on full communication. 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.
problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.
A novel framework for adaptive multi-agent communication in reinforcement learning.
problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.
A framework for multi-agent communication over noisy channels in reinforcement learning.
problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.
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.
problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.
Paper studies fundamental limits of communication in distributed learning.
problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.
Study recovers community structure from coarse graph measurements.
problem Community recovery from low-resolution graph measurements.
method Formalized coarsening process of graph measurements, developed conditions for perfect recovery.
result Simple and closed-form asymptotic conditions for perfect recovery of coarse graph communities.
New algorithm reduces communication traffic in decentralized learning.
problem Communication bottleneck in decentralized learning for low-bandwidth workers.
method Sparsification and adaptive peer selection to reduce communication traffic.
result Significant reduction in communication traffic compared to existing methods.
New method detects overlapping communities in weighted graphs without pure nodes assumption.
problem Detect overlapping communities in weighted graphs without making pure nodes assumption.
method Convex optimization-based approach for weighted graphs.
result Success on artificial and real-world datasets.
I2C enables agents to learn efficient communication without redundancy.
problem Redundant broadcast communication in multi-agent cooperation.
method I2C learns a prior for agent-agent communication via causal inference and reinforcement learning.
result I2C reduces communication overhead and improves multi-agent cooperative performance.
Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.
problem Exact recovery of communities in weighted graphs with Gaussian and exponential distributions.
method Introduces a new semi-metric to describe conditions for exact recovery and analyzes conditions for both complete and incomplete graphs.
result Necessary and sufficient conditions for exact recovery are asymptotically tight and applicable to both complete and incomplete graphs.
HSQ reduces communication costs in federated learning.
problem High cost of communicating gradients in federated learning.
method Hyper-sphere quantization (HSQ) framework for efficient gradient compression.
result HSQ achieves O(logd) per-iteration communication cost, significantly reducing costs without compromising accuracy. 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…
Generative model for creating graphs with new communities.
problem Generating graphs with a new community structure.
method Fit Gaussian mixture model to latent space data and add new clusters based on MDL principle.
result Empirically demonstrated effectiveness of GCA for generating graphs with new community structures.
Paper proposes a method to detect fair communities in graphs considering demographic attributes.
problem Inconsistent community detection violates fairness constraints for nodes with demographic attributes.
method Develops an ℓ1-regularized pseudo-likelihood approach for fair graphical model selection. result The method ensures demographic groups are fairly represented within detected communities.
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…
Study examines Fed's pandemic communication strategies.
problem Analyzing Federal Reserve's communication during the COVID-19 pandemic.
method Sentiment analysis, topic modeling, comparative analysis of previous crises.
result Fed's communication during the pandemic focused on financial stability, market volatility, social welfare, and unconventional monetary policy.
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 logn 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.
problem Identifying densely connected substructures in graphs for community detection.
method Discrete Ricci curvatures and geometric flows to reveal community structure.
result The curvature-based approach can identify overlapping communities in graphs.
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…