{"id":1682,"date":"2024-10-02T19:19:42","date_gmt":"2024-10-02T19:19:42","guid":{"rendered":"https:\/\/focs.computer.org\/2024\/?page_id=1682"},"modified":"2024-12-04T17:44:34","modified_gmt":"2024-12-04T17:44:34","slug":"plenary-talks","status":"publish","type":"page","link":"https:\/\/focs.computer.org\/2024\/plenary-talks\/","title":{"rendered":"Plenary Talks"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Plenary Talks<\/h1>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Plenary 1 (Roger Myerson, 10:50am-12:00pm, Monday, October 28)<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

\"\"<\/p>

Speaker:<\/strong> Roger Myerson, University of Chicago<\/p>

Title:<\/strong> Dual Reduction and Elementary Games with Senders and Receivers<\/a><\/p>

Abstract:<\/strong> Consider the incentive constraints that define the incentive-compatible mechanisms of a senders-receivers game. Duals of these linear constraints form Markov chains on the senders’ type sets and the receivers’ action sets. The minimal nonempty absorbing sets of these Markov chains can be interpreted as the types and actions in a dual-reduced game. Any incentive-compatible mechanism of a dual-reduced game corresponds to an equivalent incentive-compatible mechanism for the original game. We say that a game is elementary if all nontrivial incentive constraints can be satisfied as strict inequalities in incentive-compatible mechanisms. Any senders-receivers game can be reduced to an elementary game by iterative dual reduction. The set of games with transitive dual solutions is dense.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t

\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Plenary 2 (Irit Dinur, 2:40pm-3:50pm, Monday, October 28, 2024)<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

\"\"<\/p>

Speaker:<\/strong> Irit Dinur, Weizmann Institute<\/p>

Title:<\/strong> Expanders and PCPs: Emergence from Local to Global<\/p>

Abstract:<\/strong><\/p>

PCPs offer a way of verifying NP proofs with high confidence using local checks, thereby demonstrating a form of \u2018computational emergence\u2019 in which the global correctness of a PCP proof emerges from small, independent, and local checks. In essence, while each local check only provides information about a tiny piece of the proof, the design of the PCP ensures that these local pieces collectively reflect the correctness of the whole. Thus, PCPs are NP proofs cast into a distributed form, where local checks collectively verify the global correctness.<\/p>

Expander graphs have been used within PCP constructions, naturally yielding fault-tolerance at a low overhead. However, true local-to-global emergent behavior is exhibited by high-dimensional expanders, much more than classical expanders.<\/p>

In this talk, we will describe several phenomena of local-to-global emergence in high-dimensional expanders, and highlight their applications to error-correcting codes and PCPs.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t

\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Plenary 3 (Christos Papadimitriou, 10:50am-12:00pm, Tuesday, October 29, 2024)<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

\"\"<\/p>

Speaker:<\/strong> Christos Papadimitriou, Columbia University<\/p>

Title:<\/strong> Computing with Dynamical Systems<\/a><\/p>

Abstract:<\/strong> TBA<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t

\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Knuth Prize Lecture (Rajeev Alur, 2:40pm-3:50pm, Tuesday, October 29, 2024)<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

\"\"<\/p>

Speaker:<\/strong> Rajeev Alur, University of Pennsylvania<\/p>

Title:<\/strong> Specification-guided Reinforcement Learning<\/a><\/p>

Abstract:<\/strong> Reinforcement learning (RL) aims to learn optimal policies for accomplishing tasks in unknown environments, and has been recently successful in applications in robotics. Traditionally, the task is encoded in the form of a local state-based reward function which becomes cumbersome for long-horizon goals. An appealing alternative is to use high-level logical specifications, opening the direction of RL from logical specifications. In this talk, I will review both theoretical results and practical tools in this emerging area.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Plenary Talks Plenary 1 (Roger Myerson, 10:50am-12:00pm, Monday, October 28) Speaker: Roger Myerson, University of Chicago Title: Dual Reduction and Elementary Games with Senders and Receivers Abstract: Consider the incentive constraints that define the incentive-compatible mechanisms of a senders-receivers game. Duals of these linear constraints form Markov chains on the senders’ type sets and the […]<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1682","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/pages\/1682","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/comments?post=1682"}],"version-history":[{"count":0,"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/pages\/1682\/revisions"}],"wp:attachment":[{"href":"https:\/\/focs.computer.org\/2024\/wp-json\/wp\/v2\/media?parent=1682"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}