דלג לתוכן (מקש קיצור 's')
אירועים

אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Distance problems for typical norms
event date icon
יום שני, 22.07.2024, 15:30
event location icon
Amado 232
"Noga Alon is being awarded the 2024 Wolf Prize for his profound impact on Discrete Mathematics and related areas." I will describe a recent joint work with Matia Bucic and Lisa Sauermann about the investigation of extremal problems in discrete geometry for typical norms. The results include surprisingly tight solutions of the unit and distinct distances problems for typical norms, as well as a determination of the chromatic number of the unit distance graph for a typical...
[ לנוסח המלא ]

ערב "מחקר על הבר" - שלושה חברי סגל בהרצאות TED בגובה העיניים
event date icon
יום שני, 22.07.2024, 19:00
event location icon
מרפסת טאוב
שלום לכולם, מוזמנים לערב  "מחקר על הבר" - שלושה חברי סגל בהרצאותTED   בגובה העיניים. ...
[ לנוסח המלא ]

חיזוי של הצלחת עריכת מודלים
event speaker icon
ינאי סוקר
event date icon
יום רביעי, 24.07.2024, 11:00
In LLMs, the ability to update factual knowledge of the model is an important and attractive ability, due to the need to deal with everchanging nature of information in the world. However, predicting whether an edit applied to a LLM will be successful or not is difficult. In this work, we suggest two metrics that can predict the editing success: (1) where the knowledge is stored in the parameters as reflected by the logit-lens technique; (2) the probability that the...
[ לנוסח המלא ]

On Sparse Partitions
event date icon
יום רביעי, 24.07.2024, 12:45
event location icon
A partition mathcal{P} of a metric space (X,d_X) is (sigma,tau,Delta)-sparse if each cluster has a diameter at most Delta, and every ball of radius Delta/sigma intersects at most tau clusters. In this talk, we will explore the construction and different applications of sparse partitions in their various forms over the years. As time allows, we will discuss applications to: Universal TSP, Steiner point removal, universal Steiner tree, and facility location....
[ לנוסח המלא ]

הקיבול ועומק החיפוש של דנא מרוכב
event speaker icon
תומר כהן
event date icon
יום רביעי, 24.07.2024, 14:30
event location icon
This paper studies two problems that are motivated by the novel recent approach of composite DNA that takes advantage of the DNA synthesis property which generates a huge number of copies for every synthesized strand. Under this paradigm, every composite symbols does not store a single nucleotide but a mixture of the four DNA nucleotides. In the first problem, our goal is study how to carefully choose a fixed number of mixtures of the DNA nucleotides such that the decoding probability by the ...
[ לנוסח המלא ]

על יציבות הולדר של רשתות נוירונים על פני מולטיסטים וגרפים
event speaker icon
יאיר דוידסון
event date icon
יום שלישי, 30.07.2024, 10:00
Famously, multiset neural networks based on sum-pooling can separate all distinct multisets, and as a result can be used by message passing neural networks (MPNNs) to separate all pairs of graphs that can be separated by the 1-WL graph isomorphism test. However, the quality of this separation may be very weak, to the extent that the embeddings of "separable" multisets and graphs might even be considered identical when using fixed finite precision. ...
[ לנוסח המלא ]

Green AI
event speaker icon
רועי שוורץ (האוניברסיטה העברית בירושלים)
event date icon
יום שלישי, 30.07.2024, 14:30
event location icon
חדר 337
The computations required for deep learning research have been doubling every few months, resulting in an estimated 5,000x increase from 2018 to 2022. This trend has led to unprecedented success in a range of AI tasks. In this talk I will discuss a few troubling side-effects of this trend, touching on issues of lack of inclusiveness within the research community, and an increasingly large environmental footprint. I will then present Green AI – an alternative app...
[ לנוסח המלא ]

רצפים חריגים סטטיסטית במחרוזות בינאריות עם אפליקציות לאמדן העשרות מקומיות בגנום האנושי
event speaker icon
שחר מור
event date icon
יום שלישי, 06.08.2024, 11:00
Statistical enrichment tools are highly useful in biological research. Current approaches to statistical enrichment in ranked or ordered lists such as, for example, GSEA and GOrilla, are limited to the suffix (prefix) of the list. These methods assess extreme density of 1s in binary vectors on either side. Statistical significance can be assigned using, e.g, Wilcoxon Rank Sum and mHG statistics.In this work we extend the mHG approach to also add...
[ לנוסח המלא ]

On Feature Extraction from MRI Data of Crohn’s Disease patients
event speaker icon
Rotem Benisty
event date icon
יום שישי, 23.08.2024, 11:30
Diagnosing Crohn's Disease (CD) typically involves examining 2D slices from magnetic resonance enterography (MRE). However, the anisotropic resolution of MRE complicates precise 3D measurements and visualization. The absence of automated 3D measurement systems further complicates assessment. Previous methods for generating isotropic volumes from anisotropic data often rely on extensive 3D data and focus solely on interslice resolution, lea...
[ לנוסח המלא ]

Learning In Joint Input And Downstream Task Optimization
event speaker icon
תמיר שור
event date icon
יום שני, 02.09.2024, 14:30
Traditional discriminative Machine-Learning approaches often formulate problems as optimization ofa parameterized function mapping from a given input space to some desired output space.While this formulation is applicable to many theoretical and practical problems, it is inherently relianton the assumption that the dataset X is constant. The world around us is abundant with scenarioswhere this is either not the case, or where droppin...
[ לנוסח המלא ]

גוגל מגיעים ליום זרקור בפקולטה 17.7.24, שעה 13:00, טאוב 2
event date icon
יום רביעי, 17.07.2024, 13:00
event location icon
טאוב 2
גוגל מגיעים ליום זרקור בפקולטה ...
[ לנוסח המלא ]

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
event speaker icon
Ariel Kulik
event date icon
יום רביעי, 17.07.2024, 13:00
event location icon
Amado 814
The talk will focus on the d-dimensional vector bin packing problem. The input for the problem is a set of items, each associated with a d-dimensional weight vector. The objective is to partition the items into a minimal number of bins, such that the total weight of items in a bin is at most one in every dimension. The problem...
[ לנוסח המלא ]

על היסודות האלגוריתמיים של תכנון סיוע במשימה
event speaker icon
איתן בלוך
event date icon
יום רביעי, 17.07.2024, 09:30
event location icon
הרצאת זום: 98269146871 ומעבדת CRL, קומה ראשונה, בניין טאוב
In this work we introduce the problem of task assistance planning where we are given two robots Rtask and Rassist. The first robot, Rtask, is in charge of performing a given task by executing a precomputed path. The second robot, Rassist, is in charge of assisting the task performed by Rtask using on-board sensors. The ability of Rassist to provide assistance to Rtask depends on the locations of both robots. Since Rtask is moving along its path, Rassist may also need to move to provide as muc...
[ לנוסח המלא ]

זיהוי תת-מעגל חומרה באמצעות לוקליצזציה של תת-גרף
event speaker icon
דני קוגן
event date icon
יום שלישי, 16.07.2024, 13:00
Hardware Reverse Engineering (HRE) involves gate-level Netlist extraction and specification discovery, wherein graph-based methods play a crucial role in identifying sub-circuits. We propose a novel approach for Subcircuit Recognition, essential for specification discovery in HRE, leveraging existing graph similarity kernels. Focusing on the reduced problem we formulate as Subgraph Localization, we delineate two key components: graph similarity metr...
[ לנוסח המלא ]

Discovering and Erasing Unsafe Concepts
event speaker icon
Niv Cohen
event date icon
יום שלישי, 16.07.2024, 11:30
event location icon
אולם 1061, בניין מאייר
The rapid growth of generative models allows an ever-increasing variety of capabilities. Yet, these model...
[ לנוסח המלא ]

ההרשמה לתחרות הפרויקט המצטיין 2024 נפתחה!
event date icon
יום שלישי, 16.07.2024, 10:50
event location icon
טאוב
ההרשמה לתחרות הפרויקט המצטיין 2024 נפתחה! עשיתם פרויקט חדשני, מעניין, פורץ דרך? מוזמנים להגיש מועמדות בקישור: https://tinyurl.com/cs-projects24 הגשת מועמדות עד ה- 11 באוגוסט 2024 שלב הגמר יתקיים ב-21באוגוסט 202...
[ לנוסח המלא ]

אינטראקציות בין רשתות בלוקצ'יין על בסיס ניתוח שוק
event speaker icon
אורי מזור
event date icon
יום חמישי, 11.07.2024, 16:30
event location icon
הרצאת זום: 5701477766
Cryptocurrencies have gained popularity in recent years. They are often implemented on one or more of the over 1000 existing blockchain networks, including the popular Bitcoin and Ethereum networks. Recently, various technologies known as blockchain interoperability have been developed to connect these different blockchains, creating an interconnected blockchain ecosystem. Interoperability refers to the ability of blockchains to share information with each other. Decentralized Exchanges (DEXs), ...
[ לנוסח המלא ]

Theory Seminar: Learning Probability Distributions; What Can, What Can't Be Done
event speaker icon
שי בן דוד (אוניברסיטת ווטרלו)
event date icon
יום רביעי, 10.07.2024, 13:00
event location icon
אמאדו 814
Characterizing learnability by a combinatorial dimension is a hallmark of machine learning theory. Starting from the fundamental characterization of binary classification PAC by the VC-dimension, through the characterization of online mistake bound learnability by the Littlestone dimension, all the way to recent papers characterizing multi-class learning and differential privacy. However, for some basic learning setup no such characterizations have been provided. I will focus ...
[ לנוסח המלא ]

