Subject: Events and news relevant to the Laboratory for Foundations of Computer Science
List archive
[LFCS seminar] Now, 02 Apr: Xi Chen, Columbia University: Adaptivity Does Not Help: Nearly Tight Lower Bounds for Boolean Monotonicity Testing
- From: Ohad Kammar <ohad.kammar@ed.ac.uk>
- To: "inf-seminars@mlist.is.ed.ac.uk " <inf-seminars@mlist.is.ed.ac.uk>, "LFCS Interest" <lfcs-interest@mlist.is.ed.ac.uk>
- Cc: "xc2198@columbia.edu" <xc2198@columbia.edu>
- Subject: [LFCS seminar] Now, 02 Apr: Xi Chen, Columbia University: Adaptivity Does Not Help: Nearly Tight Lower Bounds for Boolean Monotonicity Testing
- Date: Thu, 2 Apr 2026 12:55:00 +0000
Hi,
Reminding that this week's LFCS seminar will hopefully start shortly:
Thur, 02 Apr, 2.10pm (note unusual time and date)
Xi Chen, Columbia University
The seminar will take place in-person only.
We're synchronising the seminar time with the teaching timetable, and
plan to start the talk at the advertised time, so please arrive a minute or two
earlier.
In detail:
----------------------------------------------------------------------
Xi Chen, Columbia University
https://www.engineering.columbia.edu/faculty-staff/directory/xi-chen
Thur, 02 Apr, 2.10pm
(Note unusual time and day.)
Venue: IF G.03
Title: Adaptivity Does Not Help: Nearly Tight Lower Bounds for Boolean Monotonicity Testing
Abstract
Monotonicity testing asks: given a Boolean function f: {0,1}^n -> {0,1},
how many queries are needed to distinguish whether f is monotone
or far from monotone? For nonadaptive algorithms, the query
complexity was pinned down at \sqrt{n}. Along the way, a series of
directed isoperimetric inequalities were established to analyze
testers such as the edge tester and the path tester.
But can adaptivity help beat the \sqrt{n} bound? In this talk we answer
in the negative, by proving an almost tight n^{0.5-c} lower bound for
adaptive monotonicity testing, for any constant c > 0. Our proof is
based on a multilevel extension of Talagrand's function.
Joint work with Mark Chen, Hao Cui, William Pires and Jonah Stockwell
(Columbia).
----------------------------------------------------------------------
If you would like to propose a speaker, or speak yourself, please contact me.
The seminar webpages:
http://web.inf.ed.ac.uk/lfcs/events/lfcs-seminars
Yours,
Ohad.
- [LFCS seminar] Now, 02 Apr: Xi Chen, Columbia University: Adaptivity Does Not Help: Nearly Tight Lower Bounds for Boolean Monotonicity Testing, Ohad Kammar, 04/02/2026
Archive powered by MHonArc 2.6.24.