Pages

דצמבר 01, 2014

  • Date:23שנידצמבר 2024

    Foundations of Computer Science Seminar

    More information
    שעה
    11:15 - 12:15
    כותרת
    On Cryptography and the Perebor Conjectures
    מיקום
    בניין יעקב זיסקינד
    Room 1 - 1 חדר
    מרצהNoam Mazor
    Tel Aviv University
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about The Perebor (Russian for "brute-force search") con...»
    The Perebor (Russian for "brute-force search") conjectures are among the oldest conjectures in complexity theory. These conjectures, a stronger form of the P!=NP conjecture (which they predate), assert that for "meta-complexity" problems—such as the Time-Bounded Kolmogorov Complexity Problem and the Minimum Circuit Size Problem (MCSP)—no algorithms significantly outperform brute-force search.  

    In this talk, we will refute the non-uniform version of the Perebor conjecture for the Time-Bounded Kolmogorov Complexity Problem. Specifically, for every polynomial t(.), we will see a circuit of size 2^{4n/5+o(n)} that solves the t(.)-bounded Kolmogorov complexity problem on all instances.  Along the way, and of independent interest, we will extend the Fiat-Naor result, by showing that any efficiently computable function can be inverted by a circuit of size 2^{4n/5+o(n)}.

    Furthermore, we will show that, under cryptographic assumptions, Gap versions of meta-complexity problems are not NP-complete under Levin (witness-preserving) reductions. Finally, we will demonstrate how this barrier, combined with known NP-completeness results for meta-complexity problems, leads to a lower bound on the overhead of indistinguishability obfuscation (iO).  

    This talk is based on joint works with Zhenjian Lu, Igor C. Oliveira, and Rafael Pass.
    הרצאה
  • Date:24שלישידצמבר 2024

    Winter STAR Workshop

    More information
    שעה
    10:00 - 18:00
    מיקום
    בניין יעקב זיסקינד
    1 & 155
    הרצאה
  • Date:24שלישידצמבר 2024

    Anterior-Posterior Insula Circuit Mediates Retrieval of a Conditioned Immune Response in Mice

    More information
    שעה
    12:30 - 13:30
    מיקום
    אולם הרצאות ע"ש גרהרד שמידט
    מרצהProf. Kobi Rosenblum
    מארגן
    המחלקה למדעי המוח
    צרו קשר
    תקצירShow full text abstract about The brain can form associations between sensory information ...»
    The brain can form associations between sensory information of inner and/or outer world (e.g. Pavlovian conditioning) but also between sensory information and the immune system. The phenomenon which was described in the last century is termed conditioned immune response (CIR) but very little is known about neuronal mechanisms subserving it.  The conditioned stimulus can be a given taste and the unconditioned stimulus is an agent that induces or reduces a specific immune response.  Over the last years, we and others revealed molecular and cellular mechanisms underlying taste valance representation in the anterior insular cortex (aIC). Recently, a circuit in the posterior insular cortex (pIC) encoding the internal representation of a given immune response was identified. Together, it allowed us to hypothesize and prove that the internal reciprocal connections between the anterior and posterior insula encode CIR.  One can look at CIR as a noon declarative form of Nocebo effect and thus we demonstrate for the first time a detailed circuit mechanism for Placebo/Nocebo effect in the cortex.
    הרצאה
  • Date:25רביעידצמבר 2024

    Winter STAR Workshop

    More information
    שעה
    10:00 - 18:00
    מיקום
    בניין יעקב זיסקינד
    1 & 155
    הרצאה
  • Date:25רביעידצמבר 2024

    Machine Learning and Statistics Seminar

    More information
    שעה
    11:15 - 12:15
    כותרת
    Communal AI - Open, Collaborative & Accessible LLMs
    מיקום
    בניין יעקב זיסקינד
    Room 1 - 1 חדר
    מרצהLeshem Choshen
    MIT
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about Developing better Language Models would benefit a myriad of ...»
    Developing better Language Models would benefit a myriad of communities. However, it is prohibitively costly. The talk would describe collaborative approaches to pretraining, such as model merging, which allows the combining of several specialized models into one. Then, it would introduce efficient evaluation to reduce overheads and touch on other accessible and collaborative aspects that best harness the expertise and diversity in Academia.
    הרצאה
  • Date:26חמישידצמבר 2024

    An intimate meeting with the families of the hostages Tal Shoham and Yagev Buchshtab

    More information
    שעה
    09:45 - 11:15
    מיקום
    בניין לביוכימיה על שם נלה וליאון בנוזיו
    Auditorium
    מארגן
    המחלקה לביולוגיה מולקולרית של התא
    צרו קשר
    אירועי תרבות
  • Date:26חמישידצמבר 2024

    Winter STAR Workshop

    More information
    שעה
    10:00 - 18:00
    מיקום
    בניין יעקב זיסקינד
    1 & 155
    הרצאה
  • Date:26חמישידצמבר 2024

    Foundations of Computer Science Seminar

    More information
    שעה
    10:15 - 11:45
    כותרת
    Algorithmic Contract Design
    מיקום
    בניין יעקב זיסקינד
    מרצהTomer Ezra
    Harvard
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about We explore the framework of contract design through a comput...»
    We explore the framework of contract design through a computational perspective. Contract design is a fundamental pillar of microeconomics, addressing the essential question of how to incentivize people to work. The significance of contract design was acknowledged by the Nobel Prize awarded to Hart and Holmström, and it applies to various real-life scenarios, such as determining bonuses for employees, setting commission structures for sales representatives, and designing payment schemes for influencers promoting products.

    While contract design has been extensively studied from an economic perspective, this talk will examine it from a computational viewpoint. Specifically, we introduce combinatorial extensions of classic contract design models, where a principal delegates tasks to one or multiple agents. The agents have sets of potential actions they can take to complete the task, and the chosen actions by the agents stochastically determine the success of the task. We analyze the structure and computational aspects of these models, and present algorithms that provide (approximately) optimal guarantees.
    הרצאה
  • Date:26חמישידצמבר 2024

    Vision and AI

    More information
    שעה
    12:15 - 13:15
    כותרת
    Discovering and Erasing Undesired Concepts
    מיקום
    בניין יעקב זיסקינד
    מרצהNiv Cohen
    NYU
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about The rapid growth of generative models allows an ever-increas...»
    The rapid growth of generative models allows an ever-increasing variety of capabilities. Yet, these models may also produce undesired content such as unsafe images, private information, or copyrighted material.

    In this talk, I will discuss practical methods to prevent undesired generations. First, I will show how the challenge of avoiding undesired generations manifested itself in a simple Capture-the-Flag LLM setting, where even our top defense strategy was breached. Next, I will demonstrate a similar vulnerability in state-of-the-art concept erasure methods for Text-to-Image models. Finally, I will describe the notion of ‘Unconditional Concept Erasure’ aiming to mitigate such vulnerabilities. I will show that Task Vectors can achieve Unconditional Concept Erasure, and discuss the challenge of applying Task Vectors in practice.

    Bio: Niv is a postdoctoral researcher at New York University hosted by Prof. Chinmay Hegde. He received a BSc in mathematics with physics as part of the Technion Excellence Program. He received his PhD in computer science from the Hebrew University of Jerusalem, advised by Prof. Yedid Hoshen. Niv was awarded the Israeli data science scholarship for outstanding postdoctoral fellows (VATAT). He is interested in anomaly detection, model personalization, and AI safety for Vision
    הרצאה
  • Date:26חמישידצמבר 2024

    Deep language models as a cognitive model for natural language processing in the human brain

    More information
    שעה
    12:30 - 13:30
    מיקום
    אולם הרצאות ע"ש גרהרד שמידט
    מרצהProf. Uri Hasson
    Special Seminar
    מארגן
    המחלקה למדעי המוח
    צרו קשר
    תקצירShow full text abstract about Naturalistic experimental paradigms in cognitive neuroscienc...»
    Naturalistic experimental paradigms in cognitive neuroscience arose from a pressure to test, in real-world contexts, the validity of models we derive from highly controlled laboratory experiments. In many cases, however, such efforts led to the realization that models (i.e., explanatory principles) developed under particular experimental manipulations fail to capture many aspects of reality (variance) in the real world. Recent advances in artificial neural networks provide an alternative computational framework for modeling cognition in natural contexts. In this talk, I will ask whether the human brain's underlying computations are similar or different from the underlying computations in deep neural networks, focusing on the underlying neural process that supports natural language processing in adults and language development in children. I will provide evidence for some shared computational principles between deep language models and the neural code for natural language processing in the human brain. This indicates that, to some extent, the brain relies on overparameterized optimization methods to comprehend and produce language. At the same time, I will present evidence that the brain differs from deep language models as speakers try to convey new ideas and thoughts. Finally, I will discuss our ongoing attempt to use deep acoustic-to-speech-to-language models to model language acquisition in children. 
    הרצאה
  • Date:26חמישידצמבר 2024

    Exploring the role of pipecolic acid in Plasmodium falciparumnnounced

    More information
    שעה
    15:00 - 16:00
    מיקום
    בניין לביוכימיה על שם נלה וליאון בנוזיו
    Cafeteria, floor 0
    מרצהSonia Oren
    מארגן
    המחלקה למדעים ביומולקולריים
    צרו קשר
    תקצירShow full text abstract about Plasmodium falciparum (Pf) parasite is the major ca...»
    Plasmodium falciparum (Pf) parasite is the major cause of malaria disease, resulting in more than 600,000 deaths annually. Patients with cerebral malaria, the most severe form of malaria, show elevated plasma L-pipecolic acid (PA) concentrations in their blood compared to those with mild malaria. However, the origin and function of PA in Pf infection remain mostly elusive. Here, using LC/MS targeted metabolomics we found that the malaria parasite, while growing inside its host human Red Blood Cell (RBC), secretes PA during a specific life stage, the trophozoite. We then demonstrated that pretreatment of the host naïve human RBCs with PA significantly enhances parasitic growth. To further investigate the effect of PA on its primary host, RBCs, we measured the biophysical alterations in the pretreated naïve RBCs using atomic force microscopy combined with machine learning.  Surprisingly, we found that PA modifies the mechanical properties of the host cell’s membrane, turning it significantly softer. Electron paramagnetic resonance data on liposomes suggest that PA’s mechanism may involve altering the lipid mobility. Overall, our findings reveal that the parasite secretes PA to prime its host RBCs for invasion by inducing mechanical changes in the stiffness of the host membrane. These results indicate that PA functions as an active secreted metabolite, facilitating Pf growth within its host cell.
    הרצאה
  • Date:29ראשוןדצמבר 2024

    Atmospheric stability sets extreme surface moist heat

    More information
    שעה
    11:00 - 12:00
    מיקום
    בניין משפחת זוסמן
    M. Magaritz seminar room
    מרצהTalia Tamarin-Brodsky
    צרו קשר
    תקצירShow full text abstract about Heatwaves have been extensively studied in the past, primari...»
    Heatwaves have been extensively studied in the past, primarily from the standpoint of heatwave formation.Previous studies have identified air subsidence, diabatic heating, and warm air advection as the primary mechanisms for heat accumulation at the surface. However, less workhas focused on what leads to eatwave termination. A recent study suggests that surface temperature can onlyincrease until convection is triggered, and thus proposed a theoretical upper bound of maximum surface airtemperature, assuming a neutrally buoyant atmosphere and a dry surface. Given that most midlatitude heatwave events involve moist surface conditions, which also support theaccumulation of Convective Available Potential Energy (CAPE), we propose an alternative theory that quantifieschanges in surface moist temperature while correctly accounting for the buildup of CAPE. We show that the lower free tropospheric inversion predicts the maximum intensity ofboth moist heat and moist convection in midlatitudes. Implications for heatwave evolution and projected future changes in extreme moist heat events are discussed.
    הרצאה
  • Date:29ראשוןדצמבר 2024

    Perceptual decision coding is inherently coupled to action in the mouse cortex

    More information
    שעה
    12:00 - 13:15
    מיקום
    בניין ע"ש מקס ולילאן קנדיוטי
    Auditorium
    מרצהMichael Sokoletsky PhD Defense
    Student Seminar-PhD Thesis Defense
    מארגן
    המחלקה למדעי המוח
    צרו קשר
    תקצירShow full text abstract about How do animals make perceptual decisions about sensory stimu...»
    How do animals make perceptual decisions about sensory stimuli to guide motor actions? One hypothesis is that dedicated "perceptual decision" cells process sensory information and drive the appropriate action. Alternatively, perceptual decisions result from competition among cells driving different actions, making decisions inherently coupled to actions. To distinguish between these hypotheses, we designed a vibrotactile detection task in which mice flexibly switched between standard and reversed contingency blocks, respectively requiring them to lick after stimulus presence or absence. Optogenetic inactivation of somatosensory and secondary motor cortices reduced stimulus sensitivity without impairing the ability to lick. However, widefield and two-photon imaging found that differences in cortical activity across perceptual decisions were almost exclusively action-coupled. In addition, we identified a subset of cells that encoded the current contingency block in a gated manner, enabling mice to flexibly make decisions without relying on action-independent decision coding.
    הרצאה
  • Date:30שנידצמבר 2024

    Hierarchical Design Principles for Multifunctional Biocomposites

    More information
    שעה
    10:00 - 11:00
    מיקום
    Schmidt Lecture Hall
    מרצהDr. Israel Kellersztein
    הרצאה
  • Date:30שנידצמבר 2024

    Foundations of Computer Science Seminar

    More information
    שעה
    11:15 - 12:15
    כותרת
    Can We Bypass the Curse of Dimensionality in Private Data Analysis?
    מיקום
    בניין יעקב זיסקינד
    Room 1 - 1 חדר
    מרצהEliad Tsfadia
    Georgetown University
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about Differentially private (DP) algorithms typically exhibit a s...»
    Differentially private (DP) algorithms typically exhibit a significant dependence on the dimensionality of their input, as their error or sample complexity tends to grow polynomially with the dimension. This cost of dimensionality is inherent in many problems, as Bun, Ullman, and Vadhan (STOC 2014) showed that any method that achieves lower error rates is vulnerable to tracing attacks (also known as membership inference attacks). Unfortunately, such costs are often too high in many real-world scenarios, such as training large neural networks, where the number of parameters (the ambient dimension) is very high.

    On the positive side, the lower bounds do not rule out the possibility of reducing error rates for "easy" inputs. But what constitutes "easy" inputs? And how likely is it to encounter such inputs in real-world scenarios?
    In this talk, I will present a few ways to quantify "input easiness" for the fundamental task of private averaging and support them with upper and lower bounds. In particular, I will show types of properties that are both sufficient and necessary for eliminating the polynomial dependency on the dimension.

    I will conclude by outlining future research directions and providing a broader perspective on my work.

    The talk is mainly based on the following three papers:

    (1) FriendlyCore https://arxiv.org/abs/2110.10132 (joint with Edith Cohen, Haim Kaplan, Yishay Mansour, and Uri Stemmer, ICML 2022),
    (2) https://arxiv.org/abs/2307.07604 (joint with Naty Peter and Jonathan Ullman, COLT 2024),
    (3) https://arxiv.org/abs/2402.06465 (NeurIPS 2024)
    הרצאה
  • Date:31שלישידצמבר 2024

    Special Guest Seminar, Dr. Neta Gazit Shimoni

    More information
    שעה
    10:00 - 11:00
    כותרת
    Molecular and Cell Biology, University of California at Berkeley
    מיקום
    Belfer Building, Botnar Auditorium
    מרצה“Neuropeptides as Modulators of Synaptic Function and Behavior in Rodents”
    הרצאה
  • Date:31שלישידצמבר 2024

    The Neural Basis of Affective States

    More information
    שעה
    12:30 - 14:00
    מיקום
    אולם הרצאות ע"ש גרהרד שמידט
    מרצהDr. Amit Vinograd
    מארגן
    המחלקה למדעי המוח
    צרו קשר
    תקצירShow full text abstract about How does the brain regulate innate behaviors and emotional s...»
    How does the brain regulate innate behaviors and emotional states? My researchis driven by a vision to decode evolutionarily conserved neural circuits that regulateaffective states like aggression and anxiety. In my work, I combine deep-brain 2-photoncalcium imaging and holographic optogenetics with theoretical neuroscience approachesto unravel latent manifolds of neural activity and their dynamics. One such dynamic, lineattractors, is hypothesized to encode continuous variables such as eye position, workingmemory, and internal states. However, direct evidence of neural implementation of a lineattractor in mammals has been hindered by the challenge of targeting perturbations tospecific neurons within ensembles. In this talk, I will present our recent breakthroughsdemonstrating causal evidence for line attractor dynamics in neurons encoding anaggressive state and highlight functional connectivity within specific neuronalensembles. This work effectively bridges circuit and manifold levels, providing strongevidence of intrinsic continuous attractor dynamics in a behaviorally relevant mammaliansystem.
    הרצאה
  • Date:31שלישידצמבר 2024

    Go with the flow: energetic robustness in bacterial photosynthesis

    More information
    שעה
    14:00 - 15:00
    מיקום
    אולם הרצאות ע"ש גרהרד שמידט
    מרצהAsst. Prof. Dvir Harris
    מארגן
    המחלקה לביולוגיה מבנית וכימית
    הרצאה
  • Date:01רביעיינואר 2025

    students seminar series- Azrieli

    More information
    שעה
    10:30 - 12:30
    מיקום
    בניין קמיליה בוטנאר
    צרו קשר
    הרצאה
  • Date:01רביעיינואר 2025

    Machine Learning and Statistics Seminar

    More information
    שעה
    11:15 - 12:15
    כותרת
    A Novel Outlier-Robust PCA Method with Applications to Computer Vision
    מיקום
    בניין יעקב זיסקינד
    Room 1 - 1 חדר
    מרצהGilad Lerman
    University of Minnesota
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about Robust subspace recovery (RSR), or outlier-robust PCA, aims ...»
    Robust subspace recovery (RSR), or outlier-robust PCA, aims to identify a low-dimensional subspace in datasets corrupted by outliers—an essential task for fundamental matrix estimation in computer vision. Despite numerous approaches, RSR faces two main challenges: heuristic methods like RANSAC often outperform mathematically rigorous approaches, and as outlier fractions grow, the problem becomes computationally intractable, with limited theoretical guarantees. We introduce the subspace-constrained Tyler's estimator (STE), which fuses Tyler's M-estimator with the fast median subspace method. Our analysis establishes that STE, when properly initialized, achieves effective subspace recovery even in challenging regimes previously lacking theoretical guarantees. We further demonstrate STE's competitive performance in fundamental matrix estimation and relate it to broader structure-from-motion (SfM) challenges. Finally, we highlight its relevance to recent advances in three-view SfM, leveraging tensor decomposition of trifocal tensors.
    הרצאה

Pages