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

Reinforcement learning policies in Markov decision processes (MDPs) often behave unexpectedly, especially in environments with sparse rewards, raising challenges for debugging and verification. We propose a general framework for discrete MDPs to generate two complementary, one-step explanations for single-action anomalies: (1) minimal counterfactual states—the smallest factored-state perturbations that flip a chosen action—and (2) robustness regions—contiguous state neighbor...
[ לנוסח המלא ]

The rapid advancement of artificial intelligence (AI) is pushing the limits of conventional digital computing architectures. Key performance bottlenecks–computational efficiency, memory bandwidth, and interconnect performance–are becoming increasingly critical, especially for edge AI applications that demand low latency and ultra-low power consumption. In this talk, I will present my recent research aimed at overcoming these challenges through a multidisciplinary approach focusing...
[ לנוסח המלא ]

We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the \ekecd problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their matching labels. We show two extra-extensions to this variation: the heterogeneous sample size case (\efmecd) and the partly recovering case....
[ לנוסח המלא ]

The software landscape is showing consistent, accelerated growth in the volume of code developed using dynamic languages. These languages are characterized by dynamic typing and more lax preemptive checks, which allow rapid application development and shorter development cycles. The vast majority of these languages are interpreted; that is, programs are executed by an interpreter in a managed runtime environment. Such interpreters incur significant performance hits, and, to counter that, mode...
[ לנוסח המלא ]

Min-Plus Weighted Finite Automata (WFAs) are a quantitative extension of Boolean automata whereby each word is assigned an integer, instead of being accepted or rejected. Applications of WFAs fall on a wide spectrum including verification, rewriting systems, tropical algebra, speech and image processing and have been key to proving the star-height conjecture. Unlike Boolean automata, WFAs cannot always be determinized. The decidability of whether a WFA admits an equivalent de...
[ לנוסח המלא ]

I will describe several old and new applications of topological and algebraic methods in the derivation of combinatorial results. In all of them the proofs provide no efficient procedures for solving the corresponding algorithmic questions. The problem of finding such procedures (or convincing reasons indicating that they are unlikely to exist) is an intriguing challenge and I will mention some progress in the study of this problem too. Bio: Noga Alon is ...
[ לנוסח המלא ]

Maximization of submodular functions under various constraints is a fundamental problem that has been studied extensively.In this talk I will discuss submodular functions and interesting research questions in the field.I will present several new techniques that lead to both deterministic algorithms and faster randomized algorithms for maximizing submodular functions.In particular, for monotone submodular functions subject to a matroid constraint we design a deterministic non-obliv...
[ לנוסח המלא ]

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

ההאקתון הפקולטי CS Doing Good יוצא לדרך ואנחנו מתרגשים!גם אם אתם לא משתתפים בהאקתון – זה לא אומר שאתם לא יכולים להצטרף לחגיגה: פתחנו את סדנאות ההכנה לכלל הסטודנטים בפקולטה!  מרגישים שאין לכם ניסיון?לקראת ההאקתון יצרנו שלוש סדנאות שיתנו ...
[ לנוסח המלא ]

Many practical prediction algorithms represent inputs in Euclidean space and replace the discrete 0/1 classification loss with a real-valued surrogate loss, effectively reducing classification tasks to stochastic optimization. In this talk, I will explore the expressiveness of such reductions in terms of key resources. I will formally define a general notion of reductions between learning problems, and realte it some well known examples such as representations by half-spaces.I will then e...
[ לנוסח המלא ]

Miner fees are a key component in the incentive scheme of properly running Blockchains’ decentralized transaction processing. In determining how fees work, we should consider many different goals: Efficient allocation, simplicity for users, and robustness to possible manipulation vectors. We consider this problem through the lens of auction theory, and characterize the tradeoffs different mechanisms may offer, in particular w.r.t. the threat of miner-user collusion.The talk is based...
[ לנוסח המלא ]

הפקולטה למדעי המחשב בטכניון מזמינה אתכם להרצאה מיוחדת:בחזרה לחדרי הביטחון הלאומי לאחר ה-7/10: הבנת המציאות בעידן של פוסט-אמתיום שלישי ב 6 במאי בשעה 16:30 אודיטוריום טאוב 2, הפקולטה למדעי המחשב, טכניון בהרצאה זו ישתף איתי ברון מחשבות על המאמץ לב...
[ לנוסח המלא ]

We introduce a Probably Approximately Correct (PAC) learning framework where each hypothesis is represented by a graph, with edges indicating positive interactions, such as between users and items. This framework subsumes the classical binary and multi-class PAC learning models as well as multi-label learning with partial feedback, where only a single random correct label per example is observed, rather than all correct labels. Our work uncovers a rich statistical and algorithmic land...
[ לנוסח המלא ]

