BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Events
X-ORIGINAL-URL:https://events.ucsc.edu
X-WR-CALDESC:Events for Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251204T130000
DTEND;TZID=America/Los_Angeles:20251204T140000
DTSTAMP:20260426T073744
CREATED:20251119T191957Z
LAST-MODIFIED:20251119T191957Z
UID:10005182-1764853200-1764856800@events.ucsc.edu
SUMMARY:GradWiC Womxn's Lunch
DESCRIPTION:Join Graduate Womxn in Computing (GradWiC) for our final Womxn’s Luncheon of the quarter. We will be on the E2 Lanai patio weather allowing\, or E2-599 in the case of inclement weather.
URL:https://events.ucsc.edu/event/gradwic-womxns-lunch/
CATEGORIES:Social Gathering
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251203T110000
DTEND;TZID=America/Los_Angeles:20251203T123000
DTSTAMP:20260426T073744
CREATED:20251103T224713Z
LAST-MODIFIED:20251119T191907Z
UID:10005028-1764759600-1764765000@events.ucsc.edu
SUMMARY:When Less is More: Applications of Type-Based Underapproximate Reasoning
DESCRIPTION:Presenter: Suresh Jagganathan\, Purdue University\n\n\nAbstract:\nUnlike program verifiers\, symbolic execution and property-based testing tools underapproximate program behavior: they aim to report only real bugs (no false positives)\, at the cost of potentially missing some (false negatives). Recent work has sought to place such tools on a more formal footing\, primarily through the development of incorrectness logics that capture a program’s ‘must’ rather than ‘may’ behavior. This talk explores how to transplant these ideas of underapproximation into an expressive refinement type system. Our development enables us to:\n\n(a) Typecheck the completeness of property-based testing (PBT) generators\, ensuring that a well-typed generator produces all values (i.e.\, fully covers) its output type;\n\n(b) Synthesize effectful generators by extending the type system to model underapproximations of sequences of effects rather than just values; and\n\n(c) Guide symbolic execution in effectful functional programs\, prioritizing execution paths capable of falsifying data structure safety properties.\n\nOur results demonstrate that viewing types through the lens of underapproximation offers a principled foundation for designing\, implementing\, and reasoning about program analyzers and test generators\, significantly improving their reliability and practical utility in the process.\n\n\nBio:\nSuresh Jagannathan is the Samuel D. Conte Professor of Computer Science at Purdue University. His interests span functional programming\, program verification\, distributed and concurrent systems\, and trustworthy machine learning. In recent years\, he has spent time as an Amazon Scholar\, a program manager at the Information Innovoation Office (I2O) at DARPA\, and a visiting researcher at the University of Cambridge. He serves an Associate Editor of ACM TOPLAS\, and has served as both General and PC Chair of POPL (ACM Symposium on Programming Languages).\n\n\nHosted by: Professor Mohsen Lesani\n\n\nLocation: E2-180\n*Refreshments such as coffee and pastries will be provided\n\n\n\nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/when-less-is-more-applications-of-type-based-underapproximate-reasoning/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2025/11/Screenshot-2025-11-03-at-2.45.08-PM.png
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251124T093000
DTEND;TZID=America/Los_Angeles:20251124T113000
DTSTAMP:20260426T073744
CREATED:20251112T181924Z
LAST-MODIFIED:20251112T181924Z
UID:10005132-1763976600-1763983800@events.ucsc.edu
SUMMARY:Chen\, Q. (CSE) - New Approximation and Online Algorithms using Novel Combinatorial Structures
DESCRIPTION:Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular\, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead\, computer scientists turn to find an approximate solution and create numerous elegant algorithms. However\, in the modern era\, computational environments have changed drastically\, and we are not able to afford to design new algorithms for each new problem via repeated trial and error. Therefore\, systematic ways to understand the possibilities and limitations of these problems are desired. This dissertation studies several central combinatorial optimization problems\, focusing on understanding the key structural obstacles and developing unified frameworks. Mainly\, we study two types of combinatorial optimization problems:\n(1) Scheduling. The problem is associated with limited resources\, and our target is to find an allocation method to complete all jobs over time that minimizes the overall budget cost.\n(2) Network Design. Different from scheduling problems. In this problem\, we aim to find a minimum-cost topological network that supports routing for demanding communications. \nOur first work is focused on a group-to-group survivable network design problem that generalizes the classic point-to-point network to support routing between any pair of subsets of nodes. Previous research stops at limited faults\, and the difficulty comes from the way to compress the graph into a tree. We propose a new framework via capacitated tree embeddings against arbitrary faults in the network\, which gives the first polylogarithmic approximation algorithm. Further\, this framework captures nearly all the recent models proposed in the area. \nIn contrast to the offline optimization problems mentioned above\, online algorithms are natural adaptations that have been found in tremendous real applications. In online algorithms\, the algorithm wants to compete against arbitrary uncertainty\, which means the instance is unknown at first and revealed over time. We study various scheduling problems and focus on some important metrics – average flow time\, which measures the average time a job stays in the system from its arrival to completion. Real-world demands give online scheduling problems enormously different settings. Computer scientists need to repeat errors and trials to find a provably good solution. We find the key required combinatorial property is supermodularity for the residual objective\, which measures the average completion time for all alive jobs assuming they have the same arrival time. Further\, we relate supermodularity with gross-substitute/linear-substitute (GS/LS)\, which is a well-studied definition in economics. Finally\, we propose a meta-algorithm that solves all captured problems in one shot. \nEvent Host: Qingyun Chen\, Ph.D. Student\, Computer Science and Engineering \nAdvisor: Sungjin Im \nZoom-  https://ucsc.zoom.us/j/94376536164?pwd=cPloEcyKuQg1C9reIbuh6rejrOaRfR.1
URL:https://events.ucsc.edu/event/chen-q-cse-new-approximation-and-online-algorithms-using-novel-combinatorial-structures/
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/11/ph.d.-presentation-graphic-option-1.jpg
LOCATION:
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251120T090000
DTEND;TZID=America/Los_Angeles:20251120T100000
DTSTAMP:20260426T073744
CREATED:20251118T162058Z
LAST-MODIFIED:20251118T162058Z
UID:10005178-1763629200-1763632800@events.ucsc.edu
SUMMARY:Jorquera\, Z. (CSE) - Quantum Entanglement Bounds and the Approximation Algorithms That Use Them
DESCRIPTION:One of the central challenges in quantum computing is finding or approximating the ground-state energy of a local Hamiltonian\, a quantum analogue of classical constraint satisfaction problems (CSPs). Among these\, the Quantum Max-Cut problem serves as a canonical example\, paralleling the classical Max-Cut problem. Despite its foundational importance in both theoretical computer science and condensed matter physics\, our understanding of approximation algorithms for Quantum Max-Cut and related local Hamiltonian problems remains limited\, primarily due to the difficulty of representing and optimizing over entangled quantum states. \nIn this advancement talk\, we introduce the quantum information background needed to contextualize the results and the significance of the proposed future work by drawing an analogy to classical optimization. We then investigate approximation algorithms for 2-local Hamiltonians beyond qubit systems\, focusing on higher-dimensional qudit analogues\, such as Quantum Max-d-Cut and a new problem we introduce: the Maximal Entanglement problem. We establish new entanglement upper bounds for these problems based on the star bound\, a key tool for analyzing entanglement monogamy in Hamiltonian optimization. For the Maximal Entanglement problem\, we show that these bounds can be efficiently certified via semidefinite programs (SDPs) and that they directly admit a (1/d + O(1/D))-approximation algorithm (where D is the degree of the interaction graph)\, which beats random assignment. For Quantum Max-d-Cut\, the star bound gives a more complicated notion of entanglement\, for which we show that the basic SDP can verify this bound for all reduced marginals on up to five vertices when d=3\, but likely fails for larger subgraphs. We further propose that b-matchings\, with b = d-1\, capture the appropriate notion of entanglement for these higher-dimensional Quantum Max-d-Cut systems\, analogous to matchings in the qubit/Quantum Max-Cut case. Leveraging this insight\, we design a novel 2-matching-based algorithm that outperforms existing approaches for Quantum Max-3-Cut\, giving an approximation ratio of 0.555. \nThe present work advances the theoretical framework for understanding approximations in qudit Hamiltonians and highlights open directions for certifying quantum upper bounds as well as finding lower bounds via approximation algorithms. \n  \nEvent Host: Zack Jorquera\, Ph.D. Student\, Computer Science and Engineering  \nAdvisor: Alexandra Kolla  \nZoom- https://ucsc.zoom.us/j/98034235739?pwd=k260nd9labWT8xoQ9Cv3m2TATGw7VB.1
URL:https://events.ucsc.edu/event/jorquera-z-cse-quantum-entanglement-bounds-and-the-approximation-algorithms-that-use-them/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/11/ph.d.-presentation-graphic-option2.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251119T110000
DTEND;TZID=America/Los_Angeles:20251119T121500
DTSTAMP:20260426T073744
CREATED:20251105T220936Z
LAST-MODIFIED:20251118T181912Z
UID:10005101-1763550000-1763554500@events.ucsc.edu
SUMMARY:CSE Colloquium - Flux: Refinement Types for Verified Rust Systems
DESCRIPTION:Presenter: Ranjit Jhala\, UCSD\n\nAbstract: Rust has risen as a language of choice for new systems code — from OS kernels to hypervisors\, firmware and run-times — as it is memory safe and provides the sort of abstractions needed for efficient low-level systems implementation. We present Flux\, a refinement type checker for Rust that shows how logical refinements can work in tandem with Rust’s ownership mechanisms to yield ergonomic type-based verification of low-level systems code. We then present a case study showing how Flux was used to formally verify process isolation in Tock: a microcontroller OS used in security-critical systems like the Google Security Chip (GSC) and Microsoft’s Pluton security processor. Our verification effort unearthed multiple subtle bugs that broke isolation\, allowing malicious applications to compromise the OS to potentially steal sensitive data or brick or take control of the OS. We describe how Flux helped design and implement a new granular process abstraction that is both simpler\, more efficient\, and yields formally verified security guarantees.\n\nBio:\nRanjit Jhala is a professor of Computer Science and Engineering at the University of California\, San Diego. He works on algorithms and tools that help engineer reliable computer systems. His work draws from and contributes to the areas of Model Checking\, Program Analysis\, and Automated Deduction\, and Type Systems. He helped create several influential and award winning systems including the BLAST software model checker and Liquid Types\, received ACM SIGPLAN’s Robin Milner Young Researcher Award\, and is a Fellow of the ACM.\n\nHosted by: Professor Mohsen Lesani\n\nLocation: Engineering 2\, Room E2-180\n*Refreshments such as coffee and pastries will be provided.\n\nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1
URL:https://events.ucsc.edu/event/cse-colloquium-flux-refinement-types-for-verified-rust-systems/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/11/235.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251113T100000
DTEND;TZID=America/Los_Angeles:20251113T120000
DTSTAMP:20260426T073744
CREATED:20251110T222658Z
LAST-MODIFIED:20251110T222748Z
UID:10005131-1763028000-1763035200@events.ucsc.edu
SUMMARY:Petety\, A. (CSE) -  New Algorithmic Methods for Uncertain Inputs
DESCRIPTION:This dissertation focuses on designing and proving performance guarantees on algorithms when there is uncertainty in the input. The uncertainty could be from the user being unsure or future inputs that have not arrived yet. We look at different methods in which algorithms can be designed to be competitive against the optimal. One of the assumptions that helps in this is to assume that the input arrival order is completely random. We study the online load/graph balancing problem when the input arrival order is uniformly random. We show lower bounds for the greedy algorithm and the general case. In the next part\, we study the online scheduling problem under the assumption that the online algorithm has an additional ϵ speed compared to the machines in offline optimal. We show a meta algorithm generalizing Shortest Remaining Processing Time that gives a scalable algorithm for minimizing total weighted flow time. We show that it achieves scalability for minimizing total weighted flow time when the residual optimum exhibits supermodularity. In the final part we look at the online caching problem when the algorithm has access to ML-augmented predictions. We propose an algorithm that achieves a O(logb k) competitive ratio even when using just b predictions per cache miss. We also prove its robustness and consistency. \nEvent Host: Aditya Petety\, Ph.D. Student\, Computer Science and Engineering \nAdvisor: Sungjin Im \n 
URL:https://events.ucsc.edu/event/petety-a-cse-new-algorithmic-methods-for-uncertain-inputs/
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2025/10/option-3.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251112T110000
DTEND;TZID=America/Los_Angeles:20251112T121500
DTSTAMP:20260426T073744
CREATED:20251106T173342Z
LAST-MODIFIED:20251106T185851Z
UID:10005103-1762945200-1762949700@events.ucsc.edu
SUMMARY:CSE Colloquium - Neurosymbolic AI: from research to industry
DESCRIPTION:Presenter: Luis Lamb\, Catholic Institute of Technology\n\nAbstract:\nNeurosymbolic AI brings together the statistical nature of machine learning with the formal reasoning capabilities of symbolic AI. It seeks to offer a balanced approach to contemporary AI technologies\, by combining the ability to learn from data\, with the capacity to reason upon knowledge acquired from an environment. The main criticism of neural machine learning lies in its lack of explainability and semantics\, which are key requirements in safety-critical applications\, yet inherent strengths of logic-based methods. Recently\, several corporations have publicly announced products and technologies grounded in neurosymbolic AI methodologies. This talk provided a concise review of the foundations\, frameworks and tools underlying neurosymbolic AI\, along with illustrative applications. It concludes by highlighting current trends and research directions in the field.\n\nBio:\nLuis Lamb is Professor of Computer Science and Vice President of Research at the Catholic Institute of Technology. His research interests include: Artificial Intelligence\, Neurosymbolic AI\, Innovation Strategies\, and Applied Logics. Lamb has co-authored two research monographs\, including Neural-Symbolic Cognitive Reasoning\, with d’Avila Garcez and Gabbay (Springer 2009). He organized two Dagstuhl Seminars on Neursymbolic AI\, published widely in AI\, and has worked in the area for over 20 years.  Lamb also has extensive experience leading research planning\, strategy\, and university wide research & infrastructure grant applications\, and strategic academic-industry partnerships. He has been a Professor in Brazil and has experience in industry as a former Senior Manager of AI and Machine Learning at Boeing. He holds a PhD in Computer Science from Imperial College London and an MBA from MIT.\n\nHosted by: Professor Mohsen Lesani\n\nLocation: Engineering 2\, E2-180\n\n*Refreshments such as coffee and pastries will be provided.\n\nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-neurosymbolic-ai-from-research-to-industry/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations
ATTACH;FMTTYPE=image/webp:https://events.ucsc.edu/wp-content/uploads/2025/11/Image_20250815_165250_742.webp
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251107T140000
DTEND;TZID=America/Los_Angeles:20251107T160000
DTSTAMP:20260426T073744
CREATED:20251021T162001Z
LAST-MODIFIED:20251023T212553Z
UID:10004958-1762524000-1762531200@events.ucsc.edu
SUMMARY:Wang\, S. (CSE) - Learned Hashing and Overlay Networks for AI-native Retrieval and Serving at Scale
DESCRIPTION:Modern AI systems demand low-latency high-quality retrieval and serving over billion-scale keys and vectors. This proposal studies learned hashing and overlay networks to co-locate semantically related items and steer queries with minimal coordination. We first present LEAD\, to our knowledge the first use of order-preserving learned hash functions in distributed key-value overlays\, enabling efficient range queries and cutting hops/messages by 80–90% in prototypes while retaining balance and churn resilience. Second\, Vortex applies learned hashing to approximate nearest-neighbor retrieval: a self-organizing overlay binding learned keys to distributed HNSW indexes to achieve high recall at low fan-out. Third\, PlanetServe introduces onion-style path setup with multi-path dispersal and cache-aware forwarding for open LLM serving\, reducing TTFT and latency while preserving privacy. Planned work generalizes learned hashing to embedding partitions\, token/KV caches\, programmable switches\, and storage tiers\, and provides formal convergence\, load-balancing\, and monotonic-progress guarantees under skew and churn. We are also working to design the first knowledge delivery network for LLM serving: an overlay that unifies data placement\, retrieval\, and policy-aware routing across clusters and providers with tunable cost\, privacy\, and quality. Evaluation on real workloads at scale will measure recall\, tail latency\, cost\, and robustness\, targeting a predictable\, elastic\, scalable AI-native retrieval and serving stack. \nEvent Host: Shengze Wang\, Ph.D. Student\, Computer Science & Engineering \nAdvisor: Chen Qian \n  \nZoom: https://ucsc.zoom.us/j/5455463199?pwd=bHRVM01Vd20rcVpkc0FQY01kZG1UUT09&omn=98106984546 \nPasscode: 2121
URL:https://events.ucsc.edu/event/wang-s-cse-learned-hashing-and-overlay-networks-for-ai-native-retrieval-and-serving-at-scale/
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2025/10/option-3-1.png
LOCATION:https://events.ucsc.edu/event/wang-s-cse-learned-hashing-and-overlay-networks-for-ai-native-retrieval-and-serving-at-scale/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251107T000000
DTEND;TZID=America/Los_Angeles:20251108T235959
DTSTAMP:20260426T073744
CREATED:20251013T212720Z
LAST-MODIFIED:20251023T232623Z
UID:10004811-1762473600-1762646399@events.ucsc.edu
SUMMARY:United Nations Reboot the Earth Hackathon
DESCRIPTION:The United Nations (UN) and the Baskin School of Engineering at the University of California\, Santa Cruz\, are collaborating to bring the “Reboot the Earth” hackathon to the West Coast for the first time. \nThis is a social event bringing together aspiring developers to create open source software solutions that address the climate crisis\, including wildfire response. It’s a chance to collaborate with peers\, use open data\, and apply your coding skills to real-world climate challenges! \n\n\n\nDate: November 7-8\, 2025\nLocation: UC Santa Cruz Silicon Valley Center.\nRegister here for the event. \n\nOrganized by the UN Office of Information and Communications Technology (OICT)\, the 2025  Reboot the Earth hackathons are focused on agriculture and artificial intelligence (AI). The California event will focus on the locally relevant challenges of wildfire detection\, response\, and impact. Participants can leverage open source\, AI\, and open data sets\, along with local expertise on the environment and emergency preparedness and response. The goal is to build solutions that can become a digital public good\, serving local community needs. \nUC Santa Cruz students interested in attending the event can take advantage of the Silicon Valley Connector shuttle\, which will be running on Saturday\, November 8\, in addition to the regular Friday schedule. \nTo learn more about the Reboot the Earth initiative\, visit: https://unite.un.org/en/reboot-earth.
URL:https://events.ucsc.edu/event/un-reboot-the-earth-hackathon/
LOCATION:Silicon Valley Campus\, 3175 Bowers Avenue\, Santa Clara\, CA\, 95054\, United States
CATEGORIES:Meetings & Conferences,Social Gathering
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2025/10/Reboot-the-earth-1.png
GEO:37.3796975;-121.9765484
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Silicon Valley Campus 3175 Bowers Avenue Santa Clara CA 95054 United States;X-APPLE-RADIUS=500;X-TITLE=3175 Bowers Avenue:geo:-121.9765484,37.3796975
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251105T110000
DTEND;TZID=America/Los_Angeles:20251105T121500
DTSTAMP:20260426T073744
CREATED:20251015T215159Z
LAST-MODIFIED:20251022T182643Z
UID:10004885-1762340400-1762344900@events.ucsc.edu
SUMMARY:CSE Colloquium: Mitigating Data Scarcity via Simulation by Roozbeh Mottaghi
DESCRIPTION:Presenter: Roozbeh Mottaghi\, University of Washington \nAbstract: Data has revolutionized progress across AI fields like natural language processing and computer vision. Yet\, in robotics\, data collection remains a significant challenge: robots must interact with complex\, dynamic environments\, making the process slow\, costly\, and difficult to scale. In this talk\, I will discuss how simulation is transforming the landscape of robotics research by addressing these data bottlenecks. I will introduce Habitat 3.0\, a 3D simulator designed for training and evaluating robotic agents in dynamic environments that include human interactions. Focusing on collaborative human-robot tasks\, I will present PARTNR\, a simulation benchmark designed to rigorously evaluate planning and reasoning in interactive settings. I will share key insights from this benchmark\, revealing both the impressive capabilities of current LLMs and the significant challenges they encounter when faced with the complexities of real-world environments. \nBio: Roozbeh Mottaghi is a Senior Research Scientist Manager at FAIR and an Affiliate Associate Professor in Paul G. Allen School of Computer Science and Engineering at the University of Washington. Prior to joining FAIR\, he was the Research Manager of the Perceptual Reasoning and Interaction Research (PRIOR) group at the Allen Institute for AI (AI2). He obtained his PhD in Computer Science in 2013 from the University of California\, Los Angeles. After PhD\, he joined the Computer Science Department at Stanford University as a post-doctoral researcher. His research mainly focuses on embodied AI\, reasoning via perception\, and learning via interaction\, and his work on large-scale Embodied AI received the Outstanding Paper Award at NeurIPS 2022. \n\n\n\n\n\n\nFaculty Host: Professor Mohsen Lesani \n\nLocation: Engineering 2\, E2-180\n\n*Refreshments such as coffee and pastries will be provided.\n\nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-mitigating-data-scarcity-via-simulation-by-roozbeh-mottaghi/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/10/profile_roozbehM.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251028T110000
DTEND;TZID=America/Los_Angeles:20251028T121500
DTSTAMP:20260426T073744
CREATED:20251020T202827Z
LAST-MODIFIED:20251022T182819Z
UID:10004952-1761649200-1761653700@events.ucsc.edu
SUMMARY:CSE Colloquium: A Journey from Programming Systems Research to AI Agents
DESCRIPTION:Speaker: Koushik Sen\, UC Berkeley and Google DeepMind \nAbstract: Coding has emerged as an important application area for large language models (LLMs)\, with a proliferation of code-specific models and their applications across various domains and tasks such as program repair\, performance optimization\, debugging\, test generation\, documentation\, and security hardening. In this talk\, I will describe how we built powerful coding agents such as R2E-Gym and DeepSWE using test-driven methodology for solving various kinds of coding tasks\, such as repair\, optimization\, security vulnerability detection\, and refactoring.  I will also discuss a novel technique\, called GEPA\, for domain-specific optimization of AI agent systems\, which has shown a significant advantage over reinforcement learning. \nBio: Koushik Sen is a professor in the Department of Electrical Engineering and Computer Sciences at the University of California\, Berkeley. His research interest lies in Software Engineering\, Programming Languages\, and AI. He is interested in developing software tools and methodologies that improve programmer productivity and software quality. He is known for his work on “DART: Directed Automated Random Testing\,” concolic testing\, and LiveCodeBench. He has received a NSF CAREER Award in 2008\, a Haifa Verification Conference (HVC) Award in 2009\, a IFIP TC2 Manfred Paul Award for Excellence in Software: Theory and Practice in 2010\, a Sloan Foundation Fellowship in 2011\, a Professor R. Narasimhan Lecture Award in 2014\, an Okawa Foundation Research Grant in 2015\, and an ACM SIGSOFT Impact Paper Award in 2019. He has won several ACM SIGSOFT Distinguished Paper Awards. He received the C.L. and Jane W-S. Liu Award in 2004\, the C. W. Gear Outstanding Graduate Award in 2005\, and the David J. Kuck Outstanding Ph.D. Thesis Award in 2007\, and a Distinguished Alumni Educator Award in 2014 from the UIUC Department of Computer Science. He holds a B.Tech from the Indian Institute of Technology\, Kanpur\, and an M.S. and Ph.D. in CS from the University of Illinois at Urbana-Champaign. \n\nHosted by: Professor Mohsen Lesani \nLocation: Engineering 2\, E2-180 (Refreshments such as coffee and pastries will be provided.) \nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-a-journey-from-programming-systems-research-to-ai-agents/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/10/ksen.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251022T110000
DTEND;TZID=America/Los_Angeles:20251022T121500
DTSTAMP:20260426T073744
CREATED:20250919T070000Z
LAST-MODIFIED:20251022T183911Z
UID:10000205-1761130800-1761135300@events.ucsc.edu
SUMMARY:CSE Colloquium - The C++11 Concurrency Memory Model: Remaining Challenges
DESCRIPTION:Presenter: Hans Boehm\, Google \nAbstract: C++11 extended the language to include threads\, defining a concurrency memory model to specify the semantics of shared variables\, including “atomic” variables that can be accessed without mutual exclusion. Although this followed Posix threads by more than a decade\, and the revision of the Java memory model by a few years\, it still helped to resolve some very fundamental points of confusion about the semantics and validity of compiler optimizations in multi-threaded programs. The C definition largely copied it\, and several other programming languages and systems\, as well as later versions of Java\, built on it. \nThese shared variable semantics provide a clean solution for concurrent programming for which a small amount of extra synchronization-related overhead is acceptable. However\, C++ programmers pride themselves in squeezing out the last bit of performance\, even if it involves living on the edge. Although the C++ memory model attempts to address those cases\, issues remain. In particular\, so-called “relaxed” atomics do not have clean semantics\, for reasons that appear more and more fundamental. And the discovery that well-motivated hardware characteristics are incompatible with the original model required complicating it. On the other hand\, hardware improvements have greatly reduced the need for the now deprecated “memory_order_consume” facility. \nWe’ll start with an overview of the C++ memory model\, and then outline some of the remaining challenges. We’ll give an example to illustrate why “memory_order_relaxed”\, which attempts to just expose machine load and store instructions\, is inherently much harder to define at the programming language level than it is at the hardware level. \nBio: Hans Boehm works primarily on concurrency issues in the Android platform. He was the initial chair of the ISO C++ Concurrency Study Group\, where he led the addition of threads and associated concurrency semantics to the language. He occasionally gets sidetracked into other topics\, including work on arithmetic in the Google Calculator app.\n\nHans is best known as the original primary author of bdwgc\, a garbage collector for C. He has published extensively on memory management and concurrent programming. He holds a Ph.D. from Cornell University. He is a former chair of ACM SIGPLAN\, an ACM Fellow\, and the recipient of the 2020 ACM SIGPLAN Programming Languages Achievement Award.\nHosted by: Professor Mohsen Lesani \nLocation: Engineering 2\, E2-180\n*Refreshments such as coffee and pastries will be provided. \nZoom: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-the-c11-concurrency-memory-model-remaining-challenges/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/09/6e96b084f8f69a730b46dacbcd5d784170d1369b.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251021T120000
DTEND;TZID=America/Los_Angeles:20251021T130000
DTSTAMP:20260426T073744
CREATED:20251013T151834Z
LAST-MODIFIED:20251014T141340Z
UID:10004809-1761048000-1761051600@events.ucsc.edu
SUMMARY:CITRIS Aviation Prize Information Session
DESCRIPTION:Join us for this virtual info session on the 2025–26 CITRIS Aviation Prize\, an exciting multi-campus student competition inviting teams to design innovative solutions for the future of air mobility across the University of California. \nThe session will cover this year’s competition guidelines\, key dates and requirements\, and available resources. Attendees will also have the opportunity for Q&A with members of the CITRIS Aviation Leadership Committee\, composed of aviation research faculty from UC Berkeley\, UC Davis\, UC Merced\, and UC Santa Cruz. \nRegister here to attend. \nFor any questions\, contact aviationprize@citris-uc.org. \n  \nDate: Tuesday\, October 21 \nTime: 12:00 pm – 1:00 pm \nLocation: Zoom (register to attend).
URL:https://events.ucsc.edu/event/citris-aviation-prize-info/
CATEGORIES:Meetings & Conferences
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2025/10/2025-Aviation-Prize-graphic.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251015T110000
DTEND;TZID=America/Los_Angeles:20251015T110000
DTSTAMP:20260426T073744
CREATED:20250924T212046Z
LAST-MODIFIED:20250924T212046Z
UID:10000051-1760526000-1760526000@events.ucsc.edu
SUMMARY:2025 Fall STEM Career & Internship Fair
DESCRIPTION:Here is a chance to meet tech recruiters in person! \nIf you are interested in pursuing a career in science\, technology\, engineering\, mathematics or research\, then take advantage of this opportunity to meet recruiters from companies looking to fill various positions (both technical and non-technical). Learn more about internships and full-time career opportunities. Undergraduate students\, graduate students\, and recent alumni are all welcome to attend! \nPLEASE NOTE: You are encouraged to check in at the student registration table in order to participate in the career fair. Bring your student ID. \nWant more support? \n\nVisit a peer coach during drop-in hours\nSchedule a career coaching appointment with a Career Engagement Specialist\nFor PhD students looking to pursue careers in industry\, explore Beyond the Professoriate\n	(Scroll over "Login to Platform" at the top navigation bar and click "Through your institution")\nGet career tips on demand from our Career Success YouTube video library\nStay in the loop by following Career Success on Instagram\n\nYou will receive registration and additional information in your email from Career Success via Handshake. Please make sure to check your junk/spam folder if you are not receiving any communication.\n  \nYou Belong Here: The programs and services described here are open to all\, consistent with state and federal law\, as well as the University of California’s nondiscrimination policies. Every initiative—whether a student service\, faculty program\, or community event—is designed to be accessible\, inclusive\, and respectful of all identities. \nTo learn more\, please visit UC Nondiscrimination Statement or Nondiscrimination Policy for UC Publications. \nQuestions? Send to csuccess@ucsc.edu or visit Career Success at Hahn 125 East Entrance\nNeed accessibility support? Let us know at slugtalent@ucsc.edu at least two weeks prior to the fair date.
URL:https://events.ucsc.edu/event/2025-fall-stem-career-internship-fair/
LOCATION:Stevenson Event Center\, Stevenson Service Road\, Santa Cruz\, CA\, 95064
CATEGORIES:Meetings & Conferences
GEO:36.996897;-122.0512963
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Stevenson Event Center Stevenson Service Road Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Stevenson Service Road:geo:-122.0512963,36.996897
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251006T110000
DTEND;TZID=America/Los_Angeles:20251006T110000
DTSTAMP:20260426T073744
CREATED:20250924T213206Z
LAST-MODIFIED:20251001T170739Z
UID:10000168-1759748400-1759748400@events.ucsc.edu
SUMMARY:AI Frontier: Data\, Agents & Robots at TechWeek SF
DESCRIPTION:Join us for an immersive SF Tech Week experience hosted by the Silicon Valley AI Pioneer Club and UC Santa Cruz GenAI Center — where AI builders\, investors\, innovators and top researchers converge to explore the technologies shaping tomorrow. Details and reservations are available at  https://partiful.com/e/OtqKL1z4hvYDLMk0uP8w
URL:https://events.ucsc.edu/event/ai-frontier-data-agents-robots-at-techweek-sf/
CATEGORIES:Lectures & Presentations
ATTACH;FMTTYPE=image/avif:https://events.ucsc.edu/wp-content/uploads/2025/09/v0FNGWaqKCOe70WuyjTVO.avif
END:VEVENT
END:VCALENDAR