Daniel L. Pimentel-Alarcón

Karan Vikyath Veeranna Rupashree

INFORMS J. Optim., 2025

Deep-Union Completion.

[BibT_eX]

[DOI]

Siddharth Baskar

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

GrassCaré: Visualizing the Grassmannian on the Poincaré Disk.

[BibT_eX]

[DOI]

SN Comput. Sci., March, 2024

Contrastive Learning with Orthonormal Anchors (CLOA).

[BibT_eX]

[DOI]

CoRR, 2024

TransFusion: Contrastive Learning with Transformers.

[BibT_eX]

[DOI]

CoRR, 2024

Group-Sparse Subspace Clustering with Elastic Stars.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Fusion over the Grassmannian for High-Rank Matrix Completion.

[BibT_eX]

[DOI]

Jeremy S. Johnson

Proceedings of the IEEE International Symposium on Information Theory, 2024

Principle Component Trees and Their Persistent Homology.

[BibT_eX]

[DOI]

Ben A. Kizaric

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Visualizing Grassmannians via Poincare Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 18th International Joint Conference on Computer Vision, 2023

2022

A Perturbation Bound on the Subspace Estimator from Canonical Projections.

[BibT_eX]

[DOI]

Karan Srivastava

Proceedings of the IEEE International Symposium on Information Theory, 2022

Geometry of the Minimum Volume Confidence Sets.

[BibT_eX]

[DOI]

Heguang Lin

Mengze Li

Matthew L. Malloy

Proceedings of the IEEE International Symposium on Information Theory, 2022

Fusion Subspace Clustering for Incomplete Data.

[BibT_eX]

[DOI]

Usman Mahmood

Proceedings of the International Joint Conference on Neural Networks, 2022

Minimum-Length Trace Reconstruction via Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Classifying Incomplete Data with a Mixture of Subspace Experts.

[BibT_eX]

[DOI]

Ben A. Kizaric

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021

Tensor Methods for Nonlinear Matrix Completion.

[BibT_eX]

[DOI]

Greg Ongie

Laura Balzano

Rebecca Willett

SIAM J. Math. Data Sci., 2021

Classification of animal sounds in a hyperdiverse rainforest using Convolutional Neural Networks.

[BibT_eX]

[DOI]

Yuren Sun

Tatiana Midori Maeda

Alejandro Pimentel-Alarcón

Zuzana Burivalova

CoRR, 2021

Mixed-Features Vectors and Subspace Splitting.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Learning Representations, 2021

2019

GLIMPS: A Greedy Mixed-Integer Approach for Super Robust Matched Subspace Detection.

[BibT_eX]

[DOI]

Md Mahfuzur Rahman

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018

Fusion Subspace Clustering: Full and Incomplete Data.

[BibT_eX]

[DOI]

Usman Mahmood

CoRR, 2018

Mixture Matrix Completion.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Breaking the Limits of Subspace Inference.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Adversarial principal component analysis.

[BibT_eX]

[DOI]

Aritra Biswas

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Low algebraic dimension matrix completion.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Random Consensus Robust PCA.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016

Corrections to "A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion".

[BibT_eX]

[DOI]

Nigel Boston

IEEE J. Sel. Top. Signal Process., 2016

Group-sparse subspace clustering with missing data.

[BibT_eX]

[DOI]

Proceedings of the IEEE Statistical Signal Processing Workshop, 2016

Crime Detection via Crowdsourcing.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 8th Mexican Conference, 2016

A converse to low-rank matrix completion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

The Information-Theoretic Requirements of Subspace Clustering with Missing Data.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

Necessary and sufficient conditions for sketched subspace clustering.

[BibT_eX]

[DOI]

Laura Balzano

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

A simpler approach to low-rank tensor canonical polyadic decomposition.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Deterministic conditions for subspace identifiability from incomplete sampling.

[BibT_eX]

[DOI]

Nigel Boston

Proceedings of the IEEE International Symposium on Information Theory, 2015

Adaptive strategy for restricted-sampling noisy low-rank matrix completion.

[BibT_eX]

[DOI]

Proceedings of the 6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2015

A characterization of deterministic sampling patterns for low-rank matrix completion.

[BibT_eX]

[DOI]

Nigel Boston

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

To lie or not to lie in a subspace.

[BibT_eX]

[DOI]

CoRR, 2014

On the sample complexity of subspace clustering with missing data.

[BibT_eX]

[DOI]