Environmental sensing has a major gap: three-dimensional (3D) mapping of the atmosphere over the ocean, under clouds. This gap is caused by occlusion of the domain from satellite views and lack of wide-field 3D sensing from space. Moreover, although water covers most of Earth, almost all sensors are currently on dry land. We address the challenge by deriving a new approach: multi-view imaging using a floating network of cameras that have overlapping view fields. Such a setup introduces new co...
[ לנוסח המלא ]

Linear error‑correcting codes that handle insertions and deletions (indels) are fundamental to reliable storage and communication in settings where symbol positions may drift—from DNA data storage to packet‑based networks. Unlike substitution and erasure errors, indels disrupt sequence alignment and therefore require additional synchronization information. This talk surveys recent constructive techniques that embed such synchronization within fully linear codes, preserving a...
[ לנוסח המלא ]

הפקולטה למדעי המחשב וועד הסטודנטים מזמינים אתכם לעשות טוב ולהיות חלק מהאירוע הכי גדול ומשמעותי השנה! האקתון CS Doing Good יתמקד השנה בנושא "אמת במרחב הדיגיטלי" – התמודדות עם פייק ניוז ודיסאינפורמציה ויתקיים בימים חמישי-שישי 8-9 במאי בטאוב. 140 סטודנטי�...
[ לנוסח המלא ]

Partially Observable Markov Decision Processes (POMDPs) provide a robust framework for decision-making under uncertainty in applications such as autonomous driving and robotic exploration. Their extension, rhoPOMDPs, introduces belief-dependent rewards, enabling explicit reasoning about uncertainty. Existing online rhoPOMDP solvers for continuous spaces rely on fixed belief representations, limiting adaptability and refinement - critical for tasks such as information-gathering. We present rho...
[ לנוסח המלא ]

Batching heuristics are used in multiple layers of the TCP/IP stack, attempting to improve performance by amortizing overheads. When defining "performance" as average latency and throughput, optimal batching decisions can be infeasible if application-perceived end-to-end performance is unknown, which is commonly the case in general-purpose setups. We propose to address this problem by occasionally adding several easily-maintained counters to TCP metadata exchanges and using them to estimate e...
[ לנוסח המלא ]

Self-supervised learning (SSL) has enabled Vision Transformers (ViTs) to learn robust representations from large-scale natural image datasets, enhancing their generalization across domains. In retinal imaging, foundation models pretrained on either natural or ophthalmic data have shown promise, but the benefits of in-domain pretraining remain uncertain. To investigate this, we benchmark six SSL-pretrained ViTs on seven digital fundus image (DFI) datasets totaling 70,000 expert-annotated image...
[ לנוסח המלא ]

Whether secure Cryptography exists is one of the most important open problems in Computer Science: Cryptographic schemes today rely on unproven computational hardness assumption. We will survey a recent thread of work (Liu-Pass FOCS’20, Liu-Pass STOC’21,.., Ball-Liu-Pass-Mazor FOCS’23, Liu-Pass EUROCRYPT’24) showing *equivalences* between the existence of some of the most basic cryptographic primitives, and the hardness of various computational problems related...
[ לנוסח המלא ]

מוזמנים לפתוח את הסמסטר עם חברת DELL שמגיעה ליום זרקור והרצאה טכנולוגית: How Code Builds Your Infrastructure: An Intro to IaCדובר, אלי רוזנס, מהנדס בכיר, ניהול מוצר, EDGE בDell Technologies יום רביעי 23.4 בצהרי יום ד' החל מהשעה 12:30 באודיטוריום פסנתר. האירוע מיועד לסטודנטים מצטיינים עם ייתרת לי�...
[ לנוסח המלא ]

Blockchain networks like Bitcoin and Ethereum underpin billions in value and promise decentralized trust, yet they face critical challenges: their security depends on fragile economic incentives, their energy consumption raises sustainability concerns, and their limited computational capacity constrains scalability. In this talk, I’ll share our research on all three fronts. First, I’ll explore incentive vulnerabilities in proof of work that can disrupt participation and th...
[ לנוסח המלא ]

Identifying novel cancer drug candidates requires a comprehensive understanding of drug-induced molecular changes. This study integrates metabolomics and proteomics data with computational methods to investigate the mechanisms of action (MOA) of previously uncharacterized compounds from a large-scale, high-throughput screening experiment. Our approach systematically compares internally generated proteomic profiles with an external dataset of 875 known small molecules, employing computational ...
[ לנוסח המלא ]

At the core of practical implementations of Quantum Communication in general and in Quantum Key Distribution (QKD) in particular is the usage of photons and quantum optical devices rather than ideal qubits and qubit gates.The realistic photonic protocol, often combined with non-ideal devices, is vulnerable to various implementation attacks even when the underlying (ideal) protocol is proven secure. Our work sheds new light on the said implementation attacks using several new tools...
[ לנוסח המלא ]

הנכם מוזמנים למפגש חשיפה לתואר שני המיועד למצטייני תואר ראשון. המפגש יתקיים ביום שני ה-21.4.25 בשעה 12:30 באודיטוריום 012 (קומה 0) בפקולטה למדעי המחשב. אנא הירשמו בקישור עד ה-15.4.25...
[ לנוסח המלא ]

Nonvolatile Memory (NVM) technologies offer new avenues for building high-performance and crash-consistent applications by combining byte-addressable DRAM-like characteristics with non-volatility. However, these features introduce complex challenges in ensuring data consistency, especially under concurrent access scenarios. This paper introduces PRD, a specialized tool designed to detect persistency races - specific type of concurrency bugs in PM environments that can lead to critical...
[ לנוסח המלא ]

Submodular functions arise in various fields, including combinatorics, graph theory, information theory, and economics. This thesis addresses two key problems in submodular maximization and presents new algorithmic contributions. The first focuses on the Online Submodular Welfare problem, where bidders with submodular utility functions compete for items arriving sequentially. We propose a randomized algorithm that achieves a tight competitive ratio of 1/4 under adversarial arrivals and improv...
[ לנוסח המלא ]

In this talk, I present three research directions from my PhD. 1. Geometric Learning for Structured Data. Firstly, we introduce a simple, spectral-geometric approach for matrix completion on graphs. Our approach couples the priors implicitly induced by gradient descent with explicitly imposed spectral-geometric priors and achieves strong performance in drug-target interaction prediction and recommendation systems applications. Secondly, we introduce inductive/generalizable solvers for...
[ לנוסח המלא ]

Despite remarkable advances, visual generative models are still far from faithfully modeling the world, struggling with fundamental aspects such as spatial relations, physics, motion, and dynamic interactions. In this talk, I present a line of work that tackles these challenges, based on a deep understanding of the inner mechanisms that drive models. I will begin by analyzing state-of-the-art visual generators, gaining insights into the underlying reasons for their limited understandi...
[ לנוסח המלא ]

OMICS-based screening offers a promising approach for untargeted drug discovery. Mass-spectrometry metabolomics and proteomics were recently used for inferring drug mechanisms of action and off-target effects, analyzing the cellular response to treatment with numerous clinically approved drugs and tool compounds. In this talk, we present a novel high-throughput LC-MS metabolomics screening pipeline and a deep-learning method specifically designed for cellular metabolism. Our novel Gra...
[ לנוסח המלא ]

Nanopore sequencing is emerging as a powerful tool for storing digital information in DNA molecules. This technique offers several advantages over traditional methods, making it an attractive area of research. In this work, we focus on a simplified model of the nanopore sequencing process, represented as a channel. This channel operates by taking a DNA sequence and analyzing it one segment at a time. It uses a sliding window of a specific length, denoted by ℓ, to scan the seque...
[ לנוסח המלא ]

We consider a spatial voting model where both candidates and voters are positioned in the d-dimensional Euclidean space, and each voter ranks candidates based on their proximity to the voter's ideal point. We focus on the scenario where the given information about the locations of the voters' ideal points is incomplete; for each dimension, only an interval of possible values is known. In this context, we investigate the computational complexity of determining the possible winners unde...
[ לנוסח המלא ]

Despite huge pages dramatically reducing CPU frontend stalls from address translation, their use for executable code remains limited due to operating system constraints and impracticality of rebuilding system binaries with special alignment. Current solutions that copy code into huge pages break essential system functionality - preventing memory sharing between processes, disrupting debugging tools, and interfering with memory management operations. In this talk, I will present a prac...
[ לנוסח המלא ]

We introduce LTX-Video, a transformer-based latent diffusion model that adopts a holistic approach to video generation by seamlessly integrating the responsibilities of the Video-VAE and the denoising transformer. Unlike existing methods, which treat these components as independent, LTX-Video aims to optimize their interaction for improved efficiency and quality. At its core is a carefully designed Video-VAE that achieves a high compression ratio of 1:192, with spatiotemporal downscal...
[ לנוסח המלא ]

Proteins exist as a dynamic ensemble of multiple conformations, and these motions are often crucial for their functions. However, current structure prediction methods predominantly yield a single conformation, overlooking the conformational heterogeneity revealed by diverse experimental modalities. This work presents a framework for building experiment-grounded protein structure generative models that infer conformational ensembles consistent with measured experimental data. The key i...
[ לנוסח המלא ]

