Seminar: Sirisha RambhatlaExport this event to calendar

Tuesday, May 11, 2021 — 1:00 PM to 2:15 PM EDT

Provably Learning from Data: New Algorithms and Models for Matrix and Tensor Decompositions 

Dr. Sirisha Rambhatla

Department of Computer Science,

University of Southern California, Los Angeles, CA, USA

Via https://zoom.us/j/97054271634?pwd=aEhtQnZtYzNZc2VIQTFDL2N3MmdGQT09

Abstract

 Learning and leveraging patterns from data has fueled the recent major advances in data driven services. As these solutions become ubiquitous and get incorporated into critical applications such as healthcare and transportation, there is an increasing need to understand their decision-making mechanism to know their limits and develop new algorithms with guarantees. Moreover, with data being generated at unprecedented rates, these algorithms also need to be fast, learn on-the-fly (online), handle large volumes of data (scalable), and be computationally efficient.

In this talk, I will present my recent work on provable algorithms for matrix and tensor factorization. Specifically, I will first present an algorithm for dictionary learning, where the task is to represent a given data vector as a sparse linear combination ( coefficients) of columns of a matrix known as a dictionary. Since both the dictionary and the coefficients parameterizing the linear model are a priori unknown, this entails solving an inherently non-convex optimization task. The current state-of-the-art provable dictionary learning algorithms focus only on the recovering the dictionary, which leads to an irreducible error in the estimation and consequently jeopardizes sparse coefficient recovery.

Overcoming these limitations, I will present a scalable online alternating optimization-based algorithm for dictionary learning with exact recovery guarantees on both the dictionary and the coefficients at a linear rate. Complementary to these theoretical results, I will present neural architectures which can speed-up computations and numerical simulations demonstrating significantly superior performance over other techniques. Furthermore, I will also present a provable algorithm for another inherently non-convex task of factorizing a structured tensor leveraging these results.

Finally, I will conclude with an overview of my other ongoing research efforts, including alternative ways of building reliable machine learning algorithms via model interpretability, and future directions.

Biographical Sketch

Dr. Sirisha Rambhatla is a Postdoctoral Researcher in the Computer Science department at the University of Southern California, Los Angeles. Her research focuses on building reliable machine learning algorithms for real-world applications with a focus on Artificial Intelligence (AI) for Healthcare and Surgery using provable algorithms, interpretable machine learning, and learning from limited labels using physics priors and transfer learning.

Recipient of academic awards such as E Bruce Lee Memorial Fellowship and Minnesota High Tech Association's SciTechsperience Fellowship, Dr. Rambhatla received her Ph.D. and Masters in Electrical Engineering from the University of Minnesota--Twin Cities, Minneapolis, MN, U.S.A. in 2019 and 2012, respectively. She received her B.Tech with Honors in Electronics and Telecommunication Engineering from College of Engineering Roorkee, Roorkee, India in 2010 (University Bronze Medalist).

S M T W T F S
25
26
27
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
  1. 2021 (17)
    1. June (1)
    2. May (4)
    3. April (4)
    4. March (3)
    5. February (3)
    6. January (2)
  2. 2020 (83)
    1. December (2)
    2. November (8)
    3. October (6)
    4. September (4)
    5. August (2)
    6. July (14)
    7. June (20)
    8. May (18)
    9. March (7)
    10. February (7)
    11. January (3)
  3. 2019 (72)
  4. 2018 (43)
  5. 2017 (35)
  6. 2016 (11)
  7. 2015 (10)
  8. 2014 (8)
  9. 2013 (8)
  10. 2012 (3)