מחקרים רחבי היקף של רשתות נוירונים עמוקות בהערכת אי ודאות וגילוי מחלקות מחוץ להתפלגות
event speaker icon
עידו גליל
event date icon
יום רביעי, 10.07.2024, 12:30
event location icon
הרצאת זום: 92810808120 וטאוב 9
In this seminar, I will discuss two of my papers (published in ICLR 2023) on uncertainty estimation and class-out-of-distribution detection. We present a novel framework to benchmark the ability of image classifiers to detect class-out-of-distribution (C-OOD) instances (i.e., instances whose true labels do not appear in the training distribution) at various levels of detection difficulty. We apply this technique to ImageNet, and benchmark 500+ pretrained, publicly available, ImageNet-1k classifi...
[ לנוסח המלא ]

יום זרקור - אנבידיה
event date icon
יום רביעי, 10.07.2024, 12:30
event location icon
קומת הכניסה, בניין טאוב למדעי המחשב
יום זרקור ראשון הסמסטר!! חברת אנבידיה מגיעה לפגוש אתכם בטאוב יום ד׳, 10 ביולי, בין 12:30-14:30 בלובי טאוב בתוכנית: מפגש עם צוות הגיוס, המהנדסים והמהנדסות וכמובן, צ'ופר מתוק מחכים לכם!!...
[ לנוסח המלא ]

Designing Language Models to Think Like Humans
event speaker icon
חן שני (סטנפורד)
event date icon
יום רביעי, 10.07.2024, 12:30
event location icon
טאוב 337
While language models (LMs) show impressive text manipulation capabilities, they also lack commonsense and reasoning abilities and are known to be brittle. In this talk, I will suggest a different LMs design paradigm, inspired by how humans understand it. I will present two papers, both shedding light on human-inspired NLP architectures aimed at delving deeper into the meaning beyond words. The first paper [1] accounts for the lack of commonsense and reasoning abilities by proposing a parad...
[ לנוסח המלא ]

Pixel Club - On The Benefits Of Models With Perceptually Aligned Gradients
event speaker icon
רוי גנץ - הפקולטה להנדסת חשמל ומחשבים ע"ש אנדרו וארנה ויטרבי
event date icon
יום שלישי, 09.07.2024, 11:30
Deep learning has revolutionized computer vision, achieving unprecedented performanc in tasks like classification and detection. However, these models are highly susceptible to adversarial attacks, prompting the development of robust training methods. A notable outcome of such training is the phenomenon of Perceptually Aligned Gradients (PAG), where input gradients align semantically with human perception. Our research explores both the practical and theoretical implications of PAG. We introd...
[ לנוסח המלא ]

פונקציית אגירה עבור ערבול מידע ברשתות עצביות עבור גרפים
event speaker icon
אלמוג דוד
event date icon
יום רביעי, 03.07.2024, 11:00
event location icon
חדר 014
Message Passing Graph Neural Networks (MPGNNs) have emerged as the standard method for modeling complex interactions across diverse graph entities. While the theory of such models is widely investigated, their aggregation module has not received sufficient attention. Sum-based aggregators have solid theoretical foundations regarding their separation capabilities. However, practitioners often prefer using more complex aggregations and mixtures of diverse aggregations. In this research, we unveil ...
[ לנוסח המלא ]

קבוצת Technipwn מטיסה אתכם לוגאס!
event date icon
יום שלישי, 02.07.2024, 17:00
event location icon
טאוב 9
קבוצת Technipwn מטיסה אתכם לוגאס!באוגוסט הקרוב קבוצת הCTF של הפקולטה משתתפת בכנס DEFCON שבלאס וגאס ומזמינה אתכם להצטרף!ביום שלישי הקרוב נערוך תחרות שמטרתה לבחור את הנבחרת שתטוס לייצג אותנו בכנס.נושאי התחרות הם הנושאים הרגילים של תחרויות ה־ctf כמו:&n...
[ לנוסח המלא ]

Wrong Mathematical Proofs for Possibly Correct Claims: Implications and Applications in Cyber Security and Chip Design
event speaker icon
פרופ' עודד מרגלית (אוניברסיטת בן גוריון)
event date icon
יום שלישי, 02.07.2024, 14:30
event location icon
אודיטוריום 012
In this talk, we'll explore intriguing parallels between incorrect mathematical proofs and critical failures in technology, demonstrating their impact and lessons learned, like: 1. Mathematical Proofs and Social Engineering: How hand-waving a mathematical proof is similar to social engineering, and why larger hardware implementations might surprisingly be more efficient. 2. Cybersecurity and Mathematical Proofs: The surprising connection between a cyber attack that nearly caused an airplane cras...
[ לנוסח המלא ]

מה ניתן ללמוד מערבוב דפי זכרון בעלי גדלים שונים
event speaker icon
מוחמד אגבאריה
event date icon
יום שני, 01.07.2024, 14:00
event location icon
הרצאת זום: 91705525071 וטאוב 601
Cycle-accurate simulations, frequently used by computer architects, incur substantial overheads. To mitigate this, recent virtual memory studies have adopted a lighter-weight methodology that leverages partial simulations of only the memory subsystem. This approach feeds simulation outputs into a mathematical linear model to predict execution runtimes. While this methodology accelerates the simulation process, its accuracy has traditionally been assumed rather than rigorously validated....
[ לנוסח המלא ]

בואו להיות חלק מקבוצת CTF של הפקולטה - מפגש ב- 30/6
event date icon
יום ראשון, 30.06.2024, 18:30
event location icon
טאוב 9
בואו להיות חלק מקבוצת Capture The Flag - CTF של הפקולטה!! קבוצת הCTF הפקולטית, Technipwn, מקיימת מפגשים דו שבועיים בהם אנו פותרים אתגרים, מתאמנים לתחרויות ונהנים. המפגשים מתאימים למשתתפים מתחילים ומנוסים כאחד, ומתקיימים בימי ראשון בטאוב 9. מאורגן ומנוהל על ידי סטודנטים, ומיועד לכלל ה...
[ לנוסח המלא ]

קיבוץ מידע מהימן והדרגתי מבוסס שיטות גיבוב במערכות אחסון דנ״א
event speaker icon
דביר בן שבת
event date icon
יום ראשון, 30.06.2024, 14:30
event location icon
Zoom Lecture: 5960823195
As data storage challenges grow and existing technologies approach their limits, synthetic DNA emerges as a promising storage solution due to its remarkable density and durability advantages. While cost remains a concern, emerging sequencing and synthetic technologies aim to mitigate it, yet introduce challenges such as errors in the storage and retrieval process. One crucial task in a DNA storage system is clustering numerous DNA reads into groups that represent the original i...
[ לנוסח המלא ]

ceClub: Advancing Computer Science with Digital Processing in Memory
event speaker icon
אוריין לייטרסדורף
event date icon
יום ראשון, 30.06.2024, 14:30
event location icon
הרצאת זום: 93857585105 וזיסאפל 608
The memory wall bottleneck is throttling the performance of data-intensive applications as the data transfer between the processing units (e.g., CPU, GPU cores) and the memory is significantly slower than the compute itself. Therefore, emerging digital processing-in-memory systems overcome this bottleneck by performing parallel bitwise logic within the memory arrays themselves. This enables a drastic reduction in data transfer for vectored operations since the same instruction may be repeated ac...
[ לנוסח המלא ]

ceClub: Enhancing Computer Performance with memristive Memory Processing Units: From General-Purpose Automation to DNA Sequencing Acceleration
event speaker icon
רותם בן חור
event date icon
יום ראשון, 30.06.2024, 10:30
event location icon
הרצאת זום: 92829605892 וזיסאפל 608
Computer systems that facilitate tight integration of data storage and processing can eliminate the "memory wall" and "power wall" bottlenecks. The memristive Memory Processing Unit (mMPU) architecture contains memory cells that can also execute logical functions, such as Memristor-Aided Logic (MAGIC) NOR gates. The mMPU supports both general-purpose computing and application-specific acceleration. This research contributes to both these aspects of the mMPU.First, we introduce frameworks...
[ לנוסח המלא ]

פריצות דרך מולקולריות: הגדרת יעדי אופטימיזציה חדשים בתכנון תרופות
event speaker icon
סאלי טורוטוב
event date icon
יום חמישי, 27.06.2024, 10:00
Deep learning has revolutionized drug development by enhancing various stages of the process, yet traditional optimization goals often lack the sophistication required for real-world applications. This work tackles more complex and nuanced problems beyond conventional property enhancement, focusing on optimizing under patentability constraints and translating preclinical success in animals to human clinical trials. In addressing patentability, we introduce a patent loss mechanism and the Molecul...
[ לנוסח המלא ]

Theory Seminar: Fast Approximate Counting of Cycles
event speaker icon
תומר אבן (טכניון)
event date icon
יום רביעי, 26.06.2024, 13:00
event location icon
אמדו 719
We consider the problem of approximate counting of triangles and longer fixed length cycles in undirected and directed graphs. We provide an algorithm which is faster as t, the number of copies of the searched subgraph, increases. Our running time, which significantly improves upon the state of the art (Tětek [ICALP’22]), is the same as that of multiplying an n x (n/t) matrix by an (n/t) x n matrix, up to polylogarithmic factors. Finally, we show that under popular fine-grained hypotheses, t...
[ לנוסח המלא ]

CE Club: Persistent Memory Programming without Persistent Memory
event speaker icon
גל אסא
event date icon
יום רביעי, 26.06.2024, 11:30
event location icon
הרצאת זום: 94673013539 וזיסאפל 506
The arrival of persistent memory devices to consumer market has revived the interest in transactional durable algorithms. Persistent memory is touted as having two attributes that distinguish it from other storage technologies: fine access granularity and fast persistece.In the first part of the talk we investigate how these attributes differentiate persistent memory from block storage in the context of buffered durability – a relaxed approach that allows some progress loss upon sys...
[ לנוסח המלא ]

Pixel Club: Robust and Fast Volumetric Tomography of Natural Objects for Climate Studies
event speaker icon
רועי רונן
event date icon
יום שלישי, 25.06.2024, 11:30
event location icon
הרצאת זום ומאייר 1061
Computed tomography (CT) aims to recover the volumetric three dimensional (3D) structure of heterogeneous objects. Traditionally, CT refers to a medical imaging modality. There the object, radiation source and detector array are fully controlled. This results in a linear image formation model. In contrast, we seek CT of natural objects, acquired outdoors, in an uncontrolled environment. We focus on underwater plankton and cloud droplets, which strongly affect climate. Cloud imagin...
[ לנוסח המלא ]

ניבוי סדרות זמן רבות משתנים
event speaker icon
נעם קורן
event date icon
יום חמישי, 20.06.2024, 16:30
event location icon
הרצאת זום: 98850618360 וטאוב 601
Multivariate time series forecasting is a pivotal task in several domains, including financial planning, medical diagnostics, and climate science. This paper presents the Neural Fourier Transform (NFT) algorithm, which combines multi-dimensional Fourier transforms with Temporal Convolutional Network layers to improve both the accuracy and interpretability of forecasts. The Neural Fourier Transform is empirically validated on fourteen diverse datasets, showing superior performance across multiple...
[ לנוסח המלא ]

ההאקתון השנתי של הפקולטה יוצא לדרך! CS Hackathon - Doing Good
event date icon
יום חמישי, 20.06.2024, 08:00
event location icon
בניין טאוב
ההאקתון השנתי של הפקולטה יוצא לדרך!  CS Hackathon - Doing Good שריינו את התאריכים: 20-21 ביוני, בטאוב. השנה, בהתאם לצו השעה, נתמקד בפיתוח פתרונות טכנולוגיים להגברת החוסן הנפשי בשיתוף אגף השיקום במשרד הביטחון, עמותות ומיזמים. פתיחת הרשמה, רעיונות לפיתוחים, וסדנאות הכנ...
[ לנוסח המלא ]

Theory Seminar: Approximate Matrix Multiplication via Spherical Convolutions
event speaker icon
Omri Weinstein (Hebrew University)
event date icon
יום רביעי, 19.06.2024, 13:00
event location icon
Amado 619
We develop a new framework, Polyform, for fast approximate matrix multiplication (AMM), through sums of sparse polynomial multiplications, using (variants of) FFT. Using this framework, we obtain new data-dependent speed-accuracy tradeoffs, which often improve on the worst-case accuracy of randomized sketching algorithms. Meanwhile, Polyform can be viewed as a cheap alternative bilinear operator to matrix multiplication in Deep Neural Networks, which is our motivating applicati...
[ לנוסח המלא ]

סמנטיקות כמותיות לאוטומטים קופצים
event speaker icon
ישי סלגדו
event date icon
יום ראשון, 16.06.2024, 14:30
event location icon
הרצאת זום: 94576770275 וטאוב 301
Jumping automata are finite automata that read their input in a non-sequential manner, by allowing a reading head to “jump” between positions on the input, consuming a permutation of the input word. We argue that allowing the head to jump should incur some cost. To this end, we propose three quantitative semantics for jumping automata, whereby the jumps of the head in an accepting run define the cost of the run. The three semantics correspond to different interpretations of jumps: the absolu...
[ לנוסח המלא ]

שינוי עקמומיות ברשתות ניורונים
event speaker icon
עקיבא מיכאל בלוק
event date icon
יום ראשון, 16.06.2024, 13:00
event location icon
הרצאת זום: 94919856641 וטאוב 9
Neural network optimization is a challenging task, in large part because of the nonconvexity, in general, of the loss function. Various algorithms have been proposed to solve this task, but most of them focus on the convex subspaces of the loss function to avoid the challenge of finding the optimal step in concave subspaces. In addition to avoiding the concave spaces entirely (which can bear a significant computational burden!), they also simply take the minimizer of a second-degree Taylor ap...
[ לנוסח המלא ]

התאמת מודל לשינויים בזמן טסט ע"י מזעור אנטרופיה מוגנת
event speaker icon
ירין בר
event date icon
יום ראשון, 16.06.2024, 11:00
event location icon
טאוב 9
In this paper, we present a novel approach for test-time domain adaptation via online self-training, consisting of two components. First, we introduce a statistical framework that detects distribution shifts in the classifier's entropy values obtained on a stream of unlabeled samples. Second, we devise an online adaptation mechanism that utilizes the evidence of distribution shifts captured by the detection tool to dynamically update the classifier's parameters. The resulting adaptation process ...
[ לנוסח המלא ]

Pixel-Club:Volumetric Signal Recovery and Calibration in Atmospheric Lidar
event speaker icon
עדי וייניגר, הפקולטה להנדסת חשמל ומחשבים של אנדרו וארנה ויטרבי
event date icon
יום שני, 10.06.2024, 15:00
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Atmospheric lidars are important remote sensing tools in aerosols and climate research. A pulsed time-of-flight lidar continuously samples vertical atmospheric profiles, through day and night, yielding a spatiotemporal atmospheric map. However, lidar analysis is challenged by low signal-to-noise ratios, sunlight interference, and need for frequent calibration. We advance lidar analysis. We develop a framework for simulating realistic spatiotemporal lidar data under diverse atmospheric and system...
[ לנוסח המלא ]

מכסים את כל הבסיסים: הדבר הבא ביעילות ריצוף DNA
event speaker icon
הדס אברהם
event date icon
יום ראשון, 09.06.2024, 14:30
event location icon
הרצאת זום: 99533009512 וחדר 601
DNA emerges as a promising medium for the exponential growth of digital data due to its density and durability. This study extends recent research by addressing the coverage depth problem in practical scenarios, exploring optimal error-correcting code pairings with DNA storage systems to minimize coverage depth. Conducted within random access settings, the study provides theoretical analyses and experimental simulations to examine the expectation and probability distribution of samples needed fo...
[ לנוסח המלא ]

Theory Seminar: Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions
event speaker icon
רונן שאלתיאל (אוניברסיטת חיפה)
event date icon
יום רביעי, 05.06.2024, 12:45
event location icon
אמדו 719
In the talk I will survey a research direction which combines coding-theory and computational complexity. This direction was introduced by Lipton, and refined by Guruswami and Smith. The goal is to construct error correcting codes which correct errors that are introduced by computationally bounded channels. This is in contrast to Hamming’s standard model which assumes a bound on the fraction of bits that a channel may flip, but allows the channel to be computationally unbounded.In rece...
[ לנוסח המלא ]

CE-Club: Safe Deployment of Deep Learning Solutions for Rate Control Problems
event speaker icon
נגה רוטמן, HUJI
event date icon
יום רביעי, 05.06.2024, 11:30
event location icon
הרצאת זום: 94673013539 ומאייר 861
In recent years, machine learning (ML) has fueled extraordinary advances in fields such as natural language processing and computer vision. These results have encouraged researchers to utilize ML in additional application domains, such as computer and networked systems, with varying degrees of success. In this talk I will focus on the prominent challenge of rate control in computer networking, and devising a practical ML toolkit for the safe deployment of deep-learning-based solutions.No...
[ לנוסח המלא ]

קבוצת ה-CTF של הפקולטה - Technipwn - מזמינה אתכם להרצאת פתיחת סמסטר 4.6.2024
event date icon
יום שלישי, 04.06.2024, 18:30
event location icon
אודיטוריום טאוב 1
קבוצת ה-CTF של הפקולטה - Technipwn מזמינה אתכם להרצאת פתיחת סמסטר- שנה של אבטחה התקפית: תקיפות על OpenAI, Atlassian, Apple ועוד! דובר>> רון מסאס, חוקר חולשות ב-Imperva במהלך עבודתו בחברת Imperva, חוקר האבטחה רון מסאס חשף מספר חולשות ופריצות מרתקות במספר חברות גדולות. בהרצאה הוא ייקח אותנו למסע ...
[ לנוסח המלא ]

אלגוריתמים מקביליים יעילים, נכונים ושרידים
event speaker icon
גל סלע
event date icon
יום ראשון, 02.06.2024, 13:30
event location icon
הרצאת זום: 97432970957
In the last two decades, a main way to improve performance of computer processors has been producing processors with multiple cores, on which tasks may execute concurrently. Software is required to keep up with the hardware advances and supply concurrent algorithms for programs that run on multiple cores. This talk will focus on a fundamental building block of concurrent algorithms: concurrent data structures, designed with improved efficiency while also satisfying strong correctness and progres...
[ לנוסח המלא ]

יום פתוח ללימודי תואר ראשון בטכניון | 31/5 בשרונה, בת"א
event date icon
יום שישי, 31.05.2024, 10:00
event location icon
מתחם שרונה, ת"א
יום פתוח ללימודי תואר ראשון בטכניון יתקיים ב-31/5 בין השעות 10:00-13:00 בשרונה, ת"א. באירוע תוכלו לפגוש את נציגי הפקולטה, להתייעץ, להתרשם ולקבל תשובות אודות הלימודים. הרשמה ליום הפתוח ...
[ לנוסח המלא ]

סמינר תיאוריה
event speaker icon
חברי קבוצת תיאוריה ומתעניינים
event date icon
יום רביעי, 29.05.2024, 12:45
event location icon
אמדו 619
This week we plan to get acclimated to our seminar's new location (outside of Taub, due to construction work), in a more social atmosphere. This includes introductions of current and prospective members of the group,* and talk about plans for the semester, including theory courses scheduled. Come meet established theorists and folks interested in theory research! * if you know students doing or interested in theory who are not (or might not be) registered to this mailing list, please let them k...
[ לנוסח המלא ]

אימות של רשתות נוירוניות רב-תגיות
event speaker icon
ג'וליאן מור
event date icon
יום רביעי, 29.05.2024, 11:30
event location icon
הרצאת זום: 91074303117 & מאייר 861
Multi-label neural networks are important in various tasks, including safety-critical tasks. Several works show that these networks are susceptible to adversarial attacks, which can remove a target label from the predicted label list or add a target label to this list. However, no verifier can deterministically determine the list of labels for which a multi-label neural network is locally robust. The main challenge is that the complexity of the analysis increases by a factor exponential in the n...
[ לנוסח המלא ]

