Fahad Panolan — accepted AI-conference papers

2024

Solving Quantified Boolean Formulas with Few Existential Variables

Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki

IJCAI 2024poster

The quantified Boolean formula (QBF) problem is an important decision problem generally viewed as the archetype for PSPACE-completeness. Many problems of central interest in AI are in general not included in NP, e.g., planning, model checking, and non-monotonic reasoning, and for such problems QBF…

Cited by 0 Source ↗PDF ↗Scholar ↗

2021

Fixed-Parameter and Approximation Algorithms for PCA with Outliers

Yogesh Dahiya, Fedor Fomin, Fahad Panolan, Kirill Simonov

ICML 2021spotlight

PCA with Outliers is the fundamental problem of identifying an underlying low-dimensional subspace in a data set corrupted with outliers. A large body of work is devoted to the information-theoretic aspects of this problem. However, from the computational perspective, its complexity is still not wel…

Cited by 7 Source ↗PDF ↗Scholar ↗

2019

Refined Complexity of PCA with Outliers

Kirill Simonov, Fedor Fomin, Petr Golovach, Fahad Panolan

ICML 2019oral

Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance and bioinformatics to image analysis and neuroscience. However, it is well-documented that the applicability of PCA in man…

Cited by 19 Source ↗PDF ↗Scholar ↗