-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' of https://github.com/kai-vu/site
- Loading branch information
Showing
4 changed files
with
89 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,36 @@ | ||
--- | ||
title: 'Knowledge Compilation for Forgetting Uncertain Evidence' | ||
layout: default | ||
description: 'In this project, students will become familiar with some knowledge compilation techniques and rules for combining uncertain evidence. In particular, they will explore the advantages and disadvantages of using knowledge compilation for forgetting uncertain evidence.' | ||
topic: 'Formal Logics, Modal Logics' | ||
keywords: | ||
- 'Uncertainty' | ||
- 'Knowledge Compilation' | ||
- 'Information fusion' | ||
- 'Belief functions' | ||
supervisor: 'Daira Pinto Prieto' | ||
contact: '[email protected]' | ||
degree: 'M.Sc.' | ||
description_link: '/theses_dir/DPP_KnowComp' | ||
--- | ||
|
||
## {{page.title}} | ||
*Supervisor: {{page.supervisor}} ({{page.contact}})* | ||
|
||
#### Background | ||
Knowledge compilation is a collection of computational approaches that allows to break down some (computationally) hard problems into an offline and an online phase. If the online part can be computed in polynomial time, the problem is said to be compilable to P. In belief function theory there are some rules of combination of evidence whose computation is compilable to P. Therefore, we can think of real-world scenarios where uncertain evidence can be combined and decombined using these rules, overcoming the challenge of their computational complexity. | ||
|
||
|
||
#### Potential projects: | ||
- Following existing literature, implement a solution to compute the unnormalized and normalised rules of combination based on knowledge compilation. Study the advantages and disadvantages of using this solution compared to using other algorithms to decombine uncertain evidence. . | ||
- Extend the literature on the computation of combination rules through knowledge compilation. This may include adapting propositional formulas to accept more general evidence, or defining new propositional formulas that can be used to implement other rules of combination via weighted model counting. | ||
|
||
|
||
#### Literature | ||
- Pierre Marquis. 2015. Compile! In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI’15). AAAI Press, 4112-4118. | ||
|
||
- Daira Pinto Prieto. Combining Uncertain Evidence: Logic and Complexity. Chapter 6. PhD thesis, University of Amsterdam, 2024. ISBN 978-94-6473-618-2. | ||
- Daira Pinto Prieto, Ronald de Haan, and Sébastien Destercke. 2024. How to efficiently decombine belief functions? In Proceedings of the 20th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2024). | ||
|
||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,30 @@ | ||
--- | ||
title: 'Uncertain Evidence in Artificial Intelligence' | ||
layout: default | ||
description: 'This project aims to address the problem of dealing with uncertain information in the context of artificial intelligence. Students can approach this question from a conceptual and/or experimental perspective.' | ||
topic: 'Formal Logics, Modal Logics' | ||
keywords: | ||
- 'Uncertainty' | ||
- 'Belief functions' | ||
- 'Information fusion' | ||
supervisor: 'Daira Pinto Prieto' | ||
contact: '[email protected]' | ||
degree: 'B.Sc.' | ||
description_link: '/theses_dir/DPP_UncerEv' | ||
--- | ||
|
||
## {{page.title}} | ||
*Supervisor: {{page.supervisor}} ({{page.contact}})* | ||
|
||
#### Background | ||
*Give some background information* | ||
|
||
Developing methods for aggregating uncertain information is a thriving area of research. Some of the questions we can investigate on this topic are: What are we uncertain about? How does uncertainty interact with other properties of information (such as consistency or relevance)? How do different aggregation methods behave in practice? | ||
|
||
#### Potential projects: | ||
- Compare different evidence combination rules on a relevant dataset focusing on those cases with mutually contradictory evidence. | ||
- A literature review about epistemic and aleatory uncertainty in artificial intelligence. This review could be complemented with illustrative examples built on real-life data and a (non-extensive) review on computational methods to deal with these kinds of uncertainty. | ||
|
||
|
||
#### Literature | ||
- Chaki, J. (2023). Handling uncertainty in artificial intelligence (1st ed.). Springer Singapore. ISBN 978-981-99-5333-2. |