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

Trend · papers per month

3367100133 · Oct 201919922001200920172026
48 results for community notes

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…

2017-10-11abs ↗pdf ↗

Patient summarization is essential for clinicians to provide coordinated care and practice effective communication. Automated summarization has the potential to save time, standardize notes, aid clinical decision making, and reduce medical errors. Here we provide an upper bound on extractive summarization of discharge …

2018-10-26abs ↗pdf ↗

Community moderation drifts towards majority, study finds.

problem How to ensure crowd-sourced moderation systems trust and reward accurate evaluations.
method Consensus-based auditing with a two-stage algorithm that weights contributors by the stability of their past residuals.
result Minority contributors' evaluations drift towards the majority, and their participation share falls on controversial topics.

The paper reviews methods for determining the number of communities in network data.

problem Determining the number of communities in network data.
method Statistical methods for hypothesis testing and clustering in network models.
result SCORE and NCV methods evaluated for clustering in Degree-Corrected Block Models, with NCV facing challenges.

Recently, our group has published two papers that have received some attention in the finance community. One is about the profitability of trend following strategies over 200 years, the second is about the correlation between the profitability of "Risk Premia" and their skewness. In this short note, we present two addi…

2017-08-25abs ↗pdf ↗

Study on limits of LLM-based multi-agent planning reliability.

problem Reliability limits of LLM-based multi-agent planning.
method Modeling LLM-based multi-agent architecture as a decision network, showing dominance by centralized Bayes decision maker.
result Optimizing multi-agent directed acyclic graphs under communication budget is equivalent to choosing a constrained experiment.

Biological datasets amenable to applied machine learning are more available today than ever before, yet they lack adequate representation in the Data-for-Good community. Here we present a work in progress case study performing analysis on antimicrobial resistance (AMR) using standard ensemble machine learning technique…

2016-07-05abs ↗pdf ↗

The tetrahedral index connects to a q-Bessel function, revealing new mathematical techniques.

problem Exploring connections between the tetrahedral index and Hahn-Exton q-Bessel function.
method Establishing a correspondence between the tetrahedral index and the q-Bessel function.
result New techniques and conjectures in q-hypergeometric theory.

Short note on soft-max and policy gradients in bandit problems using Lyapunov functions.

problem Analyzing soft-max and policy gradient methods in bandit problems.
method Lyapunov function argument for soft-max and differential equations for policy gradient algorithms.
result Regret bounds for soft-max and a different policy gradient algorithm in bandit problems.

Graph embeddings from commute networks identify socioeconomic disparities in urban areas.

problem Urban delineation and socioeconomic group identification.
method Graph Neural Network (GNN) for modeling commute networks and deriving node embeddings.
result GNNs effectively capture socioeconomic disparities between urban communities.

New algorithms for community detection in graphs with privacy constraints.

problem Community recovery in stochastic block models with node-wise privacy.
method Spectral clustering with privacy mechanisms, including privatized PCA, convex optimization, and matrix estimation.
result Developed algorithms that are computable in polynomial-time and achieve consistent community estimation under node differential privacy.

In this note we study the bilateral merchandise trade flows between 186 countries over the 1948-2005 period using data from the International Monetary Fund. We use Pajek to identify network structure and behavior across thresholds and over time. In particular, we focus on the evolution of trade "islands" in the a world…

2007-09-15abs ↗pdf ↗

In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different t…

2013-08-15abs ↗pdf ↗

The paper addresses optimal control in modern tontines with bequest preferences, showing a linear investment strategy.

problem Optimal controls and decreasing allocation in modern tontines with bequest preferences.
method Dual approach to solve optimal control problems with power utilities, modeling bequest preferences.
result Investment strategy almost linearly adjusts from 0% to 100% over time.

This paper extends Newton's method to distributed learning, avoiding saddle points and handling Byzantine workers.

problem Avoiding saddle points in distributed non-convex optimization, especially in the presence of Byzantine workers.
method Extends cubic-regularized Newton method to distributed framework, addressing communication bottlenecks and Byzantine attacks.
result The method achieves improved iteration complexity compared to first-order methods, with a 25% improvement in experiments.

In this short Note, we establish that the constant C1C_1 in Lemma 0.40.4 of the correction (Correction to Section 19.2 of Ricci Flow and the Poincare Conjecture, arXiv/math/DG:1512.00699 (2015)) by John Morgan and Gang Tian to their Clay Institute Monograph (Ricci Flow and the Poincare Conjecture, vol. 3, Clay Mathemati…

2015-12-07abs ↗pdf ↗

Spatial statisticians and quantitative investors use the same mathematical object: a Schur complement, damped by one parameter.

problem The Schur complement is used in both spatial modeling and portfolio allocation, but the parameters are different.
method The Schur complement is interpreted as reliability shrinkage of a conditional Gaussian.
result The Schur complement is the same in both applications.

Tasks involving the analysis of geometric (graph- and manifold-structured) data have recently gained prominence in the machine learning community, giving birth to a rapidly developing field of geometric deep learning. In this work, we leverage graph neural networks to improve signal detection in the IceCube neutrino ob…

2018-09-17abs ↗pdf ↗

This work improves privacy in federated combinatorial bandits by balancing regret and privacy.

problem Privacy-preserving learning in competitive online learning settings with quality constraints.
method Proposes P-FCB algorithm for federated combinatorial bandits, balancing regret and privacy.
result Improves regret while maintaining quality constraints and privacy guarantees.

In this work we introduce malware detection from raw byte sequences as a fruitful research area to the larger machine learning community. Building a neural network for such a problem presents a number of interesting challenges that have not occurred in tasks such as image processing or NLP. In particular, we note that …

2017-10-25abs ↗pdf ↗

In the Compressed Sensing community, it is well known that given a matrix XRn×pX \in \mathbb R^{n\times p} with 2\ell_2 normalized columns, the Restricted Isometry Property (RIP) implies the Null Space Property (NSP). It is also well known that a small Coherence μμ implies a weak RIP, i.e. the singular values of XTX_T l…

2016-06-29abs ↗pdf ↗

Dataset of Bose-Einstein condensates images aids ML in many-body physics.

problem Understanding solitons in Bose-Einstein condensates.
method Machine learning (ML) framework with convolutional neural networks and physics-informed classifiers.
result Automatic labeling of solitonic excitations in experimental images.

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.

In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for nn-party real summation in the shuffle model of differential privacy with Oε,δ(1)O_{ε, δ}(1) error and Θ(εn)Θ(ε\sqrt{n}) one-bit messages per party. In contrast, every local model protocol for real summation must incur error Ω(1/n)Ω(1/\sqrt{n}), and there exist …

2019-06-20abs ↗pdf ↗

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…

2017-02-24abs ↗pdf ↗

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)O(\log T), 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…

2013-09-01abs ↗pdf ↗

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 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.