BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20230328T170000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:75a9b2b5846ac671acd6d349b02036e9
CATEGORIES:Experimental Mathematics Seminar
CREATED:20240325T210523
SUMMARY:Reinforcement learning and pattern finding in combinatorics
LOCATION:https://rutgers.zoom.us/j/94346444480 [password: The 20th Catalan number\, 
 alias (40)!/(20!*21!)
DESCRIPTION:We will look at two ways we can use tools from machine learning to help us 
 with research in combinatorics. First we discuss reinforcement learning, a 
 method that gives us a way to check conjectures for counterexamples efficie
 ntly. While it usually does not perform as well as other simpler methods, t
 here have been several examples of projects in the past few years where RL 
 was crucial for success. In the second half of the talk we will consider th
 e following question of Ellenberg: at most how many points can we pick in t
 he N by N grid, without creating an isosceles triangle? The best known cons
 tructions, found by computer searches for small values of N, clearly follow
  a pattern which we do not yet understand. We will discuss how one can trai
 n transformers to understand this pattern, and use this trained transformer
  to help us find a bit better constructions for various N. This is joint wo
 rk with Jordan Ellenberg, Marijn Heule, and Geordie Williamson\n
X-ALT-DESC;FMTTYPE=text/html:<p>We will look at two ways we can use tools from machine learning to help 
 us with research in combinatorics. First we discuss reinforcement learning,
  a method that gives us a way to check conjectures for counterexamples effi
 ciently. While it usually does not perform as well as other simpler methods
 , there have been several examples of projects in the past few years where 
 RL was crucial for success. In the second half of the talk we will consider
  the following question of Ellenberg: at most how many points can we pick i
 n the N by N grid, without creating an isosceles triangle? The best known c
 onstructions, found by computer searches for small values of N, clearly fol
 low a pattern which we do not yet understand. We will discuss how one can t
 rain transformers to understand this pattern, and use this trained transfor
 mer to help us find a bit better constructions for various N. This is joint
  work with Jordan Ellenberg, Marijn Heule, and Geordie Williamson</p>
CONTACT:Adam Zsolt Wagner, Worcester Polytechnic Institute
DTSTAMP:20260829T192935
DTSTART;TZID=America/New_York:20240328T170000
DTEND;TZID=America/New_York:20240328T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR