BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Engineering & Systems Group - Texas A&M University - ECPv5.2.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Engineering & Systems Group - Texas A&M University
X-ORIGINAL-URL:https://cesg.tamu.edu
X-WR-CALDESC:Events for Computer Engineering & Systems Group - Texas A&M University
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20130310T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20131103T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20131007T160000
DTEND;TZID=America/Chicago:20131007T170000
DTSTAMP:20211018T094038
CREATED:20131004T134001Z
LAST-MODIFIED:20131004T134001Z
UID:2150-1381161600-1381165200@cesg.tamu.edu
SUMMARY:CESG Fishbowl Seminar: Randomized Kaczmarz algorithm
DESCRIPTION:Room 333 (fishbowl) \nNikolaos M. Freris\nSenior Researcher in École Polytecnique Fédérale de Lausanne (EPFL) \nAbstract:\nWe propose and analyze a randomized iterative variant of Kaczmarz algorithm for solving large-scale linear systems. The scheme features exponential convergence in the m.s. to the minimum-norm least-squares solution of a given linear system of equations. The expected number of arithmetic operations is proportional to the squared condition number of the system multiplied by the number of non-zero entries of the input matrix. We experimentally test the performance against the vastly mature literature of linear solvers and showcase improvements. \nIn sensor networks\, we study the problem of estimation from noisy relative measurements\, i.e.\, differences of nodal values across edges. We use Randomized Kaczmarz to design and analyze a new class of distributed asynchronous consensus algorithms\, and analyze the convergence rate depending solely on properties of the network topology. Inspired by the analytical insights\, we propose Randomized Kaczmarz Over-smoothing (RKO)\, which has demonstrated\, in both theory and simulations\, improvement over leading protocols in terms of both convergence speed-up and energy savings. \nKeywords: Randomized algorithms\, Distributed algorithms\, Consensus\, Wireless Sensor Networks. \nBio\nNikolaos M. Freris received the Diploma in Electrical and Computer Engineering from the National Technical University of Athens\, Greece in 2005 and the M.S. degree in Electrical and Computer Engineering\, the M.S. degree in Mathematics\, and the Ph.D. degree in Electrical and Computer Engineering all from the University of Illinois at Urbana-Champaign in 2007\, 2008\, and 2010\, respectively. He is currently a senior researcher in École Polytecnique Fédérale de Lausanne (EPFL). From 2010-2012\, he was a postdoctorate researcher in IBM Research – Zurich\, Switzerland. His research interests span the areas of control\, wireless and sensor networks\, signal processing and data mining with provable guarantees. He was a recipient of IBM invention achievement award\, in 2011\, and the Gerondelis and Vodafone fellowships for graduate studies. Dr. Freris is a member of IEEE\, SIAM and the Technical Chamber of Greece. \nHost: Dr. Kumar
URL:https://cesg.tamu.edu/seminar/cesg-fishbowl-seminar-randomized-kaczmarz-algorithm/
END:VEVENT
END:VCALENDAR