Logo: University of Southern California

Events Calendar




Events for May 04, 2016

  • Inaugural USC Day of SCupport

    Wed, May 04, 2016

    Aerospace and Mechanical Engineering

    Receptions & Special Events

    On May 4, 2016, the USC community will unite to demonstrate the loyalty and SCupport of the Trojan Family. The goal: Rally as many people as possible to create the single largest day of giving participants in USC history.

    Let us show the world that the collective power of the Trojan Family is unmatched anywhere. Every donor counts and all gifts, no matter the size, make a difference.

    Connect with the USC community by using #DayofSCupport on Facebook, Twitter, LinkedIn, Instagram, and other social media. Your pride in USC can best be shown by our joining together to spread the word about USC Day of SCupport.

    Thank you for your SCupport, and Fight On!

    Visit DayofSCupport.usc.edu to plant your sword and show your support!


    WebCast Link: dayofscupport.usc.edu

    Audiences: Everyone Is Invited

    Posted By: James Morse

  • Communications, Networks & Systems (CommNetS) Seminar

    Wed, May 04, 2016 @ 02:00 PM - 03:00 PM

    Ming Hsieh Department of Electrical Engineering

    Conferences, Lectures, & Seminars

    Speaker: Dr. Wotao Yin, UCLA

    Talk Title: Theory and Applications of Asynchronous Parallel Computing

    Series: CommNetS

    Abstract: Single-core performance stopped improving around 2005. However, 64 CPU-cores workstations, thousand-core GPUs, and even eight-core cellphones are sold at affordable prices. To take advantages of multiple cores, we must parallelize our algorithms. In order for iterative algorithms to have strong parallel performance, it is important to reduce or even remove synchronizations so that the cores can keep running with the information they have, even when the latest one has not arrived. This talk explains why such async-parallel computing is both theoretically sound and practically attractive. In particular, we study fixed-point iterations of a nonexpansive operator and show that randomized async-parallel iterations will almost surely converge to a fixed point, as long as the operator has a fixed point and the step size is properly chosen. Roughly speaking, the convergence speed scales linearly with the number of cores when the number of cores is no more than the square root of the number of variables. As special cases, novel algorithms for linear equation systems, machine learning, distributed and decentralized optimization are introduced. On sparse logistic regression and others, new async-parallel algorithms run order-of-magnitude faster than the traditional sync-parallel algorithms. This is joint work with Zhimin Peng (UCLA), Yangyang Xu (IMA), and Ming Yan (Michigan State).

    Biography: Wotao Yin is a professor in the Department of Mathematics of UCLA. His research interests lie in computational optimization and its applications in image processing, machine learning, and other inverse problems. He received his B.S. in mathematics from Nanjing University in 2001, and then M.S. and Ph.D. in operations research from Columbia University in 2003 and 2006, respectively. During 2006 - 2013, he was with Rice University. He won NSF CAREER award in 2008 and Alfred P. Sloan Research Fellowship in 2009. His recent work has been in optimization algorithms for large-scale and distributed signal processing and machine learning problems.

    Host: Dr. Mahdi Soltanolkotabi

    Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248

    Audiences: Everyone Is Invited

    Posted By: Annie Yu