Pages
January 01, 2015
-
Date:26ThursdayDecember 2024Cultural Events
An intimate meeting with the families of the hostages Tal Shoham and Yagev Buchshtab
More information Time 09:45 - 11:15Location Nella and Leon Benoziyo Building for Biological Sciences
AuditoriumOrganizer Department of Molecular Cell BiologyContact -
Date:26ThursdayDecember 2024Lecture
Winter STAR Workshop
More information Time 10:00 - 18:00Location Jacob Ziskind Building
1 & 155 -
Date:26ThursdayDecember 2024Lecture
Foundations of Computer Science Seminar
More information Time 10:15 - 11:45Title Algorithmic Contract DesignLocation Jacob Ziskind BuildingLecturer Tomer Ezra
HarvardOrganizer Department of Computer Science and Applied MathematicsContact Abstract 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:26ThursdayDecember 2024Lecture
Vision and AI
More information Time 12:15 - 13:15Title Discovering and Erasing Undesired ConceptsLocation Jacob Ziskind BuildingLecturer Niv Cohen
NYUOrganizer Department of Computer Science and Applied MathematicsContact Abstract 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:26ThursdayDecember 2024Lecture
Deep language models as a cognitive model for natural language processing in the human brain
More information Time 12:30 - 13:30Location Gerhard M.J. Schmidt Lecture HallLecturer Prof. Uri Hasson
Special SeminarOrganizer Department of Brain SciencesContact Abstract 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:26ThursdayDecember 2024Lecture
Exploring the role of pipecolic acid in Plasmodium falciparumnnounced
More information Time 15:00 - 16:00Location Nella and Leon Benoziyo Building for Biological Sciences
Cafeteria, floor 0Lecturer Sonia Oren Organizer Department of Biomolecular SciencesContact Abstract 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:29SundayDecember 2024Lecture
Atmospheric stability sets extreme surface moist heat
More information Time 11:00 - 12:00Location Sussman Family Building for Environmental Sciences
M. Magaritz seminar roomLecturer Talia Tamarin-Brodsky Contact Abstract 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:29SundayDecember 2024Lecture
Perceptual decision coding is inherently coupled to action in the mouse cortex
More information Time 12:00 - 13:15Location Max and Lillian Candiotty Building
AuditoriumLecturer Michael Sokoletsky PhD Defense
Student Seminar-PhD Thesis DefenseOrganizer Department of Brain SciencesContact Abstract 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:30MondayDecember 2024Lecture
Hierarchical Design Principles for Multifunctional Biocomposites
More information Time 10:00 - 11:00Location Schmidt Lecture HallLecturer Dr. Israel Kellersztein -
Date:30MondayDecember 2024Lecture
Foundations of Computer Science Seminar
More information Time 11:15 - 12:15Title Can We Bypass the Curse of Dimensionality in Private Data Analysis?Location Jacob Ziskind Building
Room 1 - 1 חדרLecturer Eliad Tsfadia
Georgetown UniversityOrganizer Department of Computer Science and Applied MathematicsContact Abstract 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:31TuesdayDecember 2024Lecture
Special Guest Seminar, Dr. Neta Gazit Shimoni
More information Time 10:00 - 11:00Title Molecular and Cell Biology, University of California at BerkeleyLocation Belfer Building, Botnar AuditoriumLecturer “Neuropeptides as Modulators of Synaptic Function and Behavior in Rodents” -
Date:31TuesdayDecember 2024Lecture
The Neural Basis of Affective States
More information Time 12:30 - 14:00Location Gerhard M.J. Schmidt Lecture HallLecturer Dr. Amit Vinograd Organizer Department of Brain SciencesContact Abstract 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:31TuesdayDecember 2024Lecture
Go with the flow: energetic robustness in bacterial photosynthesis
More information Time 14:00 - 15:00Location Gerhard M.J. Schmidt Lecture HallLecturer Asst. Prof. Dvir Harris Organizer Department of Chemical and Structural Biology -
Date:01WednesdayJanuary 2025Lecture
students seminar series- Azrieli
More information Time 10:30 - 12:30Location Camelia Botnar BuildingContact -
Date:01WednesdayJanuary 2025Lecture
Machine Learning and Statistics Seminar
More information Time 11:15 - 12:15Title A Novel Outlier-Robust PCA Method with Applications to Computer VisionLocation Jacob Ziskind Building
Room 1 - 1 חדרLecturer Gilad Lerman
University of MinnesotaOrganizer Department of Computer Science and Applied MathematicsContact Abstract 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. -
Date:01WednesdayJanuary 2025Cultural Events
Tango club
More information Time 19:30 - 20:45Title beginners classLocation Aquarium conference roomContact -
Date:02ThursdayJanuary 2025Lecture
Moonshot: Leveraging multi-national open science collaboration for antiviral discovery
More information Time 09:00 - 10:00Location Candiotty AuditoriumLecturer Dr. Haim Barr
LSCF & G-INCPM departmental seminars -
Date:02ThursdayJanuary 2025Lecture
Vision and AI
More information Time 12:15 - 13:15Title Utilizing Pre-trained Diffusion Models for Text-based Image and Video EditingLocation Jacob Ziskind Building
Room 1 - 1 חדרLecturer Vladimir Kulikov
TechnionOrganizer Department of Computer Science and Applied MathematicsContact Abstract Show full text abstract about Text-to-image (T2I) diffusion/flow models achieve state-of-t...» Text-to-image (T2I) diffusion/flow models achieve state-of-the-art results in image synthesis. Many works leverage these models for real image editing, where a predominant approach involves inverting the image into its corresponding gaussian-like noise map. However, inversion by itself is often insufficient for structure preserving edits. In our first work in this talk, termed ‘An Edit Friendly DDPM Noise Space’ [1], we present alternative latent noise maps for denoising diffusion probabilistic models (DDPMs) that do not have a standard normal distribution. These noise maps allow for perfect reconstruction of any real image, and lead to structure preserving edits, as we exemplify in our experiments.
In our second work, we tackle the task of text-based video editing using T2I diffusion models. Here the main challenge lies in maintaining the temporal consistency of the original video during the edit. Many methods leverage explicit correspondence mechanisms, which struggle with strong nonrigid motion. In contrast, our method termed ‘Slicedit’ [2], introduces a fundamentally different approach, which is based on the observation that spatiotemporal slices of natural videos exhibit similar characteristics to natural images. Thus, the same T2I diffusion model that is normally used only as a prior on video frames, can also serve as a strong prior for enhancing temporal consistency by applying it on spatiotemporal slices. As we show Sliceditgenerates videos that retain the structure and motion of the original video without relying on explicit correspondence matching while adhering to the target text. Finally, in our most recent work, we will discuss ‘FlowEdit’ [3], a novel text-based image editing method that leverages the increasingly popular flow models without relying on inversion. Our method constructs an ODE that directly maps between the source and target distributions (corresponding to the source and target text prompts) and achieves a lower transport cost than the inversion approach. This leads to state-of-the-art results, as we illustrate with Stable Diffusion 3 and FLUX.
[1] An Edit Friendly DDPM Noise Space: Inversion and Manipulations - CVPR24’ https://arxiv.org/abs/2304.06140
[2] Slicedit: Zero-Shot Video Editing With Text-to-Image Diffusion Models Using Spatio-Temporal Slices - ICML24’ https://arxiv.org/abs/2405.12211
[3] FlowEdit: Inversion-Free Text-Based Editing Using Pre-Trained Flow Models – under review https://arxiv.org/abs/2412.08629
Bio: Vladimir Kulikov, PhD student at the Technion, under the supervision of Prof. Tomer Michaeli. Currently studying Deep Generative Models with emphasis on Computer Vision. -
Date:02ThursdayJanuary 2025Lecture
Geometric Functional Analysis and Probability Seminar
More information Time 13:30 - 14:30Title Entropy and the growth rate of universal covering treesLocation Jacob Ziskind Building
Room 155 - חדר 155Lecturer Shlomo Hoory
Tel-HaiOrganizer Department of MathematicsContact Abstract Show full text abstract about This work studies the relation between two graph parameters,...» This work studies the relation between two graph parameters, $\rho$ and $\Lambda$.
For an undirected graph $G$, $\rho(G)$ is the growth rate of its universal covering tree,
while $\Lambda(G)$ is a weighted geometric average of the vertex degree minus one, corresponding to the rate of entropy growth for the non-backtracking random walk (NBRW).
It is well known that $\rho(G) \geq \Lambda(G)$ for all graphs, and that graphs with $\rho=\Lambda$ exhibit some special properties.
In this work we derive an easy to check, necessary and sufficient condition for the equality to hold.
Furthermore, we show that the variance of the number of random bits used by a length $\ell$ NBRW is $O(1)$ if $\rho = \Lambda$ and $\Omega(\ell)$ if $\rho > \Lambda$.
As a consequence we exhibit infinitely many non-trivial examples of graphs with $\rho = \Lambda$.
Joint work with Idan Eisner, Tel-Hai College. -
Date:05SundayJanuary 2025Lecture
Vision and AI
More information Time 11:00 - 12:00Title Adapting Language Models: From Diverging Preferences to Contextual UnderstandingLocation Jacob Ziskind Building
Room 155 - חדר 155Lecturer Valentina Pyatkin
Allen Institute for AI and University of WashingtonOrganizer Department of Computer Science and Applied MathematicsContact Abstract Show full text abstract about This talk examines how language models can be made more capa...» This talk examines how language models can be made more capable through post-training. Although Large Language Models led to major breakthroughs in Natural Language Processing, there remain recurring challenges with Natural Language Understanding. At the core, these challenges are a result of the inherent ambiguity and underspecification of language and this talk will show how they can be addressed with post-training of LMs. The first segment presents the Tulu3 project, exploring language model post-training methodologies. The research proposes open post-training recipes for improving targeted capabilities, with a focus on preference training techniques using Direct Preference Optimization (DPO) and reinforcement learning approaches. The second part investigates preference data through two perspectives. RewardBench, a novel benchmark, systematically evaluates underspecified reward models trained through different methodologies, such as the direct MLE training of classifiers and the implicit reward modeling of DPO. The presentation will detail the benchmark's design, data curation, and comparative performance analysis across varied test sets. Second, the talk will discuss when and how preference annotations diverge, i.e. lead to disagreements between annotators, showing that a lot of disagreements stem from underspecification. It will further explain how the standard Bradley-Terry model does not appropriately capture diverging preferences and will instead suggest different methods to model and detect potentially diverging instances in the data. The final section introduces ClarifyDelphi, a reinforcement learning system for generating clarification questions. Using a defeasibility reward mechanism, the system aims to extract contextual nuances from underspecified social and moral scenarios, demonstrating an approach to more sophisticated contextual reasoning.The talk synthesizes these research threads to illustrate strategies for adapting language model capabilities and improving contextual understanding, when encountering underspecification.
