Working with Subspace Embeddings part5(Machine Learning 2024)

1. Efficient Randomized Subspace Embeddings for Distributed Optimization under a Communication Budget(arXiv)

Author :

Abstract :

2. Defining equations of subspace arrangements embedded in reflection arrangements(arXiv)

Author : Jessica Sidman

Abstract : We give explicit generators for ideals of two classes of subspace arrangements embedded in certain reflection arrangements, generalizing results of Li-Li and Kleitman-Lovasz. We also give minimal generators for the ideals of arrangements that arise in a natural way from the p-skeleton of an n-dimensional cube and discuss conditions under which the generators that we give form a Groebner basis.