skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Yu, Christina"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available May 3, 2026
  2. Free, publicly-accessible full text available January 31, 2026
  3. Meka, Raghu (Ed.)
    Matrix completion tackles the task of predicting missing values in a low-rank matrix based on a sparse set of observed entries. It is often assumed that the observation pattern is generated uniformly at random or has a very specific structure tuned to a given algorithm. There is still a gap in our understanding when it comes to arbitrary sampling patterns. Given an arbitrary sampling pattern, we introduce a matrix completion algorithm based on network flows in the bipartite graph induced by the observation pattern. For additive matrices, we show that the electrical flow is optimal, and we establish error upper bounds customized to each entry as a function of the observation set, along with matching minimax lower bounds. Our results show that the minimax squared error for recovery of a particular entry in the matrix is proportional to the effective resistance of the corresponding edge in the graph. Furthermore, we show that the electrical flow estimator is equivalent to the least squares estimator. We apply our estimator to the two-way fixed effects model and show that it enables us to accurately infer individual causal effects and the unit-specific and time-specific confounders. For rank-1 matrices, we use edge-disjoint paths to form an estimator that achieves minimax optimal estimation when the sampling is sufficiently dense. Our discovery introduces a new family of estimators parametrized by network flows, which provide a fine-grained and intuitive understanding of the impact of the given sampling pattern on the difficulty of estimation at an entry-specific level. This graph-based approach allows us to quantify the inherent complexity of matrix completion for individual entries, rather than relying solely on global measures of performance. 
    more » « less
    Free, publicly-accessible full text available January 1, 2026
  4. Free, publicly-accessible full text available December 10, 2025
  5. Free, publicly-accessible full text available July 7, 2025
  6. We report the in operando visualization of the photocatalytic turnovers on single eosin Y (EY) through a redox-induced photoblinking phenomenon. The photocatalytic cyclization of thiobenzamide (TB) catalyzed by EY was investigated. The analysis of the intensity-versus-time trajectories of single EYs revealed the kinetics and dynamics of the elementary photocatalytic turnovers and the heterogeneity of the activity of individual EYs. The quenching turnover time showed a fast population and a slow population, which could be attributed to the singlet and triplet states of photoexcited EY. The slow quenching turnovers were more dominant at higher TB concentrations. The activity heterogeneity of EYs was studied over a series of reactant concentrations. Excess quenching reagent was found to decrease the percentage of active EYs. The method can be broadly applied to studying the elementary processes of photocatalytic organic reactions in operando. 
    more » « less