Stream frequency measurements are fundamental in many data stream applications such as financial data trackers, intrusion detection systems, and network monitoring. Count-Min Sketch and its variants have been widely adopted for this task due to their space efficiency and ability to provide approximate frequency estimates with bounded error guarantees. However, these sketches suffer from a limitation: they have a fixed memory usage determined by the desired accuracy, unable to adapt to changin...
[ לנוסח המלא ]

Surface reconstruction and shape matching are critical challenges in 3D geometry, underpinning the creation of detailed digital models and enabling the robust alignment of complex shapes - capabilities that drive advancements in computer vision, robotics, and medical imaging. In this talk, we introduce a method that leverages a novel view synthesis algorithm (3DGS) to reconstruct 3D surfaces from real-world data, outperforming existing techniques. We then tackle the challenge of analy...
[ לנוסח המלא ]

Shaping light plays a crucial role in science and technology, enabled by advancements in spatial-light modulator (SLM) technology. In this talk, we will explore two key applications: WFS microscopy for deep tissue imaging and holographic displays. In the first part, we will discuss wavefront shaping systems and how they enable deep tissue imaging by correcting aberrations caused by tissue inhomogeneity. However, estimating optimal modulations remains challenging due to unknown ti...
[ לנוסח המלא ]

The open-source community offers a vast and continually expanding array of large language models (LLMs), accompanied by diverse benchmarks to evaluate their performance. While this wealth ecosystem provides users with many models that may align with their objectives, the sheer number of options makes selection complex and time-consuming. A model may appear proficient in a given domain, yet underperform on specific instances. We introduce a straightforward, efficient, and scalable line...
[ לנוסח המלא ]

Cardiac T1 mapping is a crucial quantitative MRI technique for diagnosing diffuse myocardial diseases. Traditional methods rely on breath-hold sequences and ECG-based cardiac triggering, but these approaches face challenges with patient compliance, limiting their clinical effectiveness. Image registration can enable motion-robust T1 mapping, but intensity variations between time points complicate the process. We introduce MBSS-T1, a subject-specific self-supervised model for motion co...
[ לנוסח המלא ]

As program synthesizers become integrated into IDEs, programmers combine synthesized code and manually written code within the same project. We therefore built a Programming-by-Example (PBE) synthesizer that documents the example specifications provided to it alongside the result snippet that satisfies them. We also modified the IDE to treat these example scopes as localized tests for the code they surround, in case they or the code are edited. Unless strict limita...
[ לנוסח המלא ]

Deep neural networks are known to be susceptible to adversarial perturbations, small perturbations that alter the network's output and exist under strict norm limitations. Universal adversarial perturbations aim to alter the model's output on a set of out-of-sample data and present a more realistic use case, as awareness of the model's exact input is not required. In addition, patch adversarial attacks denote the setting where the adversarial pertubations are limited to consist of patches wit...
[ לנוסח המלא ]

Mesh realization focuses on developing algorithms for fabricating digital curved shapes in the real world. The goal is to derive a framework for realizing 3D shapes using various materials — such as wood, paper, or yarn — while keeping the process as automatic as possible and still allowing the user to make design choices. Material properties (i.e., their possible local deformations) guide the mathematical formulation of the underlying optimization problems. We focus on tw...
[ לנוסח המלא ]

In this seminar, I will discuss several fundamental challenges and limitations associated with high-perceptual-quality image restoration methods, and propose practical restoration and compression schemes. Specifically, I will first examine deterministic image restoration algorithms and show why striving for high output quality while maintaining consistency with the input measurements inevitably leads to algorithmic instability and vulnerability to adversarial attacks. Secondly, since ...
[ לנוסח המלא ]

Machine learning models play a key role for service providers looking to gain market share in consumer markets. However, traditional learning approaches do not take into account the existence of additional providers, who compete with each other for consumers. Our work aims to study learning in this market setting, as it affects providers, consumers, and the market itself. We begin by analyzing such markets through the lens of the learning objective, and show that accuracy cannot be th...
[ לנוסח המלא ]

As Moore's Law slows down, packet switch capabilities are falling behind datacenter demands. This has made optical circuit switches increasingly attractive in datacenter networks. These switches have already seen significant commercial use in the form of hybrid networks, which combine both packet switches and circuit switches. Recent advances in optical circuit switching technology can now operate fast enough to potentially fully replace packet switches, when combined with novel network desig...
[ לנוסח המלא ]

