Research
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,657 papers · 148 categories

Trend · papers per month

73146219292 · Jun 202019922001200920172026
48 results for sufficient dimension

PSMM method optimizes matrix sufficient dimension reduction.

problem Feature matrices with row- and column-wise interpretations require efficient dimension reduction.
method PSMM method converts matrix problem into classification problems using rank-1 normal matrix.
result PSMM outperforms existing methods and provides strong interpretability.

POTD estimates SDR subspace using optimal transport for binary response.

problem Insufficient performance of existing SDR methods for categorical responses.
method Principal optimal transport direction (POTD) using optimal transport coupling.
result POTD exclusively estimates SDR subspace for error-free class labels.

Enhances SDR via Hellinger correlation for better data dependency understanding.

problem Improving sufficient dimension reduction in single-index models.
method Developed a new method using Hellinger correlation for detecting the dimension reduction subspace.
result Significantly enhances and outperforms existing SDR methods through deeper data dependency understanding.

The purpose of sufficient dimension reduction (SDR) is to find the low-dimensional subspace of input features that is sufficient for predicting output values. In this paper, we propose a novel distribution-free SDR method called sufficient component analysis (SCA), which is computationally more efficient than existing …

2011-03-25abs ↗pdf ↗

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

GenSDR tackles SDR by leveraging generative models to fully recover lower-dimensional structures.

problem Challenges in identifying low-dimensional sufficient structures in nonlinear SDR.
method Proposes GenSDR, a method that uses modern generative models to fully recover information in the central σ-field.
result Establishes consistency of GenSDR estimator for sample-level data and extends its applicability to non-Euclidean responses.

Survey of SDR methods for high-dimensional regression and embedding.

problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.

Develops a nonparametric graphical model for conditional independence.

problem Evaluation of conditional independence without distributional assumptions.
method Nonlinear sufficient dimension reduction techniques applied to a nonparametric graphical model.
result Method outperforms existing methods in non-Gaussian settings and high-dimensional data.

New method for reducing dimensions of distributional data.

problem Nonlinear sufficient dimension reduction for distribution-on-distribution regression.
method Building universal kernels on metric spaces to characterize conditional independence.
result Method outperforms competing methods in synthetic and real data applications.

Two novel methods estimate multiple FDR directions for binary categorical responses.

problem Estimating multiple FDR directions for categorical responses.
method Information maximization and square loss mutual information.
result Statistical consistency of the proposed methods established.

Reduces IB problem to a simpler, lower-dimensional problem.

problem Information bottleneck problem in high-dimensional spaces.
method Identifies sufficient statistic that factors conditional distribution, reducing IB to a lower-dimensional problem.
result Preserves full IB curve and optimal representations, making IB tractable.

Study online multiclass classification under bandit feedback, extending previous results.

problem Online multiclass classification with bandit feedback, focusing on label space unboundedness.
method Extend Daniely and Helbertal's results, show necessity and sufficiency of Bandit Littlestone dimension for learnability.
result Sequential uniform convergence is necessary but not sufficient for bandit online learnability.

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Characterizes statistical complexity of realizable regression in PAC and online learning.

problem Understanding the statistical complexity of realizable regression in both PAC and online learning settings.
method Introduces minimax instance optimal learners, novel and combinatorial dimensions to characterize learnability.
result Characterizes which classes of real-valued predictors are learnable and provides necessary conditions for learnability.

MSRL learns a representation maximizing mutual info with response variables.

problem Learning sufficient representations for complex, multi-dimensional data.
method Variational mutual information, deep neural networks, generalized Dudley's inequality.
result MSRL achieves consistent and accurate representation learning.

SMAVE optimizes SDR by projecting onto a low-dimensional subspace on a Riemannian manifold.

problem High-dimensional regression challenges due to the curse of dimensionality.
method SMAVE combines nearest-neighbor localization and Riemannian stochastic gradient ascent.
result SMAVE achieves almost-sure convergence and matches RMAVE's synthetic subspace recovery rate.

We examine algebraic conditions for the sectional positivity of the Riemann curvature operator. We describe sufficient conditions for dimension n=4n=4, and complete characterization for a dense open subset of the space of operators in dimension 44. We also briefly examine higher-dimentional curvature operators.

