1. Strategies for Distributed CBR Santi Ontañón IIIA-CSIC

2. OUTLINE CBR Introduction Applications Distributed CBR Autonomous CBR agents Collaboration policies Learning to collaborate Case Bartering Conclusions

3. What is CBR? Case Based Reasoning: To solve a new problem by noticing its similarity to one or several previously solved problems and by adapting their solutions instead of working out a solution from scratch.

4. General Knowledge CBR: Cycle CASE BASE Retrieved cases New case Tested Case Solved case RETRIEVE REUSE REVISE RETAIN PROBLEM

5. CBR: Retrieve Is the key problem in CBR Indexing: Relevant features: predictive, discriminatory and explanatory. Good case representation Similarity metrics

6. CBR: Reuse Copy solution (for classification) Modify old solution: Reinstantiate (variables) Local search Transform Domain knowledge (causal model)

7. CBR: Revise Apply solution to problem: In real world In simulated world Evaluate Repair User guided Internal (Domain knowledge)

8. CBR: Retain What to retain? Relevant problems Solution (failed/successful) Solution method Store case Update/indentify indexes

9. CBR systems: CHEF, cooking planing (Hammon 86) HYPO, legal reasoning (Ashley/Rissland 87) PROTOS, medical diagnosis (Bereiss/Porter 88) CASEY, medial diagnosis (Koton 89) SAXEX, expresive music (Arcos 96)

10. Distributed CBR  Autonomous CBR agents  Collaboration policies  Learning to collaborate  Case Bartering

11. Autonomous CBR agents Multiagent CBR system Each agent has an individual Case-Base Agent has autonomy in Problem acquisition Problem solving Learning Collaboration policies Explicit strategies to improve individual performance

12. Multiagent CBR system MAC (Multiagent CBR) System An agent is a pair (A i,C i ) A Case base Classification task in

13. Collaboration policies Committee Peer Counsel Bounded Counsel

14. Collaboration An agent A 1 with problem P Sends P to some agents A={ A 2,…,A n } Each A j answers with a Solution Endorsing Record (SER) Endorsing pairs: ( S k,E j k )

15. Solution Endorsing Record (SER) P4P4 S3S3 P1P1 S1S1 P3P3 S2S2 P5P5 S2S2 P8P8 S1S1 P7P7 S3S3 P2P2 S1S1 P6P6 S2S2 P9P9 S4S4 { (S 2,1), (S 3,2) } P Relevant cases

16. Voting(1) A t is the set of agents submitting SER at time t (including the initiating agent). Each agent has 1 vote The vote can be fractionally assigned to various solution classes:

17. Voting(2) The agent that receives de SERs, aggregates the votes: The proposed solution is that with maximum Ballot:

18. Committee policy (1) An agent A 1 with problem P Sends P to all the other agents A={ A 2,…,A n } Each A j answers with a Solution Endorsing Record (SER) The majority vote selects the solution class

19. Agent interaction: Committee A1A1 C1C1 P A3A3 C3C3 A2A2 C2C2

20. A1A1 C1C1 P A3A3 C3C3 A2A2 C2C2 P P

21. A1A1 C1C1 P SER of A 1 A3A3 C3C3 A2A2 C2C2 SER of A 2 SER of A 3

22. Agent interaction: Committee A1A1 C1C1 P SER of A 1 SER of A 2 SOLUTION SER of A 3 A3A3 C3C3 A2A2 C2C2 Voting

23. Committee policy (2) Robust Good accuracy even with big number of agents with small case-bases Cost Linear with number of agents Always asks all agents

24. Peer Counsel The agent try to solve the problem by itself Assess competence of current solution: Votes for the max class >> rest of votes: If not competent, ask all other agents Like committee

25. Agent interaction: Peer Counsel A1A1 C1C1 P A3A3 C3C3 A2A2 C2C2

26. A1A1 C1C1 P A3A3 C3C3 A2A2 C2C2 SER of A 1 Competent!

27. Agent interaction: Peer Counsel A1A1 C1C1 P A3A3 C3C3 A2A2 C2C2 SER of A 1 SOLUTION Voting

28. Bounded Counsel Use self-competence model If not competent, ask one agent Agent returns a SER Assess competence of current solution (Termination Check): Votes for the max class >> rest of votes: If not competent, ask one agent more

29. Agent interaction: Bounded Counsel A1A1 C1C1 P A3A3 C3C3 A2A2 C2C2

30. A1A1 C1C1 P SER of A 1 A3A3 C3C3 A2A2 C2C2 Not competent!

31. Agent interaction: Bounded Counsel A1A1 C1C1 P SER of A 1 A3A3 C3C3 A2A2 C2C2 P

32. Agent interaction: Bounded Counsel A1A1 C1C1 P SER of A 1 A3A3 C3C3 A2A2 C2C2 SER of A 2

33. Agent interaction: Bounded Counsel A1A1 C1C1 P SER of A 1 A3A3 C3C3 A2A2 C2C2 SER of A 2 Competent!

34. Agent interaction: Bounded Counsel A1A1 C1C1 P SER of A 1 A3A3 C3C3 A2A2 C2C2 SER of A 2 SOLUTION Voting

35. Learning to collaborate Bounded Counsel fixed predicate to assess competence Proactive Learning Improve collaboration Actions performed in order to learn learning when to ask counsel

36. Learning to collaborate(2) A1A1 C1C1 P SER of A 1 SER of A 2 SER of A 3 Do I need the counsel of another agent? CANDIDATE SOLUTION Voting

37. Case Bartering Why? Biased individual case-bases How? Estimating underlying distribution Interchanging cases between agents

38. Case Bartering(2) Estimation of underlying distribution: Aggregating statistics of all the individual case-bases.

39. Case Bartering(3) Case-Base bias: The agents should minimize its bias

40. Case Bartering(4) Bartering Protocol: 1. Estimate underlying distribution 2. Send offers 3. Confirm offers 4. Interchange cases 5. If changes go to 2, else END.

41. Conclusions Multi-agent systems offer new paradigms to organize AI. Agent interaction is still a stimulating challenge. CBR fits perfectly with these kind of applications.