Ali Siahkoohi, Anirudh Thatipelli
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.
Functional data clustering is concerned with grouping functions that share similar structure, yet most existing methods implicitly operate on sampled grids, causing cluster assignments to depend on resolution, sampling density, or preprocessing choices rather than on the underlying functions themselves. To address this limitation, we introduce a framework that maps discretized function observationsat arbitrary resolution and on arbitrary gridsinto a fixed-dimensional vector space via an autoencoding architecture. The encoder is a hypernetwork that maps coordinate-value pairs to the weight space of an implicit neural representation (INR), which serves as the decoder. Because INRs represent functions with very few parameters, this design yields compact representations that are decoupled from the sampling grid, while the hypernetwork amortizes weight prediction across the dataset. Clustering is then performed in this weight space using standard algorithms, making the approach agnostic to both the discretization and the choice of clustering method. By means of synthetic and real-world experiments in high-dimensional settings, we demonstrate competitive clustering performance that is robust to changes in sampling resolution-including generalization to resolutions not seen during training.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2602.22823")
get_code_for_paper("2602.22823")
have("2602.22823")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2602.22823.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2602.22823)
Connect an agent — have() is free.