[{"title":"A PAC-Bayesian bound for Lifelong Learning","department":[{"_id":"ChLa"}],"_id":"2160","conference":{"location":"Beijing, China","start_date":"2014-06-21","end_date":"2014-06-26","name":"ICML: International Conference on Machine Learning"},"publist_id":"4844","page":"991 - 999","oa_version":"Submitted Version","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3045003","open_access":"1"}],"intvolume":"        32","month":"05","type":"conference","citation":{"ieee":"A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,” presented at the ICML: International Conference on Machine Learning, Beijing, China, 2014, vol. 32, pp. 991–999.","ista":"Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML: International Conference on Machine Learning vol. 32, 991–999.","ama":"Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol 32. ML Research Press; 2014:991-999.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999.","mla":"Pentina, Anastasia, and Christoph Lampert. <i>A PAC-Bayesian Bound for Lifelong Learning</i>. Vol. 32, ML Research Press, 2014, pp. 991–99.","chicago":"Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong Learning,” 32:991–99. ML Research Press, 2014.","apa":"Pentina, A., &#38; Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning (Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine Learning, Beijing, China: ML Research Press."},"status":"public","corr_author":"1","date_created":"2018-12-11T11:56:03Z","publication_status":"published","abstract":[{"text":"Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information to tasks for which no data have been observed so far. In this work we study lifelong learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization bound that offers a unified view on existing paradigms for transfer learning, such as the transfer of parameters or the transfer of low-dimensional representations. We also use the bound to derive two principled lifelong learning algorithms, and we show that these yield results comparable with existing methods.","lang":"eng"}],"quality_controlled":"1","scopus_import":"1","date_updated":"2024-10-09T20:55:36Z","year":"2014","oa":1,"volume":32,"article_processing_charge":"No","day":"10","publisher":"ML Research Press","author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia","full_name":"Pentina, Anastasia","last_name":"Pentina"},{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2014-05-10T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_updated":"2025-09-29T11:42:26Z","quality_controlled":"1","date_created":"2018-12-11T11:56:03Z","citation":{"apa":"Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., &#38; Cremer, S. (2014). Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. Springer. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>","chicago":"Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie Doums, and Sylvia Cremer. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>.","mla":"Westhus, Claudia, et al. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10, Springer, 2014, pp. 1701–10, doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>.","short":"C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, Behavioral Ecology and Sociobiology 68 (2014) 1701–1710.","ama":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. 2014;68(10):1701-1710. doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>","ista":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2014. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. Behavioral Ecology and Sociobiology. 68(10), 1701–1710.","ieee":"C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer, “Increased grooming after repeated brood care provides sanitary benefits in a clonal ant,” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10. Springer, pp. 1701–1710, 2014."},"type":"journal_article","publication":"Behavioral Ecology and Sociobiology","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"id":"9742","relation":"research_data","status":"public"}]},"article_type":"original","volume":68,"page":"1701 - 1710","department":[{"_id":"SyCr"}],"_id":"2161","isi":1,"publication_identifier":{"issn":["0340-5443"]},"month":"07","intvolume":"        68","language":[{"iso":"eng"}],"scopus_import":"1","year":"2014","abstract":[{"text":"Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects.","lang":"eng"}],"publication_status":"published","status":"public","corr_author":"1","date_published":"2014-07-23T00:00:00Z","author":[{"full_name":"Westhus, Claudia","first_name":"Claudia","id":"ca9c6ca9-e8aa-11ec-a586-b9471ede0494","last_name":"Westhus"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V","first_name":"Line V","last_name":"Ugelvig"},{"first_name":"Edouard","full_name":"Tourdot, Edouard","last_name":"Tourdot"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"},{"first_name":"Claudie","full_name":"Doums, Claudie","last_name":"Doums"},{"last_name":"Cremer","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","full_name":"Cremer, Sylvia"}],"publisher":"Springer","article_processing_charge":"No","day":"23","acknowledgement":"We thank Katrin Kellner for colony establishment and characterization, Mike Bidochka for the fungal strain, Meghan Vyleta for fungal strain characterization, Martina Klatt and Simon Tragust for help in the laboratory, Dimitri Missoh for developing the software BioLogic, and Mark Brown and Raphaël Jeanson for discussion and help with data analysis. The study was funded by the European Research Council (ERC Starting Grant to SC; Marie Curie IEF to LVU) and the German Research Foundation DFG (to SC and to JH), and CW received funding by the doctoral school Diversité du Vivant (Cotutelle project to CD and SC).\r\n","oa_version":"None","publist_id":"4823","doi":"10.1007/s00265-014-1778-8","title":"Increased grooming after repeated brood care provides sanitary benefits in a clonal ant","external_id":{"isi":["000342226200015"]},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"},{"grant_number":"243071","call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425"},{"grant_number":"CR-118/3-1","_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution"}],"issue":"10","ec_funded":1},{"type":"conference","citation":{"mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Ergodic Mean Payoff Games</i>. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">https://doi.org/10.1007/978-3-662-43951-7_11</a>.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games. In: Vol 8573. Springer; 2014:122-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_11\">10.1007/978-3-662-43951-7_11</a>","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.","ista":"Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133."},"date_created":"2018-12-11T11:56:04Z","date_updated":"2024-10-21T06:02:53Z","quality_controlled":"1","oa":1,"volume":8573,"related_material":{"record":[{"id":"5404","relation":"earlier_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"_id":"2162","conference":{"location":"Copenhagen, Denmark","start_date":"2014-07-08","name":"ICST: International Conference on Software Testing, Verification and Validation","end_date":"2014-07-11"},"alternative_title":["LNCS"],"page":"122 - 133","language":[{"iso":"eng"}],"intvolume":"      8573","month":"01","status":"public","corr_author":"1","publication_status":"published","abstract":[{"lang":"eng","text":"We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lies in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP ∩ coNP is the long-standing best known bound). We present a variant of the strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existential theory of the reals, and establish square-root sum hardness for a related class of games."}],"scopus_import":"1","year":"2014","day":"01","publisher":"Springer","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"arxiv":1,"date_published":"2014-01-01T00:00:00Z","title":"The complexity of ergodic mean payoff games","doi":"10.1007/978-3-662-43951-7_11","publist_id":"4822","oa_version":"Preprint","ec_funded":1,"main_file_link":[{"url":"http://arxiv.org/abs/1404.5734","open_access":"1"}],"issue":"Part 2","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"arxiv":["1404.5734"]}},{"title":"Games with a weak adversary","doi":"10.1007/978-3-662-43951-7_10","publist_id":"4821","acknowledgement":"This research was partly supported by European project Cassting (FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n","oa_version":"Preprint","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1404.5453"}],"issue":"Part 2","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"external_id":{"arxiv":["1404.5453"]},"status":"public","publication_status":"published","abstract":[{"text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. From our results we derive new complexity results for partial-observation stochastic games.","lang":"eng"}],"scopus_import":"1","year":"2014","day":"01","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"publisher":"Springer","arxiv":1,"date_published":"2014-01-01T00:00:00Z","department":[{"_id":"KrCh"}],"_id":"2163","conference":{"start_date":"2014-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2014-07-11","location":"Copenhagen, Denmark"},"alternative_title":["LNCS"],"page":"110 - 121","language":[{"iso":"eng"}],"intvolume":"      8573","month":"01","citation":{"ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.","short":"K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.","ama":"Chatterjee K, Doyen L. Games with a weak adversary. In: <i>Lecture Notes in Computer Science</i>. Vol 8573. Springer; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">10.1007/978-3-662-43951-7_10</a>","ieee":"K. Chatterjee and L. Doyen, “Games with a weak adversary,” in <i>Lecture Notes in Computer Science</i>, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” In <i>Lecture Notes in Computer Science</i>, 8573:110–21. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">https://doi.org/10.1007/978-3-662-43951-7_10</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2014). Games with a weak adversary. In <i>Lecture Notes in Computer Science</i> (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">https://doi.org/10.1007/978-3-662-43951-7_10</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” <i>Lecture Notes in Computer Science</i>, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-43951-7_10\">10.1007/978-3-662-43951-7_10</a>."},"publication":"Lecture Notes in Computer Science","type":"conference","date_created":"2018-12-11T11:56:04Z","date_updated":"2024-10-21T06:02:54Z","quality_controlled":"1","oa":1,"volume":8573,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5418"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"external_id":{"isi":["000340068500014"]},"issue":"8","publist_id":"4820","oa_version":"None","title":"Epilepsy-induced motility of differentiated neurons","doi":"10.1093/cercor/bht067","author":[{"last_name":"Chai","first_name":"Xuejun","full_name":"Chai, Xuejun"},{"first_name":"Gert","full_name":"Münzner, Gert","last_name":"Münzner"},{"last_name":"Zhao","first_name":"Shanting","full_name":"Zhao, Shanting"},{"last_name":"Tinnes","full_name":"Tinnes, Stefanie","first_name":"Stefanie"},{"first_name":"Janina","full_name":"Kowalski, Janina","id":"3F3CA136-F248-11E8-B48F-1D18A9856A87","last_name":"Kowalski"},{"full_name":"Häussler, Ute","first_name":"Ute","last_name":"Häussler"},{"full_name":"Young, Christina","first_name":"Christina","last_name":"Young"},{"first_name":"Carola","full_name":"Haas, Carola","last_name":"Haas"},{"full_name":"Frotscher, Michael","first_name":"Michael","last_name":"Frotscher"}],"publisher":"Oxford University Press","date_published":"2014-08-01T00:00:00Z","day":"01","article_processing_charge":"No","publication_status":"published","abstract":[{"lang":"eng","text":"Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe epilepsy (TLE), has been assumed to result from a migration defect during development. Indeed, recent studies reported that aberrant migration of neonatal-generated dentate granule cells (GCs) increased the risk to develop epilepsy later in life. On the contrary, in the present study, we show that fully differentiated GCs become motile following the induction of epileptiform activity, resulting in GCD. Hippocampal slice cultures from transgenic mice expressing green fluorescent protein in differentiated, but not in newly generated GCs, were incubated with the glutamate receptor agonist kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy, we observed that KA-exposed, differentiated GCs translocated their cell bodies and changed their dendritic organization. As found in human TLE, KA application was associated with decreased expression of the extracellular matrix protein Reelin, particularly in hilar interneurons. Together these findings suggest that KA-induced motility of differentiated GCs contributes to the development of GCD and establish slice cultures as a model to study neuronal changes induced by epileptiform activity. "}],"year":"2014","scopus_import":"1","status":"public","intvolume":"        24","month":"08","language":[{"iso":"eng"}],"isi":1,"_id":"2164","department":[{"_id":"PeJo"}],"page":"2130 - 2140","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":24,"date_created":"2018-12-11T11:56:04Z","quality_controlled":"1","date_updated":"2025-09-29T11:41:17Z","type":"journal_article","citation":{"apa":"Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., … Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. <i>Cerebral Cortex</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/cercor/bht067\">https://doi.org/10.1093/cercor/bht067</a>","chicago":"Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski, Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced Motility of Differentiated Neurons.” <i>Cerebral Cortex</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/cercor/bht067\">https://doi.org/10.1093/cercor/bht067</a>.","mla":"Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.” <i>Cerebral Cortex</i>, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40, doi:<a href=\"https://doi.org/10.1093/cercor/bht067\">10.1093/cercor/bht067</a>.","ama":"Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated neurons. <i>Cerebral Cortex</i>. 2014;24(8):2130-2140. doi:<a href=\"https://doi.org/10.1093/cercor/bht067\">10.1093/cercor/bht067</a>","short":"X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young, C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.","ista":"Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral Cortex. 24(8), 2130–2140.","ieee":"X. Chai <i>et al.</i>, “Epilepsy-induced motility of differentiated neurons,” <i>Cerebral Cortex</i>, vol. 24, no. 8. Oxford University Press, pp. 2130–2140, 2014."},"publication":"Cerebral Cortex"},{"oa_version":"Published Version","publist_id":"4816","title":"Coalescent simulation in continuous space: Algorithms for large neighbourhood size","doi":"10.1016/j.tpb.2014.05.001","external_id":{"isi":["000339460300002"]},"project":[{"grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"year":"2014","scopus_import":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Many species have an essentially continuous distribution in space, in which there are no natural divisions between randomly mating subpopulations. Yet, the standard approach to modelling these populations is to impose an arbitrary grid of demes, adjusting deme sizes and migration rates in an attempt to capture the important features of the population. Such indirect methods are required because of the failure of the classical models of isolation by distance, which have been shown to have major technical flaws. A recently introduced model of extinction and recolonisation in two dimensions solves these technical problems, and provides a rigorous technical foundation for the study of populations evolving in a spatial continuum. The coalescent process for this model is simply stated, but direct simulation is very inefficient for large neighbourhood sizes. We present efficient and exact algorithms to simulate this coalescent process for arbitrary sample sizes and numbers of loci, and analyse these algorithms in detail."}],"status":"public","date_published":"2014-08-01T00:00:00Z","pubrep_id":"391","author":[{"last_name":"Kelleher","full_name":"Kelleher, Jerome","first_name":"Jerome"},{"last_name":"Etheridge","full_name":"Etheridge, Alison","first_name":"Alison"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton"}],"publisher":"Academic Press","day":"01","article_processing_charge":"No","file":[{"file_id":"4839","file_size":569005,"access_level":"open_access","checksum":"979d7a8034e9df198f068f0d251f31bd","content_type":"application/pdf","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:10:49Z","file_name":"IST-2015-391-v1+1_1-s2.0-S0040580914000355-main.pdf","creator":"system","relation":"main_file"}],"page":"13 - 23","has_accepted_license":"1","_id":"2168","department":[{"_id":"NiBa"}],"isi":1,"month":"08","ddc":["570"],"intvolume":"        95","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:31Z","date_updated":"2025-09-29T11:39:51Z","quality_controlled":"1","date_created":"2018-12-11T11:56:06Z","citation":{"mla":"Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” <i>Theoretical Population Biology</i>, vol. 95, Academic Press, 2014, pp. 13–23, doi:<a href=\"https://doi.org/10.1016/j.tpb.2014.05.001\">10.1016/j.tpb.2014.05.001</a>.","chicago":"Kelleher, Jerome, Alison Etheridge, and Nicholas H Barton. “Coalescent Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” <i>Theoretical Population Biology</i>. Academic Press, 2014. <a href=\"https://doi.org/10.1016/j.tpb.2014.05.001\">https://doi.org/10.1016/j.tpb.2014.05.001</a>.","apa":"Kelleher, J., Etheridge, A., &#38; Barton, N. H. (2014). Coalescent simulation in continuous space: Algorithms for large neighbourhood size. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2014.05.001\">https://doi.org/10.1016/j.tpb.2014.05.001</a>","ieee":"J. Kelleher, A. Etheridge, and N. H. Barton, “Coalescent simulation in continuous space: Algorithms for large neighbourhood size,” <i>Theoretical Population Biology</i>, vol. 95. Academic Press, pp. 13–23, 2014.","ista":"Kelleher J, Etheridge A, Barton NH. 2014. Coalescent simulation in continuous space: Algorithms for large neighbourhood size. Theoretical Population Biology. 95, 13–23.","ama":"Kelleher J, Etheridge A, Barton NH. Coalescent simulation in continuous space: Algorithms for large neighbourhood size. <i>Theoretical Population Biology</i>. 2014;95:13-23. doi:<a href=\"https://doi.org/10.1016/j.tpb.2014.05.001\">10.1016/j.tpb.2014.05.001</a>","short":"J. Kelleher, A. Etheridge, N.H. Barton, Theoretical Population Biology 95 (2014) 13–23."},"publication":"Theoretical Population Biology","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":95,"oa":1},{"isi":1,"_id":"2169","department":[{"_id":"NiBa"}],"page":"10398 - 10399","intvolume":"       111","month":"07","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:07Z","quality_controlled":"1","date_updated":"2025-09-29T11:39:19Z","citation":{"short":"N.H. Barton, S. Novak, T. Paixao, PNAS 111 (2014) 10398–10399.","ama":"Barton NH, Novak S, Paixao T. Diverse forms of selection in evolution and computer science. <i>PNAS</i>. 2014;111(29):10398-10399. doi:<a href=\"https://doi.org/10.1073/pnas.1410107111\">10.1073/pnas.1410107111</a>","ista":"Barton NH, Novak S, Paixao T. 2014. Diverse forms of selection in evolution and computer science. PNAS. 111(29), 10398–10399.","ieee":"N. H. Barton, S. Novak, and T. Paixao, “Diverse forms of selection in evolution and computer science,” <i>PNAS</i>, vol. 111, no. 29. National Academy of Sciences, pp. 10398–10399, 2014.","apa":"Barton, N. H., Novak, S., &#38; Paixao, T. (2014). Diverse forms of selection in evolution and computer science. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1410107111\">https://doi.org/10.1073/pnas.1410107111</a>","chicago":"Barton, Nicholas H, Sebastian Novak, and Tiago Paixao. “Diverse Forms of Selection in Evolution and Computer Science.” <i>PNAS</i>. National Academy of Sciences, 2014. <a href=\"https://doi.org/10.1073/pnas.1410107111\">https://doi.org/10.1073/pnas.1410107111</a>.","mla":"Barton, Nicholas H., et al. “Diverse Forms of Selection in Evolution and Computer Science.” <i>PNAS</i>, vol. 111, no. 29, National Academy of Sciences, 2014, pp. 10398–99, doi:<a href=\"https://doi.org/10.1073/pnas.1410107111\">10.1073/pnas.1410107111</a>."},"type":"journal_article","publication":"PNAS","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"volume":111,"publist_id":"4815","oa_version":"Submitted Version","title":"Diverse forms of selection in evolution and computer science","doi":"10.1073/pnas.1410107111","external_id":{"isi":["000339310700017"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115508/","open_access":"1"}],"issue":"29","publication_status":"published","scopus_import":"1","year":"2014","status":"public","corr_author":"1","author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H"},{"id":"461468AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2519-824X","full_name":"Novak, Sebastian","first_name":"Sebastian","last_name":"Novak"},{"last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","full_name":"Paixao, Tiago","first_name":"Tiago"}],"publisher":"National Academy of Sciences","date_published":"2014-07-22T00:00:00Z","article_processing_charge":"No","day":"22"},{"_id":"2170","department":[{"_id":"NiBa"}],"isi":1,"page":"198 - 211","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["570"],"intvolume":"        23","month":"01","citation":{"ista":"Hearn J, Stone G, Bunnefeld L, Nicholls J, Barton NH, Lohse K. 2014. Likelihood-based inference of population history from low-coverage de novo genome assemblies. Molecular Ecology. 23(1), 198–211.","short":"J. Hearn, G. Stone, L. Bunnefeld, J. Nicholls, N.H. Barton, K. Lohse, Molecular Ecology 23 (2014) 198–211.","ama":"Hearn J, Stone G, Bunnefeld L, Nicholls J, Barton NH, Lohse K. Likelihood-based inference of population history from low-coverage de novo genome assemblies. <i>Molecular Ecology</i>. 2014;23(1):198-211. doi:<a href=\"https://doi.org/10.1111/mec.12578\">10.1111/mec.12578</a>","ieee":"J. Hearn, G. Stone, L. Bunnefeld, J. Nicholls, N. H. Barton, and K. Lohse, “Likelihood-based inference of population history from low-coverage de novo genome assemblies,” <i>Molecular Ecology</i>, vol. 23, no. 1. Wiley-Blackwell, pp. 198–211, 2014.","chicago":"Hearn, Jack, Graham Stone, Lynsey Bunnefeld, James Nicholls, Nicholas H Barton, and Konrad Lohse. “Likelihood-Based Inference of Population History from Low-Coverage de Novo Genome Assemblies.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1111/mec.12578\">https://doi.org/10.1111/mec.12578</a>.","apa":"Hearn, J., Stone, G., Bunnefeld, L., Nicholls, J., Barton, N. H., &#38; Lohse, K. (2014). Likelihood-based inference of population history from low-coverage de novo genome assemblies. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.12578\">https://doi.org/10.1111/mec.12578</a>","mla":"Hearn, Jack, et al. “Likelihood-Based Inference of Population History from Low-Coverage de Novo Genome Assemblies.” <i>Molecular Ecology</i>, vol. 23, no. 1, Wiley-Blackwell, 2014, pp. 198–211, doi:<a href=\"https://doi.org/10.1111/mec.12578\">10.1111/mec.12578</a>."},"type":"journal_article","publication":"Molecular Ecology","date_created":"2018-12-11T11:56:07Z","file_date_updated":"2020-07-14T12:45:31Z","date_updated":"2025-09-29T11:38:51Z","quality_controlled":"1","volume":23,"oa":1,"related_material":{"record":[{"id":"9754","relation":"research_data","status":"public"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Likelihood-based inference of population history from low-coverage de novo genome assemblies","doi":"10.1111/mec.12578","publist_id":"4814","oa_version":"Submitted Version","acknowledgement":"This work was funded by NERC grants to G Stone, J Nicholls, K Lohse and N Barton (NE/J010499, NBAF375, NE/E014453/1 and NER/B/S2003/00856).","issue":"1","external_id":{"isi":["000330950900017"]},"status":"public","abstract":[{"lang":"eng","text":" Short-read sequencing technologies have in principle made it feasible to draw detailed inferences about the recent history of any organism. In practice, however, this remains challenging due to the difficulty of genome assembly in most organisms and the lack of statistical methods powerful enough to discriminate between recent, nonequilibrium histories. We address both the assembly and inference challenges. We develop a bioinformatic pipeline for generating outgroup-rooted alignments of orthologous sequence blocks from de novo low-coverage short-read data for a small number of genomes, and show how such sequence blocks can be used to fit explicit models of population divergence and admixture in a likelihood framework. To illustrate our approach, we reconstruct the Pleistocene history of an oak-feeding insect (the oak gallwasp Biorhiza pallida), which, in common with many other taxa, was restricted during Pleistocene ice ages to a longitudinal series of southern refugia spanning the Western Palaearctic. Our analysis of sequence blocks sampled from a single genome from each of three major glacial refugia reveals support for an unexpected history dominated by recent admixture. Despite the fact that 80% of the genome is affected by admixture during the last glacial cycle, we are able to infer the deeper divergence history of these populations. These inferences are robust to variation in block length, mutation model and the sampling location of individual genomes within refugia. This combination of de novo assembly and numerical likelihood calculation provides a powerful framework for estimating recent population history that can be applied to any organism without the need for prior genetic resources."}],"publication_status":"published","year":"2014","scopus_import":"1","file":[{"file_name":"IST-2016-559-v1+1_Hearn_et_al.pdf","relation":"main_file","creator":"system","access_level":"open_access","checksum":"4de1ab255976a8ae77eb0e55ad62ecc9","file_id":"4651","file_size":807444,"date_created":"2018-12-12T10:07:52Z","date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf"},{"file_name":"IST-2016-559-v1+2_Hearn_et_al_Suppl.pdf","creator":"system","relation":"main_file","file_id":"4652","file_size":1518088,"access_level":"open_access","checksum":"01a8073e071c088500425f910b0f1f71","date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf","date_created":"2018-12-12T10:07:53Z"}],"day":"01","article_processing_charge":"No","pubrep_id":"559","author":[{"last_name":"Hearn","full_name":"Hearn, Jack","first_name":"Jack"},{"last_name":"Stone","first_name":"Graham","full_name":"Stone, Graham"},{"first_name":"Lynsey","full_name":"Bunnefeld, Lynsey","last_name":"Bunnefeld"},{"full_name":"Nicholls, James","first_name":"James","last_name":"Nicholls"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"first_name":"Konrad","full_name":"Lohse, Konrad","last_name":"Lohse"}],"publisher":"Wiley-Blackwell","date_published":"2014-01-01T00:00:00Z"},{"oa":1,"volume":8691,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"A. Kolesnikov, M. Guillaumin, V. Ferrari, and C. Lampert, “Closed-form approximate CRF training for scalable image segmentation,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Zurich, Switzerland, 2014, vol. 8691, no. PART 3, pp. 550–565.","short":"A. Kolesnikov, M. Guillaumin, V. Ferrari, C. Lampert, in:, D. Fleet, T. Pajdla, B. Schiele, T. Tuytelaars (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 550–565.","ama":"Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. Closed-form approximate CRF training for scalable image segmentation. In: Fleet D, Pajdla T, Schiele B, Tuytelaars T, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8691. Springer; 2014:550-565. doi:<a href=\"https://doi.org/10.1007/978-3-319-10578-9_36\">10.1007/978-3-319-10578-9_36</a>","ista":"Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. 2014. Closed-form approximate CRF training for scalable image segmentation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ECCV: European Conference on Computer Vision, LNCS, vol. 8691, 550–565.","mla":"Kolesnikov, Alexander, et al. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by David Fleet et al., vol. 8691, no. PART 3, Springer, 2014, pp. 550–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-10578-9_36\">10.1007/978-3-319-10578-9_36</a>.","apa":"Kolesnikov, A., Guillaumin, M., Ferrari, V., &#38; Lampert, C. (2014). Closed-form approximate CRF training for scalable image segmentation. In D. Fleet, T. Pajdla, B. Schiele, &#38; T. Tuytelaars (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8691, pp. 550–565). Zurich, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10578-9_36\">https://doi.org/10.1007/978-3-319-10578-9_36</a>","chicago":"Kolesnikov, Alexander, Matthieu Guillaumin, Vittorio Ferrari, and Christoph Lampert. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by David Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, 8691:550–65. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10578-9_36\">https://doi.org/10.1007/978-3-319-10578-9_36</a>."},"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","type":"conference","date_updated":"2025-06-11T07:59:20Z","quality_controlled":"1","date_created":"2018-12-11T11:56:07Z","language":[{"iso":"eng"}],"editor":[{"last_name":"Fleet","full_name":"Fleet, David","first_name":"David"},{"last_name":"Pajdla","full_name":"Pajdla, Tomas","first_name":"Tomas"},{"full_name":"Schiele, Bernt","first_name":"Bernt","last_name":"Schiele"},{"last_name":"Tuytelaars","first_name":"Tinne","full_name":"Tuytelaars, Tinne"}],"month":"09","intvolume":"      8691","alternative_title":["LNCS"],"page":"550 - 565","department":[{"_id":"ChLa"}],"_id":"2171","conference":{"end_date":"2014-09-12","name":"ECCV: European Conference on Computer Vision","start_date":"2014-09-06","location":"Zurich, Switzerland"},"article_processing_charge":"No","day":"01","date_published":"2014-09-01T00:00:00Z","publisher":"Springer","author":[{"last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","full_name":"Kolesnikov, Alexander"},{"last_name":"Guillaumin","full_name":"Guillaumin, Matthieu","first_name":"Matthieu"},{"last_name":"Ferrari","full_name":"Ferrari, Vittorio","first_name":"Vittorio"},{"last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"arxiv":1,"status":"public","scopus_import":"1","year":"2014","abstract":[{"text":"We present LS-CRF, a new method for training cyclic Conditional Random Fields (CRFs) from large datasets that is inspired by classical closed-form expressions for the maximum likelihood parameters of a generative graphical model with tree topology. Training a CRF with LS-CRF requires only solving a set of independent regression problems, each of which can be solved efficiently in closed form or by an iterative solver. This makes LS-CRF orders of magnitude faster than classical CRF training based on probabilistic inference, and at the same time more flexible and easier to implement than other approximate techniques, such as pseudolikelihood or piecewise training. We apply LS-CRF to the task of semantic image segmentation, showing that it achieves on par accuracy to other training techniques at higher speed, thereby allowing efficient CRF training from very large training sets. For example, training a linearly parameterized pairwise CRF on 150,000 images requires less than one hour on a modern workstation.","lang":"eng"}],"publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1403.7057","open_access":"1"}],"issue":"PART 3","ec_funded":1,"external_id":{"arxiv":["1403.7057"]},"project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-319-10578-9_36","title":"Closed-form approximate CRF training for scalable image segmentation","oa_version":"Submitted Version","publist_id":"4813"},{"page":"1402 - 1409","isi":1,"_id":"2172","department":[{"_id":"ChLa"}],"conference":{"location":"Columbus, USA","name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2014-06-28","start_date":"2014-06-23"},"month":"09","language":[{"iso":"eng"}],"quality_controlled":"1","date_updated":"2025-09-29T11:38:10Z","date_created":"2018-12-11T11:56:08Z","type":"conference","citation":{"chicago":"Sydorov, Vladyslav, Mayu Sakurada, and Christoph Lampert. “Deep Fisher Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, 1402–9. IEEE, 2014. <a href=\"https://doi.org/10.1109/CVPR.2014.182\">https://doi.org/10.1109/CVPR.2014.182</a>.","apa":"Sydorov, V., Sakurada, M., &#38; Lampert, C. (2014). Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i> (pp. 1402–1409). Columbus, USA: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2014.182\">https://doi.org/10.1109/CVPR.2014.182</a>","mla":"Sydorov, Vladyslav, et al. “Deep Fisher Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2014, pp. 1402–09, doi:<a href=\"https://doi.org/10.1109/CVPR.2014.182\">10.1109/CVPR.2014.182</a>.","ista":"Sydorov V, Sakurada M, Lampert C. 2014. Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Computer Vision and Pattern Recognition, 1402–1409.","short":"V. Sydorov, M. Sakurada, C. Lampert, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–1409.","ama":"Sydorov V, Sakurada M, Lampert C. Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters. In: <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2014:1402-1409. doi:<a href=\"https://doi.org/10.1109/CVPR.2014.182\">10.1109/CVPR.2014.182</a>","ieee":"V. Sydorov, M. Sakurada, and C. Lampert, “Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters,” in <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Columbus, USA, 2014, pp. 1402–1409."},"publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","publist_id":"4812","doi":"10.1109/CVPR.2014.182","title":"Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters","external_id":{"isi":["000361555601057"]},"project":[{"grant_number":"308036","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"scopus_import":"1","year":"2014","publication_status":"published","abstract":[{"lang":"eng","text":"Fisher Kernels and Deep Learning were two developments with significant impact on large-scale object categorization in the last years. Both approaches were shown to achieve state-of-the-art results on large-scale object categorization datasets, such as ImageNet. Conceptually, however, they are perceived as very different and it is not uncommon for heated debates to spring up when advocates of both paradigms meet at conferences or workshops. In this work, we emphasize the similarities between both architectures rather than their differences and we argue that such a unified view allows us to transfer ideas from one domain to the other. As a concrete example we introduce a method for learning a support vector machine classifier with Fisher kernel at the same time as a task-specific data representation. We reinterpret the setting as a multi-layer feed forward network. Its final layer is the classifier, parameterized by a weight vector, and the two previous layers compute Fisher vectors, parameterized by the coefficients of a Gaussian mixture model. We introduce a gradient descent based learning algorithm that, in contrast to other feature learning techniques, is not just derived from intuition or biological analogy, but has a theoretical justification in the framework of statistical learning theory. Our experiments show that the new training procedure leads to significant improvements in classification accuracy while preserving the modularity and geometric interpretability of a support vector machine setup."}],"status":"public","corr_author":"1","date_published":"2014-09-24T00:00:00Z","author":[{"full_name":"Sydorov, Vladyslav","first_name":"Vladyslav","last_name":"Sydorov"},{"last_name":"Sakurada","full_name":"Sakurada, Mayu","first_name":"Mayu"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph"}],"publisher":"IEEE","article_processing_charge":"No","day":"24"},{"ec_funded":1,"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"}],"title":"CoConut: Co-classification with output space regularization","publist_id":"4811","oa_version":"Published Version","file":[{"relation":"main_file","creator":"system","file_name":"IST-2016-490-v1+1_khamis-bmvc2014.pdf","date_created":"2018-12-12T10:08:23Z","content_type":"application/pdf","date_updated":"2020-07-14T12:45:31Z","access_level":"open_access","checksum":"c4c6d3efdb8ee648faf3e76849839ce2","file_id":"4683","file_size":408172}],"day":"01","pubrep_id":"490","publisher":"BMVA Press","author":[{"last_name":"Khamis","first_name":"Sameh","full_name":"Khamis, Sameh"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert"}],"date_published":"2014-09-01T00:00:00Z","status":"public","abstract":[{"text":"In this work we introduce a new approach to co-classification, i.e. the task of jointly classifying multiple, otherwise independent, data samples. The method we present, named CoConut, is based on the idea of adding a regularizer in the label space to encode certain priors on the resulting labelings. A regularizer that encourages labelings that are smooth across the test set, for instance, can be seen as a test-time variant of the cluster assumption, which has been proven useful at training time in semi-supervised learning. A regularizer that introduces a preference for certain class proportions can be regarded as a prior distribution on the class labels. CoConut can build on existing classifiers without making any assumptions on how they were obtained and without the need to re-train them. The use of a regularizer adds a new level of flexibility. It allows the integration of potentially new information at test time, even in other modalities than what the classifiers were trained on. We evaluate our framework on six datasets, reporting a clear performance gain in classification accuracy compared to the standard classification setup that predicts labels for each test sample separately.\r\n","lang":"eng"}],"publication_status":"published","year":"2014","scopus_import":1,"language":[{"iso":"eng"}],"ddc":["000"],"month":"09","conference":{"name":"BMVC: British Machine Vision Conference","end_date":"2014-09-05","start_date":"2014-09-01","location":"Nottingham, UK"},"_id":"2173","department":[{"_id":"ChLa"}],"has_accepted_license":"1","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the British Machine Vision Conference 2014","citation":{"ieee":"S. Khamis and C. Lampert, “CoConut: Co-classification with output space regularization,” in <i>Proceedings of the British Machine Vision Conference 2014</i>, Nottingham, UK, 2014.","ista":"Khamis S, Lampert C. 2014. CoConut: Co-classification with output space regularization. Proceedings of the British Machine Vision Conference 2014. BMVC: British Machine Vision Conference.","ama":"Khamis S, Lampert C. CoConut: Co-classification with output space regularization. In: <i>Proceedings of the British Machine Vision Conference 2014</i>. BMVA Press; 2014.","short":"S. Khamis, C. Lampert, in:, Proceedings of the British Machine Vision Conference 2014, BMVA Press, 2014.","mla":"Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output Space Regularization.” <i>Proceedings of the British Machine Vision Conference 2014</i>, BMVA Press, 2014.","chicago":"Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output Space Regularization.” In <i>Proceedings of the British Machine Vision Conference 2014</i>. BMVA Press, 2014.","apa":"Khamis, S., &#38; Lampert, C. (2014). CoConut: Co-classification with output space regularization. In <i>Proceedings of the British Machine Vision Conference 2014</i>. Nottingham, UK: BMVA Press."},"type":"conference","date_created":"2018-12-11T11:56:08Z","file_date_updated":"2020-07-14T12:45:31Z","quality_controlled":"1","date_updated":"2021-01-12T06:55:46Z"},{"ec_funded":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.1017"}],"issue":"2","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"external_id":{"isi":["000338697000027"],"arxiv":["1404.1017"]},"title":"Stability and response of polygenic traits to stabilizing selection and mutation","doi":"10.1534/genetics.113.159111","publist_id":"4809","oa_version":"Submitted Version","article_processing_charge":"No","day":"01","author":[{"last_name":"De Vladar","first_name":"Harold","full_name":"De Vladar, Harold"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton"}],"publisher":"Genetics Society of America","arxiv":1,"date_published":"2014-06-01T00:00:00Z","status":"public","corr_author":"1","abstract":[{"text":"When polygenic traits are under stabilizing selection, many different combinations of alleles allow close adaptation to the optimum. If alleles have equal effects, all combinations that result in the same deviation from the optimum are equivalent. Furthermore, the genetic variance that is maintained by mutation-selection balance is 2μ/S per locus, where μ is the mutation rate and S the strength of stabilizing selection. In reality, alleles vary in their effects, making the fitness landscape asymmetric and complicating analysis of the equilibria. We show that that the resulting genetic variance depends on the fraction of alleles near fixation, which contribute by 2μ/S, and on the total mutational effects of alleles that are at intermediate frequency. The inpplayfi between stabilizing selection and mutation leads to a sharp transition: alleles with effects smaller than a threshold value of 2 remain polymorphic, whereas those with larger effects are fixed. The genetic load in equilibrium is less than for traits of equal effects, and the fitness equilibria are more similar. We find p the optimum is displaced, alleles with effects close to the threshold value sweep first, and their rate of increase is bounded by Long-term response leads in general to well-adapted traits, unlike the case of equal effects that often end up at a suboptimal fitness peak. However, the particular peaks to which the populations converge are extremely sensitive to the initial states and to the speed of the shift of the optimum trait value.","lang":"eng"}],"publication_status":"published","scopus_import":"1","year":"2014","language":[{"iso":"eng"}],"intvolume":"       197","month":"06","_id":"2174","department":[{"_id":"NiBa"}],"isi":1,"page":"749 - 767","oa":1,"volume":197,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","publication":"Genetics","citation":{"ista":"De Vladar H, Barton NH. 2014. Stability and response of polygenic traits to stabilizing selection and mutation. Genetics. 197(2), 749–767.","ama":"De Vladar H, Barton NH. Stability and response of polygenic traits to stabilizing selection and mutation. <i>Genetics</i>. 2014;197(2):749-767. doi:<a href=\"https://doi.org/10.1534/genetics.113.159111\">10.1534/genetics.113.159111</a>","short":"H. De Vladar, N.H. Barton, Genetics 197 (2014) 749–767.","ieee":"H. De Vladar and N. H. Barton, “Stability and response of polygenic traits to stabilizing selection and mutation,” <i>Genetics</i>, vol. 197, no. 2. Genetics Society of America, pp. 749–767, 2014.","chicago":"De Vladar, Harold, and Nicholas H Barton. “Stability and Response of Polygenic Traits to Stabilizing Selection and Mutation.” <i>Genetics</i>. Genetics Society of America, 2014. <a href=\"https://doi.org/10.1534/genetics.113.159111\">https://doi.org/10.1534/genetics.113.159111</a>.","apa":"De Vladar, H., &#38; Barton, N. H. (2014). Stability and response of polygenic traits to stabilizing selection and mutation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.113.159111\">https://doi.org/10.1534/genetics.113.159111</a>","mla":"De Vladar, Harold, and Nicholas H. Barton. “Stability and Response of Polygenic Traits to Stabilizing Selection and Mutation.” <i>Genetics</i>, vol. 197, no. 2, Genetics Society of America, 2014, pp. 749–67, doi:<a href=\"https://doi.org/10.1534/genetics.113.159111\">10.1534/genetics.113.159111</a>."},"date_created":"2018-12-11T11:56:08Z","date_updated":"2025-09-29T11:37:14Z","quality_controlled":"1"},{"title":"Monitoring neurogenesis in the cerebral cortex: an update","doi":"10.2217/fnl.14.18","publist_id":"4806","oa_version":"Published Version","ec_funded":1,"issue":"3","project":[{"grant_number":"618444","_id":"25D61E48-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7"}],"status":"public","corr_author":"1","abstract":[{"lang":"eng","text":"The cerebral cortex, the seat of our cognitive abilities, is composed of an intricate network of billions of excitatory projection and inhibitory interneurons. Postmitotic cortical neurons are generated by a diverse set of neural stem cell progenitors within dedicated zones and defined periods of neurogenesis during embryonic development. Disruptions in neurogenesis can lead to alterations in the neuronal cytoarchitecture, which is thought to represent a major underlying cause for several neurological disorders, including microcephaly, autism and epilepsy. Although a number of signaling pathways regulating neurogenesis have been described, the precise cellular and molecular mechanisms regulating the functional neural stem cell properties in cortical neurogenesis remain unclear. Here, we discuss the most up-to-date strategies to monitor the fundamental mechanistic parameters of neuronal progenitor proliferation, and recent advances deciphering the logic and dynamics of neurogenesis."}],"publication_status":"published","scopus_import":"1","year":"2014","file":[{"date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf","date_created":"2018-12-12T10:10:25Z","file_id":"4812","file_size":3848424,"access_level":"open_access","checksum":"ba06659ecadabceec9a37dd8c4586dce","creator":"system","relation":"main_file","file_name":"IST-2016-528-v1+1_fnl.14.18.pdf"}],"article_processing_charge":"No","day":"01","publisher":"Future Science Group","author":[{"last_name":"Postiglione","full_name":"Postiglione, Maria P","first_name":"Maria P","id":"2C67902A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"528","date_published":"2014-05-01T00:00:00Z","publication_identifier":{"eissn":["1748-6971"],"issn":["1479-6708"]},"_id":"2175","department":[{"_id":"SiHi"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","has_accepted_license":"1","page":"323 - 340","language":[{"iso":"eng"}],"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"intvolume":"         9","ddc":["570"],"month":"05","type":"journal_article","publication":"Future Neurology","citation":{"ista":"Postiglione MP, Hippenmeyer S. 2014. Monitoring neurogenesis in the cerebral cortex: an update. Future Neurology. 9(3), 323–340.","ama":"Postiglione MP, Hippenmeyer S. Monitoring neurogenesis in the cerebral cortex: an update. <i>Future Neurology</i>. 2014;9(3):323-340. doi:<a href=\"https://doi.org/10.2217/fnl.14.18\">10.2217/fnl.14.18</a>","short":"M.P. Postiglione, S. Hippenmeyer, Future Neurology 9 (2014) 323–340.","ieee":"M. P. Postiglione and S. Hippenmeyer, “Monitoring neurogenesis in the cerebral cortex: an update,” <i>Future Neurology</i>, vol. 9, no. 3. Future Science Group, pp. 323–340, 2014.","chicago":"Postiglione, Maria P, and Simon Hippenmeyer. “Monitoring Neurogenesis in the Cerebral Cortex: An Update.” <i>Future Neurology</i>. Future Science Group, 2014. <a href=\"https://doi.org/10.2217/fnl.14.18\">https://doi.org/10.2217/fnl.14.18</a>.","apa":"Postiglione, M. P., &#38; Hippenmeyer, S. (2014). Monitoring neurogenesis in the cerebral cortex: an update. <i>Future Neurology</i>. Future Science Group. <a href=\"https://doi.org/10.2217/fnl.14.18\">https://doi.org/10.2217/fnl.14.18</a>","mla":"Postiglione, Maria P., and Simon Hippenmeyer. “Monitoring Neurogenesis in the Cerebral Cortex: An Update.” <i>Future Neurology</i>, vol. 9, no. 3, Future Science Group, 2014, pp. 323–40, doi:<a href=\"https://doi.org/10.2217/fnl.14.18\">10.2217/fnl.14.18</a>."},"date_created":"2018-12-11T11:56:09Z","quality_controlled":"1","date_updated":"2025-04-15T07:31:57Z","file_date_updated":"2020-07-14T12:45:31Z","oa":1,"volume":9,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1038/nprot.2014.099","title":"Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue","publist_id":"4807","oa_version":"None","issue":"6","project":[{"grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"external_id":{"isi":["000337145800020"]},"status":"public","abstract":[{"text":"Electron microscopy (EM) allows for the simultaneous visualization of all tissue components at high resolution. However, the extent to which conventional aldehyde fixation and ethanol dehydration of the tissue alter the fine structure of cells and organelles, thereby preventing detection of subtle structural changes induced by an experiment, has remained an issue. Attempts have been made to rapidly freeze tissue to preserve native ultrastructure. Shock-freezing of living tissue under high pressure (high-pressure freezing, HPF) followed by cryosubstitution of the tissue water avoids aldehyde fixation and dehydration in ethanol; the tissue water is immobilized in â ̂1/450 ms, and a close-to-native fine structure of cells, organelles and molecules is preserved. Here we describe a protocol for HPF that is useful to monitor ultrastructural changes associated with functional changes at synapses in the brain but can be applied to many other tissues as well. The procedure requires a high-pressure freezer and takes a minimum of 7 d but can be paused at several points.","lang":"eng"}],"publication_status":"published","year":"2014","scopus_import":"1","day":"29","article_processing_charge":"No","publisher":"Nature Publishing Group","author":[{"full_name":"Studer, Daniel","first_name":"Daniel","last_name":"Studer"},{"full_name":"Zhao, Shanting","first_name":"Shanting","last_name":"Zhao"},{"last_name":"Chai","full_name":"Chai, Xuejun","first_name":"Xuejun"},{"last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"last_name":"Graber","first_name":"Werner","full_name":"Graber, Werner"},{"first_name":"Sigrun","full_name":"Nestel, Sigrun","last_name":"Nestel"},{"first_name":"Michael","full_name":"Frotscher, Michael","last_name":"Frotscher"}],"date_published":"2014-05-29T00:00:00Z","isi":1,"_id":"2176","department":[{"_id":"PeJo"}],"page":"1480 - 1495","language":[{"iso":"eng"}],"intvolume":"         9","month":"05","citation":{"apa":"Studer, D., Zhao, S., Chai, X., Jonas, P. M., Graber, W., Nestel, S., &#38; Frotscher, M. (2014). Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. <i>Nature Protocols</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nprot.2014.099\">https://doi.org/10.1038/nprot.2014.099</a>","chicago":"Studer, Daniel, Shanting Zhao, Xuejun Chai, Peter M Jonas, Werner Graber, Sigrun Nestel, and Michael Frotscher. “Capture of Activity-Induced Ultrastructural Changes at Synapses by High-Pressure Freezing of Brain Tissue.” <i>Nature Protocols</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nprot.2014.099\">https://doi.org/10.1038/nprot.2014.099</a>.","mla":"Studer, Daniel, et al. “Capture of Activity-Induced Ultrastructural Changes at Synapses by High-Pressure Freezing of Brain Tissue.” <i>Nature Protocols</i>, vol. 9, no. 6, Nature Publishing Group, 2014, pp. 1480–95, doi:<a href=\"https://doi.org/10.1038/nprot.2014.099\">10.1038/nprot.2014.099</a>.","short":"D. Studer, S. Zhao, X. Chai, P.M. Jonas, W. Graber, S. Nestel, M. Frotscher, Nature Protocols 9 (2014) 1480–1495.","ama":"Studer D, Zhao S, Chai X, et al. Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. <i>Nature Protocols</i>. 2014;9(6):1480-1495. doi:<a href=\"https://doi.org/10.1038/nprot.2014.099\">10.1038/nprot.2014.099</a>","ista":"Studer D, Zhao S, Chai X, Jonas PM, Graber W, Nestel S, Frotscher M. 2014. Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. Nature Protocols. 9(6), 1480–1495.","ieee":"D. Studer <i>et al.</i>, “Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue,” <i>Nature Protocols</i>, vol. 9, no. 6. Nature Publishing Group, pp. 1480–1495, 2014."},"type":"journal_article","publication":"Nature Protocols","date_created":"2018-12-11T11:56:09Z","quality_controlled":"1","date_updated":"2025-09-29T11:36:43Z","volume":9,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"corr_author":"1","status":"public","citation":{"apa":"Edelsbrunner, H., &#38; Parsa, S. (2014). On the computational complexity of betti numbers reductions from matrix rank. In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 152–160). Portland, USA: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973402.11\">https://doi.org/10.1137/1.9781611973402.11</a>","chicago":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 152–60. SIAM, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.11\">https://doi.org/10.1137/1.9781611973402.11</a>.","mla":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 2014, pp. 152–60, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.11\">10.1137/1.9781611973402.11</a>.","ama":"Edelsbrunner H, Parsa S. On the computational complexity of betti numbers reductions from matrix rank. In: <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 2014:152-160. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.11\">10.1137/1.9781611973402.11</a>","short":"H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.","ista":"Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.","ieee":"H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers reductions from matrix rank,” in <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, USA, 2014, pp. 152–160."},"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","type":"conference","year":"2014","scopus_import":1,"quality_controlled":"1","date_updated":"2024-10-09T20:55:33Z","publication_status":"published","abstract":[{"lang":"eng","text":"We give evidence for the difficulty of computing Betti numbers of simplicial complexes over a finite field. We do this by reducing the rank computation for sparse matrices with to non-zero entries to computing Betti numbers of simplicial complexes consisting of at most a constant times to simplices. Together with the known reduction in the other direction, this implies that the two problems have the same computational complexity."}],"date_created":"2018-12-11T11:56:09Z","day":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_published":"2014-01-01T00:00:00Z","publisher":"SIAM","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Parsa","id":"4BDBD4F2-F248-11E8-B48F-1D18A9856A87","first_name":"Salman","full_name":"Parsa, Salman"}],"doi":"10.1137/1.9781611973402.11","title":"On the computational complexity of betti numbers reductions from matrix rank","page":"152 - 160","oa_version":"None","conference":{"start_date":"2014-01-05","end_date":"2014-01-07","name":"SODA: Symposium on Discrete Algorithms","location":"Portland, USA"},"publist_id":"4805","department":[{"_id":"HeEd"}],"_id":"2177","language":[{"iso":"eng"}],"month":"01"},{"publication_status":"published","abstract":[{"lang":"eng","text":"We consider the three-state toric homogeneous Markov chain model (THMC) without loops and initial parameters. At time T, the size of the design matrix is 6 × 3 · 2T-1 and the convex hull of its columns is the model polytope. We study the behavior of this polytope for T ≥ 3 and we show that it is defined by 24 facets for all T ≥ 5. Moreover, we give a complete description of these facets. From this, we deduce that the toric ideal associated with the design matrix is generated by binomials of degree at most 6. Our proof is based on a result due to Sturmfels, who gave a bound on the degree of the generators of a toric ideal, provided the normality of the corresponding toric variety. In our setting, we established the normality of the toric variety associated to the THMC model by studying the geometric properties of the model polytope."}],"year":"2014","scopus_import":"1","status":"public","arxiv":1,"publisher":"Springer","author":[{"full_name":"Haws, David","first_name":"David","last_name":"Haws"},{"last_name":"Martin Del Campo Sanchez","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","first_name":"Abraham","full_name":"Martin Del Campo Sanchez, Abraham"},{"last_name":"Takemura","first_name":"Akimichi","full_name":"Takemura, Akimichi"},{"full_name":"Yoshida, Ruriko","first_name":"Ruriko","last_name":"Yoshida"}],"date_published":"2014-03-01T00:00:00Z","day":"01","article_processing_charge":"No","publist_id":"4804","oa_version":"Submitted Version","acknowledgement":"Research of Martín del Campo supported in part by NSF Grant DMS-915211.","title":"Markov degree of the three-state toric homogeneous Markov chain model","doi":"10.1007/s13366-013-0178-y","external_id":{"arxiv":["1204.3070"]},"issue":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.3070"}],"date_created":"2018-12-11T11:56:10Z","quality_controlled":"1","date_updated":"2025-06-11T07:59:53Z","type":"journal_article","citation":{"chicago":"Haws, David, Abraham Martin del Campo Sanchez, Akimichi Takemura, and Ruriko Yoshida. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” <i>Beitrage Zur Algebra Und Geometrie</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s13366-013-0178-y\">https://doi.org/10.1007/s13366-013-0178-y</a>.","apa":"Haws, D., Martin del Campo Sanchez, A., Takemura, A., &#38; Yoshida, R. (2014). Markov degree of the three-state toric homogeneous Markov chain model. <i>Beitrage Zur Algebra Und Geometrie</i>. Springer. <a href=\"https://doi.org/10.1007/s13366-013-0178-y\">https://doi.org/10.1007/s13366-013-0178-y</a>","mla":"Haws, David, et al. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” <i>Beitrage Zur Algebra Und Geometrie</i>, vol. 55, no. 1, Springer, 2014, pp. 161–88, doi:<a href=\"https://doi.org/10.1007/s13366-013-0178-y\">10.1007/s13366-013-0178-y</a>.","ista":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. 2014. Markov degree of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra und Geometrie. 55(1), 161–188.","ama":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. Markov degree of the three-state toric homogeneous Markov chain model. <i>Beitrage zur Algebra und Geometrie</i>. 2014;55(1):161-188. doi:<a href=\"https://doi.org/10.1007/s13366-013-0178-y\">10.1007/s13366-013-0178-y</a>","short":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, R. Yoshida, Beitrage Zur Algebra Und Geometrie 55 (2014) 161–188.","ieee":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, and R. Yoshida, “Markov degree of the three-state toric homogeneous Markov chain model,” <i>Beitrage zur Algebra und Geometrie</i>, vol. 55, no. 1. Springer, pp. 161–188, 2014."},"publication":"Beitrage zur Algebra und Geometrie","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":55,"oa":1,"department":[{"_id":"CaUh"}],"_id":"2178","page":"161 - 188","intvolume":"        55","month":"03","language":[{"iso":"eng"}]},{"date_published":"2014-06-09T00:00:00Z","pubrep_id":"426","author":[{"id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","first_name":"Oskari H","full_name":"Ajanki, Oskari H","last_name":"Ajanki"},{"last_name":"Erdös","full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"first_name":"Torben H","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger"}],"publisher":"Institute of Mathematical Statistics","day":"09","article_processing_charge":"No","file":[{"file_name":"IST-2016-426-v1+1_3121-17518-1-PB.pdf","creator":"system","relation":"main_file","file_size":327322,"file_id":"4729","checksum":"bd8a041c76d62fe820bf73ff13ce7d1b","access_level":"open_access","date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf","date_created":"2018-12-12T10:09:06Z"}],"year":"2014","scopus_import":"1","abstract":[{"text":"We extend the proof of the local semicircle law for generalized Wigner matrices given in MR3068390 to the case when the matrix of variances has an eigenvalue -1. In particular, this result provides a short proof of the optimal local Marchenko-Pastur law at the hard edge (i.e. around zero) for sample covariance matrices X*X, where the variances of the entries of X may vary.","lang":"eng"}],"publication_status":"published","corr_author":"1","status":"public","external_id":{"isi":["000341869300001"]},"oa_version":"Published Version","publist_id":"4803","doi":"10.1214/ECP.v19-3121","title":"Local semicircle law with imprimitive variance matrix","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":19,"oa":1,"file_date_updated":"2020-07-14T12:45:31Z","quality_controlled":"1","date_updated":"2025-09-29T11:35:54Z","date_created":"2018-12-11T11:56:10Z","publication":"Electronic Communications in Probability","citation":{"ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local semicircle law with imprimitive variance matrix,” <i>Electronic Communications in Probability</i>, vol. 19. Institute of Mathematical Statistics, 2014.","ista":"Ajanki OH, Erdös L, Krüger TH. 2014. Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. 19.","ama":"Ajanki OH, Erdös L, Krüger TH. Local semicircle law with imprimitive variance matrix. <i>Electronic Communications in Probability</i>. 2014;19. doi:<a href=\"https://doi.org/10.1214/ECP.v19-3121\">10.1214/ECP.v19-3121</a>","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Electronic Communications in Probability 19 (2014).","mla":"Ajanki, Oskari H., et al. “Local Semicircle Law with Imprimitive Variance Matrix.” <i>Electronic Communications in Probability</i>, vol. 19, Institute of Mathematical Statistics, 2014, doi:<a href=\"https://doi.org/10.1214/ECP.v19-3121\">10.1214/ECP.v19-3121</a>.","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Semicircle Law with Imprimitive Variance Matrix.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2014. <a href=\"https://doi.org/10.1214/ECP.v19-3121\">https://doi.org/10.1214/ECP.v19-3121</a>.","apa":"Ajanki, O. H., Erdös, L., &#38; Krüger, T. H. (2014). Local semicircle law with imprimitive variance matrix. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/ECP.v19-3121\">https://doi.org/10.1214/ECP.v19-3121</a>"},"type":"journal_article","month":"06","ddc":["570"],"intvolume":"        19","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"has_accepted_license":"1","_id":"2179","isi":1,"department":[{"_id":"LaEr"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":97,"oa":1,"date_created":"2018-12-11T11:56:10Z","quality_controlled":"1","date_updated":"2025-09-29T11:35:24Z","publication":"Machine Learning","type":"journal_article","citation":{"short":"A. Bellet, A. Habrard, E. Morvant, M. Sebban, Machine Learning 97 (2014) 129–154.","ama":"Bellet A, Habrard A, Morvant E, Sebban M. Learning a priori constrained weighted majority votes. <i>Machine Learning</i>. 2014;97(1-2):129-154. doi:<a href=\"https://doi.org/10.1007/s10994-014-5462-z\">10.1007/s10994-014-5462-z</a>","ista":"Bellet A, Habrard A, Morvant E, Sebban M. 2014. Learning a priori constrained weighted majority votes. Machine Learning. 97(1–2), 129–154.","ieee":"A. Bellet, A. Habrard, E. Morvant, and M. Sebban, “Learning a priori constrained weighted majority votes,” <i>Machine Learning</i>, vol. 97, no. 1–2. Springer, pp. 129–154, 2014.","apa":"Bellet, A., Habrard, A., Morvant, E., &#38; Sebban, M. (2014). Learning a priori constrained weighted majority votes. <i>Machine Learning</i>. Springer. <a href=\"https://doi.org/10.1007/s10994-014-5462-z\">https://doi.org/10.1007/s10994-014-5462-z</a>","chicago":"Bellet, Aurélien, Amaury Habrard, Emilie Morvant, and Marc Sebban. “Learning a Priori Constrained Weighted Majority Votes.” <i>Machine Learning</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10994-014-5462-z\">https://doi.org/10.1007/s10994-014-5462-z</a>.","mla":"Bellet, Aurélien, et al. “Learning a Priori Constrained Weighted Majority Votes.” <i>Machine Learning</i>, vol. 97, no. 1–2, Springer, 2014, pp. 129–54, doi:<a href=\"https://doi.org/10.1007/s10994-014-5462-z\">10.1007/s10994-014-5462-z</a>."},"intvolume":"        97","month":"10","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"_id":"2180","isi":1,"page":"129 - 154","author":[{"full_name":"Bellet, Aurélien","first_name":"Aurélien","last_name":"Bellet"},{"full_name":"Habrard, Amaury","first_name":"Amaury","last_name":"Habrard"},{"last_name":"Morvant","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","first_name":"Emilie","full_name":"Morvant, Emilie"},{"full_name":"Sebban, Marc","first_name":"Marc","last_name":"Sebban"}],"publisher":"Springer","date_published":"2014-10-01T00:00:00Z","day":"01","article_processing_charge":"No","publication_status":"published","abstract":[{"text":"Weighted majority votes allow one to combine the output of several classifiers or voters. MinCq is a recent algorithm for optimizing the weight of each voter based on the minimization of a theoretical bound over the risk of the vote with elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated good performance when combining weak classifiers, MinCq cannot make use of the useful a priori knowledge that one may have when using a mixture of weak and strong voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate such knowledge in the form of a  constraint over the distribution of the weights, along with general proofs of convergence that stand in the sample compression setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers with a specific modeling of the voters' performance. P-MinCq significantly outperforms the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We show that it is also competitive with LMNN, a popular metric learning algorithm, and that combining both approaches further reduces the error.","lang":"eng"}],"year":"2014","scopus_import":"1","corr_author":"1","status":"public","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000341431300007"]},"ec_funded":1,"issue":"1-2","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01009578/document"}],"publist_id":"4802","oa_version":"Submitted Version","acknowledgement":"This work was funded by the French project SoLSTiCe ANR-13-BS02-01 of the ANR. ","title":"Learning a priori constrained weighted majority votes","doi":"10.1007/s10994-014-5462-z"},{"date_updated":"2025-09-29T11:34:45Z","quality_controlled":"1","date_created":"2018-12-11T11:56:11Z","citation":{"apa":"Botella Soler, V., &#38; Glendinning, P. (2014). Hierarchy and polysynchrony in an adaptive network . <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">https://doi.org/10.1103/PhysRevE.89.062809</a>","chicago":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2014. <a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">https://doi.org/10.1103/PhysRevE.89.062809</a>.","mla":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 89, no. 6, 062809, American Institute of Physics, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">10.1103/PhysRevE.89.062809</a>.","ama":"Botella Soler V, Glendinning P. Hierarchy and polysynchrony in an adaptive network . <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2014;89(6). doi:<a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">10.1103/PhysRevE.89.062809</a>","short":"V. Botella Soler, P. Glendinning, Physical Review E Statistical Nonlinear and Soft Matter Physics 89 (2014).","ista":"Botella Soler V, Glendinning P. 2014. Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 89(6), 062809.","ieee":"V. Botella Soler and P. Glendinning, “Hierarchy and polysynchrony in an adaptive network ,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 89, no. 6. American Institute of Physics, 2014."},"type":"journal_article","publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":89,"oa":1,"_id":"2183","department":[{"_id":"GaTk"}],"isi":1,"month":"06","intvolume":"        89","article_number":"062809","language":[{"iso":"eng"}],"year":"2014","scopus_import":"1","publication_status":"published","abstract":[{"lang":"eng","text":"We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes."}],"corr_author":"1","status":"public","date_published":"2014-06-16T00:00:00Z","arxiv":1,"author":[{"last_name":"Botella Soler","orcid":"0000-0002-8790-1914","id":"421234E8-F248-11E8-B48F-1D18A9856A87","first_name":"Vicente","full_name":"Botella Soler, Vicente"},{"first_name":"Paul","full_name":"Glendinning, Paul","last_name":"Glendinning"}],"publisher":"American Institute of Physics","day":"16","article_processing_charge":"No","oa_version":"Preprint","acknowledgement":"V.B.S. is partially supported by contract MEC (Grant No. AYA2010-22111-C03-02).\r\n","publist_id":"4798","title":"Hierarchy and polysynchrony in an adaptive network ","doi":"10.1103/PhysRevE.89.062809","external_id":{"isi":["000337733900007"],"arxiv":["1403.3209"]},"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"issue":"6","main_file_link":[{"url":"http://arxiv.org/abs/1403.3209","open_access":"1"}],"ec_funded":1},{"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"_id":"2184","isi":1,"language":[{"iso":"eng"}],"article_number":"17 ","intvolume":"        61","month":"05","citation":{"apa":"Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., &#38; Wagner, U. (2014). Computing all maps into a sphere. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597629\">https://doi.org/10.1145/2597629</a>","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner. “Computing All Maps into a Sphere.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597629\">https://doi.org/10.1145/2597629</a>.","mla":"Čadek, Martin, et al. “Computing All Maps into a Sphere.” <i>Journal of the ACM</i>, vol. 61, no. 3, 17, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597629\">10.1145/2597629</a>.","short":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal of the ACM 61 (2014).","ama":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing all maps into a sphere. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597629\">10.1145/2597629</a>","ista":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.","ieee":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014."},"type":"journal_article","publication":"Journal of the ACM","date_created":"2018-12-11T11:56:12Z","date_updated":"2025-09-29T11:34:15Z","quality_controlled":"1","oa":1,"volume":61,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Computing all maps into a sphere","doi":"10.1145/2597629","publist_id":"4797","acknowledgement":"The research by M. K. was supported by project GAUK 49209. The research by M. K. was also supported by project 1M0545 by the Ministry of Education of the Czech Republic and by Center of Excellence { Inst. for Theor. Comput. Sci., Prague (project P202/12/G061 of GACR). The research by U. W. was supported by the Swiss National Science Foundation (SNF Projects 200021-125309, 200020-138230, and PP00P2-138948).","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1105.6257"}],"issue":"3","external_id":{"arxiv":["1105.6257"],"isi":["000337201400003"]},"status":"public","publication_status":"published","abstract":[{"text":"Given topological spaces X,Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X→ Y. We consider a computational version, where X,Y are given as finite simplicial complexes, and the goal is to compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected; in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [X,Y] is known to be uncomputable for general X,Y, since for X = S1 it includes a well known undecidable problem: testing triviality of the fundamental group of Y. In follow-up papers, the algorithm is shown to run in polynomial time for d fixed, and extended to other problems, such as the extension problem, where we are given a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or computing the Z2-index-everything in the stable range. Outside the stable range, the extension problem is undecidable.","lang":"eng"}],"scopus_import":"1","year":"2014","article_processing_charge":"No","day":"01","publisher":"ACM","author":[{"last_name":"Čadek","first_name":"Martin","full_name":"Čadek, Martin"},{"full_name":"Krcál, Marek","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál"},{"first_name":"Jiří","full_name":"Matoušek, Jiří","last_name":"Matoušek"},{"first_name":"Francis","full_name":"Sergeraert, Francis","last_name":"Sergeraert"},{"last_name":"Vokřínek","full_name":"Vokřínek, Lukáš","first_name":"Lukáš"},{"full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","last_name":"Wagner"}],"arxiv":1,"date_published":"2014-05-01T00:00:00Z"}]