Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Wednesday, April 14, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity — An Optimal Separation of Randomized and Quantum Query Complexity

Please note: This seminar will be given online.

Pei Wu, Computer Science Department
University of California, Los Angeles

We prove that for every decision tree, the absolute values of the Fourier coefficients of given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant. This bound is essentially tight and settles a conjecture due to Tal (arxiv 2019; FOCS 2020). 

Thursday, April 22, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

Seminar • Data Visualization — Human-Centered Machine Learning: Approaches for Mixed-Initiative Topic Model Refinement

Please note: This seminar will be given online.

Mennatallah El-Assady, Research Associate
Data Analysis and Visualization, University of Konstanz
Visualization for Information Analysis Lab, University of Ontario Institute of Technology