fault tolerant distributed optimization
play

Fault-Tolerant Distributed Optimization Lili Su, Arun Padakandla, - PowerPoint PPT Presentation

Fault-Tolerant Distributed Optimization Lili Su, Arun Padakandla, Qiong Hu, Seyyed A. Fatemi, Rehana Mahfuz, Vidyasagar Sadhu CSOI-Data Science Workshop May 27th, 2016 Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May


  1. Fault-Tolerant Distributed Optimization Lili Su, Arun Padakandla, Qiong Hu, Seyyed A. Fatemi, Rehana Mahfuz, Vidyasagar Sadhu CSOI-Data Science Workshop May 27th, 2016 Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May 27th, 2016 1 / 6

  2. Multi-Agent Network Distributed Optimization: design distributed algorithms to have the agents cooperatively achieve global tasks Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May 27th, 2016 2 / 6

  3. Examples Power system: public good Sensor network Distributed machine learning · · · Existing work: all agents are cooperative Our focus: the impact of non-cooperative agents Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May 27th, 2016 3 / 6

  4. Problem Formulation n agents are connected by a network G ( V , E ), where V = { 1 , · · · , n } ; Local communication: single hop Each agent i has a local objective function f i ( x ) : R d → R , which is known to agent i only ; One agent is selfish: ˜ j Goal of selfish agent ˜ j : find the x to min f ˜ j ( x ) Goal of the cooperative agents: find the x to min 1 � f i ( x ) |G| i ∈G Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May 27th, 2016 4 / 6

  5. Specific Configuration : Completely connected graph. No memory across iterations. Single-hop communication. One simplied selfish agent. Exchange local estimates only without gradients Question Are we able to design distributed optimization algorithms/protocols such that the selsh agent can be detected and “removed” Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May 27th, 2016 5 / 6

  6. Future Work Question: Are we able to design distributed optimization algorithms/protocols such that the selfish agent can be detected or “removed”? Yes. Improve the algorithm Consider more complex scenarios arbitrary connected graph (instead of fully connected) multihop communication multiple selfish agents “smart” selfish agents No. Consider with memory Consider hierarchical architecture Applied directions: Study/improve algorithm for specific applications such as wireless sensor network, distributed machine learning, etc. Lili Su et al. (SOI-DSWKSP) Fault-tolerant distributed optimization May 27th, 2016 6 / 6

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend