1 option
Discrete and Continuous Optimization for Collaborative and Multi-Task Learning / Arman Adibi.
- Format:
- Book
- Thesis/Dissertation
- Author/Creator:
- Adibi, Arman, author.
- Language:
- English
- Subjects (All):
- Electrical engineering.
- Computer science.
- Mathematics.
- Computer engineering.
- Electrical and Systems Engineering--Penn dissertations.
- Penn dissertations--Electrical and Systems Engineering.
- Local Subjects:
- Electrical engineering.
- Computer science.
- Mathematics.
- Computer engineering.
- Electrical and Systems Engineering--Penn dissertations.
- Penn dissertations--Electrical and Systems Engineering.
- Physical Description:
- 1 online resource (323 pages)
- Contained In:
- Dissertations Abstracts International 85-03B.
- Place of Publication:
- [Philadelphia, Pennsylvania] : University of Pennsylvania, 2022.
- Ann Arbor : ProQuest Dissertations & Theses, 2023
- Language Note:
- English
- Summary:
- This thesis is dedicated to addressing the challenges of robust collaborative learning and optimization in both discrete and continuous domains. With the ever-increasing scale of data and the growing demand for effective distributed learning, a multitude of obstacles emerge, including communication limitations, resilience to failures and corrupted data, limited information access, and collaboration in multi-task learning scenarios. The thesis consists of eight chapters, each targeting specific aspects of these challenges.In the second chapter, novel algorithms are introduced for collaborative linear bandits, offering a comprehensive exploration of the benefits of collaboration in the presence of adversaries through thorough analyses and lower bounds. The third chapter delves into multi-agent min-max learning problems by tackling the presence of Byzantine adversarial agents. Chapter four delves into the effects of delays within stochastic approximation schemes, investigating non-asymptotic convergence rates under Markovian noise.Moving forward, the fifth chapter focuses on analyzing the performance of standard min-max optimization algorithms with delayed updates. The sixth chapter concentrates on robustness in discrete learning, specifically addressing convex-submodular problems in mixed continuous-discrete domains. The seventh chapter tackles the challenge of limited information access in collaborative problems with distributed constraints, developing optimal algorithms for submodular maximization under distributed partition matroid constraints.Lastly, the eighth chapter introduces a discrete variant of multi-task learning and meta-learning. In summary, this thesis contributes to the field of robust collaborative learning and decision-making by providing insights, algorithms, and theoretical guarantees in discrete and continuous optimization. The advancements made across linear bandits, minimax optimization, distributed robust learning, delayed optimization, and submodular maximization pave the way for future developments in collaborative and multi-task learning.
- Notes:
- Source: Dissertations Abstracts International, Volume: 85-03, Section: B.
- Advisors: Hassani, Hamed; Pappas, Geoerge J.; Committee members: Karbasi, Amin; Shakkottai, Sanjay.
- Department: Electrical and Systems Engineering.
- Ph.D. University of Pennsylvania 2023.
- Local Notes:
- School code: 0175
- ISBN:
- 9798380384612
- Access Restriction:
- Restricted for use by site license.
- This item is not available from ProQuest Dissertations & Theses.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.