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,742 papers · 148 categories

Trend · papers per month

3877115153 · Jun 202019922001200920172026
48 results for emergent communication

How do we know if communication is emerging in a multi-agent system? The vast majority of recent papers on emergent communication show that adding a communication channel leads to an increase in reward or task success. This is a useful indicator, but provides only a coarse measure of the agent's learned communication a…

2019-03-12abs ↗pdf ↗

A standard belief on emerging collective behavior is that it emerges from simple individual rules. Most of the mathematical research on such collective behavior starts from imperative individual rules, like always go to the center. But how could an (optimal) individual rule emerge during a short period within the group…

2018-02-21abs ↗pdf ↗

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.

We examine the effects of instantiating Lewis signaling games within a population of speaker and listener agents with the aim of producing a set of general and robust representations of unstructured pixel data. Preliminary experiments suggest that the set of representations associated with languages generated within a …

2019-11-06abs ↗pdf ↗

Neural node embeddings have recently emerged as a powerful representation for supervised learning tasks involving graph-structured data. We leverage this recent advance to develop a novel algorithm for unsupervised community discovery in graphs. Through extensive experimental studies on simulated and real-world data, w…

2016-11-09abs ↗pdf ↗

The paper examines efficient algorithms for linear regression over resource-limited networks.

problem Efficient communication in distributed learning over resource-limited networks.
method Developed algorithms for communication-efficient learning of linear regression tasks.
result The algorithms enable a tradeoff between communication and learning with theoretical performance guarantees.

Study shows it's impossible to count communities without finding them.

problem Determining the number and sizes of communities in random graph models.
method Hypothesis testing between models with different community structures, using low-degree polynomial framework.
result Testing between two different planted distributions is as hard as finding the communities.

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.

Paper proposes AggITD for efficient federated hypergradient computation.

problem Computing hypergradient in federated settings is challenging due to distributed and nonlinear construction of global Hessian matrices.
method AggITD: a novel communication-efficient federated hypergradient estimator via aggregated iterative differentiation.
result AggITD achieves the same sample complexity as AID-based approaches but with fewer communication rounds, especially in heterogeneous data environments.

Decentralized machine learning is a promising emerging paradigm in view of global challenges of data ownership and privacy. We consider learning of linear classification and regression models, in the setting where the training data is decentralized over many user devices, and the learning algorithm must run on-device, …

2018-08-13abs ↗pdf ↗

Modularity-aware GAE and VGAE improve community detection and link prediction.

problem Improving community detection with GAE and VGAE in the absence of node features.
method Introducing a modularity-aware message passing scheme and regularizer to GAE and VGAE encoders.
result Jointly addressing community detection and link prediction with high accuracy is possible.

DESTRESS optimizes decentralized nonconvex optimization with optimal IFO complexity and efficient communication.

problem Decentralized nonconvex finite-sum optimization in multi-agent systems.
method DESTRESS uses stochastic recursive gradient updates, gradient tracking, and careful hyper-parameter choices to achieve optimal IFO complexity with efficient communication.
result DESTRESS matches the optimal IFO complexity of centralized algorithms while maintaining communication efficiency.

SimFBO simplifies FBO, making it more efficient and flexible.

problem Complex nested optimization in machine learning and edge computing.
method Proposes SimFBO, a simple and flexible FBO framework with improved communication efficiency.
result SimFBO and ShroFBO achieve linear convergence speedup and improved sample and communication complexities.

In the age of globalization, it is natural that the stock market of each country is not independent form the other markets. In this case, collective behavior could be emerged form their dependency together. This article studies the collective behavior of a set of forty influential markets in the world economy with the …

2017-03-26abs ↗pdf ↗

Improved community detection and link prediction with GAE and VGAE.

problem Jointly improving community detection and link prediction with graph autoencoders.
method Introducing a community-preserving message passing scheme and doping encoders with Louvain-based prior communities.
result Empirical effectiveness of Modularity-Aware GAE and VGAE on various real-world graphs.

Networks have been a general tool for representing, analyzing, and modeling relational data arising in several domains. One of the most important aspect of network analysis is community detection or network clustering. Until recently, the major focus have been on discovering community structure in single (i.e., monople…

2016-12-01abs ↗pdf ↗

Using a data set which includes all transactions among banks in the Italian money market, we study their trading strategies and the dependence among them. We use the Fourier method to compute the variance-covariance matrix of trading strategies. Our results indicate that well defined patterns arise. Two main communitie…

2006-11-02abs ↗pdf ↗

A challenging problem in the study of complex systems is that of resolving, without prior information, the emergent, mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are …

2013-11-08abs ↗pdf ↗

Community detection, which focuses on clustering nodes or detecting communities in (mostly) a single network, is a problem of considerable practical interest and has received a great deal of attention in the research community. While being able to cluster within a network is important, there are emerging needs to be ab…

2016-06-08abs ↗pdf ↗

We present new algorithms for detecting the emergence of a community in large networks from sequential observations. The networks are modeled using Erdos-Renyi random graphs with edges forming between nodes in the community with higher probability. Based on statistical changepoint detection methodology, we develop thre…

2014-07-22abs ↗pdf ↗

Networks are ubiquitous in science and have become a focal point for discussion in everyday life. Formal statistical models for the analysis of network data have emerged as a major topic of interest in diverse areas of study, and most of these involve a form of graphical representation. Probability models on graphs dat…

2009-12-29abs ↗pdf ↗

Decentralized optimization is emerging as a viable alternative for scalable distributed machine learning, but also introduces new challenges in terms of synchronization costs. To this end, several communication-reduction techniques, such as non-blocking communication, quantization, and local steps, have been explored i…

2019-10-27abs ↗pdf ↗

This article reviews recent advances in convex optimization algorithms for Big Data, which aim to reduce the computational, storage, and communications bottlenecks. We provide an overview of this emerging field, describe contemporary approximation techniques like first-order methods and randomization for scalability, a…

2014-11-04abs ↗pdf ↗

This paper reviews methods for distributed training of machine learning models from high-rate streams.

problem Training machine learning models from high-rate distributed streams in a compute- and bandwidth-limited setting.
method Recently developed methods for large-scale distributed stochastic optimization.
result There exist regimes where systems can learn from distributed, streaming data at order-optimal rates.

A current challenge for data management systems is to support the construction and maintenance of machine learning models over data that is large, multi-dimensional, and evolving. While systems that could support these tasks are emerging, the need to scale to distributed, streaming data requires new models and algorith…

2017-10-05abs ↗pdf ↗

A deep RL approach learns multi-agent coordination through dynamic graph communication.

problem Learning collaborative policies in multi-agent systems.
method Connectivity Driven Communication (CDC) approach using graph-based attention mechanisms.
result CDC learns effective collaborative policies and outperforms other methods in cooperative navigation tasks.

This paper analyzes energy and carbon footprints in distributed and federated learning.

problem High energy costs and carbon emissions in centralized AI methods.
method A novel framework quantifying energy and carbon footprints in vanilla and consensus-based FL methods.
result Optimal bounds and operational points for green FL designs and sustainability assessment.