Biased Information Search in Homogeneous Groups: Confidence as a Moderator for the Effect of Anticipated Task Requirements

When searching for information, groups that are homogeneous regarding their members’ prediscussion decision preferences show a strong bias for information that supports rather than conflicts with the prevailing opinion (confirmation bias). The present research examined whether homogeneous groups blindly search for information confirming their beliefs irrespective of the anticipated task or whether they are sensitive to the usefulness of new information for this forthcoming task. Results of three experiments show that task sensitivity depends on the groups’ confidence in the correctness of their decision: Moderately confident groups displayed a strong confirmation bias when they anticipated having to give reasons for their decision but showed a balanced information search or even a disconfirmation bias (i.e., predominately seeking conflicting information) when they anticipated having to refute unterarguments. In contrast, highly confident groups demonstrated a strong confirmation bias independent of the anticipated task requirements

Paradoxes in Fair Computer-Aided Decision Making

Computer-aided decision making--where a human decision-maker is aided by a computational classifier in making a decision--is becoming increasingly prevalent. For instance, judges in at least nine states make use of algorithmic tools meant to determine "recidivism risk scores" for criminal defendants in sentencing, parole, or bail decisions. A subject of much recent debate is whether such algorithmic tools are "fair" in the sense that they do not discriminate against certain groups (e.g., races) of people. Our main result shows that for "non-trivial" computer-aided decision making, either the classifier must be discriminatory, or a rational decision-maker using the output of the classifier is forced to be discriminatory. We further provide a complete characterization of situations where fair computer-aided decision making is possible

A Note on the Usefulness of Constrained Fourth-Order Latent Differential Equation Models in the Case of Small T

Constrained fourth-order latent differential equation (FOLDE) models have been proposed (e.g., Boker et al. 2020) as alternative to second-order latent differential equation (SOLDE) models to estimate second-order linear differential equation systems such as the damped linear oscillator model. When, however, only a relatively small number of measurement occasions T are available (i.e., T=50), the recommendation of which model to use is not clear (Boker et al. 2020). Based on a data set, which consists of T=56 observations of daily stress for N=44 individuals, we illustrate that FOLDE can help to choose an embedding dimension, even in the case of a small T. This is of great importance, as parameter estimates depend on the embedding dimension as well as on the latent differential equations model. Consequently, the wavelength as quantity of potential substantive interest may vary considerably. We extend the modeling approaches used in past research by including multiple subjects, by accounting for individual differences in equilibrium, and by including multiple instead of one single observed indicator.Peer Reviewe

Private Multiplicative Weights Beyond Linear Queries

A wide variety of fundamental data analyses in machine learning, such as linear and logistic regression, require minimizing a convex function defined by the data. Since the data may contain sensitive information about individuals, and these analyses can leak that sensitive information, it is important to be able to solve convex minimization in a privacy-preserving way. A series of recent results show how to accurately solve a single convex minimization problem in a differentially private manner. However, the same data is often analyzed repeatedly, and little is known about solving multiple convex minimization problems with differential privacy. For simpler data analyses, such as linear queries, there are remarkable differentially private algorithms such as the private multiplicative weights mechanism (Hardt and Rothblum, FOCS 2010) that accurately answer exponentially many distinct queries. In this work, we extend these results to the case of convex minimization and show how to give accurate and differentially private solutions to *exponentially many* convex minimization problems on a sensitive dataset

Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search

We present a framework for quantifying and mitigating algorithmic bias in mechanisms designed for ranking individuals, typically used as part of web-scale search and recommendation systems. We first propose complementary measures to quantify bias with respect to protected attributes such as gender and age. We then present algorithms for computing fairness-aware re-ranking of results. For a given search or recommendation task, our algorithms seek to achieve a desired distribution of top ranked results with respect to one or more protected attributes. We show that such a framework can be tailored to achieve fairness criteria such as equality of opportunity and demographic parity depending on the choice of the desired distribution. We evaluate the proposed algorithms via extensive simulations over different parameter choices, and study the effect of fairness-aware ranking on both bias and utility measures. We finally present the online A/B testing results from applying our framework towards representative ranking in LinkedIn Talent Search, and discuss the lessons learned in practice. Our approach resulted in tremendous improvement in the fairness metrics (nearly three fold increase in the number of search queries with representative results) without affecting the business metrics, which paved the way for deployment to 100% of LinkedIn Recruiter users worldwide. Ours is the first large-scale deployed framework for ensuring fairness in the hiring domain, with the potential positive impact for more than 630M LinkedIn members.Comment: This paper has been accepted for publication at ACM KDD 201

Co-cultivation of murine BMDCs with 67NR mouse mammary carcinoma cells give rise to highly drug resistant cells

<p>Abstract</p> <p>Background</p> <p>Tumor tissue resembles chronically inflamed tissue. Since chronic inflammatory conditions are a strong stimulus for bone marrow-derived cells (BMDCs) it can be assumed that recruitment of BMDCs into cancer tissue should be a common phenomenon. Several data have outlined that BMDC can influence tumor growth and metastasis, e.g., by inducing a paracrine acting feedback loop in tumor cells. Likewise, cell fusion and horizontal gene transfer are further mechanisms how BMDCs can trigger tumor progression.</p> <p>Results</p> <p>Hygromycin resistant murine 67NR-Hyg mammary carcinoma cells were co-cultivated with puromycin resistant murine BMDCs from Tg(GFPU)5Nagy/J mice. Isolation of hygromycin/puromycin resistant mBMDC/67NR-Hyg cell clones was performed by a dual drug selection procedure. PCR analysis revealed an overlap of parental markers in mBMDC/67NR-Hyg cell clones, suggesting that dual resistant cells originated by cell fusion. By contrast, both STR and SNP data analysis indicated that only parental 67NR-Hyg alleles were found in mBMDC/67NR-Hyg cell clones favoring horizontal gene transfer as the mode of origin. RealTime-PCR-array analysis showed a marked up-regulation of Abcb1a and Abcb1b ABC multidrug transporters in mBMDC/67NR-Hyg clones, which was verified by Western Blot analysis. Moreover, the markedly increased Abcb1a/Abcb1b expression was correlated to an efficient Rhodamine 123 efflux, which was completely inhibited by verapamil, a well-known Abcb1a/Abcb1b inhibitor. Likewise, mBMDCs/67NR-Hyg clones revealed a marked resistance towards chemotherapeutic drugs including 17-DMAG, doxorubicin, etoposide and paclitaxel. In accordance to Rhodamine 123 efflux data, chemotherapeutic drug resistance of mBMDC/67NR-Hyg cells was impaired by verapamil mediated blockage of Abc1a/Abcb1b multidrug transporter function.</p> <p>Conclusion</p> <p>Co-cultivation of mBMDCs and mouse 67NR-Hyg mammary carcinoma cells gave rise to highly drug resistant cells. Even though it remains unknown whether mBMDC/67NR-Hyg clones originated by cell fusion or horizontal gene transfer, our data indicate that the exchange of genetic information between two cellular entities is crucial for the origin of highly drug resistant cancer (hybrid) cells, which might be capable to survive chemotherapy.</p

Global Solution to the Three-Dimensional Incompressible Flow of Liquid Crystals

The equations for the three-dimensional incompressible flow of liquid crystals are considered in a smooth bounded domain. The existence and uniqueness of the global strong solution with small initial data are established. It is also proved that when the strong solution exists, all the global weak solutions constructed in [16] must be equal to the unique strong solution