ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “high-dimensional data”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.AIcs.DSEmpiricalRecentJul 9, 2026

Dimensionality Reduction Meets Network Science: Sensemaking on UMAP's kNN Graph

Duen Horng Chau, Donghao Ren, Fred Hohman, Dominik Moritz

This paper explores the use of standard graph algorithms on UMAP's internal k-nearest-neighbor graph to enhance data analysis.

View →
stat.MLcs.LGEmpiricalRecentJun 10, 2026

Renewable Lasso without Batch-Number Constraints: A Gradient-Enhanced Approach

Junzhuo Gao, Ling Peng, Xu Guo, Heng Lian

This paper proposes improved online estimation methods for high-dimensional generalized linear models with streaming data.

View →
cs.LGRecentJun 3, 2026

BBOmix: A Tabular Benchmark for Hyperparameter Optimization of Unsupervised Biological Representation Learning

Luca Thale-Bombien, Jan Ewald, Ralf König, Aaron Klein

This paper introduces BBOmix, an open-source benchmark for unsupervised representation learning on real-world biological data.

View →
cs.DScs.CGcs.LGTheoreticalRecentJul 3, 2026

Dimension Reduction for Curves: Simplified and Generalized

Matthijs Ebbens, Jie Lu, Alexander Munteanu

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…

View →
cs.LGcs.AIRecentMay 29, 2026

From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

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.

View →
cs.CLEmpiricalRecentAug 14, 2026

Local and Global Regimes of Geometric Complexity in Language Model Representations

Arwa Osman, Marco Baroni, Iuri Macocco

This paper investigates the relationship between lexical diversity and intrinsic dimensionality in language models.

View →
math.MGq-bio.QMstat.MLEmpiricalRecentJun 10, 2026

Magnitude-Based Features for Multispecies Spatial Data

Julia Sollberger, Joshua Bull, Sara Kališnik, Bernadette Stolz

This paper proposes magnitude-based features for analyzing multispecies spatial data.

View →
cs.DBcs.IREmpiricalRecentOct 30, 2026

Fidelity Synopses: Pre-Execution Plan Selection for Approximate Vector Search

Adithya Ramanatha, Sanskar S. Singh, Maya Ramanath

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.

View →
eess.AScs.CRcs.LGMay 4, 2026

Dimensionality-Aware Anomaly Detection in Learned Representations of Self-Supervised Speech Models

Sandra Arcos-Holzinger, Sarah M. Erfani, James Bailey, Sanjeev Khudanpur

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…

View →
stat.MEstat.MLEmpiricalRecentJul 22, 2026

Twoblock clustering trees with coskewness-based dimension reduction: recovering piecewise multivariate linear regimes

Sven Serneels

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…

View →
math.STcs.LGstat.MLSurveyRecentJun 15, 2026

Learning the Geometry of Data: A Mathematical Review of Shape Space Analysis

Gary P. T. Choi, Khanh Dao Duc, Shira Faigenbaum-Golovin, Karen Habermann +5 more

This paper surveys the rapidly growing body of work on shape space analysis, providing a mathematical and computational framework for studying geometric data.

View →
cs.IRcs.AIcs.LGRecentMay 28, 2026

No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval

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…

View →
stat.MLcs.LGTheoreticalRecentOct 11, 2026

Minimax Rates and Improved Spectral Convergence for Multi-Manifold Clustering

Haoyu Chen, Chenghui Li

The paper studies eigenpair estimation for the tensorized Laplace--Beltrami operator from multi-manifold mixture data.

View →