The paper explores using historical data to improve clinical trial analysis by optimizing covariate weights.
problem Limited covariates in small clinical trials reduce the effectiveness of analysis.
method Leverage historical data to pre-specify covariate weights as a composite covariate.
result A composite covariate improves the cost/benefit ratio and reduces overfitting in small clinical trials.
The paper analyzes how Gaussian kernel parameters affect posterior covariance in Gaussian processes.
problem Understanding the influence of Gaussian kernel parameters on posterior covariance in Gaussian processes.
method Geometric analysis and a posteriori error estimation techniques from adaptive finite element methods.
result The bandwidth parameter and spatial distribution of observations significantly influence posterior covariance and its matrix.
Partial covariance factorizes in path diagrams, simplifying analysis.
problem Understanding partial covariance in complex diagrams.
method Factorization of partial covariance over nodes and edges.
result Simpson's paradox cannot occur in singly-connected diagrams.
A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.
problem Stability and transferability issues in covariance matrix analysis.
method Developed coVariance neural network (VNN) that operates on sample covariance matrices.
result VNN is more stable and transferable than PCA-based approaches.
The paper calculates factor loading and unique variance covariances for various factor analysis methods.
problem Estimating the asymptotic covariances of unrotated factor loading and unique variance estimates.
method Explicit formulas derived from sample covariances or correlations, using least square, principal, iterative principal component, alpha, or image factor analysis.
result The formulas produce reasonable standard errors for rotated loading estimates in multivariate normal populations.
Method estimates common covariance matrix for DLBCL gene expression studies.
problem Low sample size in gene expression studies.
method Hierarchical random covariance model and EM algorithm.
result Estimator outperforms pooled estimator in simulations.
Tightens analysis for inferring latent community structure with node covariates.
problem Inferring latent community structure from graphs with node covariates.
method Information theoretic analysis combining graph and node covariates.
result Necessity of combining graph and node covariates for accurate inference.
Efficiently estimates covariance for sparse functional data.
problem Sparse data in functional analysis.
method Random-knots and B-spline estimators for covariance function.
result Asymptotic pointwise covariance estimates for sparsified data.
Improved LDA method for better classification and dimensionality reduction.
problem Improving linear discriminant analysis for better classification performance.
method Integrates spectrally-corrected covariance matrix and regularized discriminant analysis.
result SRLDA has a linear classification global optimal solution under spiked model assumption.
The paper analyzes covariance of embedded manifolds to extract curvature information.
problem Understanding curvature of submanifolds embedded in higher-dimensional spaces.
method Covariance analysis of point sets on embedded Riemannian manifolds, focusing on volume and curvature.
result Eigenvalue decompositions of covariance matrices have asymptotic expansions containing curvature information.
A new classification rule for FDA improves classification performance by accounting for unequal covariance matrices.
problem Unequal covariance matrices in practical situations affect the performance of FDA and its variants.
method Proposes a novel classification rule for FDA that accounts for unequal covariance matrices, applicable to many FDA variants.
result The new classification rule improves classification performance compared to original FDA and variants.
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.
A new model integrates covariates with grade of membership analysis for better latent structure recovery.
problem Improving latent structure recovery in multivariate categorical data analysis.
method Covariate-assisted grade of membership model exploiting shared low-rank simplex geometry.
result Auxiliary covariates can provably improve latent structure recovery, leading to faster convergence rates.
This paper improves covariance estimation with minimal data.
problem Estimating covariance from few compressive measurements.
method Back-projections of compressive samples for consistent estimation.
result Single linear measurement suffices for consistent covariance estimation.
Abstract reviews recent Lagrangian analysis on immersions into higher dimensions.
problem Analyzing Lagrangians on immersions into higher dimensions.
method Reviews recent progress on Lagrangians on immersions with first and second fundamental forms and their derivatives.
result Recent progress in the analysis of Lagrangians on immersions into higher dimensions.
New method improves PCA for high-dimensional data with n < p.
problem PCA struggles in high-dimensional settings with n < p.
method Pairwise differences covariance estimation with four regularized versions.
result Proposed methods outperform existing estimators in high-dimensional data settings.
The paper examines extreme value statistics of high-dimensional sample covariances, with applications in finance and image analysis.
problem Statistical validation of normal conditions in high-dimensional time series data.
method Generalizes the maximal deviation of sample autocovariances to high dimensions and applies Gumbel-type extreme value asymptotics.
result Gumbel-type extreme value asymptotics holds true for high-dimensional sample covariances.
Unified analysis of kernel-based methods under covariate shift.
problem Covariate shift in learning problems.
method Unified analysis of nonparametric methods in RKHS.
result Sharp convergence rates for general loss functions.
Adaptive Bayesian model for covariate-dependent power spectra analysis.
problem Estimating complex relationships and interactions between covariates and power spectra.
method Bayesian sum of trees model with local power spectrum estimation and reversible-jump MCMC for tree modifications.
result The method can accurately recover both smooth and abrupt changes in power spectra across multiple covariates.
Attention learns PCA on Gaussian data, proving its connection to principal component analysis.
problem Principal component analysis on Gaussian data.
method Analysis of attention mechanisms through PCA, covering finite and infinite prompt regimes.
result Attention aligns with principal eigenvectors of covariance matrices, converging to optimal solutions in the infinite-prompt limit.
TraCeR uses transformers to analyze survival data with longitudinal covariates.
problem Handling longitudinal covariates and assessing model calibration in survival analysis.
method Transformer-based survival analysis framework with factorized self-attention architecture.
result TraCeR achieves significant performance improvements over state-of-the-art methods.
Simple bounds for covariance and Gram matrices across various settings.
problem Capturing the behavior of smaller eigenvalues in covariance and Gram matrices.
method General-purpose theorem converting uniform bounds into relative bounds.
result Sharper control of eigenvalues across the spectrum.
Proposes an L1-regularized functional SVM for binary classification with functional covariates.
problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.
GLM-PCA simplifies complex data for easier analysis.
problem Non-normally distributed data complicates dimension reduction.
method Derives GLM-PCA, incorporates covariates, and suggests transformations.
result Improves interpretability of latent factors in non-normal data.
New method for factor analysis using nuclear and ℓ0 norms.
problem Finding a low-rank plus sparse decomposition from noisy covariance matrix.
method Formulated an optimization problem with nuclear norm, ℓ0 norm, and KL divergence. Used alternating minimization algorithm. result Algorithm effectively decomposes covariance matrices in synthetic and real datasets.
Method calibrates simulators under covariate shift using kernel techniques.
problem Dealing with covariate shift in simulator inputs.
method Bayesian inference with kernel mean embedding and importance-weighted reproducing kernel.
result The method effectively calibrates simulators and demonstrates sensitivity analysis.
Paper presents a new framework for covariance matrix estimation with geometric insights.
problem Challenges in covariance matrix estimation, especially in finding suitable models and efficient estimation methods.
method General framework for linear restrictions on different transformations of the covariance matrix, including matrix logarithm and its inverse.
result Yields an M-estimator with M-estimation allowing for straightforward asymptotic and finite sample analysis. Novel Fréchet regression method handles errors-in-variables with low-rank covariates.
problem Regression with noisy and limited covariate data.
method Combines global Fréchet regression and principal component regression for low-rank structure.
result Improved efficiency and accuracy in high-dimensional and noisy data settings.
Linear and Quadratic Discriminant analysis (LDA/QDA) are common tools for classification problems. For these methods we assume observations are normally distributed within group. We estimate a mean and covariance matrix for each group and classify using Bayes theorem. With LDA, we estimate a single, pooled covariance m…
A new method uses Gram matrix for efficient multivariate functional principal components.
problem Efficiently estimating eigencomponents of multidimensional functional datasets.
method Proposes using inner-product matrix to estimate eigenelements of multivariate and multidimensional functional datasets.
result Established relationship between eigenelements of covariance operator and inner-product matrix.
A new ranking model with dynamic covariates improves statistical analysis.
problem Statistical ranking with varying covariates across comparisons.
method Introduced a Plackett--Luce framework for covariate-assisted ranking, providing conditions for model identifiability and MLE existence, and developing an alternating maximization algorithm.
result Uniform consistency of the Maximum Likelihood Estimation (MLE) under suitable assumptions on graph design and covariates.
New method improves conditional covariance estimation using targeted groups of assets.
problem Improving conditional covariance estimation in financial time series.
method Introduces targeting in BEKK and DCC models for financial time series analysis.
result Encouraging results from empirical case study, especially with fewer assets.
Unified analysis of ridge regression and discriminant analysis in high-dimensional settings.
problem Analyzing predictive risk in high-dimensional settings with arbitrary covariance.
method Unified analysis using high-dimensional asymptotics and random matrix theory.
result Explicit expression for limiting predictive risk depends on spectrum, signal strength, and aspect ratio.
Unified error analysis for low-rank approximation improves data assimilation performance.
problem Analyzing the error in low-rank approximation methods for data assimilation.
method Unified stochastic analysis framework for Frobenius norm error bounds on centered and non-standard Gaussian matrices.
result Unified bounds provide clearer interpretations and enable better practical choices for covariance matrices.
A new LDA model with covariates for mixed-membership clusters.
problem Modeling mixed-membership clusters in discrete data with covariates.
method Negative binomial regression embedded within LDA, slice sampling within Gibbs sampling.
result Model successfully retrieves true parameter values and predicts cluster abundances using covariates.
Proofs high-dimensional spectrum convergence of weighted sample covariance.
problem High-dimensional spectrum convergence of weighted sample covariance.
method Proposes a new, concise proof with stronger assumptions.
result Spectrum convergence proven for different weight distributions.
Network-assisted regression uses conformal prediction for valid inference.
problem Predicting node attributes using network and conventional covariates with valid statistical inference.
method Network analog of conformal prediction under mild joint exchangeability assumption.
result Achieves finite sample validity and asymptotic conditional validity for various network covariates.
SOLVAR efficiently analyzes cryo-EM data's structural variability.
problem Analyzing continuous heterogeneity in cryo-EM data.
method Low-rank assumption on covariance matrix for tractable estimation.
result Accurately captures dominant components of structural variability.
New method groups similar functional covariates for better modeling.
problem Analyzing functional covariates with similar shapes.
method Coefficient shape alignment regularization approach.
result True grouping structure can be accurately identified under certain conditions.
CSTs improve stability in covariance spectrum analysis without training.
problem Stability and expressiveness in covariance spectrum analysis.
method Sequential application of covariance wavelet filters to input data.
result Stable and expressive hierarchical representations in low-data settings.
SDR outperforms IDR in multimodal data analysis, especially with fewer samples.
problem Understanding and optimizing data efficiency in multimodal representation learning.
method Generative linear model to synthesize multimodal data, comparing IDR and SDR methods.
result Linear SDR methods yield higher-quality, more succinct reduced-dimensional representations with smaller datasets.
Study mutual info for community detection with covariate and correlated networks.
problem Community detection with covariate and correlated networks.
method Asymptotic upper bound and MMSE matrix heuristic analysis.
result Explicit characterization of combined information effects.
Robust PCA method works under uncertain covariance.
problem Principal component analysis under uncertain covariance.
method Robust streaming PCA with temporal uncertainty set.
result Noisy power method is rate-optimal in our setting.
Probabilistic principal component analysis (PPCA) seeks a low dimensional representation of a data set in the presence of independent spherical Gaussian noise, Sigma = (sigma^2)*I. The maximum likelihood solution for the model is an eigenvalue problem on the sample covariance matrix. In this paper we consider the situa…
Develops multiscale covariance tensor fields for data shape analysis.
problem Quantifying variation of data at all scales.
method Localized covariance tensor fields (CTF) and strong stability theorems.
result CTFs are robust to sampling, noise, and outliers.
Improved covariance estimation for various metrics outperforms existing methods.
problem Estimating covariance and precision matrices for a wide range of metrics.
method Random matrix theory for improved estimation.
result Significantly outperforms sample covariance matrix and state-of-the-art methods.
A new method estimates conditional canonical correlations using random forests.
problem Estimating relationships between two sets of variables given covariates.
method Random Forest with Canonical Correlation Analysis (RFCCA)
result RFCCA provides accurate canonical correlation estimations and well-controlled Type-1 error.
Graphical Lasso detects anomalies in noisy data by splitting covariance matrix into clean and outlier parts.
problem Detecting anomalies in large, noisy data sets.
method Robust Graphical Lasso (Rglasso) using ADMM optimization.
result Rglasso outperforms standard robust methods in accuracy and speed.