@article{617,
  abstract     = {Insects are exposed to a variety of potential pathogens in their environment, many of which can severely impact fitness and health. Consequently, hosts have evolved resistance and tolerance strategies to suppress or cope with infections. Hosts utilizing resistance improve fitness by clearing or reducing pathogen loads, and hosts utilizing tolerance reduce harmful fitness effects per pathogen load. To understand variation in, and selective pressures on, resistance and tolerance, we asked to what degree they are shaped by host genetic background, whether plasticity in these responses depends upon dietary environment, and whether there are interactions between these two factors. Females from ten wild-type Drosophila melanogaster genotypes were kept on high- or low-protein (yeast) diets and infected with one of two opportunistic bacterial pathogens, Lactococcus lactis or Pseudomonas entomophila. We measured host resistance as the inverse of bacterial load in the early infection phase. The relationship (slope) between fly fecundity and individual-level bacteria load provided our fecundity tolerance measure. Genotype and dietary yeast determined host fecundity and strongly affected survival after infection with pathogenic P. entomophila. There was considerable genetic variation in host resistance, a commonly found phenomenon resulting from for example varying resistance costs or frequency-dependent selection. Despite this variation and the reproductive cost of higher P. entomophila loads, fecundity tolerance did not vary across genotypes. The absence of genetic variation in tolerance may suggest that at this early infection stage, fecundity tolerance is fixed or that any evolved tolerance mechanisms are not expressed under these infection conditions.},
  author       = {Kutzer, Megan and Kurtz, Joachim and Armitage, Sophie},
  issn         = {1420-9101},
  journal      = {Journal of Evolutionary Biology},
  number       = {1},
  pages        = {159  -- 171},
  publisher    = {Wiley},
  title        = {{Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance}},
  doi          = {10.1111/jeb.13211},
  volume       = {31},
  year         = {2018},
}

@inproceedings{6195,
  abstract     = {In the context of robotic manipulation and grasping, the shift from a view that is static (force closure of a single posture) and contact-deprived (only contact for force closure is allowed, everything else is obstacle) towards a view that is dynamic and contact-rich (soft manipulation) has led to an increased interest in soft hands. These hands can easily exploit environmental constraints and object surfaces without risk, and safely interact with humans, but present also some challenges. Designing them is difficult, as well as predicting, modelling, and “programming” their interactions with the objects and the environment. This paper tackles the problem of simulating them in a fast and effective way, leveraging on novel and existing simulation technologies. We present a triple-layered simulation framework where dynamic properties such as stiffness are determined from slow but accurate FEM simulation data once, and then condensed into a lumped parameter model that can be used to fast simulate soft fingers and soft hands. We apply our approach to the simulation of soft pneumatic fingers.},
  author       = {Pozzi, Maria and Miguel Villalba, Eder and Deimel, Raphael and Malvezzi, Monica and Bickel, Bernd and Brock, Oliver and Prattichizzo, Domenico},
  isbn         = {9781538630815},
  location     = {Brisbane, Australia},
  publisher    = {IEEE},
  title        = {{Efficient FEM-based simulation of soft robots modeled as kinematic chains}},
  doi          = {10.1109/icra.2018.8461106},
  year         = {2018},
}

@article{62,
  abstract     = {Imaging is a dominant strategy for data collection in neuroscience, yielding stacks of images that often scale to gigabytes of data for a single experiment. Machine learning algorithms from computer vision can serve as a pair of virtual eyes that tirelessly processes these images, automatically detecting and identifying microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specific contextual clues and requires no training. This approach generalizes across different modalities, including serially-sectioned scanning electron microscopy (sSEM) of genetically labeled and contrast enhanced processes, spectral confocal reflectance (SCoRe) microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets, demonstrating the high biological fidelity of the pipeline’s reconstructions. FLoRIN reconstructions are of sufficient quality for preliminary biological study, for example examining the distribution and morphology of cells or extracting single axons from functional data. Compared to existing supervised learning methods, FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively.},
  author       = {Shabazi, Ali and Kinnison, Jeffery and Vescovi, Rafael and Du, Ming and Hill, Robert and Jösch, Maximilian A and Takeno, Marc and Zeng, Hongkui and Da Costa, Nuno and Grutzendler, Jaime and Kasthuri, Narayanan and Scheirer, Walter},
  journal      = {Scientific Reports},
  number       = {1},
  publisher    = {Nature Publishing Group},
  title        = {{Flexible learning-free segmentation and reconstruction of neural volumes}},
  doi          = {10.1038/s41598-018-32628-3},
  volume       = {8},
  year         = {2018},
}

