Paper proposes new density estimators for high-dimensional data.
problem Prohibitive computational cost and slow convergence rate in high-dimensional density estimation.
method Adaptive hyperbolic cross density estimators in mixed smooth Sobolev spaces.
result Proposed estimators do not suffer curse of dimensionality under Integral Probability Metrics.
Estimates high-dimensional posterior densities by marginal distributions and neural networks.
problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.
Estimates neural representation dimensionality from small sample sizes.
problem Estimating neural representation dimensionality from limited data.
method Proposed a bias-corrected estimator for participation ratio of eigenvalues.
result The estimator is more accurate with finite samples and noise.
Develops a computationally tractable high-dimensional differential privacy estimator.
problem Differential privacy in high dimensions is computationally intractable.
method Combines high-dimensional robust statistics with differential privacy techniques.
result A computationally tractable algorithm with dimension-independent privacy loss.
Paper investigates optimal transport map estimation in infinite-dimensional spaces.
problem Estimating optimal transport maps in infinite-dimensional spaces is challenging.
method Characterizes γ-smoothness for optimal transport maps and develops a polynomial-rate estimator. result Shows polynomial-order minimax risk for optimal transport map estimation.
Machine learning improves high-dimensional matrix estimation.
problem Efficient estimation of high-dimensional matrices.
method Integrates machine learning with classical optimization algorithms for high-dimensional matrix estimation.
result The reparameterized LADMM achieves faster convergence and higher accuracy.
Survey paper analyzes curvature estimates for 4D gradient Ricci solitons.
problem Analyzing curvature estimates for different types of 4D gradient Ricci solitons.
method Comparison and new estimates provided for 4D gradient steady Ricci solitons.
result Sharp curvature estimate ∣Rm∣≤CR for gradient steady Ricci solitons with positive Ricci curvature. Develops methods for estimating and providing confidence bands in sparse high-dimensional additive models.
problem Estimating and providing reliable confidence bands for nonparametric components in high-dimensional additive models.
method Integrates sieve estimation into a high-dimensional Z-estimation framework, employing a multiplier bootstrap procedure.
result Constructs uniformly valid confidence bands for the target component f1 in sparse high-dimensional additive models. Improved Sparse Polyak for high-dimensional M-estimation with sparser solutions.
problem High-dimensional M-estimation problems with potential loss of sparsity and accuracy.
method Variant of Sparse Polyak with optimal thresholding operators.
result Retains desirable scaling properties while achieving sparser and more accurate solutions.
Proposes a new method for high-dimensional density estimation.
problem Estimating high-dimensional probability density functions efficiently.
method Tensorizing flow method combining tensor-train and flow-based generative modeling.
result Efficiently constructs an approximate density in tensor-train form and trains a flow model to match empirical distribution.
Improved likelihood estimation for singular distributions using deep models.
problem Estimating singular distributions using deep generative models.
method Data perturbation to avoid singularity issues in likelihood estimation.
result Consistent estimation of target distribution with desirable rates.
SSNL improves simulation-based inference for high-dimensional data.
problem Performance degradation in neural likelihood estimation for high-dimensional data.
method Surjective Sequential Neural Likelihood (SSNL) using surjective normalizing flow models.
result SSNL avoids manual crafting of summary statistics and outperforms state-of-the-art methods.
Estimates latent dimensionality for prediction tasks using mutual information.
problem Estimating the latent dimensionality needed for accurate prediction.
method Formulates the problem as an Information Bottleneck question and uses neural mutual information estimators with a hybrid critic to preserve latent geometry.
result The hybrid critic method provides a more accurate estimation of task-relevant dimensionality.
In this paper, we propose a new method for estimation and constructing confidence intervals for low-dimensional components in a high-dimensional model. The proposed estimator, called Constrained Lasso (CLasso) estimator, is obtained by simultaneously solving two estimating equations---one imposing a zero-bias constrain…
Improved location estimation for high-dimensional data with finite sample size.
problem Estimating the shift in high-dimensional data with limited samples.
method Smoothed estimators and bounds on subgamma vectors.
result Convergence to Cramér-Rao bound for finite sample sizes.
Paper proposes robust LAD estimators for 2D sinusoidal model, proving consistency and normality.
problem Estimation of parameters in 2D sinusoidal models with outliers or heavy-tailed noise.
method Least absolute deviation (LAD) estimators for robust parameter estimation.
result Strong consistency and asymptotic normality of LAD estimators for 2D sinusoidal model parameters.
Regularized M-estimators are used in diverse areas of science and engineering to fit high-dimensional models with some low-dimensional structure. Usually the low-dimensional structure is encoded by the presence of the (unknown) parameters in some low-dimensional model subspace. In such settings, it is desirable for est…
Study improves Hayashi-Yoshida estimator for high-dimensional stock covolatility.
problem Inconsistent performance of Hayashi-Yoshida estimator in high dimensions.
method Analyzed the limiting spectral distribution of the Hayashi-Yoshida estimator.
result Established the connection between the estimator's spectrum and the true covariance matrix in high 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.
Improved ridge estimators avoid tuning parameters for high-dimensional data.
problem Difficulty in calibrating tuning parameters for ridge estimators.
method Developed modified ridge estimators that eliminate tuning parameters.
result Modified ridge estimators outperform standard methods in prediction accuracy.
Robust deep neural networks estimate multi-dimensional functional data robustly.
problem Estimating location function from multi-dimensional functional data robustly.
method Deep neural networks with ReLU activation, robust to outliers and model misspecification.
result Uniform convergence rates for robust deep neural network estimators.
We provide a general theory of the expectation-maximization (EM) algorithm for inferring high dimensional latent variable models. In particular, we make two contributions: (i) For parameter estimation, we propose a novel high dimensional EM algorithm which naturally incorporates sparsity structure into parameter estima…
The paper improves density estimation in high dimensions using tensor decompositions.
problem Density estimation struggles in high-dimensional data due to the curse of dimensionality.
method The paper uses nonnegative tensor decompositions to simplify dependence assumptions and estimate marginal distributions.
result Theoretical results show that restricting estimation to low-rank nonnegative PARAFAC or Tucker decompositions removes the dimensionality exponent on bin width rates.
Paper proposes a new sparsity scheme for high-dimensional VAR models.
problem Estimation of high-dimensional VAR models with sparsity assumptions.
method Regularized estimation procedures for sparse VAR models.
result Threholding extends consistency properties of regularized estimators.
A new particle filter avoids resampling to improve state estimation in high dimensions.
problem Particle deprivation in high-dimensional state spaces.
method A resampling-free particle filter designed to mitigate particle deprivation.
result The filter offers a near-accurate representation of the posterior distribution in high-dimensional contexts.
This paper improves diffusion models for low-dimensional data.
problem Theoretical foundations of diffusion models are lacking for low-dimensional data.
method Score approximation, estimation, and distribution recovery of diffusion models on low-dimensional data.
result Sample complexity bounds for distribution estimation using diffusion models are provided.
New method for estimating and testing impulse responses in high-dimensional VAR systems.
problem Statistical inference for impulse responses in sparse, high-dimensional vector autoregressions.
method Local projection equations and de-sparsified estimators combined with a non-regularized contemporaneous impact matrix.
result Valid inference procedures for structural impulse responses in high-dimensional systems.
We consider the problem of robustifying high-dimensional structured estimation. Robust techniques are key in real-world applications which often involve outliers and data corruption. We focus on trimmed versions of structurally regularized M-estimators in the high-dimensional setting, including the popular Least Trimme…
The paper optimizes hyperplanes for binary classification in high-dimensional data with latent Gaussian mixtures.
problem Binary classification in high-dimensional data with latent Gaussian mixtures.
method Generalized least squares estimator for estimating the direction of the optimal separating hyperplane. Simple correction for intercept estimation.
result The procedure is minimax optimal in many scenarios and can retain the interpolation property.
SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.
problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.
New algorithms improve privacy in statistical estimation by making them robust.
problem Improving privacy in statistical estimation methods.
method Black-box reduction from privacy to robustness, using Sum-of-Squares method.
result Design of polynomial-time private estimators with optimal tradeoffs among sample complexity, accuracy, and privacy.
Proposes bounds on bias from low-dimensional representations in CATE estimation.
problem Bias in CATE estimation due to low-dimensional representations.
method Proposes a refutation framework to estimate bounds on representation-induced confounding bias.
result Demonstrates effectiveness of refutation framework in practice.
Develops inequalities for high-dimensional linear processes with dependent innovations.
problem Estimating high-dimensional VAR(p) systems and HAC covariance estimation.
method Concentration inequalities for l∞ norm of vector linear processes with sub-Weibull, mixingale innovations. result Obtained concentration bounds for the maximum entrywise norm of lag-h autocovariance matrices. Proposes Causal-Batle for estimating treatment effects in small high-dimensional datasets.
problem Estimating treatment effects with small high-dimensional datasets.
method Adopts transfer learning techniques for causal inference.
result Improves treatment effect estimates in small high-dimensional datasets.
Paper proves conditions for estimating precision matrices with Laplacian constraints.
problem Estimating high-dimensional precision matrices with Laplacian constraints.
method Minimizing Stein's loss with conditions on graph connectivity and Laplacian constraints.
result High-dimensional consistency achieved with Laplacian constraints, independent of graph structure.
This paper simplifies finding least favorable priors by reducing dimensionality.
problem Finding least favorable priors is challenging due to infinite-dimensional optimization.
method Develops a dimensionality reduction method using Bregman divergences.
result Allows use of gradient ascent algorithms for finding least favorable priors.
We consider high dimensional M-estimation in settings where the response Y is possibly missing at random and the covariates X∈Rp can be high dimensional compared to the sample size n. The parameter of interest θ0∈Rd is defined as the minimizer of the risk of a …
Optimal and safe semi-supervised learning estimator for high-dimensional data.
problem Improving regression parameter estimation with unlabeled data in high-dimensional settings.
method Established minimax lower bound, proposed optimal and safe semi-supervised estimators.
result Optimal semi-supervised estimator achieves the minimax lower bound.
New method circumvents curse of dimensionality in Laplacian estimation.
problem High-dimensional data challenges spectral clustering and diffusion maps.
method Kernelized Laplacian estimation via reproducing kernel Hilbert space.
result Non-asymptotic statistical rates show improved performance in high dimensions.
Abstract: Geometrically reformulates estimation theory for finite-dimensional C*-algebras.
problem Estimation theory for finite-dimensional C*-algebras.
method Geometrical formulation of estimation theory.
result Derivation of Cramer-Rao and Helstrom bounds.
Density Estimation is one of the central areas of statistics whose purpose is to estimate the probability density function underlying the observed data. It serves as a building block for many tasks in statistical inference, visualization, and machine learning. Density Estimation is widely adopted in the domain of unsup…
Study shows how to approximate and estimate high-dimensional classification functions without the curse of dimensionality.
problem Approximating and estimating classification functions in high-dimensional spaces.
method Modified existing results to show that RBV2 functions can be approximated by neural networks with bounded weights. Proved the existence of a neural network with bounded weights approximating a classification function. Leveraged these bounds to quantify estimation rates. result Neural networks can approximate RBV2 functions without the curse of dimensionality, leading to efficient estimation rates. Proposes an EM algorithm for high-dimensional Markov-switching VAR models.
problem Estimating regime shifts in high-dimensional time series data.
method Approximate EM algorithm for Markov-switching VAR models.
result Established consistency of the proposed EM algorithm in high dimensions.
Method estimates network connectivity and dimensionality from multiple networks.
problem Estimating connectivity and dimensionality in samples of networks.
method Convex optimization with alternating direction method of multipliers.
result Method outperforms conventional methods in estimating connectivity and dimensionality.
We obtain an estimate for the volume of neighbourhoods of sets of large curvature in three-dimensional Kähler-Einstein manifolds.
Paper develops estimates for Lagrangian phase changes in 2D.
problem Interior estimates for Lagrangian phase changes in 2D.
method Modified doubling technique to handle degenerate Jacobi inequalities.
result Interior Hessian and gradient estimates established for critical phase.
New method estimates treatment effects from high dimensional data.
problem Estimating treatment effects from high dimensional data with confounders.
method Generative modeling approach to backdoor adjustment in variational inference.
result Empirically, estimates interventional likelihood in high dimensional settings.
New method for estimating high-dimensional binary time series coefficients.
problem Statistical inference for high-dimensional binary time series.
method Post-selection estimator and second-order wild bootstrap algorithm.
result Good finite-sample performance of the proposed method.