BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200204T121500
DTEND;TZID=America/Los_Angeles:20200204T131000
DTSTAMP:20260420T022158
CREATED:20200129T003031Z
LAST-MODIFIED:20200129T003031Z
UID:1831-1580818500-1580821800@colleges.claremont.edu
SUMMARY:Covering point-sets with parallel hyperplanes and sparse signal recovery (Lenny Fukshansky\, CMC)
DESCRIPTION:Let S be a set of k > n points in n-dimensional Euclidean space. How many parallel hyperplanes are needed to cover it? In fact\, it is easy to prove that every such set can be covered by k-n+1 parallel hyperplanes\, but do there exist sets that cannot be covered by fewer parallel hyperplanes? We construct a family of examples of such extremal sets. We then use it\, along with a result on girth of bipartite graphs\, to construct a family of n x d integer matrices with bounded sup-norm and the property that no m column vectors are linearly dependent\, m < n. If m < (log n)^{1-e} for any e > 0\, then d/n tends to infinity as n tends to infinity. This is a deterministic construction of a family of sensing matrices\, which are used for sparse signal recovery in compressed sensing. Joint work with Alex Hsu.
URL:https://colleges.claremont.edu/ccms/event/covering-point-sets-with-parallel-hyperplanes-and-sparse-signal-recovery-lenny-fukshansky-cmc/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200204T150000
DTEND;TZID=America/Los_Angeles:20200204T160000
DTSTAMP:20260420T022158
CREATED:20191219T182743Z
LAST-MODIFIED:20200121T223340Z
UID:1697-1580828400-1580832000@colleges.claremont.edu
SUMMARY:Tommaso Cremaschi (USC)
DESCRIPTION:Title: Volumes and filling collections of multicurves\n\n\n\n\nAbstract: In this talk we will be concerned with links L in a Seifert-Fibered space N such that their projection to the base surface is a collection of curves G in minimal position. After stating a hyperbolization result\, for the complement of L\, in terms of G we will study the volume of their complement and give combinatorial asymptotics. We will be particularly interested in the case where N is the projective tangent bundle of a hyperbolic surface. This is joint work with J.A. Rodrigues-Migueles and A. Yarmola.
URL:https://colleges.claremont.edu/ccms/event/tommaso-cremaschi-usc/
CATEGORIES:Topology Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20200205T161500
DTEND;TZID=America/Los_Angeles:20200205T171500
DTSTAMP:20260420T022158
CREATED:20190830T174047Z
LAST-MODIFIED:20200203T185415Z
UID:1434-1580919300-1580922900@colleges.claremont.edu
SUMMARY:Kernel approaches in global statistical distances\, local measure detection\, and active learning
DESCRIPTION:In this talk\, we’ll discuss the problem of constructing meaningful distances between probability distributions given only finite samples from each distribution.  We approach this through the use of data-adaptive and localized kernels\, and in a variety of contexts.  First\, we construct locally adaptive kernels to define fast pairwise distances between distributions\, with applications to unsupervised clustering.  Then\, we construct localized kernels to determine a statistical framework for determining where two distributions differ\, with applications to measure detection for generative models.  Finally\, we’ll begin to address the question of measure detection without a priori known labels of which distribution a point came from.  This is addressed through active learning\, in which one can choose a small number of points at which to query a label.  This is ongoing work with Xiuyuan Cheng (Duke) and Hrushikesh Mhaskar (CGU)\, among others.
URL:https://colleges.claremont.edu/ccms/event/alex-cloninger/
LOCATION:Freeberg Forum\, LC 62\, Kravis Center\, CMC
CATEGORIES:Colloquium
ORGANIZER;CN="Blerta Shtylla":MAILTO:shtyllab@pomona.edu
END:VEVENT
END:VCALENDAR