Pages

January 12, 2015

  • Date:24MondayJune 2024

    Foundations of Computer Science Seminar

    More information
    Time
    11:15 - 12:15
    Title
    Differentially Private Space-Efficient Algorithms for Frequency Moment Estimation in the Turnstile Model
    Location
    Jacob Ziskind Building
    LecturerRachel Cummings
    Columbia University
    Organizer
    Department of Computer Science and Applied Mathematics
    Contact
    AbstractShow full text abstract about The  turnstile continual release model of differential priva...»
    The  turnstile continual release model of differential privacy captures scenarios where a privacy-preserving real-time analysis  is sought for a dataset evolving  through additions and deletions.  In typical applications of real-time data analysis, both the length of the stream T and the size of the universe |U| from which data come can be extremely large. This motivates the study of private algorithms in the turnstile setting using space sublinear in both T and |U|. In this paper, we give the first sublinear space differentially private algorithms for the fundamental problems of counting distinct elements and $ell_p$-frequency moment estimation in the turnstile streaming model. For counting distinct elements, our algorithm achieves O(T^{1/3}) space and additive error, and a (1 eta)-relative approximation for all eta in (0,1). Our result significantly improves upon the space requirements of the state-of-the-art for this problem in this model, which has a linear dependency in both T and |U|, while still achieving an additive error that is close to the known Omega(T^{1/4}) lower bound for arbitrary streams. This addresses an open question posed in prior work about designing low-memory mechanisms for this problem. For the more general problem of L_p-frequency moment estimation, our algorithm achieves an additive error and space of O(T^{1/3}), and a (1 eta)-relative approximation for all eta in (0,1). We also give a space lower bound for this problem, which shows that any algorithm that uses our techniques must use space Omega}(T^{1/3}). Joint work with Alessandro Epasto, Jieming Mao, Tamalika Mukherjee, Tingting Ou, and Peilin Zhong.
    Lecture
  • Date:24MondayJune 2024

    Midrasha on Groups Seminar

    More information
    Time
    11:15 - 13:00
    Title
    Spectral gap absorption principle for simple groups
    Location
    Jacob Ziskind Building
    LecturerYuval Grofine
    Weizmann
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about The aim of the talk is to show that simple groups over local...»
    The aim of the talk is to show that simple groups over local fields have a spectral gap absorption principle. That is, that if a representation that doesn't have almost invariant vectors is tensored with another representation, then the tensored representation still doesn't have almost invariant vectors. This property was conjectured by Uri Bader and Roman Sauer in their paper about unitary cohomology, and was proved there in some of the cases. We prove the general result. Such tensor products appear naturally when one works with restriction and induction of representations, and it is useful to know that the spectral gap is preserved.

     

    I will (try to) give a survey of the rich and beautiful theory of representations of semisimple groups, and show how to use the celebrated Langlands classification theorem, as well as some more modern results, in order to prove the theorem.
    Lecture
  • Date:24MondayJune 2024

    Midrasha on Groups Seminar

    More information
    Time
    14:15 - 16:00
    Title
    Good locally testable codes
    Location
    Jacob Ziskind Building
    LecturerAlex Lubotzky
    Weizmann
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about An error-correcting code is locally testable (LTC) if there ...»
    An error-correcting code is locally testable (LTC) if there is a random tester that reads only a small number of bits of a given word and decides whether the word is in the code, or at least close to it. A long-standing problem asks if there exists such a code that also satisfies the golden standards of coding theory: constant rate and constant distance. Unlike the classical situation in coding theory, random codes are not LTC, so this problem is a challenge of a new kind. 

     

    We construct such codes based on what we call (Ramanujan) Left/Right Cayley square complexes.  These objects seem to be of independent group-theoretic interest. The codes built on them are 2-dimensional versions of the expander codes constructed by Sipser and Spielman (1996). 

     

    The main result and lecture will be self-contained. But we hope also to explain how the seminal work of Howard Garland (1972) on the cohomology of quotients of the Bruhat–Tits buildings of p-adic Lie group has led to this construction (even though it is not used at the end). 

     

    Based on joint work with I. Dinur, S. Evra, R. Livne, and S. Mozes.
    Lecture
  • Date:25TuesdayJune 2024

    Mechano-regulation of gene expression in striated muscle

    More information
    Time
    10:00 - 11:30
    Location
    Nella and Leon Benoziyo Building for Biological Sciences
    LecturerDr. Daria Amiad-Pavlov
    Perelman School of Medicine, University of Pennsylvania
    Organizer
    Department of Biomolecular Sciences
    Contact
    AbstractShow full text abstract about In recent years the cell nucleus emerged as a dynamic mechan...»
    In recent years the cell nucleus emerged as a dynamic mechanosensor capable of sensing and transducing mechanical signals into cellular responses to facilitate homeostasis and adaptation to changing environmental conditions. The constantly beating heart has a remarkable ability to adapt its structure and contractility in response to changes in mechanical load. I am introducing unique, live, and dynamic imaging approaches to investigate how nuclei in the mature heart can provide such mechano-protection and mechano-regulation of the genome. I will present a novel assay to couple cytoskeletal to nuclear strain transfer in the beating cardiomyocyte, and its further application to decipher mechanisms of nuclear damage in dilated cardiomyopathy caused by mutations in the LMNA gene (LMNA-DCM). This work pinpoints localized microtubule-dependent forces, but surprisingly not actomyosin contractility, as drivers of nuclear damage in LMNA-DCM, highlighting new therapeutic avenues. I will further discuss the role of mechanical signaling in spatial organization of the genome within the nucleus, to regulate transcriptionally active and repressed hubs, and downstream gene expression.
    Lecture
  • Date:25TuesdayJune 2024

    Molecular Manipulation of Heterogeneous Electrocatalysis Using Metal-Organic Frameworks

    More information
    Time
    11:00 - 12:00
    Location
    Gerhard M.J. Schmidt Lecture Hall
    LecturerProf. Idan Hod
    Department of Chemistry at Ben-Gurion University of the Negev, BGU
    Organizer
    Department of Molecular Chemistry and Materials Science
    Contact
    AbstractShow full text abstract about Electrocatalytically driven reactions that produce alternati...»
    Electrocatalytically driven reactions that produce alternative fuels and chemicals are considered as a useful means to store renewable
    energy in the form of chemical bonds. in recent years there has been a significant increase in research efforts aiming to develop highly
    efficient electrocatalysts that are able to drive those reactions. Yet, despite having made significant progress in this field, there is still a
    need for developing new materials that could function both as active and selective electrocatalysts.
    In that respect, Metal–Organic Frameworks (MOFs), are an emerging class of hybrid materials with immense potential in electrochemical
    catalysis. Yet, to reach a further leap in our understanding of electrocatalytic MOF-based systems, one also needs to consider the welldefined
    structure and chemical modularity of MOFs as another important virtue for efficient electrocatalysis, as it can be used to fine-tune
    the immediate chemical environment of the active site, and thus affect its overall catalytic performance. Our group utilizes Metal-Organic
    Frameworks (MOFs) based materials as a platform for imposing molecular approaches to control and manipulate heterogenous
    electrocatalytic systems. In this talk, I will present our recent study on electrocatalytic schemes involving MOFs, acting as: a) electroactive
    unit that incorporates molecular electrocatalysts, or b) non-electroactive MOF-based membranes coated on solid heterogenous catalysts.
    Lecture
  • Date:25TuesdayJune 2024

    Reading Minds & Machines-AND-The Wisdom of a Crowd of Brains

    More information
    Time
    12:30 - 12:30
    Location
    Gerhard M.J. Schmidt Lecture Hall
    LecturerProf. Michal Irani
    Dept of Computer Science & Applied Mathematics, WIS
    Organizer
    Department of Brain Sciences
    Contact
    AbstractShow full text abstract about 1.  Can we reconstruct images that a person saw, directly fr...»
    1.  Can we reconstruct images that a person saw, directly from his/her fMRI brain recordings?
     2.  Can we reconstruct the training data that a deep-network trained on, directly from the parameters of the network?
     
    The answer to both of these intriguing questions is “Yes!” 
    In this talk I will show how these can be done. I will then show how exploring the two domains in tandem can potentially lead to significant breakthroughs in both fields. More specifically:
    (i)  I will show how combining the power of Brains & Machines can potentially be used to bridge the gap between those two domains.
    (ii) Combining the power of Multiple Brains (scanned on different fMRI scanners with NO shared stimuli) can lead to new breakthroughs and discoveries in Brain-Science. We refer to this as “the Wisdom of a Crowd of Brains”. In particular, we show that a Universal Encoder can be trained on multiple brains with no shared data,  and that information can be functionally mapped between different brains.
    Lecture
  • Date:26WednesdayJune 2024

    Spotlight on Science

    More information
    Time
    13:00 - 14:00
    Title
    TBA
    Location
    Max and Lillian Candiotty Building
    LecturerEhud Funio
    Dr.
    Organizer
    Science for All Unit
    Contact
    Lecture
  • Date:27ThursdayJune 2024

    Geometric Functional Analysis and Probability Seminar

    More information
    Time
    13:30 - 14:30
    Title
    Tightness for Branching random walk in a space-inhomogeneous random environment
    Location
    Jacob Ziskind Building
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about In this talk we will prove tightness for the maximum in a mo...»
    In this talk we will prove tightness for the maximum in a model of branching random walk in space-inhomogeneous environment. In the first part of the talk we relate this to barrier estimates for random walks. In the second part we sketch how to prove these barrier estimates.
    Lecture
  • Date:27ThursdayJune 2024

    Immunological aspects of immune checkpoint blockade

    More information
    Time
    14:00 - 15:00
    Location
    Max and Lillian Candiotty Building
    LecturerProf. Yuval Shaked
    Rappaport Faculty of Medicine, Technion
    Organizer
    Dwek Institute for Cancer Therapy Research
    Contact
    Lecture
  • Date:27ThursdayJune 2024

    Geometric Functional Analysis and Probability Seminar

    More information
    Time
    14:30 - 15:30
    Title
    Diffusion of knowledge and the state lottery society
    Location
    Jacob Ziskind Building
    LecturerLenya Ryzhik
    Stanford
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about Diffusion of knowledge models in macroeconomics describe the...»
    Diffusion of knowledge models in macroeconomics describe the evolution of an interacting system of agents who  perform individual Brownian motions (this is internal innovation) but also can jump on top of each other (this is an agent or a company acquiring knowledge from another agent or company). The learning strategy of the individual agents (jump probabilities) are obtained from an additional optimization problem that involves the current configuration of particles and is a solution to a forward-backwards in time mean-field game. We will discuss some preliminary results on the basic properties of this system.
    Lecture
  • Date:30SundayJune 2024

    Data synthesis to assess the effects of climate change on agricultural production and food security

    More information
    Time
    11:00 - 11:00
    Location
    Sussman Family Building for Environmental Sciences
    LecturerDavid Makowski
    INRAe & University Paris-Saclay
    Organizer
    Department of Earth and Planetary Sciences
    Contact
    AbstractShow full text abstract about Climate change is having an impact on agricultural productio...»
    Climate change is having an impact on agricultural production and food
    security. Rising temperatures, changes in rainfall patterns and extreme
    weather events can reduce crop yields, sometimes dramatically. However,
    climate change can also offer new opportunities, by generating more
    favorable climatic conditions for agricultural production in certain regions
    that were previously less productive. In order to assess the positive and
    negative impacts of climate change on agriculture and identify effective
    adaptation strategies, scientists have produced massive amounts of data
    during the last two decades, conducting local experiments in agricultural
    plots and using models to simulate the effect of climate on crop yields. In
    most cases, these data are not pooled together and are analyzed separately
    by different groups of scientists to assess the effects of climate change at a
    local level, without any attempt to upscale the results at a larger scale. Yet, if
    brought together, these data represent a rich source of information that are
    relevant to analyze the effect of climate across diverse environmental
    conditions. The wealth of data available has led to the emergence of a new
    type of scientific activity, involving the retrieval of all available data on a
    given subject and their synthesis into more robust and generic results. In this
    talk, I review the statistical methods available to synthesize data generated
    in studies quantifying the effect of climate change on agriculture. I discuss
    both the most classic methods - such as meta-analysis - and more recent
    methods based on machine learning. In particular, I show how this approach
    can be used to map the impact of climate change on a large scale (national,
    continental and global) from local data. I illustrate these methods in several
    case studies and present several research perspectives in this area.
    Lecture
  • Date:30SundayJune 2024

    AI Hub Projects Day - Food, drinks and AI solutions!

    More information
    Time
    12:00 - 14:00
    Location
    Dolfi and Lola Ebner Auditorium
    LecturerThe Institute for Artificial Intelligence, Ana Naamat
    Organizer
    Department of Computer Science and Applied Mathematics
    Contact
    Lecture
  • Date:30SundayJune 2024

    Special Guest Seminar

    More information
    Time
    14:00 - 18:30
    Title
    A Pre-SAAC Symposium on Mathematics
    Location
    Jacob Ziskind Building
    LecturerA Pre-SAAC
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about Alex Furman (University of Illinois) Title: Picking out a...»
    Alex Furman (University of Illinois)

    Title: Picking out arithmetic rank-one locally symmetric manifolds among negatively curved ones

    Abstract: The definition of an arithmetic locally symmetric manifold uses the language of algebraic groups and number theory. It turns out that in the world of negatively curved manifolds the arithmetic locally symmetric ones can be detected using abstract commensurators and coarse-geometry. Based on a joint work with Yanlong Hao.

    -------

    Balint Virag (University of Toronto)

    Title: Random plane geometry: a gentle introduction

    Abstract: Assign a random length of 1 or 2 to each edge of the square grid based on independent fair coin tosses. The resulting random geometry, first passage percloation, is conjectured to have a scaling limit.  Most random plane geometric models (including hidden geometries) should have the same scaling limit. I will explain the basics of the limiting geometry, the "directed landscape", the central object in the class of models named after
    Kardar, Parisi and Zhang.

     

    ------

    Emmanuel Breuillard (University of Oxford)

    Title: Undecidable problems in linear groups.

    Abstract: The Skolem problem asks to determine whether or not a linear recurrence sequence over the integers has a zero. No algorithm is known to answer this simple question. In this talk I will discuss recent joint work with G. Kocharyan, where we consider a wider class of problems, dealing with finitely generated subgroups of matrices,  and show their undecidability.

    -------

    Omer Angel (University of British Columbia)

    Title: Interacting Polya urns.

    Abstract: The classical Polya urn has counters X_t,Y_t that are incremented with probability proportional to their current value. I will discuss some of the many generalizations possible when multiple
    Polya urns are coupled.

    -------

    Shmuel Weinberger (University of Chicago)

    Title: How existential is topology?


    Abstract:  Topology proves many things exist
    Lecture
  • Date:01MondayJuly 2024

    Midrasha on Groups Seminar

    More information
    Time
    11:15 - 13:00
    Title
    Random walks on Cayley graphs for finite groups
    Location
    Jacob Ziskind Building
    LecturerDan Rockmore
    Dartmouth College
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about In this talk we introduce the problem of random walks on the...»
    In this talk we introduce the problem of random walks on the Cayley graph of a finite group, some techniques for its study, and some of the basic results, including numerical experiments. This is a mixture of basic group theory, representation theory, probability theory, and graph theory.
    Lecture
  • Date:01MondayJuly 2024

    Foundations of Computer Science Seminar

    More information
    Time
    11:15 - 12:15
    Title
    Incompressibility and Next-Block Pseudoentropy
    Location
    Jacob Ziskind Building
    LecturerNoam Mazor
    Cornell Tech
    Organizer
    Department of Computer Science and Applied Mathematics
    Contact
    AbstractShow full text abstract about A distribution is k-incompressible, Yao [FOCS ’82], if no ef...»
    A distribution is k-incompressible, Yao [FOCS ’82], if no efficient compression scheme compresses it to less than k bits. While being a natural measure, its relation to other computational analogs of entropy such as pseudoentropy (Hastad, Impagliazzo, Levin, and Luby [SICOMP 99]), and to other cryptographic hardness assumptions, was unclear.

    We advance towards a better understating of this notion, showing that a k-incompressible distribution has (k-2) bits of next-block pseudoentropy, a refinement of pseudoentropy introduced by Haitner, Reingold, and Vadhan [SICOMP ’13]. We deduce that a samplable distribution X that is (H(X) 2)-incompressible, implies the existence of one-way functions.

    Joint work with Iftach Haitner and Jad Silbak.
    Lecture
  • Date:01MondayJuly 2024

    Midrasha on Groups Seminar

    More information
    Time
    14:15 - 16:00
    Title
    Constructing groups with desired properties using small cancellation methods
    Location
    Jacob Ziskind Building
    LecturerGil Goffer
    UCSD
    Organizer
    Department of Mathematics
    Homepage
    Contact
    AbstractShow full text abstract about I’ll discuss various ways to use small cancellation methods ...»
    I’ll discuss various ways to use small cancellation methods to produce groups with desired properties. In particular, I’ll demonstrate how to construct groups whose semigroup Zariski topology is strictly coarser than their group Zariski topology (answering a question by Elliott, Jonusas, Mesyan, Mitchell, Morayne, and Peresse)
    Lecture
  • Date:04ThursdayJuly 2024

    MSc Thesis Defense (Direct PhD Track) Lior Peretz (Stelzer Lab)

    More information
    Time
    11:00 - 11:00
    Title
    Unraveling the Role of the Polycomb Repressive Complex in Gene Regulation During Early Mammalian Embryogenesis
    Location
    Ullmann Building of Life Sciences
    LecturerMs. Lior Peretz
    (Dr. Yonatan Stelzer Lab)
    Organizer
    Department of Molecular Cell Biology
    Contact
    Lecture
  • Date:04ThursdayJuly 2024

    Vision and AI

    More information
    Time
    12:15 - 13:15
    Title
    Recovering the Pre-Fine-Tuning Weights of Generative Models
    Location
    Jacob Ziskind Building
    LecturerEliahu Horwitz
    HUJI
    Organizer
    Department of Computer Science and Applied Mathematics
    Contact
    AbstractShow full text abstract about The dominant paradigm in generative modeling consists of two...»
    The dominant paradigm in generative modeling consists of two steps: i) pre-training on a large-scale but unsafe dataset, ii) aligning the pre-trained model with human values via fine-tuning. This practice is considered safe, as no current method can recover the unsafe, pre-fine-tuning model weights. In this paper, we demonstrate that this assumption is often false. Concretely, we present Spectral DeTuning, a method that can recover the weights of the pre-fine-tuning model using a few low-rank (LoRA) fine-tuned models. In contrast to previous attacks that attempt to recover pre-fine-tuning capabilities, our method aims to recover the exact pre-fine-tuning weights. Our approach exploits this new vulnerability against large-scale models such as a personalized Stable Diffusion and an aligned Mistral.

    Bio:

    Eliahu Horwitz is a PhD candidate in Computer Science at the Hebrew University of Jerusalem, working under the supervision of Prof. Yedid Hoshen. His research area is computer vision, with a focus on representation learning and generative models. Currently, his work revolves around reversing the training trajectories of neural networks.

    A recipient of the KLA Scholarship for Outstanding Graduate Students and a CIDR (Center for Interdisciplinary Data Science Research) fellow, Eliahu’s academic achievements are complemented by his practical experience. Before transitioning to research, he honed his skills as a self-taught software developer, working with diverse technologies across the tech stack at both startups and large-scale companies. His latest research can be found on his website: pages.cs.huji.ac.il/eliahu-horwitz.
    Lecture
  • Date:07SundayJuly 2024

    The Clore Center for Biological Physics

    More information
    Time
    13:15 - 14:30
    Title
    What does the system “care about”? Empirical approaches to identifying biological regulation
    Location
    Nella and Leon Benoziyo Physics Library
    LecturerProf. Naama Brenner
    Dept. of Chemical Engineering & Network Biology Research Lab, Technion
    Organizer
    Clore Center for Biological Physics
    Contact
    AbstractShow full text abstract about Biological systems regulate their action at multiple levels ...»
    Biological systems regulate their action at multiple levels of organization, from molecular circuits to physiological function. This “homeostasis” maintains stability of the system in the face of external and internal perturbation. How exactly this is achieved remains a topic of ongoing investigation; challenges are high dimensionality, many coupled positive and negative feedback loops, conflicting regulation demands and interaction with the environment.
    Here I will introduce an empirical approach to the fundamental question – how do we know what it is that the system really “cares about”? What variable, or combination of variables, is under regulation? Two data-driven methods will be presented. one based on statistical analysis and applied to bacterial growth and division, revealing a hierarchy of regulation – from tightly regulated to sloppy variables. The second is based on a machine-learning algorithm we developed to identify regulation with minimal assumptions. This provides a different angle on the problem and highlights directions for future research.

    FOR THE LATEST UPDATES AND CONTENT ON SOFT MATTER AND BIOLOGICAL PHYSICS AT THE WEIZMANN, VISIT OUR WEBSITE: https://www.biosoftweizmann.com/
    Lecture
  • Date:08MondayJuly 2024

    Midrasha on Groups Seminar

    More information
    Time
    11:15 - 13:00
    Title
    Property testing for group equations and relations to group approximations
    Location
    Jacob Ziskind Building
    LecturerAlon Dogon
    Weizmann
    Organizer
    Department of Mathematics
    Contact
    AbstractShow full text abstract about In this talk we will give an introduction to property testin...»
    In this talk we will give an introduction to property testing questions in group theory. Property testing problems were mentioned in Alex’s talk, and come up naturally in various branches of theoretical computer science, as well as mathematics and physics. For example, the question of cocycle expansion, “are almost cocycles close to actual cocycles”, is a typical property testing problem. Another example is the following: Given two permutations that commute with high probability on randomly sampled entries, are they close to actual commuting permutations? For groups, here are key notions: Given a group G, it is said to be permutation stable if approximate actions of G on finite sets by permutations are close to actual finite actions of G. G is said to be Hilbert Schmidt stable if the same can be said about approximate finite dimensional representations of G. We will introduce these properties, give a lot of examples and mention connections with the study of characters and invariant random subgroups, as well as the questions of soficity and Connes embeddability of groups.
    Lecture

Pages