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

Colloquia and Seminars

To join the email distribution list of the cs colloquia, please visit the list subscription page.

Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.
Academic Calendar at Technion site.

Upcoming Colloquia & Seminars

event head separator Serving-Time Platform for Mechanistic Interpretability Apps
event speaker icon
Michael Blum (M.Sc. Thesis Seminar)
event date icon
Monday, 23.11.2026, 12:30
event location icon

Zissapel 506 & Zoom

event speaker icon
Advisor:  Prof. Mark Silberstein, Dr. Yaniv David

Mechanistic interpretability (MI) enables monitoring and steering LLMs by
operating on their internal state during inference. MI applications
remain difficult to develop, expensive to execute, and challenging to manage
at runtime.

We present xMIx, a system that integrates MI applications as
first-class components of LLM serving, enabling simplified development,
efficient execution, and flexible deployment. Guided by a comprehensive
analysis of modern MI applications, xMIx streamlines the MI apps
development via a simple Python-based Domain Specific Language (DSL) for
accessing intra- and inter-layer runtime model state at well-defined trigger
points during inference. xMIx enables efficient access to ephemeral attention
scores via a novel FlashInspect kernel that retains the performance benefits of
FlashAttention.

xMIx's compiler integrates multiple MI applications into the performance-optimized inference execution flow while ensuring conflict-free coexistence. xMIx's
runtime supports dynamic, per-request activation and deactivation of MI apps
without service interruption or performance degradation when inactive,
leveraging xMIx' dynamic memory management and CUDA graph-compatible
execution.

We integrate xMIx with vLLM and evaluate ten MI apps, including sparse
autoencoders, steering, and jailbreak detection, across four
state-of-the-art LLMs. xMIx incurs negligible execution overhead, up to two
orders of magnitude lower than existing frameworks, while enabling per-request
activation and deactivation up to 1,000 times faster than alternatives.
These results demonstrate that xMIx makes MI applications practical for
deployment in production LLM serving systems.

event head separator Stress-Testing Causal Claims via Cardinality Repairs
event speaker icon
Yarden Gabbay (M.Sc. Thesis Seminar)
event date icon
Thursday, 26.11.2026, 09:30
event location icon

Taub 601

event speaker icon
Advisor:  Dr. Brit Youngmann

Decisions in healthcare, public policy, economics, and many other fields often rest on causal conclusions drawn from observational data. These conclusions can be surprisingly fragile: ordinary data problems such as duplicate records, entry mistakes, or corrupted subsets can substantially change, or even reverse, an estimated causal effect. This raises a basic question: how robust is a causal claim to small, targeted changes in the data? We address this question through the lens of cardinality repairs and introduce SubCure, a framework for auditing causal robustness. Given a causal query and a desired range for the estimated effect, SubCure finds a small set of records, or a compact subpopulation described by attribute-value predicates, whose removal moves the estimate into that range. The size of this repair is an intuitive, data-centric, model-agnostic measure of how fragile a conclusion is. The removed data reveals which parts of the dataset are responsible for the observed effect. We formalize the problem for both individual records and subpopulations. To handle large datasets, we design scalable search algorithms that update causal estimates incrementally, rather than recomputing them from scratch after every deletion. Experiments on four real-world datasets and a synthetic benchmark show that SubCure finds smaller and more influential subsets than eight baseline methods, scales to datasets with millions of records, and exposes vulnerabilities that traditional sensitivity analyses miss.

event head separator X-Basis Initialization in Compressed QAOA: From Random Ensembles to Structured Selection
event speaker icon
Abed Semre (M.Sc. Thesis Seminar)
event date icon
Sunday, 29.11.2026, 14:00
event location icon

Taub 401

event speaker icon
Advisor:  Prof. Steven Frankel

The Quantum Approximate Optimization Algorithm (QAOA) offers a variational approach to combinatorial optimization. When combined with quantum random access code (QRAC) compression, the quality of classical solutions depends not only on the optimized quantum energy but also on the initial state and the decoding procedure.

In this seminar, we investigate SEMI-QAOA, a family of compressed QAOA algorithms initialized in tensor products of X-basis eigenstates, with corresponding state-dependent mixers. We first introduce Rand-SEMI-QAOA, which explores ensembles of randomly selected initialization masks, demonstrating substantial improvements in decoded MaxCut performance over conventional initialization.

We then investigate structured approaches that select a single initialization mask before variational angle optimization, reducing the need to optimize large ensembles of quantum circuits. We establish theoretical separations showing that conventional initialization can suffer from persistent decoding obstructions, while suitable X-basis masks overcome these limitations, even at shallow circuit depth.

Finally, we present numerical comparisons across combinatorial optimization problems, examining solution quality, computational requirements, and the relationship between quantum energy optimization and classical decoding performance. The results highlight initialization-mask selection as an important algorithmic component of compressed quantum optimization.

event head separator Beyond the Screen: Open Theoretical and Algorithmic Frontiers in Physical AI
event speaker icon
Guy Altagar (Head of Physical AI at the Israeli National AI Directorate)
event date icon
Tuesday, 01.12.2026, 14:30
event location icon

Taub 337 

While digital AI and large multimodal models have achieved massive scaling laws in virtual spaces, grounding artificial intelligence in the unstructured, non-deterministic physical world exposes severe foundational bottlenecks. Physical AI -the synthesis of embodied robotics, multi-modal perception, foundation world models, and real-time control- cannot rely merely on scaling compute or self-supervised text scraping. The transition to embodied agents operating safely at human-level dexterity and situational reasoning presents acute open problems: closing the sim-to-real gap, formulating verifiable neural world models, scaling physics-grounded reinforcement learning under sparse supervision, and developing low-latency edge inference capable of deterministic safety guarantees.

This talk bypasses off-the-shelf industrial deployments to outline the critical scientific and algorithmic roadblocks where industry and public frameworks stall without academic intervention. We will dissect the open research questions Israel must tackle to pioneer embodied autonomy: How do we construct mathematically rigorous bounds for agent safety in unstructured physical environments? What new paradigms in spatial reasoning and tactile-proprioceptive sensor fusion can replace sample-inefficient learning?

Short bio: Guy Altagar is the Vice President and Head of Physical AI at the Israeli National AI Directorate within the Prime Minister's Office, where he leads national strategy, infrastructure development, and R&D testbed initiatives for embodied artificial intelligence and robotics. Prior to his government role, he was the founder and Chief Executive Officer of Unlimited Robotics, leading the development of autonomous service robot platforms and software operating systems for embodied devices. With an interdisciplinary background spanning deep-tech entrepreneurship, engineering leadership, and law, Guy works closely with academic research institutions, government bodies, and international industry leaders to accelerate national-scale computing infrastructure, physical test environments, and cross-disciplinary research in physical autonomy.

event head separator The Formal Verification AI Flywheel: From Productivity at Scale to Proof Power
event speaker icon
Ziyad Hanna (Cadence)
event date icon
Tuesday, 08.12.2026, 14:30
event location icon

Taub 337

AI is driving unprecedented growth in data center compute, with the market projected to approach $2 trillion by 2030 and revenue growth averaging approximately 24% annually from 2025 to 2030. As AI adoption progresses from infrastructure and physical systems to scientific discovery, it is creating a major opportunity for verification and in particular formal verification - the crown of design. Natural-language interfaces and AI-driven productivity are introducing a new level of abstraction, while emerging examples of AI-assisted mathematical reasoning demonstrate the potential to extend scientific and engineering capabilities.

This keynote traces the evolution from the man–machine communication vision presented at DAC 1964, through collective intelligence and human-in-the-loop formal methods presented at JUG 2013, to today’s agentic verification workflows in Cadence ChipStack. These workflows combine specialized formal agents, proof engines, machine learning, and expert guidance to address properties that remain difficult to prove manually. By interleaving design and verification, and using platforms such as Cadence ChipStack, the Formal Verification AI Flywheel can transform productivity at scale into greater proof power, enabling engineers to build increasingly complex systems with higher confidence and much less manual effort.

Short bio:  Ziyad Hanna is a Corporate Vice President at Cadence Design Systems and R&D General Manager of Cadence Israel. He leads system verification products and Cadence-wide AI initiatives for autonomous chip-design development. Previously, he served as Senior Vice President of Jasper and senior PE and management roles at Intel, where he developed three generations of formal-verification suites widely deployed since the start of Pentium. Hanna earned degrees from Tel Aviv University and a PhD from Oxford University, where he is a visiting professor. An IEEE Senior Member, he has published over 30 articles, 20 patents, and delivered hundreds of industrial and academic presentations and talks. His honors include Intel IAA awards and an honorary doctorate from Ruppin Collage. Ziyad initiated a formal-verification course at the Technion that attracts hundreds of students interested in pursuing advanced studies in the field.

event head separator On codes for DNA storage and families of covering codes
event speaker icon
Avital Boruchovski (Ph.D. Thesis Seminar)
event date icon
Sunday, 13.12.2026, 14:30
event location icon

Taub 601

event speaker icon
Advisor:  Prof. Eitan Yaakobi

Synthetic deoxyribonucleic acid (DNA) has emerged as a promising archival storage medium due to its extraordinary information density and multi-century stability. However, the biochemical processes of DNA synthesis and sequencing introduce fundamental coding-theoretic and algorithmic bottlenecks—most notably the lack of spatial ordering among stored strands, high sequencing coverage overhead, and synchronization (insertion and deletion) errors. In this talk, I will present the main contributions of my PhD research, focusing primarily on coding schemes and algorithms designed to overcome these challenges across the DNA data storage pipeline:

End-to-End Error Correction: Introducing DNA-correcting codes, which replace the traditional decoupled pipeline of clustering, trace reconstruction, and decoding with a unified coding framework that guarantees unambiguous end-to-end recovery.

Random Access Coverage Depth: Minimizing the expected number of sequencing reads needed to retrieve a single designated information strand—resolving the $k=2$ case completely and constructing recovery-complete codes that improve upon state-of-the-art bounds for general $k$.

Synchronization Errors: Developing black-box algorithmic reductions that transform off-the-shelf deletion decoders into general insertion–deletion decoders, alongside linear-time, constant-space algebraic decoders for two-dimensional Reed–Solomon codes.

I will conclude with a brief overview of the second part of my dissertation, which investigates combinatorial and extremal problems in covering codes, including binary nearly perfect $1$-covering codes, pair-covering codes, and all-symbol PIR and batch codes.

event head separator Efficient Visual Learning under Annotation and Computation Constraints
event speaker icon
Moshe Kimhi (Ph.D. Thesis Seminar)
event date icon
Wednesday, 23.12.2026, 12:00
event location icon

Taub 601 & Zoom

event speaker icon
Advisor:  Prof. Ehud Rivlin, Dr. Chaim Baskin

Modern computer vision systems achieve strong performance, but often depend on extensive manual annotations and substantial computational resources. This PhD seminar explores how the structure of visual data can help overcome these limitations, focusing on learning segmentation with limited supervision and enabling efficient visual processing.

I will begin with semi-supervised semantic segmentation, showing how spatial relationships between neighboring predictions can improve pseudo-label reliability and make better use of unlabeled images. I will then turn to instance segmentation for robotic grasping; beyond annotation scarcity, I will examine annotation quality, introducing controlled benchmarks that reveal how spatial errors and automatically generated masks affect segmentation performance.

The second part extends this efficiency perspective to vision–language models (VLMs). I will present approaches that predict sufficient input resolution, retrieve high-resolution regions when additional evidence is needed, and progressively encode visual detail using wavelet representations and computation reuse. These approaches adapt visual processing to the requirements of each task, offering control over the trade-off between accuracy and computational cost.

Together, these studies investigate how visual structure and task-dependent information can support effective learning and inference with fewer resources.