20 results for “high-dimensional data”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper explores the use of standard graph algorithms on UMAP's internal k-nearest-neighbor graph to enhance data analysis.
This paper proposes improved online estimation methods for high-dimensional generalized linear models with streaming data.
This paper introduces BBOmix, an open-source benchmark for unsupervised representation learning on real-world biological data.
This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…
Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more
The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.
This paper investigates the relationship between lexical diversity and intrinsic dimensionality in language models.
This paper proposes magnitude-based features for analyzing multispecies spatial data.
This paper proposes a synopsis-guided approach to optimize vector search in databases by predicting the fidelity of different configurations and selecting the most cost-effective one for each query.
The paper introduces GRIDS, a framework using Local Intrinsic Dimensionality (LID) to detect anomalies in self-supervised speech model representations, showing that LID elevation correlates with ASR d…
The twoblock clustering tree is introduced as a new type of interpretable regression tree for multivariate responses, using local multivariate linear models as leaves and twoblock dimension reduction…
This paper surveys the rapidly growing body of work on shape space analysis, providing a mathematical and computational framework for studying geometric data.
Lixuan Guo, Yifei Wang, Tiansheng Wen, Aosong Feng +2 more
The paper introduces Single-stage Sparse Retrieval (SSR), a method that replaces computationally expensive vector clustering with sparse autoencoding to achieve highly efficient multi-vector retrieval…
The paper studies eigenpair estimation for the tensorized Laplace--Beltrami operator from multi-manifold mixture data.