@article{620,
  abstract     = {Clathrin-mediated endocytosis requires the coordinated assembly of various endocytic proteins and lipids at the plasma membrane. Accumulating evidence demonstrates a crucial role for phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) in endocytosis, but specific roles for PtdIns(4)P other than as the biosynthetic precursor of PtdIns(4,5)P2 have not been clarified. In this study we investigated the role of PtdIns(4)P or PtdIns(4,5)P2 in receptor-mediated endocytosis through the construction of temperature-sensitive (ts) mutants for the PI 4-kinases Stt4p and Pik1p and the PtdIns(4) 5-kinase Mss4p. Quantitative analyses of endocytosis revealed that both the stt4(ts)pik1(ts) and mss4(ts) mutants have a severe defect in endocytic internalization. Live-cell imaging of endocytic protein dynamics in stt4(ts)pik1(ts) and mss4(ts) mutants revealed that PtdIns(4)P is required for the recruitment of the alpha-factor receptor Ste2p to clathrin-coated pits whereas PtdIns(4,5)P2 is required for membrane internalization. We also found that the localization to endocytic sites of the ENTH/ANTH domain-bearing clathrin adaptors, Ent1p/Ent2p and Yap1801p/Yap1802p, is significantly impaired in the stt4(ts)pik1(ts) mutant, but not in the mss4(ts) mutant. These results suggest distinct roles in successive steps for PtdIns(4)P and PtdIns(4,5)P2 during receptor-mediated endocytosis.},
  author       = {Yamamoto, Wataru and Wada, Suguru and Nagano, Makoto and Aoshima, Kaito and Siekhaus, Daria E and Toshima, Junko and Toshima, Jiro},
  journal      = {Journal of Cell Science},
  number       = {1},
  publisher    = {Company of Biologists},
  title        = {{Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis}},
  doi          = {10.1242/jcs.207696},
  volume       = {131},
  year         = {2018},
}

@article{63,
  abstract     = {African cichlids display a remarkable assortment of jaw morphologies, pigmentation patterns, and mating behaviors. In addition to this previously documented diversity, recent studies have documented a rich diversity of sex chromosomes within these fishes. Here we review the known sex-determination network within vertebrates, and the extraordinary number of sex chromosomes systems segregating in African cichlids. We also propose a model for understanding the unusual number of sex chromosome systems within this clade.},
  author       = {Gammerdinger, William J and Kocher, Thomas},
  journal      = {Genes},
  number       = {10},
  publisher    = {MDPI},
  title        = {{Unusual diversity of sex chromosomes in African cichlid fishes}},
  doi          = {10.3390/genes9100480},
  volume       = {9},
  year         = {2018},
}

@article{6339,
  abstract     = {We introduce a diagrammatic Monte Carlo approach to angular momentum properties of quantum many-particle systems possessing a macroscopic number of degrees of freedom. The treatment is based on a diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach is applicable at arbitrary coupling, is free of systematic errors and of finite-size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model; however, the method is quite general and can be applied to a broad variety of systems in which particles exchange quantum angular momentum with their many-body environment.},
  author       = {Bighin, Giacomo and Tscherbul, Timur and Lemeshko, Mikhail},
  journal      = {Physical Review Letters},
  number       = {16},
  publisher    = {American Physical Society},
  title        = {{Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems}},
  doi          = {10.1103/physrevlett.121.165301},
  volume       = {121},
  year         = {2018},
}

@article{6354,
  abstract     = {Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow.},
  author       = {Fan, Shuxia and Lorenz, Michael and Massberg, Steffen and Gärtner, Florian R},
  issn         = {2331-8325},
  journal      = {Bio-Protocol},
  keywords     = {Platelets, Cell migration, Bacteria, Shear flow, Fibrinogen, E. coli},
  number       = {18},
  publisher    = {Bio-Protocol},
  title        = {{Platelet migration and bacterial trapping assay under flow}},
  doi          = {10.21769/bioprotoc.3018},
  volume       = {8},
  year         = {2018},
}

@article{64,
  abstract     = {Tropical geometry, an established field in pure mathematics, is a place where string theory, mirror symmetry, computational algebra, auction theory, and so forth meet and influence one another. In this paper, we report on our discovery of a tropical model with self-organized criticality (SOC) behavior. Our model is continuous, in contrast to all known models of SOC, and is a certain scaling limit of the sandpile model, the first and archetypical model of SOC. We describe how our model is related to pattern formation and proportional growth phenomena and discuss the dichotomy between continuous and discrete models in several contexts. Our aim in this context is to present an idealized tropical toy model (cf. Turing reaction-diffusion model), requiring further investigation.},
  author       = {Kalinin, Nikita and Guzmán Sáenz, Aldo and Prieto, Y and Shkolnikov, Mikhail and Kalinina, V and Lupercio, Ernesto},
  issn         = {0027-8424},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {35},
  pages        = {E8135 -- E8142},
  publisher    = {National Academy of Sciences},
  title        = {{Self-organized criticality and pattern emergence through the lens of tropical geometry}},
  doi          = {10.1073/pnas.1805847115},
  volume       = {115},
  year         = {2018},
}

