We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce a novel gradient descent algorithm extending the well-known Gradient Sampling methodology to the class of stratifiably smooth objective functions, which are defined as locally Lipschitz functions that are smooth on some regular pieces-called the strata-of the ambient Euclidean space. For this class of functions, our algorithm achieves a sub-linear convergence rate. We then apply our method to objective functions based on the (extended) persistent homology map computed over lower-star filters, which is a central tool of Topological Data Analysis. For this, we propose an efficient exploration of the corresponding stratification by using the Cayley graph of the permutation group. Finally, we provide benchmark and novel topological optimization problems, in order to demonstrate the utility and applicability of our framework.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.00530")
get_code_for_paper("2109.00530")
have("2109.00530")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.00530.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.00530)
Connect an agent — have() is free.