High dimensional data analysis is known to be as a challenging problem. In this article, we give a theoretical analysis of high dimensional classification of Gaussian data which relies on a geometrical analysis of the error measure. It links a problem of classification with a problem of nonparametric regression. We giv…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,694 papers · 148 categories
Trend · papers per month
48 results for “high-dimensional analysis”
New method explains high-dimensional text classifiers.
problem Limited explainability tools for high-dimensional inputs and neural networks.
method Theoretical high-dimensional properties in neural networks.
result Improved explainability for neural network classifiers.
Nonlinear Sparse Generalized Canonical Correlation Analysis for Multi-view High-dimensional Datastat.ML
New methods integrate nonlinear, sparse, and multi-view aspects for high-dimensional data analysis.
problem Integrating nonlinear dependence, sparsity, and multi-view data in high-dimensional datasets.
method Proposes HSIC-SGCCA, SA-KGCCA, and TS-KGCCA methods for multi-view high-dimensional data analysis.
result HSIC-SGCCA outperforms competing methods in multi-view variable selection.
New method analyzes complex multivariate pathways in high-dimensional data.
problem High-dimensional mediation analysis of multivariate exposures, mediators, and outcomes.
method Simultaneous variable selection, indirect effect matrix estimation, and prediction of multivariate outcomes.
result Identifies biologically interpretable genetic-neural-cognitive pathways.
Tensor Regressionstat.ML
Tensor Regression tackles high-dimensional data analysis.
problem Challenges in traditional data representation methods for high-dimensional data.
method Systematic study and analysis of tensor-based regression models.
result Provides solutions for specific regression tasks with multiway data.
New method for tensor classification with missing data.
problem Handling incomplete tensor data in high-dimensional classification.
method High-dimensional tensor linear discriminant analysis with TGMM and Tensor LDA-MD.
result Established convergence rates and minimax optimal bounds for misclassification rate.
Overview of high-dimensional time series regression methods.
problem Estimation and inference with high-dimensional time series data.
method Limit theory for high-dimensional dependent data, asymptotic theory for time series regression, statistical learning methods.
result Main limit theory results and asymptotic theory for high-dimensional time series regression.
PROD method improves high-dimensional regression by handling strong correlations.
problem Violation of Irrepresentable Condition in LASSO for high-dimensional data.
method PROD procedure based on orthogonal decomposition of design matrix.
result PROD enhances performance of high-dimensional penalized regression.
New framework tackles high-dimensional reliability analysis using surrogate models and active subspaces.
problem High computational cost and curse of dimensionality in reliability analysis of high-dimensional systems.
method Sparse Active Subspace (SAS) algorithm for identifying low-dimensional manifolds and constructing efficient surrogate models.
result Proposed framework significantly improves accuracy and efficiency of reliability analysis compared to existing methods.
Paper studies the theoretical equivalence between implicit and explicit neural networks in high dimensions.
problem Lack of theoretical analysis of implicit and explicit neural networks.
method Examined high-dimensional implicit neural networks and established their equivalence to explicit networks.
result Equivalence between implicit and explicit neural networks in high dimensions.
Bayesian tree ensemble model for estimating treatment effects in high-dimensional survival data.
problem Estimating heterogeneous treatment effects in censored survival data with many covariates.
method Developed a Bayesian tree ensemble model with a horseshoe prior for adaptive shrinkage.
result Accurately estimates treatment effects in high-dimensional covariate spaces and non-linear functions.
Novel method converts time series data into functional data for high dimensional classification.
problem Small sample size problem in high dimensional time series data.
method Classwise Functional Principal Component Analysis (PCA) followed by Bayesian linear classifier.
result Demonstrated efficacy on synthetic and real data sets.
New KNN test improves association analysis of high-dimensional sequencing data.
problem Challenges in using neural networks for high-dimensional sequencing data analysis.
method Kernel-based neural network (KNN) test for complex association analysis.
result KNN test outperforms SKAT in detecting non-linear and interaction effects.
Localized Sparse Principal Component Analysis of Multivariate Time Series in Frequency Domainstat.ME
The paper introduces a method for interpretable principal component analysis of high-dimensional time series.
problem Inconsistent and difficult-to-interpret principal component estimates in high-dimensional regimes.
method Localized sparse principal component analysis of spectral density matrices in frequency domain.
result Efficient algorithm for sparse-localized estimates of principal subspaces.
PERCEPT detects changes in high-dimensional data streams using topological data analysis.
problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.
Mapper and Ball Mapper tools for complex data analysis.
problem Exploring and visualizing high-dimensional data and scalar functions.
method Combining Mapper and Ball Mapper, adding new features for encoding structure and symmetries.
result A new hybrid algorithm, Mapper on Ball Mapper, for comparing high-dimensional data descriptors.
The paper analyzes PLS-SVD in high-dimensional data integration, revealing its strengths and limitations.
problem Understanding the behavior of PLS-SVD in high-dimensional data integration.
method Analysis using random matrix theory and singular value decomposition.
result PLS-SVD exhibits counter-intuitive or limiting behavior in certain regimes and outperforms PCA when detecting common latent subspace.
New method interpolates high-dimensional scattered data using kernel theory.
problem Scattered data in high-dimensional spaces defy traditional distributional assumptions.
method Kernel interpolation framework based on integral operator theory.
result Spectra of kernel matrices predict performance of interpolation methods.
The study introduces a high-dimensional tail index model for viral post analysis.
problem Empirical observation of power-law distributions in viral posts.
method High-dimensional tail index regression model, regularized estimator, debiasing for inference.
result Consistency and asymptotic normality of debiased estimator.
We consider the high-dimensional discriminant analysis problem. For this problem, different methods have been proposed and justified by establishing exact convergence rates for the classification risk, as well as the l2 convergence results to the discriminative rule. However, sharp theoretical analysis for the variable…
A New Statistical Framework for Genetic Pleiotropic Analysis of High Dimensional Phenotype Datastat.ML
The widely used genetic pleiotropic analysis of multiple phenotypes are often designed for examining the relationship between common variants and a few phenotypes. They are not suited for both high dimensional phenotypes and high dimensional genotype (next-generation sequencing) data. To overcome these limitations, we …
Paper proposes a method to improve circular coordinate representation for detecting changes in high-dimensional datasets.
problem Detecting changes in high-dimensional datasets with preserved topological structures.
method Adapt circular coordinate framework using a generalized penalty function instead of an L2 penalty.
result Circular coordinates with generalized penalty can detect changes in high-dimensional datasets under different sampling schemes.
New robust method for high-dimensional data analysis in imaging studies.
problem Analyzing high-dimensional data with complex dependence and outliers.
method Robust high-dimensional regression with coefficient thresholding and Huber loss.
result Statistical consistency and computational convergence under high-dimensional settings.
SEDA improves RLDA for high-dimensional data.
problem Inconsistent performance of RLDA in high-dimensional scenarios.
method Developed a non-asymptotic approximation of misclassification rate, derived new theoretical results on eigenvectors, and proposed SEDA algorithm.
result SEDA achieves higher classification accuracy and dimensionality reduction compared to existing LDA methods.
A new QDA classifier for high-dimensional data with spiked covariance.
problem Classifying high-dimensional data with distinct covariance matrices.
method Proposes a novel quadratic classification technique with parameters chosen to maximize the fisher-discriminant ratio.
result The proposed classifier outperforms classical R-QDA and requires lower computational complexity.
We present new findings in regard to data analysis in very high dimensional spaces. We use dimensionalities up to around one million. A particular benefit of Correspondence Analysis is its suitability for carrying out an orthonormal mapping, or scaling, of power law distributed data. Power law distributed data are foun…
New research shows CFG improves high-dimensional data generation.
problem Characterizing CFG's effect on high-dimensional distributions.
method High-dimensional analysis of CFG's impact on target distributions.
result CFG accurately reproduces the target distribution in high dimensions.
A new method for analyzing high-dimensional time-series data using deep neural networks.
problem Challenges in modeling high-dimensional time-series data with explicit state and observation processes.
method Deep Direct Discriminative Decoders (D4) for high-dimensional observation processes.
result D4 outperforms traditional SSMs and RNNs in various time-series data applications.
The use of M-estimators in generalized linear regression models in high dimensional settings requires risk minimization with hard constraints. Of the known methods, the class of projected gradient descent (also known as iterative hard thresholding (IHT)) methods is known to offer the fastest and most scalable sol…
DFSOS improves sparse discriminant analysis for high-dimensional data.
problem Sparse discriminant analysis in high-dimensional settings with feature selection.
method Deflation-Free Sparse Optimal Scoring (DFSOS) using Bregman iteration and orthogonality-constrained optimization.
result DFSOS achieves comparable or better classification accuracy than deflation-based methods.
Unified framework for high-dimensional bandit problems with low-dimensional structures.
problem Stochastic high-dimensional bandit problems with low-dimensional structures.
method Proposed a simple unified algorithm and a general analysis framework for the regret upper bound.
result Unified algorithm achieves comparable regret bounds in various high-dimensional bandit problems.
New test for comparing high-dimensional text data.
problem Testing equality of multinomial distributions in high dimensions.
method Proposed a test statistic with asymptotic normality under null.
result Achieves optimal detection boundary across parameter space.
MediEncoder: Nonlinear Representation Learning for High-Dimensional Causal Mediation Analysisstat.ME
MediEncoder learns nonlinear representations for causal mediation analysis.
problem High-dimensional noisy covariates and mediators in biomedical studies.
method Coupled encoder-decoder architecture with cross-factor network.
result Improves estimation accuracy in high-dimensional causal mediation analysis.
A novel method extracts topological features from word embeddings for text classification.
problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.
This study evaluates clustering algorithms on high-dimensional data.
problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.
Conjugate gradient methods improve efficiency for high-dimensional GLMMs.
problem Efficiency bottleneck in computing high-dimensional GLMM precision matrices.
method Combining spectral analysis and random graph theory with conjugate gradient methods.
result CG-based methods achieve linear scaling in cost with model parameters and observations.
The paper analyzes how generated data improves adversarial training in high-dimensional regression.
problem Improving adversarial training in high-dimensional regression.
method Theoretical analysis of a two-stage training approach with generated data and pseudo-labels.
result Two-stage adversarial training achieves better performance than ridgeless training in high-dimensional linear regression.
Study shows double descent curve in high-dimensional linear regression with random projections.
problem Understanding the generalization performance in high-dimensional settings with random projections.
method Fixed prediction problem, ridge regression estimator, minimum norm least-squares fit, random matrix theory, asymptotic equivalents.
result Exhibit a double descent curve for high-dimensional linear regression with random projections.
Class prediction is an important application of microarray gene expression data analysis. The high-dimensionality of microarray data, where number of genes (variables) is very large compared to the number of samples (obser- vations), makes the application of many prediction techniques (e.g., logistic regression, discri…
The paper develops a new model for high-dimensional spatial arbitrage pricing.
problem Estimating spatial interactions in high-dimensional asset pricing.
method Integrates spatial interactions with multi-factor analysis using generalized shrinkage Yule-Walker (SYW) estimation.
result Established asymptotic properties for high-dimensional spatial arbitrage pricing models.
For high dimensional data, some of the standard statistical techniques do not work well. So modification or further development of statistical methods are necessary. In this paper, we explore these modifications. We start with the important problem of estimating high dimensional covariance matrix. Then we explore some …
Modern data analysis depends increasingly on estimating models via flexible high-dimensional or nonparametric machine learning methods, where the identification of structural parameters is often challenging and untestable. In linear settings, this identification hinges on the completeness condition, which requires the …
Learning rate needs to decrease with higher data moments for effective ICA in high dimensions.
problem Slower convergence of ICA in high-dimensional data with high-order moments.
method High-dimensional ODE analysis of ICA algorithm under controlled moment structure.
result Critical learning rate threshold for effective ICA when moments are high.
We introduce a new method of performing high dimensional discriminant analysis, which we call multiDA. We achieve this by constructing a hybrid model that seamlessly integrates a multiclass diagonal discriminant analysis model and feature selection components. Our feature selection component naturally simplifies to wei…
New tool helps analyze complex financial data.
problem Difficulty in comprehending high-dimensional financial data.
method Topological Data Analysis Ball Mapper algorithm.
result Shows new way to see detail in financial data.
New method approximates high-dimensional probability densities efficiently.
problem Approximating high-dimensional probability densities accurately and efficiently.
method Hierarchical tensor-network approach using randomized SVD and linear equations.
result The method effectively approximates high-dimensional densities with linear complexity.
Modern techniques simplify complex high-dimensional data.
problem Complex, high-dimensional data.
method Unsupervised dimension reduction techniques.
result Simplified representation of high-dimensional data.
FAMDAD detects anomalies in mixed data using kurtosis-weighted Factor Analysis.
problem Detecting anomalies in high-dimensional mixed data.
method kurtosis-weighted Factor Analysis of Mixed Data (FAMDAD).
result Anomalies are highly separable in the first and last few dimensions of the FAMDAD embedding.