@article{6497,
  abstract     = {T cells are actively scanning pMHC-presenting cells in lymphoid organs and nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the T cell actomyosin cytoskeleton facilitates this task in distinct environments is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface stiffness in primary T cells. Nonetheless, intravital imaging revealed robust motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and differentiation during immune responses. In contrast, accumulation of Myo9b−/− CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for T cell crossing of basement membranes, such as those which are present between dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell adaptation from lymphoid to NLT surveillance and the establishment of protective tissue–resident T cell populations.},
  author       = {Moalli, Federica and Ficht, Xenia and Germann, Philipp and Vladymyrov, Mykhailo and Stolp, Bettina and de Vries, Ingrid and Lyck, Ruth and Balmer, Jasmin and Fiocchi, Amleto and Kreutzfeldt, Mario and Merkler, Doron and Iannacone, Matteo and Ariga, Akitaka and Stoffel, Michael H. and Sharpe, James and Bähler, Martin and Sixt, Michael K and Diz-Muñoz, Alba and Stein, Jens V.},
  issn         = {1540-9538},
  journal      = {The Journal of Experimental Medicine},
  number       = {7},
  pages        = {1869–1890},
  publisher    = {Rockefeller University Press},
  title        = {{The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells}},
  doi          = {10.1084/jem.20170896},
  volume       = {2015},
  year         = {2018},
}

@article{6499,
  abstract     = {Expansion microscopy is a recently introduced imaging technique that achieves super‐resolution through physically expanding the specimen by ~4×, after embedding into a swellable gel. The resolution attained is, correspondingly, approximately fourfold better than the diffraction limit, or ~70 nm. This is a major improvement over conventional microscopy, but still lags behind modern STED or STORM setups, whose resolution can reach 20–30 nm. We addressed this issue here by introducing an improved gel recipe that enables an expansion factor of ~10× in each dimension, which corresponds to an expansion of the sample volume by more than 1,000‐fold. Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm on conventional epifluorescence microscopes. X10 provides multi‐color images similar or even superior to those produced with more challenging methods, such as STED, STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest and easiest option for high‐quality super‐resolution imaging currently available. X10 should be usable in any laboratory, irrespective of the machinery owned or of the technical knowledge.},
  author       = {Truckenbrodt, Sven M and Maidorn, Manuel and Crzan, Dagmar and Wildhagen, Hanna and Kabatas, Selda and Rizzoli, Silvio O},
  issn         = {1469-3178},
  journal      = {EMBO reports},
  number       = {9},
  publisher    = {Embo Press},
  title        = {{X10 expansion microscopy enables 25‐nm resolution on conventional microscopes}},
  doi          = {10.15252/embr.201845836},
  volume       = {19},
  year         = {2018},
}

@inproceedings{6558,
  abstract     = {This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity.},
  author       = {Alistarh, Dan-Adrian and Allen-Zhu, Zeyuan and Li, Jerry},
  booktitle    = {Advances in Neural Information Processing Systems},
  location     = {Montreal, Canada},
  pages        = {4613--4623},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{Byzantine stochastic gradient descent}},
  volume       = {2018},
  year         = {2018},
}

@inproceedings{6589,
  abstract     = {Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics.},
  author       = {Alistarh, Dan-Adrian and Hoefler, Torsten and Johansson, Mikael and Konstantinov, Nikola H and Khirirat, Sarit and Renggli, Cedric},
  booktitle    = {Advances in Neural Information Processing Systems 31},
  location     = {Montreal, Canada},
  pages        = {5973--5983},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{The convergence of sparsified gradient methods}},
  volume       = {Volume 2018},
  year         = {2018},
}

@article{690,
  abstract     = {We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1.},
  author       = {Lee, Jii and Schnelli, Kevin},
  journal      = {Probability Theory and Related Fields},
  number       = {1-2},
  publisher    = {Springer},
  title        = {{Local law and Tracy–Widom limit for sparse random matrices}},
  doi          = {10.1007/s00440-017-0787-8},
  volume       = {171},
  year         = {2018},
}

