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

Asad Lodhia

dblp:243/3480 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021

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
Graph learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph signal processing
graph denoising
0.612022
Recovering shared structure from multiple networks with unknown edge distributions · J. Mach. Learn. Res. 2022
Bioinformatics and computational biology › neuroscience › neuroinformatics
brain network analysis
0.212022
Recovering shared structure from multiple networks with unknown edge distributions · J. Mach. Learn. Res. 2022

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

random weighted adjacency matrix · 1.7finite-sample concentration inequality · 1.7
YearPublicationVenuePosition
2022 Recovering shared structure from multiple networks with unknown edge distributions
abstract
In increasingly many settings, data sets consist of multiple samples from a population of networks, with vertices aligned across networks; for example, brain connectivity networks in neuroscience. We consider the setting where the observed networks have a shared expectation, but may differ in the noise structure on their edges. Our approach exploits the shared mean structure to denoise edge-level measurements of the observed networks and estimate the underlying population-level parameters. We also explore the extent to which edge-level errors influence estimation and downstream inference. In the process, we establish a finite-sample concentration inequality for the low-rank eigenvalue truncation of a random weighted adjacency matrix, which may be of independent interest. The proposed approach is illustrated on synthetic networks and on data from an fMRI study of schizophrenia.
Keith D. Levin, Asad Lodhia, Elizaveta Levina
J. Mach. Learn. Res.2