Skip to content (access key 's')
Logo of Technion
Logo of CS Department
Logo of CS4People
Events

The Taub Faculty of Computer Science Events and Talks

Early Time Classification with Accumulated Accuracy Gap Control
event speaker icon
Liran Ringel
event date icon
Tuesday, 05.03.2024, 15:00
event location icon
Zoom Lecture:96835343656 and Taub 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 classifi...
[ Full version ]

CS RESEARCH DAY 2024
event date icon
Wednesday, 03.04.2024, 12:30
event location icon
CS Taub Lobby
The 12th CS Research Day for graduate studies will be held on Wednesday, April 03, 2024 between 12:30-14:30, at the lobby of the CS Taub Building. Research Day events are opportunity for our graduate students to expose their researches using posters and presentations to CS faculty and all degrees students, Technion distinguished representatives and to high-ranking delegates from the hi-tech leading industry companies in Israel and abroad. The participating researches will be on...
[ Full version ]

Stable Tuple Embeddings for Dynamic Databases
event speaker icon
Neta Friedman
event date icon
Thursday, 29.02.2024, 15:00
event location icon
Zoom Lecture: 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 chall...
[ Full version ]

Spotlight Day For Nvidia At The Technion
event date icon
Wednesday, 28.02.2024, 12:30
event location icon
CS Taub Lobby
Spotlight day for Nvidia at the Technion on February 28, 2024 Nvidia is coming to meet the students of the Faculty of Computer Science at the Technion! Come and meet the company's engineers face to face Wednesday February 28, 2024 | 12:30-14:30 | Taub lobby, floor 0...
[ Full version ]

Distance Sensitivity Oracles
event speaker icon
Sarel Cohen (Tel-Aviv Academic College)
event date icon
Wednesday, 28.02.2024, 12:15
event location icon
Taub 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. Th...
[ Full version ]

TDC Seminar: Fast and Fair Lock-Free Locks
event speaker icon
Naama Ben-David, Technion
event date icon
Monday, 26.02.2024, 13:30
event location icon
Zisapel (ECE) 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 ...
[ Full version ]

Fundamental Problems in AI: Transferability, Compressibility and Generalization
event speaker icon
Tomer Galanti
event date icon
Thursday, 22.02.2024, 15:00
event location icon
Zoom Lecture:9316005503 Passcode: 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 expl...
[ Full version ]

Theory and Practice of DNA Storage
event speaker icon
Daniella Bar-Lev
event date icon
Wednesday, 21.02.2024, 17:00
event location icon
Zoom Lecture: 92916633492 and Taub 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 st...
[ Full version ]

Identifying Underlying Geometry To Analyze High-Dimensional Data: Images And Shape Spaces As A Case Study
event speaker icon
Shira Faigenbaum-Golovin
event date icon
Wednesday, 21.02.2024, 15:00
event location icon
Zoom Lecture:93613579310 Passcode: 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, particul...
[ Full version ]

Theory Seminar: IOPs with Inverse Polynomial Soundness Error
event speaker icon
Gal Arnon (Weizmann institute)
event date icon
Wednesday, 21.02.2024, 12:15
event location icon
Taub 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 conjec...
[ Full version ]

TDC Seminar: Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
event speaker icon
Yuval Gil, Technion
event date icon
Monday, 19.02.2024, 13:30
event location icon
Zisapel (ECE) 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...
[ Full version ]

A Deep Learning Platform for Diagnosing ECG Tests
event speaker icon
Idan Levy
event date icon
Thursday, 15.02.2024, 11:00
event location icon
Zoom Lecture: Link and Taub 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 objectiv...
[ Full version ]

Theory Seminar: Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
event speaker icon
Idan Mehalel (Technion)
event date icon
Wednesday, 14.02.2024, 12:15
event location icon
Taub 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...
[ Full version ]

ceClub: Space-efficient FTL for Mobile Storage via Tiny Neural Nets
event speaker icon
Ron Marcus
event date icon
Wednesday, 14.02.2024, 11:30
event location icon
Meyer 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...
[ Full version ]

Technion CTF Team
event date icon
Tuesday, 13.02.2024, 18:30
event location icon
Taub 2
Come be part of a new Capture The Flag-CTF group at the Faculty The meetings are held every Tuesday at 18:30 at Taub 9 and include guest lectures and practical experience in solving challenges. Everybody is invited! Beginners and experienced For details: Technionctf.com This week - February 13, 2024: 18:30 | Taub 2 | Omar Atias - security researcher, lecturer at BlackHat USA & DEFCON The price of con...
[ Full version ]

A 0-RTT-Aware QUIC Load Balancer
event speaker icon
Robert Shahla
event date icon
Monday, 12.02.2024, 12:00
event location icon
Zoom Lecture: 97318309550 and Taub 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-wor...
[ Full version ]

Final Spotlight Day
event date icon
Wednesday, 07.02.2024, 12:30
event location icon
Auditorium 012, floor 0
You are invited to Final spotlight day Wednesday 07.02.2024 | 12:30-14:30 | Visitor Center Auditorium 012, Floor 0 12:30 - Come meet engineers, researchers and the recruitment team at Final, and get to know the day-to-day life at Final. 13:15 - Meeting on options, probabilities and the world of algorithm trading | Noam Horowitz - researcher at Final To register for the lecture click ...
[ Full version ]

