More Like this

1. Uncertainty Quantification for Fairness in Two-Stage Recommender Systems

   https://doi.org/10.1145/3539597.3570469  

   Wang, Lequn; Joachims, Thorsten (February 2023, ACM Conference on Web Search and Data Mining (WSDM))

   Many large-scale recommender systems consist of two stages. The first stage efficiently screens the complete pool of items for a small subset of promising candidates, from which the second-stage model curates the final recommendations. In this paper, we investigate how to ensure group fairness to the items in this two-stage architecture. In particular, we find that existing first-stage recommenders might select an irrecoverably unfair set of candidates such that there is no hope for the second-stage recommender to deliver fair recommendations. To this end, motivated by recent advances in uncertainty quantification, we propose two threshold-policy selection rules that can provide distribution-free and finite-sample guarantees on fairness in first-stage recommenders. More concretely, given any relevance model of queries and items and a point-wise lower confidence bound on the expected number of relevant items for each threshold-policy, the two rules find near-optimal sets of candidates that contain enough relevant items in expectation from each group of items. To instantiate the rules, we demonstrate how to derive such confidence bounds from potentially partial and biased user feedback data, which are abundant in many large-scale recommender systems. In addition, we provide both finite-sample and asymptotic analyses of how close the two threshold selection rules are to the optimal thresholds. Beyond this theoretical analysis, we show empirically that these two rules can consistently select enough relevant items from each group while minimizing the size of the candidate sets for a wide range of settings. 

   more » « less
2. Search for Gravitational Waves Associated with Fast Radio Bursts Detected by CHIME/FRB during the LIGO–Virgo Observing Run O3a

   https://doi.org/10.3847/1538-4357/acd770  

   Abbott, R.; Abbott, T. D.; Acernese, F.; Ackley, K.; Adams, C.; Adhikari, N.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Agarwal, D.; et al (September 2023, The Astrophysical Journal)

   Abstract We search for gravitational-wave (GW) transients associated with fast radio bursts (FRBs) detected by the Canadian Hydrogen Intensity Mapping Experiment Fast Radio Burst Project, during the first part of the third observing run of Advanced LIGO and Advanced Virgo (2019 April 1 15:00 UTC–2019 October 1 15:00 UTC). Triggers from 22 FRBs were analyzed with a search that targets both binary neutron star (BNS) and neutron star–black hole (NSBH) mergers. A targeted search for generic GW transients was conducted on 40 FRBs. We find no significant evidence for a GW association in either search. Given the large uncertainties in the distances of our FRB sample, we are unable to exclude the possibility of a GW association. Assessing the volumetric event rates of both FRB and binary mergers, an association is limited to 15% of the FRB population for BNS mergers or 1% for NSBH mergers. We report 90% confidence lower bounds on the distance to each FRB for a range of GW progenitor models and set upper limits on the energy emitted through GWs for a range of emission scenarios. We find values of order 10⁵¹–10⁵⁷erg for models with central GW frequencies in the range 70–3560 Hz. At the sensitivity of this search, we find these limits to be above the predicted GW emissions for the models considered. We also find no significant coincident detection of GWs with the repeater, FRB 20200120E, which is the closest known extragalactic FRB. 

   more » « less
3. Causal inference with invalid instruments: post-selection problems and a solution using searching and sampling

   https://doi.org/10.1093/jrsssb/qkad049  

   Guo, Zijian (May 2023, Journal of the Royal Statistical Society Series B: Statistical Methodology)

   Abstract Instrumental variable methods are among the most commonly used causal inference approaches to deal with unmeasured confounders in observational studies. The presence of invalid instruments is the primary concern for practical applications, and a fast-growing area of research is inference for the causal effect with possibly invalid instruments. This paper illustrates that the existing confidence intervals may undercover when the valid and invalid instruments are hard to separate in a data-dependent way. To address this, we construct uniformly valid confidence intervals that are robust to the mistakes in separating valid and invalid instruments. We propose to search for a range of treatment effect values that lead to sufficiently many valid instruments. We further devise a novel sampling method, which, together with searching, leads to a more precise confidence interval. Our proposed searching and sampling confidence intervals are uniformly valid and achieve the parametric length under the finite-sample majority and plurality rules. We apply our proposal to examine the effect of education on earnings. The proposed method is implemented in the R package RobustIV available from CRAN. 

   more » « less
4. An Exploratory Study of Bot Commits

   https://doi.org/10.1145/3387940.3391502  

   Dey, T. (January 2020, IEEE International Working Conference on Mining Software Repositories)

   Background: Bots help automate many of the tasks performed by software developers and are widely used to commit code in various social coding platforms. At present, it is not clear what types of activities these bots perform and understanding it may help design better bots, and find application areas which might benefit from bot adoption. Aim: We aim to categorize the Bot Commits by the type of change (files added, deleted, or modified), find the more commonly changed file types, and identify the groups of file types that tend to get updated together. Method: 12,326,137 commits made by 461 popular bots (that made at least 1000 commits) were examined to identify the frequency and the type of files added/ deleted/ modified by the commits, and association rule mining was used to identify the types of files modified together. Result: Majority of the bot commits modify an existing file, a few of them add new files, while deletion of a file is very rare. Commits involving more than one type of operation are even rarer. Files containing data, configuration, and documentation are most frequently updated, while HTML is the most common type in terms of the number of files added, deleted, and modified. Files of the type "Markdown", "Ignore List", "YAML", "JSON" were the types that are updated together with other types of files most frequently. Conclusion: We observe that majority of bot commits involve single file modifications, and bots primarily work with data, configuration, and documentation files. A better understanding if this is a limitation of the bots and, if overcome, would lead to different kinds of bots remains an open question. 

   more » « less
5. Robust Monocular Edge Visual Odometry through Coarse-to-Fine Data Association

   https://doi.org/10.1109/IROS45743.2020.9341052  

   Wu, Xiaolong; Vela, Patricio A.; Pradalier, Cedric (October 2020, Intelligent Robots and Systems)

   null (Ed.)

   This work describes a monocular visual odometry framework, which exploits the best attributes of edge features for illumination-robust camera tracking, while at the same time ameliorating the performance degradation of edge mapping. In the front-end, an ICP-based edge registration provides robust motion estimation and coarse data association under lighting changes. In the back-end, a novel edge-guided data association pipeline searches for the best photometrically matched points along geometrically possible edges through template matching, so that the matches can be further refined in later bundle adjustment. The core of our proposed data association strategy lies in a point-to-edge geometric uncertainty analysis, which analytically derives (1) a probabilistic search length formula that significantly reduces the search space and (2) a geometric confidence metric for mapping degradation detection based on the predicted depth uncertainty. Moreover, a match confidence based patch size adaption strategy is integrated into our pipeline to reduce matching ambiguity. We present extensive analysis and evaluation of our proposed system on synthetic and real- world benchmark datasets under the influence of illumination changes and large camera motions, where our proposed system outperforms current state-of-art algorithms. 

   more » « less