research
∙
09/09/2022
Sample Complexity Bounds for Learning High-dimensional Simplices in Noisy Regimes
In this paper, we propose a sample complexity bound for learning a simpl...
share
research
∙
11/02/2021
Distributed Sparse Feature Selection in Communication-Restricted Networks
This paper aims to propose and theoretically analyze a new distributed s...
research
∙
05/24/2019
Robustness to Adversarial Perturbations in Learning from Incomplete Data
What is the role of unlabeled data in an inference problem, when the pre...
research
∙
10/18/2018
On Statistical Learning of Simplices: Unmixing Problem Revisited
Learning of high-dimensional simplices from uniformly-sampled observatio...
research
∙
10/05/2017