2019-08-18abs ↗pdf ↗

Modified relative universality for unbiasedness and consistency in dimension reduction.

problem Gap in proof of unbiasedness and Fisher consistency in relative universality.
method Modified definition of relative universality using ǫ-measurability.
result Established unbiasedness and Fisher consistency rigorously.

We consider sufficient conditions of local removability of coincidences of maps f,g:N->M, where M,N are manifolds with dimensions dimN>dimM. The coincidence index is the only obstruction to the removability for maps with fibers either acyclic or homeomorphic to spheres of certain dimensions. We also address the normali…

2001-03-25abs ↗pdf ↗

Unified framework for fair representation learning in machine learning.

problem Ensuring fairness in machine learning models, especially when biased data representations lead to unfair predictions.
method Integrates nonlinear sufficient dimension reduction with deep learning to construct fair and informative representations, introducing a penalty term to enforce conditional independence between sensitive attributes and learned representations.
result Achieves a superior balance between fairness and utility, significantly outperforming state-of-the-art baselines on various data structures.

In this short note, we give a sufficient condition for almost smooth compact metric measure spaces to satisfy the Bakry-Émery condition BE(K,N)BE (K, N). The sufficient condition is satisfied for the glued space of any two (not necessary same dimensional) closed pointed Riemannian manifolds at their base points. This tells …

2018-04-19abs ↗pdf ↗

We extend the validity of a Gromov's dimension comparison estimate for topological hypersurfaces to sufficiently large classes of rectifiable sets, arising from Sobolev mappings. Our tools are a suitably weak exterior differentiation for pullback differential forms and a new low rank property for Sobolev mappings.

2015-07-27abs ↗pdf ↗

We classify manifolds of small dimension that admit both, a Riemannian metric of non-negative scalar curvature, and a -- a priori different -- metric for which all wedge products of harmonic forms are harmonic. For manifolds whose first Betti numbers are sufficiently large, this classification extends to higher dimensi…

2012-12-13abs ↗pdf ↗

Paper improves SDR estimation speed and conditions.

problem Improving sufficient dimension reduction for multi-index models.
method Estimating expected smoothed gradient outer product.
result Achieves fast parametric convergence rate of Cdn1/2C_d \cdot n^{-1/2}.

Proposes a method to estimate personalized treatments from high-dimensional data.

problem Estimating individualized treatment regimes (ITRs) from high-dimensional covariates.
method Directly targets the contrast between potential outcomes, using dimension-reduced outcome-weighted learning.
result Achieves universal consistency, converging to the Bayes risk under mild conditions.

Proposes a deep learning method for effective data representation.

problem Constructing effective data representations for prediction.
method A deep dimension reduction approach to learning representations with sufficiency, low dimensionality, and disentanglement.
result The proposed deep nonparametric representation is consistent and performs better than existing methods.

Two methods preserve tensor structure for reduced dimensionality in tensor regression.

problem Reducing dimensionality of tensor predictors for improved interpretation and accuracy.
method Developed two tensor dimension reduction methods using Tucker and CP decompositions.
result Substantial improvement in accuracy over existing methods in simulations and applications.

FlowSDR learns a low-dimensional projection preserving the response's conditional distribution.

problem Learning a low-dimensional projection that captures the response's conditional distribution.
method FlowSDR uses conditional log-likelihood maximization with monotone rational-quadratic spline flows to learn the projection and conditional density.
result FlowSDR outperforms existing SDR methods in various simulation settings and a face-age prediction task.

Given a semi-Riemannian manifold, we give necessary and sufficient conditions for a Riemannian submanifold of arbitrary co-dimension to be umbilical along normal directions. We do that by using the so-called \emph{total shear tensor}, i.e., the trace-free part of the second fundamental form. We define the \emph{shear s…

2017-01-21abs ↗pdf ↗

It was proved by H. Whitney in 1933 that it is possible to mark a point in all curves in a continuous way. The main result of this paper extends the Whitney theorem to dimensions 2 and 3. Namely, we prove that it is possible to choose a point continuously in all two-dimensional surfaces sufficiently close to a given su…

2002-08-24abs ↗pdf ↗