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

Private Incremental Regression

Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but rather arrives incrementally over time. We introduce the problems of private incremental ERM and private incremental regression where the general goal is to always maintain a good empirical risk minimizer for the history observed under differential privacy. Our first contribution is a generic transformation of private batch ERM mechanisms into private incremental ERM mechanisms, based on a simple idea of invoking the private batch ERM procedure at some regular time intervals. We take this construction as a baseline for comparison. We then provide two mechanisms for the private incremental regression problem. Our first mechanism is based on privately constructing a noisy incremental gradient function, which is then used in a modified projected gradient procedure at every timestep. This mechanism has an excess empirical risk of $\approx\sqrt{d}$, where $d$ is the dimensionality of the data. While from the results of [Bassily et al. 2014] this bound is tight in the worst-case, we show that certain geometric properties of the input and constraint set can be used to derive significantly better results for certain interesting regression problems.Comment: To appear in PODS 201

Luspatercept stimulates erythropoiesis, increases iron utilization, and redistributes body iron in transfusion-dependent thalassemia

Luspatercept, a ligand-trapping fusion protein, binds select TGF-β superfamily ligands implicated in thalassemic erythropoiesis, promoting late-stage erythroid maturation. Luspatercept reduced transfusion burden in the BELIEVE trial (NCT02604433) of 336 adults with transfusion-dependent thalassemia (TDT). Analysis of biomarkers in BELIEVE offers novel physiological and clinical insights into benefits offered by luspatercept. Transfusion iron loading rates decreased 20% by 1.4 g (~7 blood units; median iron loading rate difference: −0.05 ± 0.07 mg Fe/kg/day, p< .0001) and serum ferritin (s-ferritin) decreased 19.2% by 269.3 ± 963.7 μg/L (p < .0001), indicating reduced macrophage iron. However, liver iron content (LIC) did not decrease but showed statistically nonsignificant increases from 5.3 to 6.7 mg/g dw. Erythropoietin, growth differentiation factor 15, soluble transferrin receptor 1 (sTfR1), and reticulocytes rose by 93%, 59%, 66%, and 112%, respectively; accordingly, erythroferrone increased by 51% and hepcidin decreased by 53% (all p < .0001). Decreased transfusion with luspatercept in patients with TDT was associated with increased erythropoietic markers and decreasing hepcidin. Furthermore, s-ferritin reduction associated with increased erythroid iron incorporation (marked by sTfR1) allowed increased erythrocyte marrow output, consequently reducing transfusion needs and enhancing rerouting of hemolysis (heme) iron and non-transferrin-bound iron to the liver. LIC increased in patients with intact spleens, consistent with iron redistribution given the hepcidin reduction. Thus, erythropoietic and hepcidin changes with luspatercept in TDT lower transfusion dependency and may redistribute iron from macrophages to hepatocytes, necessitating the use of concomitant chelator cover for effective iron management

Making sense of the bizarre behaviour of horizons in the McVittie spacetime

The bizarre behaviour of the apparent (black hole and cosmological) horizons of the McVittie spacetime is discussed using, as an analogy, the Schwarzschild-de Sitter-Kottler spacetime (which is a special case of McVittie anyway). For a dust-dominated "background" universe, a black hole cannot exist at early times because its (apparent) horizon would be larger than the cosmological(apparent) horizon. A phantom-dominated "background" universe causes this situation, and the horizon behaviour, to be time-reversed.Comment: 8 pages, 3 figure

Black Holes in the Universe: Generalized Lemaitre-Tolman-Bondi Solutions

We present new exact solutions {which presumably describe} black holes in the background of a spatially flat, pressureless dark matter (DM)-, or dark matter plus dark energy (DM+DE)-, or quintom-dominated universe. These solutions generalize Lemaitre-Tolman-Bondi metrics. For a DM- or (DM+DE)-dominated universe, the area of the black hole apparent horizon (AH) decreases with the expansion of the universe while that of the cosmic AH increases. However, for a quintom-dominated universe, the black hole AH first shrinks and then expands, while the cosmic AH first expands and then shrinks. A (DM+DE)-dominated universe containing a black hole will evolve to the Schwarzschild-de Sitter solution with both AHs approaching constant size. In a quintom-dominated universe, the black hole and cosmic AHs will coincide at a certain time, after which the singularity becomes naked, violating Cosmic Censorship.Comment: 13 pages, 4 figure

Cosmological expansion and local physics

The interplay between cosmological expansion and local attraction in a gravitationally bound system is revisited in various regimes. First, weakly gravitating Newtonian systems are considered, followed by various exact solutions describing a relativistic central object embedded in a Friedmann universe. It is shown that the ``all or nothing'' behaviour recently discovered (i.e., weakly coupled systems are comoving while strongly coupled ones resist the cosmic expansion) is limited to the de Sitter background. New exact solutions are presented which describe black holes perfectly comoving with a generic Friedmann universe. The possibility of violating cosmic censorship for a black hole approaching the Big Rip is also discussed.Comment: 17 pages, LaTeX, to appear in Phys. Rev.

EXMOTIF: efficient structured motif extraction

BACKGROUND: Extracting motifs from sequences is a mainstay of bioinformatics. We look at the problem of mining structured motifs, which allow variable length gaps between simple motif components. We propose an efficient algorithm, called EXMOTIF, that given some sequence(s), and a structured motif template, extracts all frequent structured motifs that have quorum q. Potential applications of our method include the extraction of single/composite regulatory binding sites in DNA sequences. RESULTS: EXMOTIF is efficient in terms of both time and space and is shown empirically to outperform RISO, a state-of-the-art algorithm. It is also successful in finding potential single/composite transcription factor binding sites. CONCLUSION: EXMOTIF is a useful and efficient tool in discovering structured motifs, especially in DNA sequences. The algorithm is available as open-source at: