@inproceedings{6493, abstract = {We present two algorithmic approaches for synthesizing linear hybrid automata from experimental data. Unlike previous approaches, our algorithms work without a template and generate an automaton with nondeterministic guards and invariants, and with an arbitrary number and topology of modes. They thus construct a succinct model from the data and provide formal guarantees. In particular, (1) the generated automaton can reproduce the data up to a specified tolerance and (2) the automaton is tight, given the first guarantee. Our first approach encodes the synthesis problem as a logical formula in the theory of linear arithmetic, which can then be solved by an SMT solver. This approach minimizes the number of modes in the resulting model but is only feasible for limited data sets. To address scalability, we propose a second approach that does not enforce to find a minimal model. The algorithm constructs an initial automaton and then iteratively extends the automaton based on processing new data. Therefore the algorithm is well-suited for online and synthesis-in-the-loop applications. The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given automaton. We solve this membership problem for linear hybrid automata by repeated reachability computations. We demonstrate the effectiveness of the algorithm on synthetic data sets and on cardiac-cell measurements.}, author = {Garcia Soto, Miriam and Henzinger, Thomas A and Schilling, Christian and Zeleznik, Luka}, booktitle = {31st International Conference on Computer-Aided Verification}, isbn = {9783030255398}, issn = {0302-9743}, keywords = {Synthesis, Linear hybrid automaton, Membership}, location = {New York City, NY, USA}, pages = {297--314}, publisher = {Springer}, title = {{Membership-based synthesis of linear hybrid automata}}, doi = {10.1007/978-3-030-25540-4_16}, volume = {11561}, year = {2019}, } @article{65, abstract = {We provide an entropy formulation for porous medium-type equations with a stochastic, non-linear, spatially inhomogeneous forcing. Well-posedness and L1-contraction is obtained in the class of entropy solutions. Our scope allows for porous medium operators Δ(|u|m−1u) for all m∈(1,∞), and Hölder continuous diffusion nonlinearity with exponent 1/2.}, author = {Dareiotis, Konstantinos and Gerencser, Mate and Gess, Benjamin}, journal = {Journal of Differential Equations}, number = {6}, pages = {3732--3763}, publisher = {Elsevier}, title = {{Entropy solutions for stochastic porous media equations}}, doi = {10.1016/j.jde.2018.09.012}, volume = {266}, year = {2019}, } @article{6504, abstract = {Root gravitropism is one of the most important processes allowing plant adaptation to the land environment. Auxin plays a central role in mediating root gravitropism, but how auxin contributes to gravitational perception and the subsequent response is still unclear. Here, we showed that the local auxin maximum/gradient within the root apex, which is generated by the PIN directional auxin transporters, regulates the expression of three key starch granule synthesis genes, SS4, PGM and ADG1, which in turn influence the accumulation of starch granules that serve as a statolith perceiving gravity. Moreover, using the cvxIAA‐ccvTIR1 system, we also showed that TIR1‐mediated auxin signaling is required for starch granule formation and gravitropic response within root tips. In addition, axr3 mutants showed reduced auxin‐mediated starch granule accumulation and disruption of gravitropism within the root apex. Our results indicate that auxin‐mediated statolith production relies on the TIR1/AFB‐AXR3‐mediated auxin signaling pathway. In summary, we propose a dual role for auxin in gravitropism: the regulation of both gravity perception and response.}, author = {Zhang, Yuzhou and He, P and Ma, X and Yang, Z and Pang, C and Yu, J and Wang, G and Friml, Jiří and Xiao, G}, issn = {1469-8137}, journal = {New Phytologist}, number = {2}, pages = {761--774}, publisher = {Wiley}, title = {{Auxin-mediated statolith production for root gravitropism}}, doi = {10.1111/nph.15932}, volume = {224}, year = {2019}, } @article{6506, abstract = {How does environmental complexity affect the evolution of single genes? Here, we measured the effects of a set of Bacillus subtilis glutamate dehydrogenase mutants across 19 different environments—from phenotypically homogeneous single-cell populations in liquid media to heterogeneous biofilms, plant roots and soil populations. The effects of individual gene mutations on organismal fitness were highly reproducible in liquid cultures. However, 84% of the tested alleles showed opposing fitness effects under different growth conditions (sign environmental pleiotropy). In colony biofilms and soil samples, different alleles dominated in parallel replica experiments. Accordingly, we found that in these heterogeneous cell populations the fate of mutations was dictated by a combination of selection and drift. The latter relates to programmed prophage excisions that occurred during biofilm development. Overall, for each condition, a wide range of glutamate dehydrogenase mutations persisted and sometimes fixated as a result of the combined action of selection, pleiotropy and chance. However, over longer periods and in multiple environments, nearly all of this diversity would be lost—across all the environments and conditions that we tested, the wild type was the fittest allele.}, author = {Noda-García, Lianet and Davidi, Dan and Korenblum, Elisa and Elazar, Assaf and Putintseva, Ekaterina and Aharoni, Asaph and Tawfik, Dan S.}, issn = {2058-5276}, journal = {Nature Microbiology}, number = {7}, pages = {1221–1230}, publisher = {Springer Nature}, title = {{Chance and pleiotropy dominate genetic diversity in complex bacterial environments}}, doi = {10.1038/s41564-019-0412-y}, volume = {4}, year = {2019}, } @article{6511, abstract = {Let U and V be two independent N by N random matrices that are distributed according to Haar measure on U(N). Let Σ be a nonnegative deterministic N by N matrix. The single ring theorem [Ann. of Math. (2) 174 (2011) 1189–1217] asserts that the empirical eigenvalue distribution of the matrix X:=UΣV∗ converges weakly, in the limit of large N, to a deterministic measure which is supported on a single ring centered at the origin in ℂ. Within the bulk regime, that is, in the interior of the single ring, we establish the convergence of the empirical eigenvalue distribution on the optimal local scale of order N−1/2+ε and establish the optimal convergence rate. The same results hold true when U and V are Haar distributed on O(N).}, author = {Bao, Zhigang and Erdös, László and Schnelli, Kevin}, issn = {0091-1798}, journal = {Annals of Probability}, number = {3}, pages = {1270--1334}, publisher = {Institute of Mathematical Statistics}, title = {{Local single ring theorem on optimal scale}}, doi = {10.1214/18-AOP1284}, volume = {47}, year = {2019}, } @article{6513, abstract = {Adult intestinal stem cells are located at the bottom of crypts of Lieberkühn, where they express markers such as LGR5 1,2 and fuel the constant replenishment of the intestinal epithelium1. Although fetal LGR5-expressing cells can give rise to adult intestinal stem cells3,4, it remains unclear whether this population in the patterned epithelium represents unique intestinal stem-cell precursors. Here we show, using unbiased quantitative lineage-tracing approaches, biophysical modelling and intestinal transplantation, that all cells of the mouse intestinal epithelium—irrespective of their location and pattern of LGR5 expression in the fetal gut tube—contribute actively to the adult intestinal stem cell pool. Using 3D imaging, we find that during fetal development the villus undergoes gross remodelling and fission. This brings epithelial cells from the non-proliferative villus into the proliferative intervillus region, which enables them to contribute to the adult stem-cell niche. Our results demonstrate that large-scale remodelling of the intestinal wall and cell-fate specification are closely linked. Moreover, these findings provide a direct link between the observed plasticity and cellular reprogramming of differentiating cells in adult tissues following damage5,6,7,8,9, revealing that stem-cell identity is an induced rather than a hardwired property.}, author = {Guiu, Jordi and Hannezo, Edouard B and Yui, Shiro and Demharter, Samuel and Ulyanchenko, Svetlana and Maimets, Martti and Jørgensen, Anne and Perlman, Signe and Lundvall, Lene and Mamsen, Linn Salto and Larsen, Agnete and Olesen, Rasmus H. and Andersen, Claus Yding and Thuesen, Lea Langhoff and Hare, Kristine Juul and Pers, Tune H. and Khodosevich, Konstantin and Simons, Benjamin D. and Jensen, Kim B.}, issn = {1476-4687}, journal = {Nature}, pages = {107--111}, publisher = {Springer Nature}, title = {{Tracing the origin of adult intestinal stem cells}}, doi = {10.1038/s41586-019-1212-5}, volume = {570}, year = {2019}, } @article{6515, abstract = {We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature.}, author = {Dyer, Ramsay and Vegter, Gert and Wintraecken, Mathijs}, issn = {1920-180X}, journal = {Journal of Computational Geometry }, number = {1}, pages = {223–256}, publisher = {Carleton University}, title = {{Simplices modelled on spaces of constant curvature}}, doi = {10.20382/jocg.v10i1a9}, volume = {10}, year = {2019}, } @article{6521, abstract = {Microglia have emerged as a critical component of neurodegenerative diseases. Genetic manipulation of microglia can elucidate their functional impact in disease. In neuroscience, recombinant viruses such as lentiviruses and adeno-associated viruses (AAVs) have been successfully used to target various cell types in the brain, although effective transduction of microglia is rare. In this review, we provide a short background of lentiviruses and AAVs, and strategies for designing recombinant viral vectors. Then, we will summarize recent literature on successful microglial transductions in vitro and in vivo, and discuss the current challenges. Finally, we provide guidelines for reporting the efficiency and specificity of viral targeting in microglia, which will enable the microglial research community to assess and improve methodologies for future studies.}, author = {Maes, Margaret E and Colombo, Gloria and Schulz, Rouven and Siegert, Sandra}, issn = {0304-3940}, journal = {Neuroscience Letters}, publisher = {Elsevier}, title = {{Targeting microglia with lentivirus and AAV: Recent advances and remaining challenges}}, doi = {10.1016/j.neulet.2019.134310}, volume = {707}, year = {2019}, } @inproceedings{6528, abstract = {We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism.}, author = {Pietrzak, Krzysztof Z}, booktitle = {10th Innovations in Theoretical Computer Science Conference}, isbn = {978-3-95977-095-8}, issn = {1868-8969}, location = {San Diego, CA, United States}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Simple verifiable delay functions}}, doi = {10.4230/LIPICS.ITCS.2019.60}, volume = {124}, year = {2019}, } @article{6552, abstract = {When animals become sick, infected cells and an armada of activated immune cells attempt to eliminate the pathogen from the body. Once infectious particles have breached the body's physical barriers of the skin or gut lining, an initially local response quickly escalates into a systemic response, attracting mobile immune cells to the site of infection. These cells complement the initial, unspecific defense with a more specialized, targeted response. This can also provide long-term immune memory and protection against future infection. The cell-autonomous defenses of the infected cells are thus aided by the actions of recruited immune cells. These specialized cells are the most mobile cells in the body, constantly patrolling through the otherwise static tissue to detect incoming pathogens. Such constant immune surveillance means infections are noticed immediately and can be rapidly cleared from the body. Some immune cells also remove infected cells that have succumbed to infection. All this prevents pathogen replication and spread to healthy tissues. Although this may involve the sacrifice of some somatic tissue, this is typically replaced quickly. Particular care is, however, given to the reproductive organs, which should always remain disease free (immune privilege). }, author = {Cremer, Sylvia}, issn = {09609822}, journal = {Current Biology}, number = {11}, pages = {R458--R463}, publisher = {Elsevier}, title = {{Social immunity in insects}}, doi = {10.1016/j.cub.2019.03.035}, volume = {29}, year = {2019}, } @article{6554, abstract = {Due to the importance of zero-shot learning, i.e. classifying images where there is a lack of labeled training data, the number of proposed approaches has recently increased steadily. We argue that it is time to take a step back and to analyze the status quo of the area. The purpose of this paper is three-fold. First, given the fact that there is no agreed upon zero-shot learning benchmark, we first define a new benchmark by unifying both the evaluation protocols and data splits of publicly available datasets used for this task. This is an important contribution as published results are often not comparable and sometimes even flawed due to, e.g. pre-training on zero-shot test classes. Moreover, we propose a new zero-shot learning dataset, the Animals with Attributes 2 (AWA2) dataset which we make publicly available both in terms of image features and the images themselves. Second, we compare and analyze a significant number of the state-of-the-art methods in depth, both in the classic zero-shot setting but also in the more realistic generalized zero-shot setting. Finally, we discuss in detail the limitations of the current status of the area which can be taken as a basis for advancing it.}, author = {Xian, Yongqin and Lampert, Christoph and Schiele, Bernt and Akata, Zeynep}, issn = {1939-3539}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, number = {9}, pages = {2251 -- 2265}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Zero-shot learning - A comprehensive evaluation of the good, the bad and the ugly}}, doi = {10.1109/tpami.2018.2857768}, volume = {41}, year = {2019}, } @inproceedings{6556, abstract = {Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth tw(M) of a compact, connected 3-manifold M, defined to be the minimum treewidth of the face pairing graph of any triangulation T of M. In this setting the relationship between the topology of a 3-manifold and its treewidth is of particular interest. First, as a corollary of work of Jaco and Rubinstein, we prove that for any closed, orientable 3-manifold M the treewidth tw(M) is at most 4g(M)-2, where g(M) denotes Heegaard genus of M. In combination with our earlier work with Wagner, this yields that for non-Haken manifolds the Heegaard genus and the treewidth are within a constant factor. Second, we characterize all 3-manifolds of treewidth one: These are precisely the lens spaces and a single other Seifert fibered space. Furthermore, we show that all remaining orientable Seifert fibered spaces over the 2-sphere or a non-orientable surface have treewidth two. In particular, for every spherical 3-manifold we exhibit a triangulation of treewidth at most two. Our results further validate the parameter of treewidth (and other related parameters such as cutwidth or congestion) to be useful for topological computing, and also shed more light on the scope of existing FPT-algorithms in the field.}, author = {Huszár, Kristóf and Spreer, Jonathan}, booktitle = {35th International Symposium on Computational Geometry}, isbn = {978-3-95977-104-7}, issn = {1868-8969}, keywords = {computational 3-manifold topology, fixed-parameter tractability, layered triangulations, structural graph theory, treewidth, cutwidth, Heegaard genus}, location = {Portland, Oregon, United States}, pages = {44:1--44:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{3-manifold triangulations with small treewidth}}, doi = {10.4230/LIPIcs.SoCG.2019.44}, volume = {129}, year = {2019}, } @article{6564, abstract = {Optogenetics enables the spatio-temporally precise control of cell and animal behavior. Many optogenetic tools are driven by light-controlled protein–protein interactions (PPIs) that are repurposed from natural light-sensitive domains (LSDs). Applying light-controlled PPIs to new target proteins is challenging because it is difficult to predict which of the many available LSDs, if any, will yield robust light regulation. As a consequence, fusion protein libraries need to be prepared and tested, but methods and platforms to facilitate this process are currently not available. Here, we developed a genetic engineering strategy and vector library for the rapid generation of light-controlled PPIs. The strategy permits fusing a target protein to multiple LSDs efficiently and in two orientations. The public and expandable library contains 29 vectors with blue, green or red light-responsive LSDs, many of which have been previously applied ex vivo and in vivo. We demonstrate the versatility of the approach and the necessity for sampling LSDs by generating light-activated caspase-9 (casp9) enzymes. Collectively, this work provides a new resource for optical regulation of a broad range of target proteins in cell and developmental biology.}, author = {Tichy, Alexandra-Madelaine and Gerrard, Elliot J. and Legrand, Julien M.D. and Hobbs, Robin M. and Janovjak, Harald L}, issn = {1089-8638}, journal = {Journal of Molecular Biology}, number = {17}, pages = {3046--3055}, publisher = {Elsevier}, title = {{Engineering strategy and vector library for the rapid generation of modular light-controlled protein–protein interactions}}, doi = {10.1016/j.jmb.2019.05.033}, volume = {431}, year = {2019}, } @inproceedings{6565, abstract = {In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example.}, author = {Kundu, Atreyee and Garcia Soto, Miriam and Prabhakar, Pavithra}, booktitle = {5th Indian Control Conference Proceedings}, isbn = {978-153866246-5}, location = {Delhi, India}, publisher = {IEEE}, title = {{Formal synthesis of stabilizing controllers for periodically controlled linear switched systems}}, doi = {10.1109/INDIANCC.2019.8715598}, year = {2019}, } @article{6566, abstract = {Methodologies that involve the use of nanoparticles as “artificial atoms” to rationally build materials in a bottom-up fashion are particularly well-suited to control the matter at the nanoscale. Colloidal synthetic routes allow for an exquisite control over such “artificial atoms” in terms of size, shape, and crystal phase as well as core and surface compositions. We present here a bottom-up approach to produce Pb–Ag–K–S–Te nanocomposites, which is a highly promising system for thermoelectric energy conversion. First, we developed a high-yield and scalable colloidal synthesis route to uniform lead sulfide (PbS) nanorods, whose tips are made of silver sulfide (Ag2S). We then took advantage of the large surface-to-volume ratio to introduce a p-type dopant (K) by replacing native organic ligands with K2Te. Upon thermal consolidation, K2Te-surface modified PbS–Ag2S nanorods yield p-type doped nanocomposites with PbTe and PbS as major phases and Ag2S and Ag2Te as embedded nanoinclusions. Thermoelectric characterization of such consolidated nanosolids showed a high thermoelectric figure-of-merit of 1 at 620 K.}, author = {Ibáñez, Maria and Genç, Aziz and Hasler, Roger and Liu, Yu and Dobrozhan, Oleksandr and Nazarenko, Olga and Mata, María de la and Arbiol, Jordi and Cabot, Andreu and Kovalenko, Maksym V.}, issn = {1936-086X}, journal = {ACS Nano}, keywords = {colloidal nanoparticles, asymmetric nanoparticles, inorganic ligands, heterostructures, catalyst assisted growth, nanocomposites, thermoelectrics}, number = {6}, pages = {6572--6580}, publisher = {American Chemical Society}, title = {{Tuning transport properties in thermoelectric nanocomposites through inorganic ligands and heterostructured building blocks}}, doi = {10.1021/acsnano.9b00346}, volume = {13}, year = {2019}, } @inproceedings{6569, abstract = {Knowledge distillation, i.e. one classifier being trained on the outputs of another classifier, is an empirically very successful technique for knowledge transfer between classifiers. It has even been observed that classifiers learn much faster and more reliably if trained with the outputs of another classifier as soft labels, instead of from ground truth data. So far, however, there is no satisfactory theoretical explanation of this phenomenon. In this work, we provide the first insights into the working mechanisms of distillation by studying the special case of linear and deep linear classifiers. Specifically, we prove a generalization bound that establishes fast convergence of the expected risk of a distillation-trained linear classifier. From the bound and its proof we extract three keyfactors that determine the success of distillation: data geometry – geometric properties of the datadistribution, in particular class separation, has an immediate influence on the convergence speed of the risk; optimization bias– gradient descentoptimization finds a very favorable minimum of the distillation objective; and strong monotonicity– the expected risk of the student classifier always decreases when the size of the training set grows.}, author = {Bui Thi Mai, Phuong and Lampert, Christoph}, booktitle = {Proceedings of the 36th International Conference on Machine Learning}, location = {Long Beach, CA, United States}, pages = {5142--5151}, publisher = {ML Research Press}, title = {{Towards understanding knowledge distillation}}, volume = {97}, year = {2019}, } @article{6575, abstract = {Motivated by recent experimental observations of coherent many-body revivals in a constrained Rydbergatom chain, we construct a weak quasilocal deformation of the Rydberg-blockaded Hamiltonian, whichmakes the revivals virtually perfect. Our analysis suggests the existence of an underlying nonintegrableHamiltonian which supports an emergent SU(2)-spin dynamics within a small subspace of the many-bodyHilbert space. We show that such perfect dynamics necessitates the existence of atypical, nonergodicenergy eigenstates—quantum many-body scars. Furthermore, using these insights, we construct a toymodel that hosts exact quantum many-body scars, providing an intuitive explanation of their origin. Ourresults offer specific routes to enhancing coherent many-body revivals and provide a step towardestablishing the stability of quantum many-body scars in the thermodynamic limit.}, author = {Choi, Soonwon and Turner, Christopher J. and Pichler, Hannes and Ho, Wen Wei and Michailidis, Alexios and Papić, Zlatko and Serbyn, Maksym and Lukin, Mikhail D. and Abanin, Dmitry A.}, issn = {10797114}, journal = {Physical Review Letters}, number = {22}, publisher = {American Physical Society}, title = {{Emergent SU(2) dynamics and perfect quantum many-body scars}}, doi = {10.1103/PhysRevLett.122.220603}, volume = {122}, year = {2019}, } @article{6586, abstract = {The bottom-up assembly of colloidal nanocrystals is a versatile methodology to produce composite nanomaterials with precisely tuned electronic properties. Beyond the synthetic control over crystal domain size, shape, crystal phase, and composition, solution-processed nanocrystals allow exquisite surface engineering. This provides additional means to modulate the nanomaterial characteristics and particularly its electronic transport properties. For instance, inorganic surface ligands can be used to tune the type and concentration of majority carriers or to modify the electronic band structure. Herein, we report the thermoelectric properties of SnTe nanocomposites obtained from the consolidation of surface-engineered SnTe nanocrystals into macroscopic pellets. A CdSe-based ligand is selected to (i) converge the light and heavy bands through partial Cd alloying and (ii) generate CdSe nanoinclusions as a secondary phase within the SnTe matrix, thereby reducing the thermal conductivity. These SnTe-CdSe nanocomposites possess thermoelectric figures of merit of up to 1.3 at 850 K, which is, to the best of our knowledge, the highest thermoelectric figure of merit reported for solution-processed SnTe.}, author = {Ibáñez, Maria and Hasler, Roger and Genç, Aziz and Liu, Yu and Kuster, Beatrice and Schuster, Maximilian and Dobrozhan, Oleksandr and Cadavid, Doris and Arbiol, Jordi and Cabot, Andreu and Kovalenko, Maksym V.}, issn = {1520-5126}, journal = {Journal of the American Chemical Society}, number = {20}, pages = {8025--8029}, publisher = {American Chemical Society}, title = {{Ligand-mediated band engineering in bottom-up assembled SnTe nanocomposites for thermoelectric energy conversion}}, doi = {10.1021/jacs.9b01394}, volume = {141}, year = {2019}, } @inproceedings{6590, abstract = {Modern machine learning methods often require more data for training than a single expert can provide. Therefore, it has become a standard procedure to collect data from external sources, e.g. via crowdsourcing. Unfortunately, the quality of these sources is not always guaranteed. As additional complications, the data might be stored in a distributed way, or might even have to remain private. In this work, we address the question of how to learn robustly in such scenarios. Studying the problem through the lens of statistical learning theory, we derive a procedure that allows for learning from all available sources, yet automatically suppresses irrelevant or corrupted data. We show by extensive experiments that our method provides significant improvements over alternative approaches from robust statistics and distributed optimization. }, author = {Konstantinov, Nikola H and Lampert, Christoph}, booktitle = {Proceedings of the 36th International Conference on Machine Learning}, location = {Long Beach, CA, USA}, pages = {3488--3498}, publisher = {ML Research Press}, title = {{Robust learning from untrusted sources}}, volume = {97}, year = {2019}, } @article{6596, abstract = {It is well known that many problems in image recovery, signal processing, and machine learning can be modeled as finding zeros of the sum of maximal monotone and Lipschitz continuous monotone operators. Many papers have studied forward-backward splitting methods for finding zeros of the sum of two monotone operators in Hilbert spaces. Most of the proposed splitting methods in the literature have been proposed for the sum of maximal monotone and inverse-strongly monotone operators in Hilbert spaces. In this paper, we consider splitting methods for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators in Banach spaces. We obtain weak and strong convergence results for the zeros of the sum of maximal monotone and Lipschitz continuous monotone operators in Banach spaces. Many already studied problems in the literature can be considered as special cases of this paper.}, author = {Shehu, Yekini}, issn = {1420-9012}, journal = {Results in Mathematics}, number = {4}, publisher = {Springer}, title = {{Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces}}, doi = {10.1007/s00025-019-1061-4}, volume = {74}, year = {2019}, }