No article text was recorded for this version.
high-dimensional noise sensitivity
Version 1 of 194 papers99 conceptsfrozen 2026-10-04
Papers in this version
- Blog: High-dimensional Learning with Noisy Labels
- Blog: Assessment of Heterogeneous Treatment Effect Estimation Accuracy via Matching
- Blog: Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Features
- Blog: Dimensionality Reduction for Spectral Clustering
- Blog: Clustering High-dimensional Data with Ordered Weighted $\ell_1$ Regularization
- Blog: Input Routed Echo State Networks
- Blog: Learning to generalize 3D spatial relationships
- Blog: Adaptive Nearest Neighbor Classification Using Support Vector Machines
- Blog: Ball Divergence: Nonparametric two sample test
- Blog: Learning and Evaluation in Presence of Non-i.i.d. Label Noise
- Blog: Learning Contrastive Embedding in Low-Dimensional Space
- Blog: Learning a Metric for Music Similarity
- Blog: Projection Robust Wasserstein Distance and Riemannian Optimization
- Blog: Colored Point Cloud Registration Revisited
- Blog: Brain Density Clustering Analysis: A New Approach to Brain Functional Dynamics
- Blog: Post-hoc Interpretability Illumination for Scientific Interaction Discovery
- Blog: Estimating Mutual Information via Geodesic kNN
- Blog: Using Feature Alignment Can Improve Clean Average Precision and Adversarial Robustness in Object Detection
- Blog: Sample Complexity of Learning Mahalanobis Distance Metrics
- Blog: Projection Robust Wasserstein Barycenters
- Blog: Iterative Double Clustering for Unsupervised and Semi-supervised Learning
- Blog: Constructing Robust Affinity Graphs for Spectral Clustering
- Blog: Relevance Learning for Dimensionality Reduction
- Blog: Determination of the Mahalanobis matrix using nonparametric noise estimations
- Blog: TAFSSL: Task-Adaptive Feature Sub-Space Learning for few-shot classification
- Blog: Semi-Supervised Fuzzy Clustering with Feature Discrimination
- Blog: A Single-Pass Algorithm for Efficiently Recovering Sparse Cluster Centers of High-dimensional Data
- Blog: Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation
- Blog: Identifying Latent Concepts and Structures for Generalized Category Discovery
- Blog: Prediction under Latent Subgroup Shifts with High-Dimensional Observations
- Blog: Interpretable Measures of Conceptual Similarity by Complexity-Constrained Descriptive Auto-Encoding
- Blog: Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA
- Blog: Expertise Trees Resolve Knowledge Limitations in Collective Decision-Making
- Blog: Robust Discriminative Clustering with Sparse Regularizers
- Blog: Feature Selection for Concept Drift Detection
- Blog: Direct Importance Estimation with a Mixture of Probabilistic Principal Component Analyzers
- Blog: A Quest for Structure: Jointly Learning the Graph Structure and Semi-Supervised Classification
- Blog: An Infinite Mixture Model of Generalized Inverted Dirichlet Distributions for High-Dimensional Positive Data Modeling
- Blog: Generalized infinite dimensional Alpha-Procrustes based geometries
- Blog: Projection Robust Wasserstein Barycenters
- Blog: Projection Robust Wasserstein Barycenters
- Blog: Assessing Neural Network Representations During Training Using Noise-Resilient Diffusion Spectral Entropy
- Blog: Knowledge Driven Dimension Reduction for Clustering
- Blog: Signatured Deep Fictitious Play for Mean Field Games with Common Noise
- Blog: DIFFRAC: a discriminative and flexible framework for clustering
- Blog: Finite Sample Error Bound for Parzen Windows
- Blog: Hierarchical Bayesian nonparametric mixture models for clustering with variable relevance determination
- Blog: High-dimensional classification using features annealed independence rules
- Blog: Top-down particle filtering for Bayesian decision trees
- Blog: Clustering Complex Data with Group-Dependent Feature Selection
- Blog: t-Divergence: A New Divergence Measure with Application to Robust Statistics & Clustering
- Blog: Generative Moment Matching Networks
- Blog: Improving k-Nearest Neighbour Classification with Distance Functions Based on Receiver Operating Characteristics
- Blog: Training Logistic Regression and SVM on 200GB Data Using b-Bit Minwise Hashing and Comparisons with Vowpal Wabbit (VW)
- Blog: Receiver Operating Characteristic Curves and Confidence Bands for Support Vector Machines
- Blog: ArcDAE: Asymmetric Rectified Contrastive Diffusion Autoencoder for Unified Representation Learning
- Blog: Discriminative Clustering: Optimal Contingency Tables by Learning Metrics
- Blog: Clustering High-dimensional Data with Ordered Weighted ℓ1 Regularization
- Blog: Isolation Forest Anomaly Detection Algorithm Based On Multi-level Sub-subspace Partition
- Blog: Visualizing High Dimensional Dynamical Processes
Showing 60 of 94 papers.
History & citation
Current · Permanent link
- This direction split from Isolating Structural Signals in High Dimensional Noise (88% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_high_dimensional_noise_sensitivity_eea9cafc,
title = {high-dimensional noise sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-dimensional-noise-sensitivity/rdr_eea9cafcc75f43b2b00700a1cf9004c5},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_high_dimensional_noise_sensitivity_eea9cafc_v1,
title = {high-dimensional noise sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-dimensional-noise-sensitivity/rdr_eea9cafcc75f43b2b00700a1cf9004c5/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}