Colloquia and Seminars

To join the email distribution list of the cs colloquia, please visit the list subscription page.


Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.

Academic Calendar at Technion site.

Upcoming Colloquia & Seminars

  • MPC Beyond the Generic Model - Private Intersection Analytics

    Speaker:
    Benny Pinkas - COLLOQUIUM LECTURE
    Date:
    Tuesday, 10.12.2019, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Dept. of Computer Science, and Center for Research in Applied Cryptography and Cyber Security, Bar-Ilan University
    Host:
    Yuval Filmus

    Effective data analysis often depends on data that is known to different sources, including private data whose owners cannot disclose. The task at hand is to perform effective analysis of the data while preserving its privacy. This talk will describe efficient cryptographic protocols, some of them based on variants of private set intersection (PSI), that can be applied to perform private analysis of data. Short Bio: ============ Benny Pinkas is a member of the Bar Ilan Cryptography Group and the Center for Research in Applied Cryptography and Cyber Security. His reserach focuses on computer security, privacy and cryptography, and in particular on the design of efficient security systems based on sound assumptions and solid proofs. During the 2011/2 academic year he was also on sabbatical at Google Research. He previously worked at the University of Haifa, at HP Labs in Haifa and in Princeton, and at STAR Lab, Intertrust Technologies. Before that he was a Ph.D. student of Moni Naor at the Foundations of Computer Science Group at the Department of Computer Science and Applied Math in the Weizmann Institute of Science. ========================================= Rereshments will be served from 14:15 Lecture starts at 14:30

  • Theory Seminar: Lovasz Meets Weisfeiler and Leman

    Speaker:
    Martin Grohe (RWTH Aachen University)
    Date:
    Wednesday, 11.12.2019, 12:30
    Place:
    Taub 201 Taub Bld.

    I will speak about an unexpected correspondence between a beautiful theory, due to Lovasz, about homomorphisms and graph limits and a popular heuristic for the graph isomorphism problem known as the Weisfeiler-Leman algorithm. I will also relate this to graph kernels in machine learning. Indeed, the context of this work is to design and understand similarity measures between graphs and discrete structures.

    (Joint work with Jan Böker, Holger Dell, and Gaurav Rattan.)

  • Quantifying the Impact of Latency on High Frequency Trading

    Speaker:
    Yehonatan Rubin, M.Sc. Thesis Seminar
    Date:
    Sunday, 15.12.2019, 15:00
    Place:
    Room 601 Taub Bld.
    Advisor:
    Prof. D. Raz

    Establishing a low network latency connection to stock exchanges has been the desire of trader for years. A well-known example is the extremely expensive construction of an ultra-low latency fiber optic cable between New York and Chicago just for reducing three millisecond in the round trip time. Yet, the exact possible usage and potential profitability of such high end network connection remains mostly unclear. In this Thesis, we address this point by studying the impact of latency on the profitability of traders. We concentrate on the single security, single exchange case and use the Geometric Brownian Motion (GBM) model as the underling model for stock prices. Using this model, we are able to quantify the potential profit of traders as a function of their latency. Moreover, using the intra-day security prices of the AAPL and the GOOG shares we verified that indeed this model can be used for real life data.

  • Data Science & Deep Learning Seminar: Meta-Learning by Adjusting Priors Based on Extended PAC-BayesTheory

    Speaker:
    Ron Amit (Technion)
    Date:
    Monday, 16.12.2019, 12:30
    Place:
    Taub 301 Taub Bld.

    Efficient learning requires prior knowledge (inductivebias). The algorithm designer can manually insert a prior based on hisintuition, but ideally, we would like to automatically infer the mostbeneficial prior. In meta-learning an agent extracts a ‘learned prior’ fromseveral observed learning tasks, which in turn, can be used to facilitate thelearning of new related tasks. The prior should capture the common structureacross learned tasks while allowing sufficient flexibility to adapt tonovel aspects of new tasks.

    We present a framework for meta-learning that is based on generalization errorbounds, allowing us to extend various PAC-Bayes bounds to meta-learning. Wedevelop a gradient-based algorithm that minimizes an objective function derivedfrom the bounds and demonstrates its effectiveness numerically with neuralnetworks.

  • Cryptographic Computations need Compilers

    Speaker:
    Madan Musuvathi - COLLOQUIUM LECTURE
    Date:
    Tuesday, 17.12.2019, 14:30
    Place:
    Room 337 Taub Bld.
    Affiliation:
    Microsoft Research RiSE group
    Host:
    Erez Petrank

    There is a recent surge of interest in performing computations on encrypted data. Techniques such as secure multi-party computations and fully-homomorphic encryption enable rich privacy-preserving applications. On the other hand, building such applications is hard due to the cryptographic expertise required to build them correctly, securely, and efficiently. Excitingly, a compiler that raises the level of programming abstraction while performing a slew of domain-specific optimizations can make a huge difference in building these applications. I will provide an overview of recent work in this area while focusing on our own work on a compiler for fully-homomorphic computations. Here the fundamental problem reduces to mapping application level parallelism onto the vectorization capabilities inherent in the encryption schemes. Short Bio: ========== Madan Musuvathi manages the Research in Software Engineering (RiSE) group at Microsoft Research. His interests primarily lie in the intersection of programming languages, formal methods, and systems. His research has produced several software reliability tools that are widely used within Microsoft and other companies. He received his Ph.D. from Stanford University. ====================================== Rereshments will be served from 14:15 Lecture starts at 14:30