@article{691,
  abstract     = {Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.

Objective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.

Methods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.

Results: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.

Conclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function.},
  author       = {Marin Valencia, Isaac and Novarino, Gaia and Johansen, Anide and Rosti, Başak and Issa, Mahmoud and Musaev, Damir and Bhat, Gifty and Scott, Eric and Silhavy, Jennifer and Stanley, Valentina and Rosti, Rasim and Gleeson, Jeremy and Imam, Farhad and Zaki, Maha and Gleeson, Joseph},
  issn         = {0022-2593},
  journal      = {Journal of Medical Genetics},
  number       = {1},
  pages        = {48 -- 54},
  publisher    = {BMJ Publishing Group},
  title        = {{A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features}},
  doi          = {10.1136/jmedgenet-2017-104627},
  volume       = {55},
  year         = {2018},
}

@article{692,
  abstract     = {We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them.},
  author       = {Akopyan, Arseniy},
  journal      = {Geometriae Dedicata},
  number       = {1},
  pages        = {55 -- 64},
  publisher    = {Springer},
  title        = {{3-Webs generated by confocal conics and circles}},
  doi          = {10.1007/s10711-017-0265-6},
  volume       = {194},
  year         = {2018},
}

@article{7,
  abstract     = {Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups.},
  author       = {Stroeymeyt, Nathalie and Grasse, Anna V and Crespi, Alessandro and Mersch, Danielle and Cremer, Sylvia and Keller, Laurent},
  issn         = {1095-9203},
  journal      = {Science},
  number       = {6417},
  pages        = {941 -- 945},
  publisher    = {AAAS},
  title        = {{Social network plasticity decreases disease transmission in a eusocial insect}},
  doi          = {10.1126/science.aat4793},
  volume       = {362},
  year         = {2018},
}

@article{70,
  abstract     = {We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes.},
  author       = {Nejjar, Peter},
  issn         = {1980-0436},
  journal      = {Latin American Journal of Probability and Mathematical Statistics},
  number       = {2},
  pages        = {1311--1334},
  publisher    = {Instituto Nacional de Matematica Pura e Aplicada},
  title        = {{Transition to shocks in TASEP and decoupling of last passage times}},
  doi          = {10.30757/ALEA.v15-49},
  volume       = {15},
  year         = {2018},
}

@article{705,
  abstract     = {Although dopamine receptors D1 and D2 play key roles in hippocampal function, their synaptic localization within the hippocampus has not been fully elucidated. In order to understand precise functions of pre- or postsynaptic dopamine receptors (DRs), the development of protocols to differentiate pre- and postsynaptic DRs is essential. So far, most studies on determination and quantification of DRs did not discriminate between subsynaptic localization. Therefore, the aim of the study was to generate a robust workflow for the localization of DRs. This work provides the basis for future work on hippocampal DRs, in light that DRs may have different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi isolated by a sucrose gradient protocol were prepared for super-resolution direct stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594 enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites. D1R immunoreactivity clusters were observed within the presynaptic active zone as well as at perisynaptic sites at the edge of the presynaptic active zone. The results may be useful for the interpretation of previous studies and the design of future work on DRs in the hippocampus. Moreover, the reduction of the complexity of brain tissue by the use of synaptosomal preparations and dSTORM technology may represent a useful tool for synaptic localization of brain proteins.},
  author       = {Miklosi, Andras and Del Favero, Giorgia and Bulat, Tanja and Höger, Harald and Shigemoto, Ryuichi and Marko, Doris and Lubec, Gert},
  journal      = {Molecular Neurobiology},
  number       = {6},
  pages        = {4857 – 4869},
  publisher    = {Springer},
  title        = {{Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes}},
  doi          = {10.1007/s12035-017-0688-y},
  volume       = {55},
  year         = {2018},
}

@inproceedings{7116,
  abstract     = {Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.},
  author       = {Grubic, Demjan and Tam, Leo and Alistarh, Dan-Adrian and Zhang, Ce},
  booktitle    = {Proceedings of the 21st International Conference on Extending Database Technology},
  isbn         = {9783893180783},
  issn         = {2367-2005},
  location     = {Vienna, Austria},
  pages        = {145--156},
  publisher    = {OpenProceedings},
  title        = {{Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study}},
  doi          = {10.5441/002/EDBT.2018.14},
  year         = {2018},
}

@inproceedings{7123,
  abstract     = {Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.

On the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time.},
  author       = {Alistarh, Dan-Adrian and Aspnes, James and Gelashvili, Rati},
  booktitle    = {Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms},
  isbn         = {9781611975031},
  location     = {New Orleans, LA, United States},
  pages        = {2221--2239},
  publisher    = {ACM},
  title        = {{Space-optimal majority in population protocols}},
  doi          = {10.1137/1.9781611975031.144},
  year         = {2018},
}

