Pages
אוקטובר 05, 2015
-
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. -
Date:01רביעיינואר 2025אירועי תרבות
מועדון טנגו
More information שעה 19:30 - 20:45כותרת כיתת מתחיליםמיקום Aquarium conference roomצרו קשר -
Date:02חמישיינואר 2025הרצאה
Moonshot: Leveraging multi-national open science collaboration for antiviral discovery
More information שעה 09:00 - 10:00מיקום Candiotty Auditoriumמרצה Dr. Haim Barr
LSCF & G-INCPM departmental seminars -
Date:02חמישיינואר 2025הרצאה
Vision and AI
More information שעה 12:15 - 13:15כותרת Utilizing Pre-trained Diffusion Models for Text-based Image and Video Editingמיקום בניין יעקב זיסקינד
Room 1 - 1 חדרמרצה Vladimir Kulikov
Technionמארגן המחלקה למדעי המחשב ומתמטיקה שימושיתצרו קשר תקציר 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:02חמישיינואר 2025הרצאה
Geometric Functional Analysis and Probability Seminar
More information שעה 13:30 - 14:30כותרת Entropy and the growth rate of universal covering treesמיקום בניין יעקב זיסקינד
Room 155 - חדר 155מרצה Shlomo Hoory
Tel-Haiמארגן המחלקה למתמטיקהצרו קשר תקציר 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:05ראשוןינואר 2025הרצאה
Vision and AI
More information שעה 11:00 - 12:00כותרת Adapting Language Models: From Diverging Preferences to Contextual Understandingמיקום בניין יעקב זיסקינד
Room 155 - חדר 155מרצה Valentina Pyatkin
Allen Institute for AI and University of Washingtonמארגן המחלקה למדעי המחשב ומתמטיקה שימושיתצרו קשר תקציר 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. -
Date:05ראשוןינואר 2025הרצאה
Anatomical organization of the human hippocampal system
More information שעה 11:00 - 12:30מיקום Belfer Building
Botnar Auditorium,מרצה Dr. Daniel Reznik מארגן המחלקה למדעי המוחצרו קשר תקציר Show full text abstract about Animal tract-tracing studies provided critical insights into...» Animal tract-tracing studies provided critical insights into the organizational principles of the hippocampal system, thus defining the anatomical constraints within which animal mnemonic functions operate. However, no clear framework defining the anatomical organization of the human hippocampal system exists. This gap in knowledge originates in notoriously low MRI data quality in the human medial temporal lobe (MTL) and in group-level blurring of idiosyncratic anatomy between adjacent brain regions comprising the MTL. In this talk, I will present our recent data, which overcame these longstanding challenges and allowed us to explore in detail the cortical networks associated with the human MTL, and to examine the intrinsic organization of the hippocampal-entorhinal system with unprecedented anatomical precision. Our results point to biologically meaningful and previously unknown organizational principles of the human hippocampal system. These findings facilitate the study of the evolutionary trajectory of the hippocampal connectivity and function across species, and prompt a reformulation of the neuroanatomical basis of episodic memory. -
Date:05ראשוןינואר 2025הרצאה
The Clore Center for Biological Physics
More information שעה 13:15 - 14:30כותרת The Analog Computer — a "Comeback"?מיקום ספרית הפיסיקה על שם נלה וליאון בנוזיומרצה Prof. Oren Raz
lunch will be served at 12:45מארגן מרכז לפיזיקה ביולוגית עש קלורצרו קשר תקציר Show full text abstract about In the last decade there have been several efforts to use ph...» In the last decade there have been several efforts to use physical systems as 'physical computers': D-Wave is using super-conducting qubits as an adiabatic quantum (or non-quantum?) computer, the Israeli company Light-Solver (ex Davidson group) tries to use lasers in finding optimal solutions to optimization problems, HP is developing memristor computation, 'Natural Computing' is developing a chip that is based on thermal computin, companies like Toshiba and Fujitsu are commercializing products like Bifurcation machines' and Digital annealers', and so on... Are we indeed seeing the `comeback' of analog computers? In the talk I will discuss the physical ideas behind these machines and try to provide some intuition and understanding on their advantages and disadvantages. FOR THE LATEST UPDATES AND CONTENT ON SOFT MATTER AND BIOLOGICAL PHYSICS AT THE WEIZMANN, VISIT OUR WEBSITE: https://www.biosoftweizmann.com/ -
Date:06שניינואר 2025הרצאה
From mechanisms to evolution: Understanding genetic variation with long-read sequencing
More information שעה 11:30 - 12:30כותרת The Department of Molecular Cell Biology and the Department of Molecular Genetics Guest Seminarמיקום Wolfson
Auditoriumמרצה Dr. Regev Schweiger מארגן המחלקה לביולוגיה מולקולרית של התאצרו קשר תקציר Show full text abstract about Patterns of genetic variation we observe today hold echoes o...» Patterns of genetic variation we observe today hold echoes of the ancestral events that shaped them. Population genetics - the study of genetic variation - offers a window into this past, providing insights across evolutionary biology, history, and human health. Advances in long-read sequencing technology, combined with the rapid decrease in sequencing costs, open new avenues for studying genetic variation. In my talk, I will focus on two such examples: First, how long-read sperm sequencing is uncovering new insights into meiotic recombination, with emphasis on non-crossover recombination. Second, algorithms based on coalescent theory for recovering evolutionary histories, with applications ranging from the deep evolutionary history of humans to detecting natural selection on genetic variants. -
Date:08רביעיינואר 2025הרצאה
A single-cell view into the development and evolution of a complex morphology
More information שעה 10:00 - 11:00מיקום בניין ארתור ורושל בלפר למחקר ביורפואי
Botnar Auditoriumמרצה Dr. Ella Preger-Ben Noon -
Date:08רביעיינואר 2025הרצאה
Special Guest Seminar
More information שעה 11:00 - 12:00כותרת RNA Dicing: Transforming Gene Expression from Linear Simplicity to Modular Complexityמיקום בניין ע"ש מקס ולילאן קנדיוטי
Auditoriumמרצה Dr. Yuval Malka מארגן המחלקה לאימונולוגיה ורגנרציה ביולוגיתצרו קשר -
Date:08רביעיינואר 2025הרצאה
The Computational and Neural Basis of Cognitive Dynamics and Diversity
More information שעה 11:15 - 12:45מיקום Belfer Building
Botnar Auditorium,מרצה Dr. Roey Schurr מארגן המחלקה למדעי המוחצרו קשר תקציר Show full text abstract about Humans adapt their behavior across multiple timescales: from...» Humans adapt their behavior across multiple timescales: from rapid adjustments to changing contexts to lifelong tendencies in how they approach tasks. This variation across time and individuals poses a challenge for identifying the cognitive strategies people use and the neural processes that support them. My research combines computational modeling and neuroimaging to uncover the strategies individuals use and reveal how their dynamics are reflected in neural activity and constrained by brain structure. In this talk I will present my work on computational modeling of cognitive dynamics over weeks. I will briefly describe my work on mapping of human white matter, and my current work on the computational and neural bases of creative search. I will conclude by outlining my future research aimed at uncovering the core principles that drive both the dynamics and diversity of human cognition. -
Date:08רביעיינואר 2025הרצאה
Machine Learning and Statistics Seminar
More information שעה 11:15 - 12:15כותרת Learning in Deep Weight Spaces Through Symmetriesמיקום בניין יעקב זיסקינד
Room 1 - 1 חדרמרצה Haggai Maron
Technion/NVIDIAמארגן המחלקה למדעי המחשב ומתמטיקה שימושיתצרו קשר תקציר Show full text abstract about With millions of pre-trained models now available online, ne...» With millions of pre-trained models now available online, neural weights have emerged as a new and rich data modality. This talk explores these weights as structured data objects with inherent symmetries. We will cover architectures that process weight spaces while preserving these symmetries, including our equivariant architectures for multilayer perceptron weights (ICML 2023) and Graph Metanetworks (GMN) (ICLR 2024), which extend this approach across network architectures. We'll also present our research on weight space data augmentation and network alignment (ICML 2024). Time permitting, we'll discuss recent work on learning with Low-Rank Adaptations (LoRA). This research aims to enable novel ways to analyze and modify networks, with potential applications from Implicit Neural Representation (INR) manipulation to weight pruning and model editing. -
Date:08רביעיינואר 2025אירועי תרבות
Aikya 2025 - The Unity
More information שעה 18:00 - 20:00כותרת An Indian cultural event with classical dance, violin and guitar performances, and Bollywood dance by Weizmann members.מיקום Michael Sela Auditoriumמארגן ענף המשרד הבינלאומידף בית צרו קשר
