CSE Seminar: Rong Jin

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Friday September 28, 2012 - Saturday September 29, 2012
      2:00 pm - 2:59 pm
  • Location: Klaus 2447
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact

Hongyuan Zha 

zha@gatech.edu

Summaries

Summary Sentence: Stochastic Gradient Descent with Only One Projection

Full Summary:

Stochastic Gradient Descent with Only One Projection

Speaker:

Rong Jin, Michigan State University

Title: 

Stochastic Gradient Descent with Only One Projection

Abstract:

Stochastic gradient descent (SGD) have been widely used for large-scale convex optimization. Although many variants of stochastic gradient descent have been proposed, most of them require projecting the intermediate solution at each iteration to ensure that the obtained solution stay within the feasible domain. For complex domains (e.g. SDP cone), the projection step can be computationally expensive, making stochastic gradient descent unattractive for large-scale optimization problems. In this talk, I will discuss our work that explicitly addresses this limitation of stochastic gradient descent.

The key feature of the proposed algorithm is that it does not need to project the intermediate solution to the feasible domain. Instead, only one projection at the last iteration is needed to obtain a feasible solution from the given domain. Our analysis shows that with a high probability, the proposed algorithms achieve an O(1/sqrt{T}) convergence rate for general convex optimization, and an O([ln T]/T ) rate for strongly convex functions under mild conditions about the domain and the objective function.

Bio:

Dr. Jin is an associate professor in the Department of Computer Science and Engineering at Michigan State University. His research is focused on statistical machine learning and its application to information retrieval. He has worked on a variety of machine learning algorithms/theories and their application to a wide range of applications, including information retrieval, collaborative filtering, document clustering, and visual object recognition. He has published over 180 conference and journal articles on related topics.

Dr. Jin holds a Ph.D. in Computer Science from Carnegie Mellon University in 2003. He received the NSF Career Award in 2006, and the best student paper of COLT in 2012.

Additional Information

In Campus Calendar
Yes
Groups

High Performance Computing (HPC), College of Computing, School of Computer Science, School of Interactive Computing, School of Computational Science and Engineering

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Joshua Preston
  • Workflow Status: Published
  • Created On: Sep 26, 2012 - 9:39am
  • Last Updated: Oct 7, 2016 - 10:00pm