CE-Club: Robustness Verification of Multi-Label Neural Network Classifiers
event speaker icon
ג'וליאן מור
event date icon
יום רביעי, 29.05.2024, 11:30
event location icon
הרצאת זום: 91074303117 ומאייר 861
Multi-label neural networks are important in various tasks, including safety-critical tasks. Several works show that these networks are susceptible to adversarial attacks, which can remove a target label from the predicted label list or add a target label to this list. However, no verifier can deterministically determine the list of labels for which a multi-label neural network is locally robust. The main challenge is that the complexity of the analysis increases by a factor exponential in the n...
[ לנוסח המלא ]

השמיים הם הגבול - יום פתוח ללימודי תארים מתקדמים בפקולטה
event date icon
יום רביעי, 22.05.2024, 13:00
event location icon
טאוב 337
מפגש מתעניינים בלימודים לתארים מתקדמים בפקולטה למדעי המחשב ע"ש טאוב בטכניון יתקיים ביום רביעי 22.5.24, שעה 13:00, חדר 337 בוגרי תואר ראשון מצטיינים מכל האוניברסיטאות! זאת ההזדמנות שלכם להשתתף ולהתרשם מהפקולטה למדעי המחשב בטכניון, לפגוש חברי הסגל וסטודנטים לתארים מתקדמים ו...
[ לנוסח המלא ]

CE-Club: Survivable Payment Channel Networks
event speaker icon
יקטרינה פודיאצ'ב
event date icon
יום רביעי, 22.05.2024, 11:30
event location icon
מאייר 861
Payment Channel Networks (PCNs) are a leading method to scale the transaction throughput in cryptocurrencies. Two participants can use a bidirectional payment channel for making multiple mutual payments without committing them to the blockchain. Opening a payment channel is a slow operation that involves an on-chain transaction locking a certain amount of funds. These aspects limit the number of channels that can be opened or maintained. Users may route payments through a multi-hop path and thus...
[ לנוסח המלא ]

מודלי שפה מבניים לקוד
event speaker icon
שקד ברודי
event date icon
יום חמישי, 16.05.2024, 14:00
event location icon
הרצאת זום: 92691399579
In the past few years, software has been at the heart of many applications ranging from appliances to virtual services. Helping software developers to write better code is a crucial task. In parallel, recent developments in machine learning and deep learning in particular have shown great promise in many fields, and code-related tasks in particular. The main challenge is how to represent code in a way that can be used by deep learning models effectively. While code can be treated as a sequence o...
[ לנוסח המלא ]

אוטומטים קופצים מעל מילים אינסופיות
event speaker icon
עומר יצחק
event date icon
יום רביעי, 15.05.2024, 15:30
event location icon
הרצאת זום: 95929737670, סיסמה: OmerMSC וחדר 601
We introduce and study jumping automata over infinite words, a fascinating twist on traditional finite automata. These machines read their input in a non-consecutive manner, defying conventional word order. We explore three distinct semantics: one ensuring every letter is accounted for, another permitting word permutation within fixed windows, and a third allowing permutation within windows of an existentially-quantified bound. Our work covers expressiveness, closure properties, algorithmic char...
[ לנוסח המלא ]

מודל מענה לשאלות בהשראת קידוד
event speaker icon
מוסא עראף
event date icon
יום ראשון, 05.05.2024, 15:00
event location icon
הרצאת זום: 91070061962
Methods in question-answering (QA) that transform texts detailing processes into an intermediate code representation, subsequently executed to generate a response to the presented question, have demonstrated promising results in analyzing scientific texts that describe intricate processes. The limitations of these existing text-to-code models are evident when attempting to solve QA problems that require knowledge beyond what is presented in the input text. We propose a novel domain-agnostic mode...
[ לנוסח המלא ]

הלוואות בלוקצין: שיטות פלטפורמות ואתגרים
event speaker icon
תום אזולאי
event date icon
יום ראשון, 21.04.2024, 16:00
Distributed lending protocols are major financial mechanisms that match borrowers and lenders without the need for intermediaries. Smart contracts deployed on blockchains ensure the security of such loans. Borrowers mitigate the risk of default by providing collateral in the form of cryptocurrencies or by limiting the loan duration. In the first part of the talk, we describe various loan types, major platforms, and financial models that allow them. In the second part of the talk, we refer to a ...
[ לנוסח המלא ]

Pixel Club: Deep Computational Imaging: Optimal sensing, reconstruction, and uncertainty quantification
event speaker icon
Elias Nehme - The Andrew and Erna Viterbi Faculty of Electrical & Computer Engineering
event date icon
יום שלישי, 16.04.2024, 14:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל & הרצאת זום
In biological imaging, fast acquisition of depth information is crucial e.g. for accurate 3D tracking of sub-cellular elements and for 3D super-resolution. In the first part of this talk, we present a series of works enhancing the success of snapshot depth sensing in the revolutionary field of single-molecule localization microscopy (Nobel Prize in Chemistry 2014). Specifically, we present an approach for jointly designing the “optics” of the microscope and the 3D reconstruction algorithm, b...
[ לנוסח המלא ]

למידה עמוקה ואופטימיזציה של מדיניות מבוסס חיפוש עץ תחת עיגובים סטוכאסטיים
event speaker icon
דוד ולנסי
event date icon
יום שני, 15.04.2024, 14:00
event location icon
הרצאת זום: 98471388934 & זיספל 413
The standard formulation of Markov decision processes (MDPs) assumes that the agent's decisions are executed immediately. However, in numerous realistic applications such as robotics or healthcare, actions are performed with a delay whose value can even be stochastic. In this work, we introduce stochastic delayed execution MDPs, a new formalism addressing random delays without resorting to state augmentation. We show that given observed delay values, it is sufficient to perform a policy search i...
[ לנוסח המלא ]

ביקור VIP בטכניון לילדי בוגרים
event date icon
יום שני, 15.04.2024, 10:00
event location icon
טכניון, בניין אולמן
בוגרי הפקולטה מוזמנים עם ילדיהם ליום של הרצאות סדנאות ומידע לגבי רישום וקבלה - לילדים; וסיור נוסטלגי (להורים) יום שני, 15 באפריל, החל מ-10:00 בטכניון בתוכנית: 1. נפלאות האינסוף - הפקולטה למתמטיקה 2. מה זה האינטרנט של הדברים? - הפקולטה למדעי המחשב 3. ...
[ לנוסח המלא ]

CE-Club: Buffer Isolation With Imperfect Congestion Control Classification
event speaker icon
יארה מולה ( NVidia - IBC Barracuda)
event date icon
יום רביעי, 10.04.2024, 11:30
event location icon
הרצאת זום: 83464479226
Due to their increasing aggressiveness, recent congestion control algorithms (CCAs) can quickly starve standard TCP flows in their shared router queues. Existing solutions based on fair queueing are not scalable enough, and those based on admission control do not fit all CCAs. Independently, building on the popularization of machine learning, recent papers have designed several CCA classifiers.In this seminar, we introduce a buffer isolation mode where incoming flows first undergo CCA cl...
[ לנוסח המלא ]

Pixel Club: FreeAugment: Data Augmentation Search Across All Degrees of Freedom
event speaker icon
תום בקור - הפקולטה להנדסת חשמל ומחשבים ע"ש אנדרו וארנה ויטרבי
event date icon
יום שלישי, 09.04.2024, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
Graduate Seminar Data augmentation has become an integral part of deep learning, as it is known to improve the generalization capabilities of neural networks.Since the most effective set of image transformations differs between tasks and domains, automatic data augmentation search aims to alleviate the extreme burden of manually finding the optimal image transformations. However, current methods are not able to jointly optimize all degrees of freedom: (1) the number of ...
[ לנוסח המלא ]

הבטחה סטטיסטית לעיבוד זרמי נתונים מבוסס בינה מלאכותית
event speaker icon
נדב רובינשטיין
event date icon
יום שלישי, 09.04.2024, 11:00
event location icon
הרצאת זום: 94644097135
In the landscape of data stream processing, the challenges posed by online problems are of paramount importance. This paper introduces a pioneering method tailored to address these challenges within the context of data streams. While our initial focus centered on Complex Event Processing (CEP) problems, it is essential to underscore the versatility of our approach, as it is equally applicable to a diverse range of online problems. To the best of our knowledge, there exists no comprehensive metho...
[ לנוסח המלא ]

TDC Seminar: Fault-Tolerant Labeling and Compact Routing Schemes
event speaker icon
מיכל דורי, אוניברסיטת חיפה
event date icon
יום שני, 08.04.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
Assume that you have a huge graph, where edges and vertices may fail, and you want to answer questions about this graph quickly, without inspecting the whole graph. A fault-tolerant labeling scheme allows us to do just that. It is a distributed data structure, in which each vertex and edge is assigned a short label, such that given the labels of a pair of vertices s,t, and a set of failures F, you can answer questions about s and t in G\F. For example, determine if s and t are connected in G\F, ...
[ לנוסח המלא ]

אימון מקדים של מודלי שפה מכוון שיח
event speaker icon
זכרי אלישע במרגר
event date icon
יום ראשון, 07.04.2024, 10:00
event location icon
חדר 601
Language Models (LMs) excel in many tasks, but understanding discourse – how sentences connect to form coherent text – remains a challenge. This is especially true for smaller models aiming to match the abilities of their larger counterparts in handling long and complex inputs. To address this, we introduce DEPTH, a new encoder-decoder model designed to foster robust discourse-level representations during the pre-training phase. DEPTH uniquely combines hierarchical sentence representations a...
[ לנוסח המלא ]

