Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lani F. Wu

dblp:55/4887 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-0052-7537ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Transfer learning and domain adaptation · 50% Trustworthy machine learning · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 50% Computational science and engineering · 50%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.412019
Multi-Domain Adversarial Learning · ICLR (Poster) 2019
Machine learning › Transfer learning and domain adaptation › cross-domain learning
multi-domain learning
0.412019
Multi-Domain Adversarial Learning · ICLR (Poster) 2019
Bioinformatics and computational biology › network bioinformatics › biological network analysis
biological network inference
0.212016
PHOCOS: inferring multi-feature phenotypic crosstalk networks · Bioinform. 2016
Computational science and engineering
graph learning
0.212016
PHOCOS: inferring multi-feature phenotypic crosstalk networks · Bioinform. 2016

Methods — techniques the papers use, named apart from their topics

adversarial learning · 0.4robust network inference · 0.2graph-learning paradigm · 0.2
YearPublicationVenuePosition
2019 Multi-Domain Adversarial Learning
Alice Schoenauer Sebag, Louise Heinrich, Marc Schoenauer, Michèle Sebag, Lani F. Wu, Steven J. Altschuler
ICLR (Poster)5
2016 PHOCOS: inferring multi-feature phenotypic crosstalk networks
abstract
MOTIVATION: Quantification of cellular changes to perturbations can provide a powerful approach to infer crosstalk among molecular components in biological networks. Existing crosstalk inference methods conduct network-structure learning based on a single phenotypic feature (e.g. abundance) of a biomarker. These approaches are insufficient for analyzing perturbation data that can contain information about multiple features (e.g. abundance, activity or localization) of each biomarker. RESULTS: We propose a computational framework for inferring phenotypic crosstalk (PHOCOS) that is suitable for high-content microscopy or other modalities that capture multiple phenotypes per biomarker. PHOCOS uses a robust graph-learning paradigm to predict direct effects from potential indirect effects and identify errors owing to noise or missing links. The result is a multi-feature, sparse network that parsimoniously captures direct and strong interactions across phenotypic attributes of multiple biomarkers. We use simulated and biological data to demonstrate the ability of PHOCOS to recover multi-attribute crosstalk networks from cellular perturbation assays. AVAILABILITY AND IMPLEMENTATION: PHOCOS is available in open source at https://github.com/AltschulerWu-Lab/PHOCOS CONTACT: [email protected] or [email protected].
Steven J. Altschuler, Lani F. Wu
Bioinform.3
2011 A Density-Dependent Switch Drives Stochastic Clustering and Polarization of Signaling Molecules
abstract
Positive feedback plays a key role in the ability of signaling molecules to form highly localized clusters in the membrane or cytosol of cells. Such clustering can occur in the absence of localizing mechanisms such as pre-existing spatial cues, diffusional barriers, or molecular cross-linking. What prevents positive feedback from amplifying inevitable biological noise when an un-clustered "off" state is desired? And, what limits the spread of clusters when an "on" state is desired? Here, we show that a minimal positive feedback circuit provides the general principle for both suppressing and amplifying noise: below a critical density of signaling molecules, clustering switches off; above this threshold, highly localized clusters are recurrently generated. Clustering occurs only in the stochastic regime, suggesting that finite sizes of molecular populations cannot be ignored in signal transduction networks. The emergence of a dominant cluster for finite numbers of molecules is partly a phenomenon of random sampling, analogous to the fixation or loss of neutral mutations in finite populations. We refer to our model as the "neutral drift polarity model." Regulating the density of signaling molecules provides a simple mechanism for a positive feedback circuit to robustly switch between clustered and un-clustered states. The intrinsic ability of positive feedback both to create and suppress clustering is a general mechanism that could operate within diverse biological networks to create dynamic spatial organization.
Alexandra Jilkine, Sigurd B. Angenent, Lani F. Wu, Steven J. Altschuler
PLoS Comput. Biol.3