Leopold Grinberg is a Fellow Software Systems Design Engineer at Advanced Micro Devices (AMD) and an Adjunct Lecturer in Applied Mathematics at Brown University. He earned his PhD in Applied Mathematics from Brown University in 2009 and holds a master’s degree in Mechanical Engineering from Ben-Gurion University of the Negev, awarded in 2003 He focuses on High Performance Computing - systems and applications. Specifically, his current objective is to&nbs...
[ לנוסח המלא ]

מתעניינים בלימודי תואר ראשון?  מידע על מסלולי הלימוד לתואר ראשון בפקולטה ל...
[ לנוסח המלא ]

Whether secure Cryptography exists is one of the most important open problems in Computer Science: Cryptographic schemes today rely on unproven computational hardness assumption. We will survey a recent thread of work (Liu-Pass,FOCS’20, Liu-Pass-STOC'21,.., Ball-Liu-Pass-Mazor, FOCS’23, Liu-Pass’EUROCRYPTO’24) showing *equivalences* between the existence of some of the most basic cryptographic primitives, and the hardness of various computational problems relat...
[ לנוסח המלא ]

We propose an efficient pipeline to register, detect, and analyze changes in 3D models of coral reefs captured over time. Corals have complex structures with intricate geometric features at multiple scales. 3D reconstructions of corals (e.g., using Pho- togrammetry) are represented by dense triangle meshes with millions of vertices. Hence, identifying correspondences quickly using conventional state-of-the-art algorithms is challenging. To address this gap we employ the Globally Optimal Itera...
[ לנוסח המלא ]

תקציר:...
[ לנוסח המלא ]

Shape interpolation is essential in graphics and geometry processing. For instance, smoothly transitioning between two poses of the same shape is crucial for animation, while morphing multiple shapes helps with design exploration. Since the blended shapes often differ, some distortion is unavoidable. We introduce an interpolation method for planar shapes based on logarithmic metric blending. Our approach extends previous work on pullback metrics, enabling the use of various techniques...
[ לנוסח המלא ]

Adversarial training aims to defend against adversaries - malicious opponents aiming to harm predictive performance in any way possible. This strict perspective can result in overly conservative training. As an alternative, we propose modeling opponents as pursuing their own goals rather than working directly against the classifier. Employing tools from strategic modeling, our approach incorporates knowledge of the opponent's potential incentives as inductive bias for learning. We propose a m...
[ לנוסח המלא ]

A myriad of authentication mechanisms embody a continuous evolution from verbal passwords in ancient times to contemporary multi-factor authentication: Cryptocurrency wallets advanced from a single signing key to using a handful of well-kept credentials, and for online services, the infamous “security questions” were all but abandoned. Nevertheless, digital asset heists and numerous identity theft cases illustrate the urgent need to revisit the fundamentals of user authentication....
[ לנוסח המלא ]

In the field of video compression, the pursuit for better quality at lower bit rates remains a long-lasting goal. Recent developments have demonstrated the potential of Implicit Neural Representation (INR) as a promising alternative to traditional transform-based methodologies. Video INRs can be roughly divided into frame-wise and pixel-wise methods according to the structure the network outputs. While the pixel-based methods are better for upsampling and parallelization, frame-wise methods d...
[ לנוסח המלא ]

A myriad of authentication mechanisms embody a continuous evolution from verbal passwords in ancient times to contemporary multi-factor authentication: Cryptocurrency wallets advanced from a single signing key to using a handful of well-kept credentials, and for online services, the infamous “security questions” were all but abandoned. Nevertheless, digital asset heists and numerous identity theft cases illustrate the urgent need to revisit the fundamentals of user authentication....
[ לנוסח המלא ]

The extraction of neural networks poses a significant challenge to the security and intellectual property of AI models, enabling adversaries to recreate proprietary architectures, breach confidentiality, and exploit model functionality. In this seminar talk, I will introduce a novel attack that reconstructs both the structure and exact parameters of black-box convolutional neural networks (CNNs), using only query-based access. This technique is the first to recover the precise weight values a...
[ לנוסח המלא ]

Labeling schemes are a prevalent paradigm in various computing settings. In such schemes, an oracle is given an input graph and produces a label for each of its nodes, enabling the labels to be used for various tasks. In this talk, I will address the question of what happens in a labeling scheme if some labels are erased, e.g., due to communication loss with the oracle or hardware errors. I will present a new resilient labeling scheme which improves upon the state of the art in several comput...
[ לנוסח המלא ]

In the age of abundant data, deep learning has emerged as a leading tool for predictive tasks, consistently setting new benchmarks in areas such as computer vision. One such task is 3D Object Detection (3DOD), where the goal is to estimate the locations of objects within a 3D space using inputs like RGB images and LiDAR point clouds. This task is crucial for applications in advanced driver-assistance systems, autonomous vehicles, and robotic navigation. Despite the promise of deep learning, t...
[ לנוסח המלא ]

Property Directed Reachability (Pdr), also known as IC3, is a state-of-the-art model checking algorithm widely used for verifying safety properties. While Pdr is effective in finding inductive invariants, its underlying proof system, Resolution, limits its ability to construct short proofs for certain verification problems. In this talk we present PdrER, a generalization of Pdr that uses Extended Resolution (ER), a proof system exponentially stronger than Resolution. Using a strong pr...
[ לנוסח המלא ]

Edge computing extends cloud capabilities to the proximity of end-users, offering ultra-low latency, which is essential for real-time applications. Unlike traditional cloud systems that suffer from latency and reliability constraints due to distant datacenters, edge computing employs a distributed model, leveraging local edge datacenters to process and store data. This talk explores key challenges in edge computing across three domains: workloads, storage, and service allocation. ...
[ לנוסח המלא ]

אנו שמחים להזמינכם לכנס Tech.AI Robotics– אשר יתקיים ב-5 בפברואר 2025 ויעסוק בצומת הקריטי שבין בינה מלאכותית ורובוטיקה: ממערכות ביתיות חכמות למכוניות אוטונומיות, פסי ייצור מתקדמים וניתוחים רפואיים - הטכנולוגיות הללו מחוללות מהפכה �...
[ לנוסח המלא ]

We study budgeted variants of the well known Matching, Matroid Independent Set, and Matroid Intersection problems. While the three problems admit polynomial-time approximation schemes (PTAS) [Berger et al. (Math. Programming, 2011), Chekuri, Vondrak and Zenklusen (SODA 2011)], it has been an intriguing open question whether these problems admit a Fully PTAS (FPTAS), or even an Efficient PTAS (EPTAS). In this work, we show that the three problems admit an EPTAS. On the other hand, we ...
[ לנוסח המלא ]

Estimating the second frequency moment of a stream up to (1 ± ε) multiplicative error requires at most O(log n / ε²) bits of space, due to a seminal result of Alon, Matias, and Szegedy. It is also known that at least Ω(log n + 1/ε²) space is needed. We prove a tight lower bound of Ω(log(nε²) / ε²) for all ε = Ω(1/√n). Notably, when ε > n^(-1/2 + c), where c > 0, our...
[ לנוסח המלא ]

הפקולטה למדעי המחשב מזמינה אתכם לאירוע ייעודי לסטודנטים לתארים מתקדמים של חברת  StarkWare מהמובילות בתחום טכנולוגיות הבלוקצ'יין - "Engineering the Future of Blockchain" יום רביעי הקרוב צה"ד , 29.01.25, בשעה 12:30, באודיטוריום פסנתר (שימו לב לשינוי במיקום ההרצאה). מה בתכ�...
[ לנוסח המלא ]

 Over the past decade, an increasing number of systems and devices have gained Internet connectivity and been enhanced with sensing capabilities and AI. While these advancements have created a world of smarter, more automated, and highly connected devices, they have also introduced significant security and privacy challenges that cannot be effectively addressed with traditional countermeasures. In the first part of this talk, we will explore the security and privacy concerns of c...
[ לנוסח המלא ]

Over the past decade, several studies have shown that DNA-based storage systems can potentially become the standard for data archival due to their high data density and durability. However, the current bottleneck involves the synthesis and sequencing costs, along with a lack of coding solutions to address the unique error characteristics of DNA-based systems. This work tackles multiple challenges that hinder the practical implementation of DNA storage. First, we explore theoretical as...
[ לנוסח המלא ]

Geometric data and signal processing have made remarkable progress in recent years, and the advent of modern AI tools promises an even brighter future. Many classical and contemporary methods, however, use vast amounts of data, substantial processing power, and considerable natural resources to achieve their results. These approaches can be expensive, environmentally harmful, and ultimately unsustainable. This talk explores efforts to do more with less in geometry processing by ensuring that ...
[ לנוסח המלא ]

Image generative models are advancing rapidly, producing images of remarkable realism and fidelity. However, existing models often lack precise control over the generated content, limiting their image editing capabilities and the integration of real content into synthesized imagery. In this talk, I will demonstrate how a deep understanding of the inner mechanisms of large-scale pretrained generative models enables the design of powerful techniques for a variety of image manipulation tasks. By...
[ לנוסח המלא ]

In a recent work, Cormode, Dall'Agnol, Gur and Hickey (CCC, 2024) introduced the model of Zero-Knowledge Streaming Interactive Proofs (zkSIPs). Loosely speaking, such proof-systems enable a prover to convince a streaming verifier that the input x, to which it has read-once streaming access, satisfies some property, in such a way that nothing beyond the correctness of the claim is revealed. Cormode et al. also gave constructions of zkSIPs to some specific and notable p...
[ לנוסח המלא ]

המהפכה של הבינה המלאכותית מתרחבת מעולם הענן הישר למחשבים האישיים שלנו, ואתם מוזמנים להצטרף לסדנה מעשית בת 3 שעות בה תוכלו לחוות את ההתקדמות והיכולות האחרונות...
[ לנוסח המלא ]

How can we trust the correctness of a learned model on a particular input of interest? Model accuracy is typically measured on average over a distribution of inputs, giving no guarantee for any specific input. This talk introduces Self-Proving models, a new class of models that formally prove the correctness of their outputs via an Interactive Proof system. We will formally define Self-Proving models and their per-input (worst-case) guarantees. We will then present algorithms for learning the...
[ לנוסח המלא ]

Digital pathology has emerged as a transformative field, enabling automated imaging and computational analysis of thin tissue biopsy slices or body fluids. These samples are typically stained to enhance contrast in biological structures and reveal their morphology under microscopic magnification. Digitally scanning these stained samples produces gigapixel-scale images, known as whole slide images (WSIs), which pose significant challenges for computational analysis using deep learning techniqu...
[ לנוסח המלא ]

Language models (LMs) are increasingly used to assist users in day to day tasks such as programming (Github Copilot) or search (Google's AI Overviews). But can we build language model systems that are able to autonomously complete entire tasks end-to-end? In this talk I'll discuss our efforts to build autonomous LM systems, focusing on the software engineering domain. I'll present SWE-bench, our novel method for measuring the performance of automatic programming systems on their abilities to ...
[ לנוסח המלא ]

ממשיכים במרתון סדנאות הקריירה! אחרי שהכרתם את סוגי המשרות הקיימות, הגיע הזמן לשדרג את קורות החיים שלכם.אנו מזמינים אתכם לסדנת הקו"ח הראשון שלי – איך הופכים דף ריק להזדמנות בהנחיית בר יעקבי, בוגרת הפקולטה יום שלישי, 21.1, החל מהשעה 17:30 בטאוב 33...
[ לנוסח המלא ]

Image generative models are advancing rapidly, producing images of remarkable realism and fidelity. However, existing models often lack precise control over the generated content, limiting their image editing capabilities and the integration of real content into synthesized imagery. In this talk, I will demonstrate how a deep understanding of the inner mechanisms of large-scale pretrained generative models enables the design of powerful techniques for a variety of image manipulation tasks. By...
[ לנוסח המלא ]

In this talk, I present an approach for interpreting the internal computation in deep vision models. I show that these interpretations can be used to detect model bugs and to improve the performance of pre-trained deep neural networks (e.g., reducing hallucinations from image captioners and detecting and removing spurious correlations in CLIP) without any additional training. Moreover, the obtained understanding of deep representations can unlock new model capabilities (e.g., novel identity e...
[ לנוסח המלא ]

When learning is used to inform decisions about humans, such as for loans, hiring, or admissions, this can incentivize users to strategically modify their features to obtain positive predictions. A key assumption is that modifications are costly, and are governed by a cost function that is exogenous and predetermined. We challenge this assumption, and assert that the deployment of a classifier is what creates costs. Our idea is simple: when users seek positive predictions, this creates d...
[ לנוסח המלא ]

Constraint satisfaction problems (CSPs in short) are among the most important computational problems studied in TCS. This talk will focus on a recent line of study addressing the complexity of approximating satisfiable instances of CSPs, and  connections of this study to multi-player parallel repetition theorems, property testing and extremal combinatorics. Based mostly on joint works with Amey Bhangale, Subhash Khot and Yang P. Liu....
[ לנוסח המלא ]

Deduplication is widely utilized in many modern large scale storage systems and provide an effective solution for both secondary and primary storage. Therefore, there is a rising need for deduplication storage to support advanced features such as data indexing for information retrieval. To our knowledge, no indexing solution for deduplicated storage utilizes the deduplication and current indexing methods process duplicates. In this work, we propose IDEA, Inverted Dedupl...
[ לנוסח המלא ]

חברת פיינאל מגיעה לפקולטה ליום זרקור והרצאה טכנולוגיתיום רביעי הבא 15/1 בצה"ד החל מהשעה 12:30 בטאוב מחפשים את הצעד הבא שלכם? רוצים לשמוע על אלגו-טריידינג, אופציות והסתברויות?חברת פיינאל מגיעה עם צוותי גיוס ומהנדסים שיספרו לכם הכול – מקריירה ועד טכנ�...
[ לנוסח המלא ]

Tuesday, January 14, 2025 at 11:30Meyer Building Room 1061 & Zoom This talk will explore advances in 3D scene reconstruction, focusing on approaches ...
[ לנוסח המלא ]

Computational analogs of information-theoretic notions have given rise to some of the most intriguing phenomena in theoretical computer science. For example, pseudorandomness allows us to bypass Shannon's lower bounds on the key length of encryption schemes. Moreover, computational analogs of entropy and randomness are key tools in the construction of pseudorandom generators and have become foundational concepts in complexity theory and cryptography.One such computational analog is time-b...
[ לנוסח המלא ]

זה הזמן לקחת את הקריירה שלכם צעד קדימה! מרתון קריירה יוצא לדרך, ואתם מוזמנים למפגש הראשון שלנו – סדנת חשיפה למשרות בתעשייה - עושים סדר בBuzz Words -יום שני, 13.1, בשעה 17:30 באודיטוריום פסנתר רוצים להבין מה עומד מאחורי הטייטלים הנחשקים בתעשייה?...
[ לנוסח המלא ]

מוזמנים לערב  "מחקר על הבר" - שלושה חברי סגל בהרצאות TED בגובה העיניים.  אל תפספסו את ההזדמנות להכיר את החוקרים וקבוצות המחקר החדשות, באווירה פתוחה עם בירות ונשנושים.  יום רביעי, 8/1 החל מהשעה 18:30 בטאוב 2. ד"ר ברית יונגמן - שים מבטחך בנתונים...
[ לנוסח המלא ]

The Huge Object model is a distribution testing model in which we are given access to independent samples from an unknown distribution over the set of strings {0,1}^n, but are only allowed to query a few bits from the samples. We investigate the problem of testing whether a distribution is supported on m elements in this model. It turns out that the behavior of this property is surprisingly intricate, especially when also considering the question of adaptivity. We prove lower and upper bounds...
[ לנוסח המלא ]

Join us for our Internship Spotlight Day, where we’ll introduce the TII AI/IR Research Center recently established in Haifa, discuss our work in Generative AI and share details about our 2025 Internship Program. Date: Wednesday, January 8 Time: 12:30–14:15 Agenda: 12:30-13:00: Get-together 13:00-13:50 : Introduction & Tech Talk &...
[ לנוסח המלא ]

בואו להיות חלק מקבוצת Capture The Flag-CTF של הטכניון!  והשבוע: הרצאת אורח בנושא אבטחת בינה מלאכותית! Building and Breaking AI Security בהנחיית עמית לוי ורום הימלשטיין – חוקרי אבטחת AI בטכניון “The Model They Told You Not to Worry About” איך חולשות במודלים של שפה עלולות לגרום לקריסת מערכות ...
[ לנוסח המלא ]

Developing better Language Models would benefit a myriad of communities. However, it is prohibitively costly. The talk would describe collaborative approaches to pretraining such as model merging, allowing combining several specialized models into one. Then introduce efficient evaluation to reduce overheads and touch on other accessible and collaborative aspects that best harness the expertise and diversity in Academia....
[ לנוסח המלא ]

Classical shape descriptors such as Heat Kernel Signature (HKS), Wave Kernel Signature (WKS), and Signature of Histograms of Orientations (SHOT), while widely used in shape analysis, exhibit sensitivity to mesh connectivity, sampling patterns, and topological noise. While differential geometry offers a promising alternative through its theory of differential invariants, which are theoretically guaranteed to be robust shape descriptors, the computation of these invariants on discrete m...
[ לנוסח המלא ]

Generative models, such as ChatGPT and DALL-E, are used by millions of people daily for tasks ranging from programming and content creation to resume filtering. These models often create the impression of being “intelligent,” which can incentivize careless use in critical applications. While generative models are empowering, they appear to be black boxes, and their misuse can result in harmful or unlawful outcomes. In this talk, I will present algorithms and tools for diss...
[ לנוסח המלא ]

Artificial intelligence (AI) offers immense potential to accelerate scientific discoveries crucial for combating climate change. However, this powerful tool comes with a significant environmental cost due to its substantial energy consumption and carbon emissions. This talk explores the research challenge of harnessing AI's capabilities while minimizing its ecological footprint. Bio: Dr. Tamar Eilam is an IBM Fellow and Chief Scientist for Sustainable Computing i...
[ לנוסח המלא ]

We explore the framework of contract design through a computational perspective. Contract design is a fundamental pillar of microeconomics, addressing the essential question of how to incentivize people to work. The significance of contract design was acknowledged by the Nobel Prize awarded to Hart and Holmström, and it applies to various real-life scenarios, such as determining bonuses for employees, setting commission structures for sales representatives, and designing payment schemes ...
[ לנוסח המלא ]