Learning with visual foundation models for Gen AI
event speaker icon
גל צ'צ'יק, אוניברסיטת בר-אילן ו-NVIDIA
event date icon
יום חמישי, 04.04.2024, 10:30
event location icon
טאוב 337
Between training and inference, lies a growing class of AI problems that involve fast optimization of a pre-trained model for a specific inference task. These are not pure “feed-forward” inference problems applied to a pre-trained model, because they involve some non-trivial inference-time optimization beyond what the model was trained for; neither are they training problems, because they focus on a specific input. These compute-heavy inference workflows raise new challenges in machine learn...
[ לנוסח המלא ]

יום מחקר 2024 בפקולטה למדעי המחשב
event date icon
יום רביעי, 03.04.2024, 12:30
event location icon
קומת הכניסה, בניין טאוב למדעי המחשב
יום המחקר העשירי לתארים מתקדמים בפקולטה למדעי המחשב יתקיים ביום רביעי, 03 באפריל 2024, בין השעות 12:30-14:30, בלובי של בניין טאוב למדעי המחשב. יום מחקר הוא הזדמנות עבור משתלמי הפקולטה להציג את מחקריהם באמצעות פוסטרים בפני חברי סגל, מנהלים מהתעשייה וסטודנטים בפקולטה ומכלל הט...
[ לנוסח המלא ]

Theory Seminar: Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition
event speaker icon
אור מאיר (אוניברסיטת חיפה)
event date icon
יום רביעי, 03.04.2024, 12:15
event location icon
טאוב 201
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits. Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995) suggested approaching this problem by proving that depth complexity of a composition of two functions is roughly the sum of their individual depth complexities. They showed that the validity of this conjecture would imply the desired lower bounds.The intuition that underlies the KRW conjecture is that ...
[ לנוסח המלא ]

CE-Club:Here Comes the GenAI Malware, Worm, and APT
event speaker icon
בן נשיא, הטכניון
event date icon
יום רביעי, 03.04.2024, 11:30
event location icon
מאייר 861
In the past year, numerous companies have incorporated Generative AI (GenAI) capabilities into new and existing applications, forming interconnected Generative AI (GenAI) ecosystems consisting of applications powered by GenAI services.While ongoing research highlighted risks associated with the GenAI layer of agents (e.g., dialog poisoning, membership inference, prompt leaking, jailbreaking), a critical question emerges: Can attackers develop malware to exploit the GenAI component of an ...
[ לנוסח המלא ]

Marrying Vision and Language: A Mutually Beneficial Relationship?
event speaker icon
הדר אברבוך-אלור, אוניברסיטת תל-אביב
event date icon
יום שלישי, 02.04.2024, 14:30
event location icon
טאוב 337
Foundation models that connect vision and language have recently shown great promise for a wide array of tasks such as text-to-image generation. Significant attention has been devoted towards utilizing the visual representations learned from these powerful vision and language models. In this talk, I will present an ongoing line of research that focuses on the other direction, aiming at understanding what knowledge language models acquire through exposure to images during pretraining. We first co...
[ לנוסח המלא ]

Pixel-Club: STMPL: Human Soft-Tissue Simulation
event speaker icon
אנטון אגפונוב (סמינר לתואר שני)
event date icon
יום שלישי, 02.04.2024, 11:30
event location icon
חדר 608, בניין זיסאפל
In various applications, such as virtual reality and gaming, simulating the deformation of soft tissues in the human body during interactions with external objects is essential. Traditionally, Finite Element Methods (FEM) have been employed for this purpose, but they tend to be slow and resource-intensive. In this paper, we propose a unified representation of human body shape and soft tissue with a data-driven simulator of non-rigid deformations. This approach enables rapid simulation of realist...
[ לנוסח המלא ]

StarkWare - הנדסת העתיד של בלוקצ'יין
event speaker icon
StarkWare
event date icon
יום שני, 01.04.2024, 12:30
event location icon
מועדון משתלמים, חדר 225
הנדסת העתיד של בלוקצ'יין 1.4.23 | 12:30-14:30 | מועדון משתלמים, טאוב, קומה 2 12:30 - מינגלינג וחטיפים 13:00 - עודד נאור, Ph.D., מנהל מוצר - Btockchain הומצא מחדש: צלילה עמוקה לתוך הפתרונות המשנים את המשחק של StarkWare 13:30 - נועה עובד, MSC, ראש צוות תוכנה - קידוד העתיד: הפ...
[ לנוסח המלא ]

יום פתוח 28.3 יוצאים לדרך!
event date icon
יום חמישי, 28.03.2024, 09:30
event location icon
הטכניון
יום פתוח ללימודים בטכניון יתקיים ביום ה' 28/3 החל מ-09:30 לפרטים והרשמה היכנסו לאתר רישום וקבלה בקישור ...
[ לנוסח המלא ]

Theory Seminar: Exploring the Generalization Ability of (Convex) Optimization Algorithms
event speaker icon
תומר קורן (אוניברסיטת תל אביב)
event date icon
יום רביעי, 27.03.2024, 12:15
event location icon
טאוב 201
In machine learning, there has been considerable interest over the past decade in understanding the ability of optimization algorithms to generalize—namely, to produce solutions (models) that extend well to unseen data—particularly in the context of overparameterized problems. I will survey several recent theoretical studies that explore generalization in classical convex optimization, that reveal intriguing behavior of common optimization methods and shed some light on the concept of gener...
[ לנוסח המלא ]

הרצאת אורח בפקולטה: How to design innovative software?
event speaker icon
פרופ' דניאל ג'קסון, MIT
event date icon
יום רביעי, 27.03.2024, 12:00
event location icon
אודיטוריום 012, קומה 0
I will explain how successful innovations in software can usually be traced to just one or two "concepts" that offer new scenarios that, with seemingly small shifts, radically change how an application is used. I give examples from apps such as Zoom, WhatsApp and Calendly. I explain how concepts, each with their own characteristic scenarios, can be composed to form apps. I explain how this idea can be used to make software more usable, modular and consistent. More information at:...
[ לנוסח המלא ]

CE-Club: Optimizing Information Freshness in Wireless Networks: From Theory to Implementation
event speaker icon
איתן מודיאנו - המעבדה למערכות מידע והחלטות המכון הטכנולוגי של מסצ'וסטס
event date icon
יום רביעי, 27.03.2024, 11:30
event location icon
מאייר 861
Age of Information (AoI) is a recently proposed performance metric that captures the freshness of the information from the perspective of the application. AoI measures the time that elapsed from the moment that the most recently received packet was generated to the present time. In this talk, we explore the AoI optimization problem in wireless networks.We start by considering a wireless network with a number of nodes transmitting information to a base station and develop low-complexity t...
[ לנוסח המלא ]

ה- Tech Experience של אינטל מגיע לקמפוס!
event date icon
יום רביעי, 27.03.2024, 10:00
event location icon
בניין מאייר, הפקולטה להנדסת חשמל
ה- Tech Experience של אינטל מגיע לקמפוס! מוכנים לפיקניק הטכנולוגי הכי חדשני שראיתם אי פעם? העמסנו כלים טכנולוגיים ואת המוחות הכי גדולים שלנו לטראק ואנחנו בדרך אליכם יום רביעי 27.3 | בניין מאייר קומה 3 10:00 - AR | VR | HR בואו להכיר אותנו ואת הטכנולוגיות שלנו 12:30 ...
[ לנוסח המלא ]

Pixel-Club: Idempotent Generative Network
event speaker icon
אסף שוצ'ר, NVIDIA
event date icon
יום שלישי, 26.03.2024, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We propose a new approach for generative modeling based on training a neural network to be idempotent. An idempotent operator is one that can be applied sequentially without changing the result beyond the initial application, namely f(f(z))=f(z). The proposed model f is trained to map a source distribution (e.g, Gaussian noise) to a target distribution (e.g. realistic images) using the following objectives: (1) Instances from the target distribution should map to themselves, namely f(x)=x. We de...
[ לנוסח המלא ]

הגישה האלרואיסטית-אגנוסטית לשיתוף פעולה בניהול זיכרון
event speaker icon
אמיר דחבש
event date icon
יום חמישי, 21.03.2024, 10:30
event location icon
הרצאת זום: 93387090038
In this lecture we will explore collaborative caching algorithms in order to boost the effectiveness of caches in a distributed storage system. I'll introduce a scheme that partitions each node’s cache into two conceptual regions: an egoistic area whose goal is to contain the most valuable data for the node that owns the cache, and an altruistic area whose goal is to contain the most valuable data for the system as a whole. Each node’s division between these two regions is dynamically adjust...
[ לנוסח המלא ]

Pixel-Club: Explaining Classification by Image Decomposition
event speaker icon
אלנתן קידר (סמינר לתואר שני)
event date icon
יום רביעי, 20.03.2024, 14:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We propose a new way to explain and to visualize neural network classification through a decomposition-based explainable AI. Instead of providing an explanation heatmap, our method yields a decomposition of the image into class-agnostic and class-distinct parts, with respect to the data and chosen classifier. Following a fundamental signal processing paradigm of analysis and synthesis, the original image is the sum of the decomposed parts. We thus obtain a radically different way of explaining c...
[ לנוסח המלא ]

