Exploiting Data Geometry in Machine Learning
Abstract
A key challenge in Machine Learning (ML) is the identification of geometric structure in high-dimensional data. Most algorithms assume that data lives in a high-dimensional vector space; however, many applications involve non-Euclidean data, such as graphs, strings and matrices, or data whose structure is determined by symmetries in the underlying system. Here, we discuss methods for identifying geometric structure in data and how leveraging data geometry can give rise to efficient ML algorithms with provable guarantees.
Cite
Text
Weber. "Exploiting Data Geometry in Machine Learning." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I20.30297Markdown
[Weber. "Exploiting Data Geometry in Machine Learning." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/weber2024aaai-exploiting/) doi:10.1609/AAAI.V38I20.30297BibTeX
@inproceedings{weber2024aaai-exploiting,
title = {{Exploiting Data Geometry in Machine Learning}},
author = {Weber, Melanie},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2024},
pages = {22681},
doi = {10.1609/AAAI.V38I20.30297},
url = {https://mlanthology.org/aaai/2024/weber2024aaai-exploiting/}
}