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

255176101 · Oct 201919922001200920172026
48 results for Therapeutic Communities

Study shows peers' graduation improves residents' success in TCs.

problem Identifying peer influence in therapeutic communities adjusting for latent homophily.
method Used data on affirmations and exit dates to form peer networks, modeled latent homophily, and proposed bias correction methods.
result Positive effect of peers' graduation on residents' graduation, varying by gender, race, and role model definition.

Microbes are everywhere, including in and on our bodies, and have been shown to play key roles in a variety of prevalent human diseases. Consequently, there has been intense interest in the design of bacteriotherapies or "bugs as drugs," which are communities of bacteria administered to patients for specific therapeuti…

2018-05-11abs ↗pdf ↗

PropEn uses matching to create a larger dataset for efficient design optimization.

problem Limited data and complex landscapes in scientific applications.
method PropEn uses a matching approach to implicitly guide design without a discriminator.
result PropEn efficiently approximates the gradient of property improvement within the data distribution.

New models suggest molecules that are often unfeasible to synthesize.

problem Models suggest molecules that are difficult to synthesize.
method Used a computer-aided synthesis planning program to analyze synthesizability of molecules generated by state-of-the-art models.
result State-of-the-art models generate molecules that are often unfeasible to synthesize.

Determining the optimal initial dose for warfarin is a critically important task. Several factors have an impact on the therapeutic dose for individual patients, such as patients' physical attributes (Age, Height, etc.), medication profile, co-morbidities, and metabolic genotypes (CYP2C9 and VKORC1). These wide range f…

2019-03-21abs ↗pdf ↗

Warfarin dosing remains challenging due to narrow therapeutic index and highly individual variability. Incorrect warfarin dosing is associated with devastating adverse events. Remarkable efforts have been made to develop the machine learning based warfarin dosing algorithms incorporating clinical factors and genetic va…

2018-09-10abs ↗pdf ↗

RL algorithms with medical integration improve personalized treatment recommendations.

problem Developing effective personalized treatment strategies for chronic diseases.
method Integrating medical knowledge into RL algorithms for DTR.
result Enhanced treatment recommendations with increased confidence.

Personalized cancer vaccines are envisioned as the next generation rational cancer immunotherapy. The key step in developing personalized therapeutic cancer vaccines is to identify tumor-specific neoantigens that are on the surface of tumor cells. A promising method for this is through de novo peptide sequencing from m…

2019-04-17abs ↗pdf ↗

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…

2017-10-11abs ↗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.

A broad spectrum of data from different modalities are generated in the healthcare domain every day, including scalar data (e.g., clinical measures collected at hospitals), tensor data (e.g., neuroimages analyzed by research institutes), graph data (e.g., brain connectivity networks), and sequence data (e.g., digital f…

2018-03-23abs ↗pdf ↗

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

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…

2018-08-26abs ↗pdf ↗

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.

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.

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…

2013-01-11abs ↗pdf ↗

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\ell_1-regularized pseudo-likelihood approach for fair graphical model selection.
result The method ensures demographic groups are fairly represented within detected communities.

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.

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.