Taub 201
event speaker icon
אילן ניומן (אוניברסיטת חיפה)
event date icon
יום רביעי, 20.03.2024, 13:15
event location icon
טאוב 201
A finite metric space $(X,d)$ on a set of points $X$ is just the shortest path metric $d$ on a positively weighted graph $G=(X,E)$. In the online setting, the vertices of the input finite metric space $(X,d)$ are exposed one by one, together with their distances $d(*,*)$to the previously exposed vertices. The goal is to embed (map) $X$ into a given host metric space $(H,d_H)$ (finite or not) and so to distort the distances as little as possible (distortion is the worst case ratio of how ...
[ לנוסח המלא ]

יום זרקור מובילאיי
event date icon
יום רביעי, 20.03.2024, 12:30
event location icon
בניין טאוב
מוזמנים ליום זרקור של חברת מובילאיי בטכניון יום רביעי 20.3 | 12:30 | בניין טאוב...
[ לנוסח המלא ]

ceClub: From Dashboards To Labels: Helping Users Manage And Make Decision About Privacy
event speaker icon
אדם ג'יי אביב (אוניברסיטת ג'ורג' וושינגטון)
event date icon
יום רביעי, 20.03.2024, 11:30
event location icon
מאייר 861 & הרצאת זום
The surveillance economy, where tracking and collecting data on uses for the purpose of advertising and other actions, is central to much of the money-making enterprises of the modern technology ecosystem. Due to regulations and other forces, some of the largest companies, such as Google and Apple, have prioritized mechanisms for users to better manage and receive information about the kinds of data that is being collected about them. In this talk, I will explore how effective these mechanisms r...
[ לנוסח המלא ]

יאהו מגיעים לפקולטה 19/3 - התמחויות קיץ והזדמנויות למחקר
event date icon
יום שלישי, 19.03.2024, 12:30
event location icon
מועדון משתלמים, חדר 225
יאהו מקיימים מפגש ייעודי עם סטודנטים לתארים מתקדמים יום שלישי, 19/3 ב-12:30 במועדון משתלמים בתוכנית: היכרות עם המחקר של יאהו בישראל ותוכנית התמחויות הקיץ. להרשמה לאירוע כאן מחכים לכם!! ...
[ לנוסח המלא ]

Nvidia - הרצאה ופיצה
event speaker icon
ירדן צוקרמן, מנהל אבטחת תוכנה, Nvidia
event date icon
יום שני, 18.03.2024, 18:00
event location icon
אודיטוריום 012, קומה 0
הצטרפו אלינו להרצאה ופיצה! אתגרי אבטחת סייבר בעידן המודרני מאת ירדן צוקרמן, מנהל אבטחת תוכנה, Nvidia יום שני | 18 במרץ, 2024 | 18:00 | אודיטוריום הפסנתר בניין טאוב הרשמה ...
[ לנוסח המלא ]

TDC Seminar: Null Messages, Information and Coordination
event speaker icon
ראיסה נטף
event date icon
יום שני, 18.03.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
I'll present our paper about the role that null messages play in synchronous systems with and without failures. Our work provides necessary and sufficient conditions on the structure of protocols for information transfer and coordination there. We start by introducing a new and more refined definition of null messages. A generalization of message chains that allow these null messages is provided and is shown to be necessary and sufficient for information transfer in reliable systems. Coping with...
[ לנוסח המלא ]

Theory Seminar: A Unified Characterization Of Private Learning
event speaker icon
הילה שפלר (טכניון)
event date icon
יום רביעי, 13.03.2024, 12:15
event location icon
טאוב 201
Differential Privacy (DP) is a mathematical framewirk for ensuring the privacy of individuals in a dataset. Roughly speaking, it guarantees that privacy is protected in data analysis by ensuring that the output of an analysis does not reveal sensitive information about any specific individual, regardless of whether their data is included in the dataset or not.This talk presents a unified framework for characterizing both pure and approximate differentially private learnabiliity under the...
[ לנוסח המלא ]

זיהוי שינוי התפלגות ברשתות נוירונים עמוקות
event speaker icon
גיא בר-שלום
event date icon
יום רביעי, 13.03.2024, 10:30
event location icon
הרצאת זום: 97086749422 ומאייר 1061
To deploy and operate deep neural models in production, the quality of their predictions, which might be contaminated benignly or manipulated maliciously by input distributional deviations, must be monitored and assessed. Specifically, we study the case of monitoring the healthy operation of a deep neural network (DNN) receiving a stream of data, with the aim of detecting input distributional deviations over which the quality of the network’s predictions is potentially damaged. Using selective...
[ לנוסח המלא ]

עיצוב רעש הנעה אקטיבי עבור לוקליזציה של רחפנים
event speaker icon
גבריאל סרוסי
event date icon
יום שלישי, 12.03.2024, 14:30
event location icon
הרצאת זום: 99864029841 וטאוב 401
Multi-rotor aerial autonomous vehicles (MAVs) primarily rely on vision for navigation purposes. However, visual localization and odometry techniques suffer from poor performance in low or direct sunlight, a limited field of view, and vulnerability to occlusions. Acoustic sensing can serve as a complementary or even alternative modality for vision in many situations, and it also has the added benefits of lower system cost and energy footprint, which is especially important for micro aircraft. Thi...
[ לנוסח המלא ]

Pixel-Club: Using Zodiacal Light For Spaceborne Calibration Of Polarimetric Imagers
event speaker icon
אור אביטן (סמינר לתואר שני)
event date icon
יום שלישי, 12.03.2024, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
We propose that spaceborne polarimetric imagers can be calibrated, or self-calibrated using zodiacal light (ZL). ZL is created by a cloud of interplanetary dust particles. It has a significant degree of polarization in a wide field of view. From space, ZL is unaffected by terrestrial disturbances. ZL is insensitive to the camera location, so it is suited for simultaneous cross-calibration of satellite constellations. ZL changes on a scale of months, thus being a quasi-constant target in realisti...
[ לנוסח המלא ]

TDC Seminar: From Distributed Computing to Cryptography and Back
event speaker icon
איתי אברהם, אינטל
event date icon
יום שני, 11.03.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
I will share some of my learnings from working on problems on the intersection of Distributed Computing and Cryptography.On the one hand, I will show how some cryptographic protocols (MPC and DKG) can be improved by using distributed computing counterparts for notions such as zero knowledge proofs and proofs of knowledge. On the other hand, I will show how distributed computing protocols (ABA) can be improved by carefully using notions of binding from cryptography. One recurring theme is...
[ לנוסח המלא ]

מידול שיחה יציב בסדרה של שאלות ותשובות: מחקר מעמיק ושיטת מידול חדשה
event speaker icon
זוריק גכמן
event date icon
יום שני, 11.03.2024, 10:30
Most works on modeling the conversation history in Conversational Question Answering (CQA) report a single main result on a common CQA benchmark. While existing models show impressive results on CQA leaderboards, it remains unclear whether they are robust to shifts in setting (sometimes to more realistic ones), training data size (e.g. from large to small sets) and domain. In this work, we design and conduct the first large-scale robustness study of history modeling approaches for CQA. We find t...
[ לנוסח המלא ]

אנבידיה מזמינה אתכם ליום זרקור וירטואלי 10/3
event date icon
יום ראשון, 10.03.2024, 18:00
event location icon
נפגשים וירטואלית
אנבידיה מזמינה אתכם ליום זרקור וירטואלי בו מהנדסי ומהנדסות החברה יספרו על הקבוצות השונות והמשרות הפתוחות יום ראשון, 10 במרץ, בין השעות 18:00-19:30 להרשמה לאירוע כאן ...
[ לנוסח המלא ]

קיידנס מגיעים ליום גיוס בפקולטה
event date icon
יום רביעי, 06.03.2024, 12:30
event location icon
קומת הכניסה, בניין טאוב למדעי המחשב
חברת Cadence מגיעה ליום זרקור בפקולטה יום ד' 6/3 | 12:30-14:30 | לובי טאוב בתוכנית: מפגש עם צוותי הגיוס, המהנדסים והמהנדסות לשיחה 1:1 על הזדמנויות תעסוקה וטיפים לכתיבת קו"ח. וכמובן מרצ' ומתוקים. מחכים לכם!! ...
[ לנוסח המלא ]

Faster Matrix Game Solvers Via Ball Oracle Acceleration
event speaker icon
יאיר כרמון (אוניברסיטת תל אביב)
event date icon
יום רביעי, 06.03.2024, 12:15
event location icon
טאוב 201
We design a new stochastic first-order algorithm for approximately solving matrix games as well as the more general problem of minimizing the maximum of smooth convex functions. Our central tool is ball oracle acceleration: a technique for minimizing any convex function with a small number of calls to a ball oracle that minimizes the same function restricted to a small ball around the query point. To design an efficient ball oracle for our problems of interest we leverage stochastic gradient des...
[ לנוסח המלא ]

סיווג מוקדם עם שליטה על פער הדיוק המצטבר
event speaker icon
לירן רינגל
event date icon
יום שלישי, 05.03.2024, 15:00
event location icon
הרצאת זום: 96835343656 וטאוב 401
Early time classification algorithms aim to label a stream of features without processing the full input stream, while maintaining accuracy comparable to that achieved by applying the classifier to the entire input. In this paper, we introduce a statistical framework that can be applied to any sequential classifier, formulating a calibrated stopping rule. This data-driven rule attains finite-sample, distribution-free control of the accuracy gap between full and early-time classification. We star...
[ לנוסח המלא ]

התקבלת למשרת סטודנט! מה עכשיו? 4/3 | הרצאה על האתגרים וההזדמנויות במשרה ראשונה
event speaker icon
מור פילו, בוגרת הפקולטה ומפתחת באמזון
event date icon
יום שני, 04.03.2024, 18:30
event location icon
אודיטוריום 012, קומה 0
התקבלת למשרת סטודנט! מה עכשיו? קהילת הסטודנטיות בפקולטה SHE S מזמינה אותך למפגש בנושא: משרת סטודנט ראשונה: על ההזדמנויות, האתגרים והמיומנויות שרוכשים בעבודה הראשונה יום שני, 4/3 בשעה 18:30 באודיטוריום פסנתר נא הירשמי מראש: כאן ד...
[ לנוסח המלא ]

שיכון וקטורי יציב עבור מסדי נתונים דינמיים
event speaker icon
נטע פרידמן
event date icon
יום חמישי, 29.02.2024, 15:00
event location icon
הרצאת זום: 99751665591
We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database. In this problem, the embedding should be stable in the sense that it should not change on the existing tuples due to the embedding of newly inserted tuples (as database applications might already rely on existing embeddings); at the same time, the embedding of all tuples, old and new, should retain high quality. This task is challenging since in...
[ לנוסח המלא ]

יום זרקור לחברת אנבידיה בטכניון
event date icon
יום רביעי, 28.02.2024, 12:30
event location icon
קומת הכניסה, בניין טאוב למדעי המחשב
יום זרקור לחברת אנבידיה בטכניון ב-28.2.24 אנבידיה מגיעה לפגוש את הסטודנטים והסטודנטיות של הפקולטה למדעי המחשב בטכניון! בואו לפגוש את מהנדסי ומהנדסות החברה פנים מול פנים יום רביעי 28.2.24 | 12:30-14:30 | לובי טאוב, קומה 0...
[ לנוסח המלא ]

Taub 201
event speaker icon
שראל כהן (המכללה האקדמית תל-אביב)
event date icon
יום רביעי, 28.02.2024, 12:15
event location icon
טאוב 201
Theory Seminar: An f-edge fault-tolerant distance sensitivity oracle (f-DSO) is a data-structure that, when queried with two vertices (s, t) and a set F of at most f edges of a graph G with n vertices, returns an estimate tilde{d}(s,t,F) of the distance d(s,t,F) from s to t in G – F. The oracle has stretch alpha if the estimate satisfies d(s,t,F) le tilde{d}(s,t,F) le alpha cdot d(s,t,F) . In the last two decades, extensive research has focused on developing efficient f-DSOs. This research aim...
[ לנוסח המלא ]

TDC Seminar: Fast and Fair Lock-Free Locks
event speaker icon
נעמה בן-דוד, טכניון
event date icon
יום שני, 26.02.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
Locks are frequently used in concurrent systems to simplify code and ensure safe access to contended parts of memory. However, they are also known to cause bottlenecks in concurrent code, leading practitioners and theoreticians to sometimes opt for more intricate lock-free implementations. In this talk, I’ll show that, despite the seeming contradiction, it is possible to design practically and theoretically efficient lock-free locks; I'll present a lock-free lock algorithm with good bounds on ...
[ לנוסח המלא ]

Fundamental Problems in AI: Transferability, Compressibility and Generalization
event speaker icon
תומר גלנטי
event date icon
יום חמישי, 22.02.2024, 15:00
event location icon
הרצאת זום: 9316005503 סיסמה: 272625
In this talk, we delve into several fundamental questions in deep learning. We start by addressing the question, "What are good representations of data?" Recent studies have shown that the representations learned by a single classifier over multiple classes can be easily adapted to new classes with very few samples. We offer a compelling explanation for this behavior by drawing a relationship between transferability and an emergent property known as neural collapse. Later, we explore why certain...
[ לנוסח המלא ]

תאוריה ופרקטיקה של זכרונות דנ״א
event speaker icon
דניאלה בר-לב
event date icon
יום רביעי, 21.02.2024, 17:00
event location icon
הרצאת זום: 92916633492 וטאוב 9
In the last decade, DNA-based storage systems emerged as a potential data archival solution due to their high data density and durability. This research delves into intrinsic error characteristics of DNA storage systems to devise robust coding strategies and innovative algorithms for enhanced reliability, efficiency, scalability, and cost-effectiveness. The research propels DNA storage feasibility while contributing to foundational theory.The work analyzes combinatorial structures tied t...
[ לנוסח המלא ]

Identifying Underlying Geometry To Analyze High-Dimensional Data: Images And Shape Spaces As A Case Study
event speaker icon
שירה פייגנבוים-גולובין
event date icon
יום רביעי, 21.02.2024, 15:00
event location icon
הרצאת זום: 93613579310 סיסמה: 652820
High-dimensional data is increasingly available in diverse applications, ranging from images to shapes represented as point clouds. Such data raises novel questions and offers a unique opportunity to study them by developing new machine-learning tools. While the analysis of an individual sample may be challenging, leveraging the power of the data collection can be effective in tackling complex tasks. This talk delves into the challenges associated with studying such data, particularly focusing o...
[ לנוסח המלא ]

Theory Seminar: IOPs with Inverse Polynomial Soundness Error
event speaker icon
גל ארנון (מכון ויצמן)
event date icon
יום רביעי, 21.02.2024, 12:15
event location icon
טאוב 201
We show that every language in NP has an Interactive Oracle Proof (IOP) with inverse polynomial soundness error and small query complexity. This achieves parameters that surpass all previously known PCPs and IOPs. Specifically, we construct an IOP with perfect completeness, soundness error 1/n, round complexity O(loglog n), proof length poly(n) over an alphabet of size O(n), and query complexity O(loglog n). This is a step forward in the quest to establish the sliding-scale conjecture for IOPs (...
[ לנוסח המלא ]

TDC Seminar: Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
event speaker icon
יובל גיל (טכניון)
event date icon
יום שני, 19.02.2024, 13:30
event location icon
זיסאפל (הנדסת חשמל ומחשבים) חדר 608
This talk focuses on the distributed task of constructing an approximate \emph{maximum weight independent set (MWIS)}. Specifically, we are interested in deterministic CONGEST algorithms whose approximation guarantees are expressed as a function of the graph's \emph{arboricity} $\alpha$.Generally speaking, efficient deterministic non-trivial approximation algorithms for MWIS were not known until the recent breakthrough of Faour et al.~[SODA 2023] that obtained an $O(\Delta)$-approximatio...
[ לנוסח המלא ]

פלטפורמת למידה עמוקה לאבחון בדיקות אק״ג
event speaker icon
עידן לוי
event date icon
יום חמישי, 15.02.2024, 11:00
event location icon
הרצאת זום: קישור  וטאוב 401
In clinical settings, a significant portion of ECG data is typically available in printed form, and the most convenient means of digitizing this information involves utilizing a mobile device. Despite notable progress in AI-based techniques for paper-based 12-lead ECG analysis, their adoption in clinical practice remains limited primarily due to challenges such as inadequate accuracy in clinical settings and a restricted ability to diagnose various cardiac conditions. Our objective was to tackle...
[ לנוסח המלא ]

Theory Seminar: Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
event speaker icon
עידן מהלל (טכניון)
event date icon
יום רביעי, 14.02.2024, 12:15
event location icon
טאוב 201
Suppose that n forecasting experts (or functions) are providing daily rain/no-rain predictions, and the best among them is mistaken in at most k many days. For how many days will a person allowed to observe the predictions, but has no weather-forecasting prior knowledge, mispredict?In this talk, we will discuss how such classical problems can be reduced to calculating the (average) depth of binary trees, by using newly introduced complexity measures (aka dimensions) of the set of experts...
[ לנוסח המלא ]

ceClub: Space-efficient FTL for Mobile Storage via Tiny Neural Nets
event speaker icon
רון מרקוס
event date icon
יום רביעי, 14.02.2024, 11:30
event location icon
מאייר 861
With the rapid increase of storage demands and working sets of modern mobile apps, maintaining high I/O performance in mobile SSDs under strict resource constraints is challenging. The Flash Translation Layer (FTL) must increase the capacity of the Logical-To-Physical (L2P) address translation cache to keep up with the new workloads, but it comes at the cost of scaling the on-die SRAM, resulting in higher chip area, power consumption, and costs.In this talk, I will present RQFTL, a deman...
[ לנוסח המלא ]

קבוצת CTF טכניון
event date icon
יום שלישי, 13.02.2024, 18:30
event location icon
טאוב 2
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים. כולם מוזמנים! מתחילים ובעלי ניסיון לפרטים: Technionctf.com השבוע 13.2.24: 18:30 | טאוב 2 | עומר אטיאס - ...
[ לנוסח המלא ]

מאזן עומס ל QUIC המודע ל- 0-RTT
event speaker icon
רוברט שהלה
event date icon
יום שני, 12.02.2024, 12:00
event location icon
הרצאת זום: 97318309550 וטאוב 601
QUIC is an emerging transport protocol, offering multiple advantages over TCP. Yet, to fully unleash QUIC’s potential, a paradigm shift is needed in existing network infrastructure. We propose a novel 0-RTT-aware load balancing algorithm. 0-RTT is crucial for web performance, particularly on mobile networks. Our load balancing algorithm ensures 0-RTT while maintaining near-optimal load balancing performance.Through extensive simulations, using both synthetic and real-world traffic trac...
[ לנוסח המלא ]

יום זרקור פיינל
event date icon
יום רביעי, 07.02.2024, 12:30
event location icon
אודיטוריום 012, קומה 0
מוזמנים ליום זרקור של חברת פיינל יום רביעי 07.02.2024 | 12:30-14:30 | אודיטוריום מרכז המבקרים 012, קומה 0 12:30 - בואו לפגוש מהנדסים, חוקרים ואת צוות הגיוס בפיינל, ולהכיר את היום יום בפיינל. 13:15 - מפגש על אופציות, הסתברויות ועולם האלגוטריידינג | נועם הורוביץ - חו...
[ לנוסח המלא ]

Theory Seminar: Algorithmic Cheap Talk
event speaker icon
קונסטנטין זברני
event date icon
יום רביעי, 07.02.2024, 12:15
event location icon
טאוב 201
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים. כולם מוזמנים! מתחילים ובעלי ניסיון לפרטים: Technionctf.com השבוע 6.2.24: מתחילים: פורנזיקה & רש...
[ לנוסח המלא ]

קבוצת CTF טכניון
event date icon
יום שלישי, 06.02.2024, 18:30
event location icon
טאוב 9
בואו להיות חלק מקבוצת Capture The Flag-CTF חדשה בפקולטה המפגשים מתקיימים מדי יום ג' בשעה 18:30 בטאוב 9 וכוללים הרצאות אורח והתנסות מעשית בפתרון אתגרים. כולם מוזמנים! מתחילים ובעלי ניסיון לפרטים: Technionctf.com השבוע 6.2.24: מתחילים: פורנזיקה & רשת...
[ לנוסח המלא ]

אי השתנות כבעיית תכן
event speaker icon
אלעד קינסברונר
event date icon
יום שלישי, 06.02.2024, 12:30
event location icon
טאוב 601
Many object-oriented applications in algorithm design rely on objects never changing during their lifetime. This is often tackled by marking object references as read-only, e.g., using the const keyword in C++. In other languages like Python or Java where such a concept does not exist, programmers rely on best practices that are entirely unenforced. While reliance on best practices is obviously too permissive, const-checking is too restrictive: it is possible for a method to mutate the internal ...
[ לנוסח המלא ]

Pixel-Club: Robustified ANNs Reveal Wormholes Between Human Category Percepts
event speaker icon
גיא גזיב (מעבדת דיקרלו ב-MIT)
event date icon
יום שלישי, 06.02.2024, 11:30
event location icon
חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל
The visual object category reports of artificial neural networks (ANNs) are notoriously sensitive to tiny, adversarial image perturbations. Because human category reports (aka human percepts) are thought to be insensitive to those same small-norm perturbations — and locally stable in general — this argues that ANNs are incomplete scientific models of human visual perception. Consistent with this, we show that when small-norm image perturbations are generated by standard ANN models, human obj...
[ לנוסח המלא ]

Theory Of Crypto Seminar: Perfect Asynchronous MPC with Linear Communication Overhead
event speaker icon
גלעד אשרוב (אוניברסיטת בר אילן)
event date icon
יום חמישי, 01.02.2024, 11:30
event location icon
טאוב 4001
We study secure multiparty computation in the asynchronous setting with perfect security and optimal resilience (less than one-fourth of the participants are malicious). It has been shown that every function can be computed in this model [Ben-OR, Canetti, and Goldreich, STOC'1993]. Despite 30 years of research, all protocols in the asynchronous setting require $\Omega(n^2C)$ communication complexity for computing a circuit with $C$ multiplication gates. In contrast, for nearly 15 years, in the ...
[ לנוסח המלא ]

אלגוריתמי קירוב לבעיות סידור של גרפים
event speaker icon
דור קצלניק
event date icon
יום רביעי, 31.01.2024, 12:30
event location icon
טאוב 201
We study several graph layout problems with a min max objective. Here, given a graph we wish to find a linear ordering of the vertices that minimizes some worst case objective over the natural cuts in the ordering; which separate an initial segment of the vertices from the rest. A prototypical problem here is cutwidth, where we want to minimize the maximum number of edges crossing a cut. The only known algorithm here is by [Leighton-Rao J.ACM 99] based on recursively partitioning the graph using...
[ לנוסח המלא ]

Theory Seminar: Almost Logarithmic Approximation for Cutwidth and Pathwidth
event speaker icon
דור קצלניק (טכניון)
event date icon
יום רביעי, 31.01.2024, 12:15
event location icon
טאוב 201
We study several graph layout problems with a min max objective. Here, given a graph we wish to find a linear ordering of the vertices that minimizes some worst case objective over the natural cuts in the ordering; which separate an initial segment of the vertices from the rest. A prototypical problem here is cutwidth, where we want to minimize the maximum number of edges crossing a cut. The only known algorithm here is by [Leighton-Rao J.ACM 99] based on recursively partitioning the graph using...
[ לנוסח המלא ]

ceClub: Challenges and Opportunities In Securing Software Supply Chains
event speaker icon
ד"ר יניב דוד (אוניברסיטת קולומביה)
event date icon
יום רביעי, 31.01.2024, 11:30
event location icon
מאייר 861
Racing to be first to market and deploy new features, developers rely on many external libraries to underpin their software. Each library uses more libraries, creating vast networks of dependencies that the developers know little about and have no control over, forming a knowledge gap that quickly turns into technical debt. Repaying this debt is difficult, as analyzing or examining all libraries is infeasible, and worse, the debt keeps growing due to frequent library updates. Attackers move quic...
[ לנוסח המלא ]

CS Lecture: On Implicit Bias and Benign Overfitting in Neural Networks
event speaker icon
גל ורדי
event date icon
יום רביעי, 31.01.2024, 10:30
event location icon
טאוב 601
When training large neural networks, there are typically many solutions that perfectly fit the training data. Nevertheless, gradient-based methods often have a tendency to reach those which generalize well, namely, perform well also on test data. Thus, the training algorithm seems to be implicitly biased towards certain networks, which exhibit good generalization performance. Understanding this “implicit bias” has been a subject of extensive research recently. Moreover, in contradiction to c...
[ לנוסח המלא ]

עדשת דיפוזיה: תפקיד קידוד הטקסט במודלי טקסט לתמונה
event speaker icon
מיכאל טוקר
event date icon
יום שני, 29.01.2024, 15:30
event location icon
טאוב 601
Text-to-image diffusion models (T2I) use a latent representation of a text prompt to guide the image generation process. However, the encoder that produces the text representation is largely unexplored. We propose the Diffusion Lens, a method for analyzing the text encoder of T2I models by generating images from its intermediate representations. Using the Diffusion Lens, we perform an extensive analysis of two recent T2I models.We find that the text encoder gradually builds prompt repres...
[ לנוסח המלא ]

CS Lecture: Verification of Complex Hyperproperties
event speaker icon
הדר פרנקל
event date icon
יום ראשון, 28.01.2024, 10:30
event location icon
אודיטוריום 012, קומה 0
Hyperproperties are system properties that relate multiple execution traces to one another. Hyperproperties are essential to express a wide range of system requirements such as information flow and security policies; epistemic properties like knowledge in multi-agent systems; fairness; and robustness. With the aim of verifying program correctness, the two major challenges are (1) providing a specification language that can precisely express the desired properties; and (2) providing scalable veri...
[ לנוסח המלא ]

Theory Seminar: The Sample Complexity Of ERMs In Stochastic Convex Optimization
event speaker icon
דניאל כרמון (טכניון)
event date icon
יום רביעי, 24.01.2024, 12:15
event location icon
טאוב 201
Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained unresolved: How many data points must be observed so that any empirical risk minimizer (ERM) shows good performance on the true population? This question was proposed by Feldman who proved that Ω(\frac{d}{ϵ} + \frac{1}{ϵ^2}) data points are necessary (where d is the dimension and ε > 0 is the accuracy parameter). P...
[ לנוסח המלא ]

קבוצת Technion CTF Team נפתחת בפקולטה
event date icon
יום שלישי, 23.01.2024, 18:30
event location icon
טאוב 9
קבוצת Technion CTF Team נפתחת בפקולטה אנו מזמינים אתכם להצטרף למפגשי Capture The Flag - CTF .CTF היא תחרות אתגרי סייבר ואבטחת מידע בנושאים: קריפטוגרפיה, הנדסה לאחור, פורנזיקה, ווב וכיוצ"ב. המפגשים יכללו הרצאות אורח והתנסות מעשית בפתרון אתגרים. מוזמנים להצטרף סטודנטים מתחילים וסטוד...
[ לנוסח המלא ]

CGGC Seminar: Poisson Manifold Reconstruction (beyond co-dimension one)
event speaker icon
פרופ' מישה קז'דן (מדעי המחשב, אוניברסיטת ג'ונס הופקינס)
event date icon
יום חמישי, 18.01.2024, 11:30
event location icon
טאוב 012 (אודיטוריום, מרכז רב תכליתי)
In this talk we consider the problem of manifold reconstruction from oriented point clouds for embedded manifolds of co-dimension larger than one. Using the framework of Poisson Surface Reconstruction, and formulating the problem in the language of alternating products, we show that the earlier approach for reconstructing hyper-surfaces extends to general manifolds, at the cost of replacing a quadratic energy with a multi-quadratic energy. We provide an efficient iterative hierarchical solver th...
[ לנוסח המלא ]

Taub 201
event speaker icon
דוד וייץ (טכניון)
event date icon
יום רביעי, 17.01.2024, 12:15
event location icon
טאוב 201
Vizing’s Theorem provides an algorithm that edge colors any graph of maximum degree Δ using Δ+1 colors, which is necessary for some graphs, and at most one higher than necessary for any graph. In online settings, the trivial greedy algorithm requires 2Δ-1 colors, and Bar-Noy, Motwani and Naor in the early 90s showed that this is best possible, at least in the low-degree regime. In contrast, they conjectured that for graphs of superlogarithmic-in-n maximum degree, much better can be done, an...
[ לנוסח המלא ]

Internet-Scale Consensus in the Blockchain Era
event date icon
יום שלישי, 16.01.2024, 11:00
event location icon
טאוב 601
Blockchains have ignited interest in Internet-scale consensus as a vital building block for decentralized applications and services that promise egalitarian access and robustness to faults and abuse. While the study of consensus has a 40+ year tradition, the new Internet-scale setting requires a fundamental rethinking of models, desiderata, and protocols. An emergent key challenge is to simultaneously serve clients with different requirements regarding the two fundamental aspects of security, li...
[ לנוסח המלא ]

סיווג של אק"ג מ 12 חיבורים באמצעות שיטות של למידה עמוקה
event speaker icon
ודים גלינר
event date icon
יום חמישי, 04.01.2024, 12:30
event location icon
הפקולטה להנדסה ביו-רפואית, בניין סילבר, חדר 201
12-lead electrocardiogram (ECG) recordings can be collected in any clinic and the interpretation is performed by a clinician. Modern machine learning tools may make them automatable. However, a large fraction of 12-lead ECG data is still available in printed paper or image only and comes in various formats. To digitize the data, smartphone cameras can be used. Nevertheless, this approach may introduce various artifacts and occlusions into the obtained images.Here, I will present 5 papers...
[ לנוסח המלא ]

Auditorium 012, floor 0
event speaker icon
יובל דגן
event date icon
יום שני, 01.01.2024, 10:30
event location icon
אודיטוריום 012, קומה 0
I will present a theoretical framework for analyzing learning algorithms which rely on dependent, rather than independent, observations. While a common assumption is that the learning algorithm receives independent datapoints, such as unrelated images or texts, this assumption often does not hold. An example is data on opinions across a social network, where opinions of related people are often correlated, for example as a consequence of their interactions. I will present a line of work that mod...
[ לנוסח המלא ]