LWLawrence M. Wein

Lawrence M. Wein

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lawrence M. Wein has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Analysis of the privacy‐performance tradeoff of reference testing in Forensic Investigative Genetic Genealogy

    by Yuchen Hu, Lawrence M. Wein

    During an investigation using Forensic Investigative Genetic Genealogy, which is a novel approach for solving violent crimes and identifying human remains, reference testing—when law enforcement requests a DNA sample from a person in a partially constructed family tree—is sometimes used when an investigation has stalled. Because the people considered for a reference test have not opted in to allow law enforcement to use their DNA profile in this way, reference testing is viewed by many as an invasion of privacy and by some as unethical. We generalize an existing mathematical optimization model of the genealogy process by incorporating the option of reference testing. Using simulated versions of 17 DNA Doe Project cases, we find that reference testing can solve cases more quickly (although many reference tests are required to substantially hasten the investigative process), but only rarely (<1%) solves cases that cannot otherwise be solved. Through a mixture of mathematical and computational analysis, we find that the most desirable people to test are at the bottom of a path descending from an ancestral couple that is most likely to be related to the target. We also characterize the rare cases where reference testing is necessary for solving the case: when there is only one descending path from an ancestral couple, which precludes the possibility of identifying an intersection (e.g., marriage) between two descendants of two different ancestral couples.


  • Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities

    by Jose H. Blanchet, Martin I. Reiman, Virag Shah, Lawrence M. Wein, Linjia Wu

    The utility of a match in a two-sided matching market often depends on a variety of characteristics of the two agents (e.g., a buyer and a seller) to be matched. In contrast to the matching market literature, this utility may best be modeled by a general matching utility distribution. In “Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities,” Blanchet, Reiman, Shah, Wein, and Wu consider general matching utilities in the context of a centralized dynamic matching market. To analyze this difficult problem, they combine two asymptotic techniques: extreme value theory (and regularly varying functions) and fluid asymptotics of queueing systems. A key trade-off in this problem is market thickness: Do we myopically make the best match that is currently available, or do we allow the market to thicken in the hope of making a better match in the future while avoiding agent abandonment? Their asymptotic analysis derives quite explicit results for this problem and reveals how the optimal amount of market thickness increases with the right tail of the matching utility distribution and the amount of market imbalance. Their use of regularly varying functions also allows them to consider correlated matching utilities (e.g., buyers have positively correlated utilities with a given seller), which is ubiquitous in matching markets.


  • Open Access

    Analysis of the genealogy process in forensic genetic genealogy

    by Mine Su Ertürk, Colleen Fitzpatrick, Margaret Press, Lawrence M. Wein

    The genealogy process is typically the most time‐consuming part of—and a limiting factor in the success of—forensic genetic genealogy, which is a new approach to solving violent crimes and identifying human remains. We formulate a stochastic dynamic program that—given the list of matches and their genetic distances to the unknown target—chooses the best decision at each point in time: which match to investigate (i.e., find its ancestors and look for most recent common ancestors between the match and the target), which set of potential most recent common ancestors to descend from (i.e., find its descendants, with the goal of identifying a marriage between the maternal and paternal sides of the target's family tree), or whether to terminate the investigation. The objective is to maximize the probability of finding the target minus a cost associated with the expected size of the final family tree. We estimate the parameters of our model using data from 17 cases (eight solved, nine unsolved) from the DNA Doe Project. We assess the Proposed Strategy using simulated versions of the 17 DNA Doe Project cases, and compare it to a Benchmark Strategy that ranks matches by their genetic distance to the target and only descends from known common ancestors between a pair of matches. The Proposed Strategy solves cases ≈10 − fold faster than the Benchmark Strategy, and does so by aggressively descending from a set of potential most recent common ancestors between the target and a match even when this set has a low probability of containing the correct most recent common ancestor. Our analysis provides a mathematical foundation for improving the genealogy process in forensic genetic genealogy.


  • Open Access

    Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities

    by Jose H. Blanchet, Martin I. Reiman, Viragh Shah, Lawrence M. Wein, Linjia Wu

    We consider a matching market where buyers and sellers arrive according to independent Poisson processes at the same rate and independently abandon the market if not matched after an exponential amount of time with the same mean. In this centralized market, the utility for the system manager from matching any buyer and any seller is a general random variable. We consider a sequence of systems indexed by $n$ where the arrivals in the $n^{\mathrm{th}}$ system are sped up by a factor of $n$. We analyze two families of one-parameter policies: the population threshold policy immediately matches an arriving agent to its best available mate only if the number of mates in the system is above a threshold, and the utility threshold policy matches an arriving agent to its best available mate only if the corresponding utility is above a threshold. Using a fluid analysis of the two-dimensional Markov process of buyers and sellers, we show that when the matching utility distribution is light-tailed, the population threshold policy with threshold $\frac{n}{\ln n}$ is asymptotically optimal among all policies that make matches only at agent arrival epochs. In the heavy-tailed case, we characterize the optimal threshold level for both policies. We also study the utility threshold policy in an unbalanced matching market with heavy-tailed matching utilities and find that the buyers and sellers have the same asymptotically optimal utility threshold. We derive optimal thresholds when the matching utility distribution is exponential, uniform, Pareto, and correlated Pareto. We find that as the right tail of the matching utility distribution gets heavier, the threshold level of each policy (and hence market thickness) increases, as does the magnitude by which the utility threshold policy outperforms the population threshold policy.

  • Open Access

    Best arm identification in generalized linear bandits

    by Abbas Kazerouni, Lawrence M. Wein


  • No Detectable Surge in SARS-CoV-2 Transmission Attributable to the April 7, 2020 Wisconsin Election

    by Kathy Leung, Joseph T. Wu, Kuang Xu, Lawrence M. Wein

    American Journal of Public Health (AJPH) from the American Public Health Association (APHA) No Detectable Surge in SARS-CoV-2 Transmission Attributable to the April 7, 2020 Wisconsin Election, an article from American Journal of Public Health, Vol 110 Issue 8


  • Open Access

    A cost-effectiveness analysis of the number of samples to collect and test from a sexual assault

    by Zhengli Wang, Kevin MacMillan, Mark Powell, Lawrence M. Wein

    Although the backlog of untested sexual assault kits in the United States is starting to be addressed, many municipalities are opting for selective testing of samples within a kit, where only the most probative samples are tested. We use data from the San Francisco Police Department Criminalistics Laboratory, which tests all samples but also collects information on the samples flagged by sexual assault forensic examiners as most probative, to build a standard machine learning model that predicts (based on covariates gleaned from sexual assault kit questionnaires) which samples are most probative. This model is embedded within an optimization framework that selects which samples to test from each kit to maximize the Combined DNA Index System (CODIS) yield (i.e., the number of kits that generate at least one DNA profile for the criminal DNA database) subject to a budget constraint. Our analysis predicts that, relative to a policy that tests only the samples deemed probative by the sexual assault forensic examiners, the proposed policy increases the CODIS yield by 45.4% without increasing the cost. Full testing of all samples has a slightly lower cost-effectiveness than the selective policy based on forensic examiners, but more than doubles the yield. In over half of the sexual assaults, a sample was not collected during the forensic medical exam from the body location deemed most probative by the machine learning model. Our results suggest that electronic forensic records coupled with machine learning and optimization models could enhance the effectiveness of criminal investigations of sexual assaults. Significance Within the context of sexual assaults, we address a fundamental issue in criminal investigations: how much evidence to collect and process. Using data from the San Francisco Police Department, we show that machine learning algorithms outperform sexual assault forensic examiners at identifying probative samples. Relative to selective testing of samples, testing all DNA samples in a sexual assault kit more than doubles the number of sexual assault kits generating a DNA profile that can be entered into the criminal DNA database, at only a slightly lower benefit-to-cost ratio. Our results suggest that the yield of DNA profiles for the database would increase another 47.2% by collecting samples from the three most probative locations (as deemed by the machine learning algorithm).


  • Open Access

    No Detectable Surge in SARS-CoV-2 Transmission due to the April 7, 2020 Wisconsin Election

    by Kathy Leung, Joseph T. Wu, Kuang Xu, Lawrence M. Wein

    We analyze confirmed cases and new hospitalizations in Wisconsin in the weeks surrounding the April 7, 2020 election, and find no evidence of a surge in SARS-CoV-2 transmission.


  • Open Access

    Best Arm Identification in Generalized Linear Bandits

    by Abbas Kazerouni, Lawrence M. Wein

    Motivated by drug design, we consider the best-arm identification problem in generalized linear bandits. More specifically, we assume each arm has a vector of covariates, there is an unknown vector of parameters that is common across the arms, and a generalized linear model captures the dependence of rewards on the covariate and parameter vectors. The problem is to minimize the number of arm pulls required to identify an arm that is sufficiently close to optimal with a sufficiently high probability. Building on recent progress in best-arm identification for linear bandits (Xu et al. 2018), we propose the first algorithm for best-arm identification for generalized linear bandits, provide theoretical guarantees on its accuracy and sampling efficiency, and evaluate its performance in various scenarios via simulation.