Theory Seminar: Algorithmic Cheap Talk
event speaker icon
Konstantin Zabaranyi (Technion)
event date icon
Wednesday, 07.02.2024, 12:15
event location icon
Taub 201
Come be part of a new Capture The Flag-CTF group at the Faculty The meetings are held every Tuesday at 18:30 at Taub 9 and include guest lectures and practical experience in solving challenges. Everybody is invited! Beginners and experienced For details: Technionctf.com The week of February 6, 2024: Beginners: Forensics & Networks | Taub 9 experienced: Challenges from 2023 LA CTF | Tau...
[ Full version ]

Technion CTF Team
event date icon
Tuesday, 06.02.2024, 18:30
event location icon
Taub 9
Come be part of a new Capture The Flag-CTF group at the Faculty The meetings are held every Tuesday at 18:30 at Taub 9 and include guest lectures and practical experience in solving challenges. Everybody is invited! Beginners and experienced For details: Technionctf.com The week of February 6, 2024: Beginners: Forensics & Networks | Taub 9 experienced: Challenges from 2023 LA CTF | Taub 8...
[ Full version ]

Constrictor: Immutability as a Design Concept
event speaker icon
Elad Kinsbruner
event date icon
Tuesday, 06.02.2024, 12:30
event location icon
Taub 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 mutat...
[ Full version ]

Pixel-Club: Robustified ANNs Reveal Wormholes Between Human Category Percepts
event speaker icon
Guy Gaziv (DiCarlo Lab at MIT)
event date icon
Tuesday, 06.02.2024, 11:30
event location icon
Room 1061, EE Meyer Building
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 mo...
[ Full version ]

Theory Of Crypto Seminar: Perfect Asynchronous MPC with Linear Communication Overhead
event speaker icon
Gilad Asharov (Bar Ilan University)
event date icon
Thursday, 01.02.2024, 11:30
event location icon
Taub 401
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...
[ Full version ]

Almost Logarithmic Approximation for Cutwidth and Pathwidth
event speaker icon
Dor Katzelnick
event date icon
Wednesday, 31.01.2024, 12:30
event location icon
Taub 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 ...
[ Full version ]

Theory Seminar: Almost Logarithmic Approximation for Cutwidth and Pathwidth
event speaker icon
Dor Katzelnick (Technion)
event date icon
Wednesday, 31.01.2024, 12:15
event location icon
Taub 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 ...
[ Full version ]

ceClub: Challenges and Opportunities In Securing Software Supply Chains
event speaker icon
Dr. Yaniv David (Columbia University)
event date icon
Wednesday, 31.01.2024, 11:30
event location icon
Meyer 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. Atta...
[ Full version ]

CS Lecture: On Implicit Bias and Benign Overfitting in Neural Networks
event speaker icon
Gal Vardi
event date icon
Wednesday, 31.01.2024, 10:30
event location icon
Taub 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 con...
[ Full version ]

Diffusion Lens: Interpreting Text Encoders in Text-to-Image Pipelines
event speaker icon
Michael Toker
event date icon
Monday, 29.01.2024, 15:30
event location icon
Taub 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 build...
[ Full version ]

CS Lecture: Verification of Complex Hyperproperties
event speaker icon
Hadar Frenkel
event date icon
Sunday, 28.01.2024, 10:30
event location icon
Auditorium 012, floor 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) providin...
[ Full version ]

Theory Seminar: The Sample Complexity Of ERMs In Stochastic Convex Optimization
event speaker icon
Daniel Carmon (Technion)
event date icon
Wednesday, 24.01.2024, 12:15
event location icon
Taub 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 accurac...
[ Full version ]

The Technion CTF Team opens at the Faculty
event date icon
Tuesday, 23.01.2024, 18:30
event location icon
Taub 9
The Technion CTF Team opens at the Faculty We invite you to join the Capture The Flag - CTF meetings. CTF is a cyber challenge competition and information security on the topics: cryptography, reverse engineering, forensics, web, etc. The meetings will include guest lectures and practical experience in solving challenges. Beginner and experienced students are welcome to join. The first introductory meeting will be held on Tuesday, January 23 at 6:30 pm at Taub 9. In the f...
[ Full version ]

CGGC Seminar: Poisson Manifold Reconstruction (beyond co-dimension one)
event speaker icon
Prof. Misha Kazhdan (Computer Science, Johns Hopkins University)
event date icon
Thursday, 18.01.2024, 11:30
event location icon
Taub 012 (Learning Center Auditorium)
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 hierarc...
[ Full version ]

Theory Seminar: Online edge coloring
event speaker icon
David Wajc (Technion)
event date icon
Wednesday, 17.01.2024, 12:15
event location icon
Taub 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 ...
[ Full version ]

Internet-Scale Consensus in the Blockchain Era
event speaker icon
Joachim Neu
event date icon
Tuesday, 16.01.2024, 11:00
event location icon
Taub 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 ...
[ Full version ]

12-Lead ECG Classification Using Deep Learning Methods
event speaker icon
Vadim Gliner
event date icon
Thursday, 04.01.2024, 12:30
event location icon
Faculty of Biomedical Engineering, Silver Building, Room 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 p...
[ Full version ]

CS Lecture: Learning From Dependent Data And Its Modeling Through The Ising Model
event speaker icon
Yuval Dagan
event date icon
Monday, 01.01.2024, 10:30
event location icon
Auditorium 012, floor 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 o...
[ Full version ]