SearcharxivSearch

arXiv subjects

Yanhui Wu

Publications and source records attributed to Yanhui Wu.

3 recordsLinked to original sources

Local Information for Global Network Estimation in Latent Space Models

In many social networks, an individual observes only a restricted local view of the full network structure. We study such local views under a partial information framework that models an individual's observations as a subgraph based on path length, and address the problem of estimating a general latent space model from a single individual's local view. Compared to the full network, the partial information network contains many missing edges and depends on a random, potentially sparse neighborhood, posing significant challenges for estimation. We propose a projected gradient descent algorithm for maximum likelihood estimation and establish theoretical guarantees for its convergence under both conditional likelihood and full likelihood settings. To characterize the quality of a local view, we introduce an imbalance measure as a theoretical and diagnostic quantity for assessing bias in a local view and show that it plays a central role in determining convergence rates and estimation error bounds. Using simulated networks, we demonstrate that satisfactory estimation is possible from a single local view. In an application to U.S. Congress cosponsorship networks, we show how the estimated latent positions reveal nuanced structure in legislators' social relationships.

stat.ME

Neyman-Pearson and equal opportunity: when efficiency meets fairness in classification

Organizations often rely on statistical algorithms to make socially and economically impactful decisions. We must address the fairness issues in these important automated decisions. On the other hand, economic efficiency remains instrumental in organizations' survival and success. Therefore, a proper dual focus on fairness and efficiency is essential in promoting fairness in real-world data science solutions. Among the first efforts towards this dual focus, we incorporate the equal opportunity (EO) constraint into the Neyman-Pearson (NP) classification paradigm. Under this new NP-EO framework, we (a) derive the oracle classifier, (b) propose finite-sample based classifiers that satisfy population-level fairness and efficiency constraints with high probability, and (c) demonstrate statistical and social effectiveness of our algorithms on simulated and real datasets.

stat.ME

Intentional Control of Type I Error over Unconscious Data Distortion: a Neyman-Pearson Approach to Text Classification

This paper addresses the challenges in classifying textual data obtained from open online platforms, which are vulnerable to distortion. Most existing classification methods minimize the overall classification error and may yield an undesirably large type I error (relevant textual messages are classified as irrelevant), particularly when available data exhibit an asymmetry between relevant and irrelevant information. Data distortion exacerbates this situation and often leads to fallacious prediction. To deal with inestimable data distortion, we propose the use of the Neyman-Pearson (NP) classification paradigm, which minimizes type II error under a user-specified type I error constraint. Theoretically, we show that the NP oracle is unaffected by data distortion when the class conditional distributions remain the same. Empirically, we study a case of classifying posts about worker strikes obtained from a leading Chinese microblogging platform, which are frequently prone to extensive, unpredictable and inestimable censorship. We demonstrate that, even though the training and test data are susceptible to different distortion and therefore potentially follow different distributions, our proposed NP methods control the type I error on test data at the targeted level. The methods and implementation pipeline proposed in our case study are applicable to many other problems involving data distortion.

stat.ME