Select a calendar:
Filter April Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for April 05, 2022
-
CS Undergraduate Web Registration Live Chat AssistanceTue, Apr 05, 2022 @ 09:00 AM - 09:30 AM
Thomas Lord Department of Computer Science
Student Activity
If you are a CS undergraduate with a web registration permit time of 9am today and are having difficulty with web registration, the advisement staff will be available from 9:00am - 9:30am to help troubleshoot your registration questions and issues. Chat with us at https://www.cs.usc.edu/chat/
Audiences: Undergrad
Contact: USC Computer Science
-
CS Colloquium: Suguman Bansal (University of Pennsylvania) - Specification-Guided Policy Synthesis
Tue, Apr 05, 2022 @ 11:00 AM - 12:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Suguman Bansal , University of Pennsylvania
Talk Title: Specification-Guided Policy Synthesis
Series: CS Colloquium
Abstract: Policy synthesis or algorithms to design policies for computational systems is one of the fundamental problems in computer science. Standing on the shoulders of simplified yet concise task-specification using high-level logical specification languages, this talk will cover synthesis algorithms using two contrasting approaches. First, the classical logic-based approach of reactive synthesis; Second, the modern learning-based approach of reinforcement learning. This talk will cover our scalable and efficient state-of-the-art algorithms for synthesis from high-level specifications using both these approaches, and investigate whether formal guarantees are possible. We will conclude with a forward-looking view of these contributions to trustworthy AI.
This lecture satisfies requirements for CSCI 591: Research Colloquium
Biography: Suguman Bansal is an NSF/CRA Computing Innovation Postdoctoral Fellow at the University of Pennsylvania, mentored by Prof. Rajeev Alur. Her primary area of research is Formal Methods and Programming Langauge, and her secondary area of research is Artificial Intelligence.
https://suguman.github.io/
Host: Mukund Raghothaman
Location: Olin Hall of Engineering (OHE) - 132
Audiences: By invitation only.
Contact: Assistant to CS chair
-
Virtual First-Year Admission Information Session
Tue, Apr 05, 2022 @ 11:00 AM - 12:00 PM
Viterbi School of Engineering Undergraduate Admission
Workshops & Infosessions
Our virtual information session is a live presentation from a USC Viterbi admission counselor designed for high school students and their family members to learn more about the USC Viterbi undergraduate experience. Our session will cover an overview of our undergraduate engineering programs, the application process, and more on student life. Guests will be able to ask questions and engage in further discussion toward the end of the session.
Register Here!
Audiences: Everyone Is Invited
Contact: Viterbi Admission
-
CS Colloquium: Daniel Grier (University of Waterloo) - The Complexity of Near-Term Quantum Computers
Tue, Apr 05, 2022 @ 02:00 PM - 03:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Daniel Grier, University of Waterloo
Talk Title: The Complexity of Near-Term Quantum Computers
Series: CS Colloquium
Abstract: Quantum computing is at an exciting moment in its history, with some high-profile experimental successes in building programmable quantum devices. That said, these quantum devices (at least in the near term) will be restricted in several ways, raising questions about their power relative to classical computers. In this talk, I will present three results which give us a better understanding of these near-term quantum devices, revealing key features which make them superior to their classical counterparts.
First, I will show that constant-depth quantum circuits can solve problems that cannot be solved by any constant-depth classical circuit consisting of AND, OR, NOT, and PARITY gates---giving the largest-known unconditional separation between natural classes of quantum and classical circuits. Second, I will show that these quantum circuits can nevertheless be simulated quickly by classical algorithms that have no depth restriction, emphasizing the role that depth plays in provable quantum advantage. Finally, I will address some of the experimental challenges in implementing linear optical quantum computers, and I will prove that they outperform classical computers using standard conjectures but in more practical experimental regimes.
This lecture satisfies requirements for CSCI 591: Research Colloquium
Biography: Daniel is a postdoctoral researcher at the Institute for Quantum Computing at the University of Waterloo. He received his PhD in Computer Science at MIT, where he was advised by Scott Aaronson and was supported by an NSF Graduate Research Fellowship. His research lies at the intersection of complexity theory and quantum computing, with a particular focus on the power of near-term quantum computing devices.
Host: Ramesh Govindan
Location: online only
Audiences: By invitation only.
Contact: Assistant to CS chair
-
ISE 651 Epstein Seminar
Tue, Apr 05, 2022 @ 03:30 PM - 04:50 PM
Daniel J. Epstein Department of Industrial and Systems Engineering
Conferences, Lectures, & Seminars
Speaker: Dr. Timothy C. Y. Chan, Professor, Dept. of Mechanical & Industrial Engineering, University of Toronto
Talk Title: An Inverse Optimization Approach to Measuring Clinical Pathway Concordance
Host: Prof. Suvrajeet Sen
More Information: April 5, 2022.pdf
Location: Online/Zoom
Audiences: Everyone Is Invited
Contact: Grace Owh
