BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20190301T230916Z
DTSTART;TZID=America/Los_Angeles:20190306T150000
DTEND;TZID=America/Los_Angeles:20190306T160000
TRANSP:OPAQUE
SUMMARY:Triangular" Dvoretzky matrices and online coding
UID:124373-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:1011 Evans Hall
DESCRIPTION:Piyush Srivastava\, Tata Institute of Fundamental Research\n\nA special case of the classical Dvoretzky theorem states that the space of n-dimensional real vectors equipped with the l1 norm admits a large "Euclidean section"\, i.e. a subspace of dimension Θ(n) on which a scaled l1 norm essentially agrees with the Euclidean norm. In particular\, such a subspace can be realized as the column space of a "tall" n × (n/k) random matrix A with identically distributed independent Gaussian entries (k > 1).\n\nThis special case of the Dvoretzky theorem has a natural interpretation in the setting of encoding real vectors for transmission across an adversarial noisy channel when the vector x to be encoded is given in advance (the so-called "block coding" scenario)\, so that the encoding can be computed in an "offline" fashion. Motivated by the same problem in the setting when the encoding has to be "online"\, i.e.\, has to be carried out as each entry of x becomes available\, we give randomized constructions of triangular matrices with properties similar to Dvoretzky matrices. The guarantees provided by these constructions in the "online" scenario are close to\, but still somewhat worse than\, those provided by the Dvoretzky theorem in the "block" scenario\, and the question of finding the optimal triangular version of the Dvoretzky theorem remains open.\n\nJoint work with Leonard J. Schulman.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=124373&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20190301T230916Z
LAST-MODIFIED:20190301T230916Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR